![]() |
|
|
#12 |
|
Nov 2003
11101001001002 Posts |
|
|
|
|
|
|
#13 |
|
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
|
|
|
|
|
|
#14 | |
|
Nov 2003
22×5×373 Posts |
Quote:
are a special case of his more general Frobenius PRP tests. However, T.Rex was unwilling to accept this. Why should I spend the time writing up 2 to 3 pages of a formal proof for someone who won't understand it? (neither will you). His request for a proof was not serious. It was a taunt. |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Endorsement Prime Numbers finding algorithm | marouane | Computer Science & Computational Number Theory | 18 | 2017-11-06 15:41 |
| pari-algorithm for finding Gaussian integer bases | devarajkandadai | Software | 0 | 2017-10-05 04:54 |
| OEIS - (2^n-5)/3 - n odd - LLT-like algorithm for finding PRPs | T.Rex | Miscellaneous Math | 10 | 2015-09-01 18:07 |
| OEIS - A050414 - 2^n-3 - LLT-like algorithm for finding PRPs | T.Rex | Miscellaneous Math | 16 | 2015-08-31 02:32 |
| New Prime-Finding Algorithm Discovered! L00K HERE! | dilip_1bhowmik | Miscellaneous Math | 22 | 2009-01-09 23:39 |