![]() |
![]() |
#12 |
Dec 2022
22216 Posts |
![]()
The known proof about primitive divisors in Lucas sequences makes this a finite problem, and verifiable in theory: there are always only finitely many. (We can't use n^2+1 directly as that has infinity many terms without a primitive divisor, which is surely true for any polynomial.)
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
(M48) NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED! | dabaichi | News | 571 | 2020-10-26 11:02 |
Not the largest prime | Tomws | Lounge | 5 | 2020-05-03 01:46 |
Largest PM1 factors? | hansl | Data | 4 | 2019-08-25 22:50 |
List of largest factors | DrTarr | Math | 4 | 2016-02-11 07:00 |
need Pentium 4s for 5th largest prime search (largest proth) | wfgarnett3 | Lounge | 7 | 2002-11-25 06:34 |