Go Back > Extra Stuff > Miscellaneous Math

Thread Tools
Old 2015-03-20, 15:09   #1
Jul 2014

2·13 Posts
Default Pseudoprimality Hypothesis for Specific Class of Generalized Fermat Numbers


Let P_m(x)=2^{-m}\cdot \left(\left(x-\sqrt{x^2-4}\right)^{m}+\left(x+\sqrt{x^2-4}\right)^{m}\right) , where m and x are nonnegative integers .


Let F_n(b)=b^{2^n}+1 such that n>1 , b is even , 3 \not\mid b and 5\not\mid b .

Let S_i=P_b(S_{i-1}) with S_0=P_{b/2}(P_{b/2}(8)) , thus

F_n(b) is prime iff S_{2^n-2} \equiv 0 \pmod{F_n(b)}

PARI/GP implementation

for(i=1,2^n-2, s=2*polchebyshev(b,1,s/2));
You can run this code here .

List of generalized Fermat primes sorted by base .
primus is offline   Reply With Quote
Old 2015-03-25, 22:18   #2
gd_barnes's Avatar
May 2007
Kansas; USA

287F16 Posts

Originally Posted by primus View Post
List of generalized Fermat primes sorted by base .
gd_barnes is online now   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Generalized Fermat numbers (in our case primes) pepi37 Conjectures 'R Us 4 2015-10-09 14:49
Lucasian Pseudoprimality Hypothesis for Specific Class of k 2^n-1 primus Miscellaneous Math 14 2015-07-04 15:42
Conjectured Primality Test for Specific Class of Mersenne Numbers primus Miscellaneous Math 1 2014-10-12 09:25
Disproven Primality Test for Specific Class of kb^n-1 primus Computer Science & Computational Number Theory 8 2014-08-21 15:16
Generalized Fermat Numbers ET_ Programming 4 2008-06-23 07:59

All times are UTC. The time now is 03:18.

Thu May 13 03:18:51 UTC 2021 up 34 days, 21:59, 1 user, load averages: 2.97, 4.71, 4.51

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.