| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Search results
Create the page "Generalized Fermat number 5 2 33" on this wiki! See also the search results found.
- '''Pépin's test''' is mainly used for proving the primality of [[Fermat number]]s, but it is of no help for finding the factors of such numbers. ...ralized Fermat number]]s <math>F_{n,2} = 4^{3^n}+2^{3^n}+1</math> with k = 5 instead of k = 3.2 KB (401 words) - 14:40, 6 March 2019
- There are different kinds of '''generalized [[Fermat number]]s'''. ...^n}-1)</math> where p is the prime of apparition rank r (r(2)=1, r(3)=2, r(5)=3, ...) and n is greater or equal to 0.5 KB (774 words) - 07:39, 27 May 2024
