xddd

[sweety439]

Originally Posted by sweety439

Smallest odd prime p such that (a^p-b^p)/(a-b) is (probable) prime for 2<=a<=50, -a<b<a, gcd(a,b) = 1

There are only 5 unknown (a,b): (32, -5), (43, 7), (44, -43), (46, 31), (50, -37)

The top 12 PRPs are: (only sorted by exponent)

(48^58543-47^58543)/(48-47)
(50^56099+43^56099)/(50+43)
(46^45281+11^45281)/(46+11)
(49^38069-46^38069)/(49-46)
(47^32833-33^32833)/(47-33)
(18^25667-1^25667)/(18-1)
(49^16747+46^16747)/(49+46)
(38^16747+7^16747)/(38+7)
(37^13217-34^13217)/(37-34)
(47^9181+37^9181)/(47+37)
(31^6961-6^6961)/(31-6)
(47^5641-23^5641)/(47-23)

[sweety439]

...........

[sweety439]

Update my program of unique primes.

[sweety439]

Originally Posted by sweety439

Update my program of unique primes.

Fixed the program.

[sweety439]

See https://dozenal.fandom.com/wiki/Conj...numbers_base_n for the conjectured smallest Sierpinski/Riesel numbers for bases <= 1000, also see https://dozenal.fandom.com/wiki/Sier...s_sorted_by_CK for these conjectures sorted by conjectured k

[sweety439]

Update my program.

[sweety439]

Update files

[sweety439]

.......

[sweety439]

Update programs for https://github.com/xayahrainie4793/all-k-1024 and https://github.com/xayahrainie4793/S...-variable-base

[sweety439]

The PARI/GP programs for primes and dozenal numbers, stored in GitHub: https://github.com/xayahrainie4793/Prime-program

[sweety439]

Upload files.