![]() |
|
|
#1 |
|
Mar 2018
2×5×53 Posts |
If N is even consider
N is congruent to (10^m*2^n) mod 216 with(10^m*2^n)<216 for some nonnegative m, n IF N is odd CONSIDER N is congruent to - (10^m*2^n) mod 216 with(10^m*2^n)<216 for some nonnegative m and n Which N's satisfy one of the above modular equations? AND WHAT if we add the restriction that (10^m*2^n) must be congruent to 2^k<(10^m*2^n) mod 13 for some k? I ask this because possibly it is related to exponents of pg primes congruent to 0 mod 43 215 696660 92020 and 541456 infact are congruent to + or - (2^m*10^n) mod 216 Last fiddled with by enzocreti on 2020-03-02 at 15:33 |
|
|
|
|
|
#2 |
|
"Sam"
Nov 2016
22·34 Posts |
IF N is odd, it can NEVER be congruent to - (10^m*2^n) mod 216 (unless m and n are both zero), so I don't see the point to go any futher.
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| 10^k is congruent to p(n)*p(n+1) mod 1093 | enzocreti | enzocreti | 5 | 2020-02-19 14:52 |
| N congruent to 2^2^n mod(2^2^n+1) | enzocreti | enzocreti | 2 | 2020-02-12 15:14 |
| Pg primes pg(k) with k congruent to 10^n mod 41 | enzocreti | enzocreti | 0 | 2020-01-26 19:19 |
| Congruent to 10^n mod 41 | enzocreti | enzocreti | 0 | 2020-01-09 11:56 |
| ((my) mod n ) congruent to n-1 | smslca | Math | 2 | 2012-01-29 11:30 |