12 entries in 0.532s
a111: Logged on 2017-10-07 21:48 apeloyee:
http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-
prime-fit-in-your-primorial and find what
number of primorial is congruent to it using chinese remainder
theorem mircea_popescu: anyway, back to rsa discussion : there's about 6.5e612 primes in the interval 2^2045-1, 0 (by teh
prime number theorem). every key needs a pair of these, and no
number can EVER be repeated (if it is -- phuctor breaks both keys).
a111: Logged on 2017-10-07 21:48 apeloyee:
http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-
prime-fit-in-your-primorial and find what
number of primorial is congruent to it using chinese remainder
theorem a111: Logged on 2017-11-07 14:34 a111: Logged on 2017-10-07 21:48 apeloyee:
http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-
prime-fit-in-your-primorial and find what
number of primorial is congruent to it using chinese remainder
theorem a111: Logged on 2017-11-07 14:34 a111: Logged on 2017-10-07 21:48 apeloyee:
http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-
prime-fit-in-your-primorial and find what
number of primorial is congruent to it using chinese remainder
theorem a111: Logged on 2017-10-07 21:48 apeloyee:
http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-
prime-fit-in-your-primorial and find what
number of primorial is congruent to it using chinese remainder
theorem ☟︎☟︎ a111: Logged on 2017-10-07 21:48 apeloyee:
http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-
prime-fit-in-your-primorial and find what
number of primorial is congruent to it using chinese remainder
theorem a111: Logged on 2017-10-07 21:48 apeloyee:
http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-
prime-fit-in-your-primorial and find what
number of primorial is congruent to it using chinese remainder
theorem apeloyee:
http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-
prime-fit-in-your-primorial and find what
number of primorial is congruent to it using chinese remainder
theorem ☝︎☟︎☟︎☟︎☟︎☟︎