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

Jump to: navigation, search

Create the page "3" on this wiki! See also the search results found.

Page title matches

Page text matches

  • Williams prime MM 5
    3
    917 bytes (86 words) - 12:13, 22 May 2019
  • Williams prime
    ...ime MM table|here]]<br>{{#expr:{{PAGESINCATEGORY:Williams prime MM|pages}}-3}} bases || [[Williams prime MM least|here]]<ref>The list contains values fo ...ime MP table|here]]<br>{{#expr:{{PAGESINCATEGORY:Williams prime MP|pages}}-3}} bases || [[Williams prime MP least|here]]<br>{{PAGESINCATEGORY:Williams p
    5 KB (744 words) - 07:30, 5 August 2019
  • Carol-Kynea prime 2
    3 3
    5 KB (537 words) - 08:17, 9 October 2020
  • Carol-Kynea prime 6
    3
    1 KB (85 words) - 10:45, 16 April 2023
  • Examples
    <pre><math>\sum_{i=1}^\infty \frac{1}{p_i} = \frac{1}{2} + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} + \frac{1}{11} + \dotsb = \infty</math></pre> :<math>\sum_{i=1}^\infty \frac{1}{p_i} = \frac{1}{2} + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} + \frac{1}{11} + \dotsb = \infty</math>
    11 KB (1,236 words) - 14:41, 3 September 2020
  • Mersenne prime
    ...us; 1 = {{Kbn|4}}, for example, is not a prime, because 15 is divisible by 3 and 5. The first four Mersenne primes {{V|M<sub>2</sub>}}, {{V|M<sub>3</sub>}}, {{V|M<sub>5</sub>}}, {{V|M<sub>7</sub>}} were known in antiquity.
    5 KB (857 words) - 14:53, 19 September 2021
  • Mersenne number
    ...for ''d=0 ... 48'' and has provided a new (and clearer) proof for case ''d=3''. *Let <math>q = 3 \pmod{4}</math> be a prime. <math>2q+1</math> is also a prime if and only i
    2 KB (351 words) - 11:28, 7 March 2019
  • Marin Mersenne
    : <math>\sqrt[4]{\frac{2}{3-\sqrt{2}}}</math> ...enne prime|Mersenne primes]] less than or equal to M(257) were:<br>M(2), M(3), M(5), M(7), M(13), M(17), M(19), M(31), ''M(67)'', [[M12|M(127)]], ''M(25
    11 KB (1,582 words) - 01:17, 15 January 2024
  • Fermat number
    :{{V|F}}<sub>0</sub> = {{Kbn|+|1}} = 3 :{{V|F}}<sub>3</sub> = {{Kbn|+|8}} = 257
    12 KB (1,913 words) - 14:35, 9 August 2021
  • Derrick Henry Lehmer
    ...the [[Ramanujan conjecture]], that <math>5^4 | p(599)</math> and <math>11^3 | p(721)</math>, computing the values using the [[Hardy-Ramanujan series]]
    6 KB (1,033 words) - 01:13, 15 January 2024
  • Home prime
    The length of such chains is also of interest, in this case #HP(25) = 3. :21<sub>10</sub> = 3 &times; 7 (11 &times; 111)
    980 bytes (143 words) - 13:22, 6 March 2019
  • Cunningham tables
    *[[3 Minus Tables]] *[[3 Plus Tables]]
    614 bytes (69 words) - 12:08, 13 February 2019
  • Cunningham project
    ...ion]] of numbers of the form <math>b^n\pm 1</math> for <math>b</math> = 2, 3, 5, 6, 7, 10, 11, 12. The values of the exponent <math>n</math> are selecte | 2 || 3 || 5 || 6 || 7 || 10 || 11 || 12
    7 KB (1,150 words) - 23:48, 19 April 2023
  • 2 Minus Tables
    *2 : {{FDBID|3}} / M1 *3 : {{FDBID|7}} / M2
    2 KB (176 words) - 12:01, 13 February 2019
  • Lucas-Lehmer test
    ...<sup>2</sup> - 2 = 37634. So the fact that 2<sup>5</sup> - 1 divides S<sub>3</sub> (37634 / 31 = 1214) shows that 2<sup>5</sup> - 1 is prime. ...4 (= 2<sup>2</sup>) bits, the value of S<sub>2</sub> has about 8 (= 2<sup>3</sup>) bits, and the value of S<sub>50000000</sub> (which would need to be
    20 KB (3,572 words) - 14:30, 17 February 2019
  • Édouard Lucas
    '''François Édouard Anatole Lucas''' {{BirthDeath|4. April 1842|3. October 1891}} was born in Amiens, France and educated at the Ecole Normal
    2 KB (296 words) - 01:09, 15 January 2024
  • Digit
    A '''digit''' is a symbol (a number symbol, e.g. "3" or "7") used in numerals (combinations of symbols, e.g. "37"), to represen
    1 KB (171 words) - 10:17, 18 January 2019
  • Decimal
    ...symbols (called [[digit]]s) for no more than ten distinct values (0, 1, 2, 3, 4, 5, 6, 7, 8 and 9) to represent any numbers, no matter how large. These
    1 KB (190 words) - 10:23, 18 January 2019
  • Base
    | 3 || '''11''' || 3
    2 KB (399 words) - 10:37, 18 January 2019
  • Whole number
    *the nonnegative [[integer]]s (0, 1, 2, 3, ...) *the positive integers (1, 2, 3, ...) (often called [[natural number]]s)
    413 bytes (54 words) - 09:51, 8 February 2019
  • Integer
    ...umber]]s (1, 2, 3, &hellip;), their negatives (&minus;1, &minus;2, &minus;3, ...) and the number zero. The set of all integers is usually denoted in [[
    3 KB (404 words) - 14:58, 26 March 2023
  • Factorial number
    :<math>n! = 1 \cdot 2 \cdot 3 \cdots (n{-}2) \cdot (n{-}1) \cdot n</math> :5! = 5 * 4 * 3 * 2 * 1 = 120
    729 bytes (93 words) - 13:40, 5 November 2023
  • Subtraction
    ...are, minuend &minus; subtrahend = difference. The expression 7 &minus; 4 = 3 can be spoken as "seven minus four equals three", "seven take away four lea
    893 bytes (128 words) - 16:58, 29 August 2022
  • Division
    :<math>2 \times 3 = 6</math>.
    2 KB (368 words) - 16:58, 29 August 2022
  • Remainder
    ...ng. Dividing 13 into groups of 5 would yield 2 groups, with a remainder of 3.
    245 bytes (34 words) - 14:07, 18 January 2019
  • Factoring Database
    **Greatest prime factor ^2+1, ^2+2, ^2-1, ^2-2, ^3+1, ^3-1
    1 KB (144 words) - 13:44, 24 January 2019
  • Factorization
    ...factors (half of the numbers are multiples of 2, a third are multiples of 3 and so on) it pays to run factorization methods in the first category and t
    4 KB (642 words) - 12:57, 5 March 2019
  • Odd number
    When expressed in decimal notation, the odd numbers end in 1, 3, 5, 7 or 9. All prime numbers except 2 are odd.
    316 bytes (42 words) - 11:21, 7 March 2019
  • M46
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 3 GHz Core 2 [[Personal computer|PC]] ...since 1996 testing over 1400 candidates. The calculation took 29 days on a 3.0 GHz Intel Core2 processor.
    2 KB (248 words) - 11:45, 18 February 2019
  • Riesel prime 2 187605
    3
    490 bytes (35 words) - 12:22, 11 December 2022
  • Program
    *Knuth, Donald E., The Art of Computer Programming, Volume 3, 3rd Edition, 1997, Addison-Wesley, ISBN 0-201-89685-0
    2 KB (263 words) - 11:53, 7 February 2019
  • M1
    | number= 3
    193 bytes (19 words) - 13:43, 17 February 2019
  • Conjectures 'R Us
    ==Sub-project #3==
    3 KB (503 words) - 02:20, 1 May 2024
  • Fast Fourier transform
    ...key algorithm is O(&epsilon; log ''n''), compared to O(&epsilon; ''n''<sup>3/2</sup>) for the naive DFT formula (Gentleman and Sande, 1966), where &epsi ...achlass: Theoria interpolationis methodo nova tractata," ''Werke'' band '''3''', 265&ndash;327 (K&ouml;nigliche Gesellschaft der Wissenschaften, G&ouml;
    17 KB (2,684 words) - 18:50, 28 September 2023
  • GpuOwL
    Apart from the LL test, gpuOwL also implements a base-3 [[probable prime|PRP]] test with [[Gerbicz error checking]] ensuring correc
    1 KB (216 words) - 05:22, 1 December 2020
  • M32
    ...nski was notified and tested the number on a 16 CPU Cray-C90, taking about 3 hours. Later it was verified on a different computer architecture, using di
    2 KB (279 words) - 08:35, 18 February 2019
  • 2 Plus Tables
    *1 : {{FDBID|3}}
    2 KB (127 words) - 15:28, 17 August 2019
  • Binary
    :0 &rarr; 0 * 2<sup>3</sup> = 0
    1 KB (210 words) - 11:16, 22 January 2019
  • Repunit
    ...) numbers. 111 is a repunit, in base 2 it is equal to 7 (base 10), in base 3 it is equal to 13 (base 10).
    1 KB (207 words) - 08:04, 12 March 2024
  • Parallel computing
    | 3 || 300 || x || 1440 || 432000 || ..., they could all be done in parallel. This would cut a 5 step procedure to 3. If the numbers were each 100 digits long and 10 individuals (or cores in a
    3 KB (416 words) - 06:47, 1 May 2019
  • Trial factoring
    ...trial divisors. If P(i) is the i'th prime number so P(1) = 2, P(2) = 3, P(3) = 5, etc, then the last prime factor possibility for some number N would b ...ce 2*7 is excluded because 2 will have been tried, 3*7 is excluded because 3 will have been tried, and 5*7 is excluded because 5 will have been tried. T
    7 KB (1,221 words) - 13:20, 11 February 2019
  • M44
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 3 GHz Pentium 4 [[Personal computer|PC]]
    997 bytes (129 words) - 11:35, 18 February 2019
  • Odd Magnar Strindmo
    Strindmo's 3 GHz Core 2 Duo PC first reported the prime to GIMPS on 2009-04-12. However,
    991 bytes (141 words) - 00:33, 15 January 2024
  • Modular arithmetic
    ...rithmetic modulo 12 and the set of numbers representing the hours 0, 1, 2, 3,..., 11 is known as <b>Z</b>/12<b>Z</b>. The set <b>Z</b>/n<b>Z</b> of numbers modulo n contains the numbers 0, 1, 2, 3, ..., n-2 and n-1. The following operations are defined:
    4 KB (625 words) - 10:25, 23 January 2019
  • Montgomery multiplication
    :Let m=5 , n=3 , a = b = 3. :We get: a' = b' = 3 &times; 8 mod 5 = 4
    4 KB (582 words) - 17:01, 29 August 2022
  • Elliptic curve method
    ...cation|multiplying]] lots of different prime numbers together. So that 2 x 3 x 5 x 7 x 11 x 13 etc will be a highly composite number. But that is only t ...for ''y''. If we plug in ''x'' = 2, we get out ''y'' = 23. Plug in ''x'' = 3, we get out ''y'' = 48. If we plug in enough different values for ''x'' and
    19 KB (3,181 words) - 22:27, 6 July 2023
  • Raphael M. Robinson
    ...ey.edu/sites/default/files/imagecache/photo_album_main/photo_albums/ROBINS~3.jpg ...[Mersenne number]]s were all composite except for 17 values of ''n'' = 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, [[M12|127]], [[M13|521]], [[M14|607]],
    4 KB (526 words) - 14:51, 19 September 2021
  • Sierpiński problem
    *{{Kbn|+|78557|2n}} is multiple of 3. *{{Kbn|+|78557|9n+3}} is multiple of 73.
    5 KB (650 words) - 10:25, 26 March 2024
  • Paul Seelhoff
    :28 [[Proth prime]]s for 3 &le; {{Vk}} &le; 97
    2 KB (195 words) - 00:13, 15 January 2024
  • M2
    | nvalue= 3
    193 bytes (19 words) - 13:43, 17 February 2019
  • M3
    | rank= 3 | pdigits= 3
    194 bytes (19 words) - 13:43, 17 February 2019
  • M4
    | digits= 3
    195 bytes (19 words) - 13:44, 17 February 2019
  • Perfect number
    ...ct number, because 1, 2 and 3 are its proper positive divisors and 1 + 2 + 3 = 6. The next perfect number is 28 = 1 + 2 + 4 + 7 + 14. The next perfect n :for ''n'' = 3: &nbsp; 2<sup>2</sup>(2<sup>3</sup> - 1) = 28
    6 KB (885 words) - 11:33, 7 March 2019
  • Unused computing power
    ..."do nothing". A [[computer]] that is a quad-[[Processor|core]] running at 3 GHz is capable of performing 12 billion instructions a second. Often less t
    971 bytes (156 words) - 13:46, 25 January 2019
  • Mfakto
    -v <n> verbosity level: 0=terse, 1=normal, 2=verbose, 3=debug Maximum: 3 (debug)
    17 KB (2,524 words) - 12:39, 24 January 2019
  • Rho factorization method
    ...ed by Floyd that consists in computing x<sub>1</sub>, x<sub>2</sub>, x<sub>3</sub> and so on by iterating the polynomial, and at the same time computing ...sub> - x<sub>2</sub>, N), gcd(x<sub>2</sub> - x<sub>4</sub>, N), gcd(x<sub>3</sub> - x<sub>6</sub>, N), and so on until we find a proper factor of N.
    3 KB (558 words) - 10:28, 6 February 2019
  • Lucas primality test
    Prove that N = 811 is prime knowing that N-1 = 2 &times; 3<sup>4</sup> &times; 5 Let's start with b = 3.
    1 KB (177 words) - 14:31, 17 February 2019
  • Square root
    For example, <math>\sqrt 9 = 3</math> since <math>3^2 = 3 \times 3 = 9</math>. :<math> = 1 + \frac{1}{2}x - \frac{1}{8}x^2 + \frac{1}{16} x^3 - \frac{5}{128} x^4 + ...</math>
    13 KB (1,873 words) - 16:52, 24 October 2020
  • Primality testing program
    ...e Prime Freeware] by [[Luke Welsh]] and Yuri Sorkin. Last updated on April 3, 2008.
    2 KB (314 words) - 21:23, 29 August 2019
  • Pépin's test
    ...mber]]s <math>F_{n,2} = 4^{3^n}+2^{3^n}+1</math> with k = 5 instead of k = 3. ...n>0</math>, <math>F_n = 2^{2^n}+1</math> is a prime if and only if <math>\ 3^{(F_n-1)/2} \ \equiv -1 \ \pmod{F_n}</math>.
    2 KB (401 words) - 14:40, 6 March 2019
  • Proof by induction
    *'''Step 3''' *'''Step 3'''
    4 KB (679 words) - 13:57, 20 February 2019
  • M37
    | top5000id=3
    877 bytes (111 words) - 11:04, 18 February 2019
  • GIMPS factoring and sieving
    ...d is eliminated if it was not previously eliminated in the divisibility by 3 test, and so forth. It is not necessary to carry this sieving process all t
    6 KB (962 words) - 10:08, 7 March 2019
  • Modular square root
    ===Modulus congruent to 3 modulo 4=== *Step 2: <math>x = 2</math>, <math>z = 2^7 \bmod 113 = 15</math>, <math>z^{2^3} \bmod 113 = 1</math>, so we have to repeat step 2.
    5 KB (726 words) - 10:38, 6 February 2019
  • Legendre symbol
    ...egin{cases} 1 & \text{if } p \equiv 1 \pmod{4} \\ -1 & \text{if } p \equiv 3 \pmod{4} \end{cases}</math> ...\text{if } p \equiv 1 \text { or } 7 \pmod{8} \\ -1 & \text{if } p \equiv 3 \text{ or } 5 \pmod{8} \end{cases}</math>
    2 KB (348 words) - 18:57, 28 September 2023
  • Law of quadratic reciprocity
    *If both of <math>p</math> or <math>q</math> are congruent to 3 mod 4: <math>p</math> is a quadratic residue modulo <math>q</math> if and o
    1 KB (208 words) - 18:19, 2 October 2022
  • LLR
    ..." for Gaussian-Mersenne norms and Wagstaff numbers (2<sup>{{V|p}}</sup>+1)/3. The latter uses a strong Fermat PRP-test and the [[Vrba-Reix algorithm]].
    2 KB (300 words) - 22:00, 16 December 2023
  • Double Mersenne number
    *MM(2) = <math>2^3-1</math> = 7, known prime since antiquity *MM(3) = <math>2^7-1</math> = 127, known prime since antiquity
    4 KB (655 words) - 14:50, 19 September 2021
  • P-1 factorization method
    :<math>E = 2^{E_2} * 3^{E_3} * 5^{E_5} * ... * B</math> Then E = 2<sup>3</sup> &times; 3<sup>2</sup> &times; 5 &times; 7 &times; 29.
    5 KB (814 words) - 01:35, 12 March 2019
  • Brent-Suyama extension
    Recall that stage 1 computes S=3<sup>E</sup> where E is the product of prime powers less than B1. Then by [[ A naive stage 2 would then compute T=S<sup>q</sup> = 3<sup>E*q</sup> for successive prime q in the range (B1,B2]. Then p | T-1 if
    2 KB (421 words) - 11:51, 28 January 2019
  • Special number field sieve
    ...eft(\exp\left( \left(\frac{32}{9}n\right)^{\frac{1}{3}} (\log n)^{\frac{2}{3}} \right)\right).</math>
    1 KB (186 words) - 12:07, 19 February 2019
  • Miller-Rabin pseudoprimality test
    *r = 3: <math>463^2\equiv 67\,\pmod{561}</math>
    3 KB (432 words) - 15:33, 28 January 2019
  • Generalized Fermat number
    ...-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. ...zed Fermat numbers the program PFGW can be used. For example to test {{NPr|3|41}} call
    5 KB (726 words) - 09:57, 12 September 2021
  • PrimeGrid
    ...Network Computing]] (BOINC) platform. As of October 2020, there are about 3,300 active participants (on about 16,000 host computers) from 89 countries, ...e Search|321 Prime Search]] searching for mega primes of the form {{Kbn|±|3|2|n}}.
    3 KB (458 words) - 10:28, 26 March 2024
  • 321 Search
    ...oject|distributed computing project]] to search for [[prime]]s of the form 3*2<sup>n</sup>-1.
    1 KB (185 words) - 09:34, 3 August 2021
  • Sieve of Eratosthenes
    ...number which hasn't been crossed out already; these are divisible by <math>3</math> and so are composite.
    4 KB (654 words) - 11:10, 6 February 2019
  • Top GIMPS teams
    | 3 || [[GPUto72|GPU to 72]] || 17738197
    2 KB (206 words) - 09:56, 7 March 2019
  • Aliquot sequence
    ...<math>10^6</math>, 18361 under <math>2*10^6</math>, and 27659 under <math>3*10^6</math>. :<math>2^ \ \ *\ 3</math>
    6 KB (914 words) - 19:49, 21 February 2023
  • Abundant number
    The divisors of 12 are <math>(1, 2, 3, 4, 6, 12)</math>, so :<math>\sigma(12)\ =\ 1+2+3+4+6+12\ =\ 28</math>
    671 bytes (92 words) - 00:34, 30 January 2019
  • Prime
    ...that is only divisible by itself and 1. The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19. ...tive whole numbers from 2 to P plus the number 1. In other words, Q = (2 x 3 x 4 x 5 ... x P) + 1. From the form of the number Q, it is obvious that no
    2 KB (447 words) - 00:22, 10 July 2023
  • Twin prime
    | align="right" | 10<sup>3</sup> || align="right" | 35
    2 KB (255 words) - 06:08, 21 February 2023
  • Computing power
    ...TFLOPS) or petaFLOPS (PFLOPS)) are normally used. [[GIMPS]] has also used 3 other measurements over its lifespan (P90 years, PII-400 years, and GHz-day
    2 KB (257 words) - 22:54, 3 February 2019
  • Math rendering
    | <code>\prime, f^\prime, f', f'', f^{(3)}, \dot y, \ddot y</code> | <math>\prime, f^\prime, f', f'', f^{(3)} \!, \dot y, \ddot y</math>
    33 KB (4,920 words) - 10:54, 7 March 2019
  • Why participate in GIMPS?
    ...like 6 and 28 who are equal to the sum of their aliquot divisors: 6 = 1+2+3, 28=1+2+4+7+14). He realized that the even perfect numbers (no odd perfect
    7 KB (1,252 words) - 09:47, 7 March 2019
  • Smooth number
    :900 = 2<sup>2</sup> &times; 3<sup>2</sup> &times; 5<sup>2</sup>
    436 bytes (63 words) - 21:36, 3 February 2019
  • NewPGen
    *k&times;2<sup>n</sup>+1, k&times;2<sup>n+1</sup>+3 (Sophie Germain) ...>+1 (to test k&times;b<sup>n</sup>+1, and if that is prime check the other 3 for the chance of a twin prime or CC 2nd kind)
    3 KB (529 words) - 09:32, 7 March 2019
  • Sophie Germain prime
    | 2 || 3 || {{NRi|2}} | 3 || 5 || {{NRi|3|1}}
    1 KB (171 words) - 04:26, 3 November 2020
  • Torture test
    ...using the default "Blend" setting, the first instance each will use about 3/4 of memory the system memory. The second instance will try to do the same.
    2 KB (323 words) - 10:59, 18 June 2019
  • Floor function
    | 2 || 3 | 2 || 3
    813 bytes (111 words) - 16:56, 29 August 2022
  • Power of two
    ...so 1024 bytes = 1 kibibyte. 1024<sup>2</sup> bytes = 1 mebibyte, 1024<sup>3</sup> bytes = 1 gibibyte, and so on.
    839 bytes (127 words) - 11:38, 6 February 2019
  • Introductory stuff
    ...3 = 4 - 1 = 2<sup>2</sup> - 1 is a Mersenne prime; so is 7 = 8 - 1 = 2<sup>3</sup> - 1. See [[Mersenne prime]].
    14 KB (2,370 words) - 15:15, 17 August 2019
  • Glossary
    *'''[[Exponent]]''' - In <math>3^5</math>, 5 is the exponent.
    1 KB (190 words) - 10:55, 7 March 2019
  • Overclocking
    ...your AGP PORT for your AGP card is set to operate at a fixed fraction, (2/3 or 1/2), of the FSB.
    14 KB (2,326 words) - 15:17, 11 February 2019
  • Area
    ...efined as a surface enclosed by a shape. It can be 2 or 3 dimensional. For 3 dimensional shapes, the surface is the area.
    215 bytes (32 words) - 13:43, 18 September 2022
  • Triangular number
    :4△ = 4 + 3 + 2 + 1 = 10 (10 pin bowling uses a triangular arrangement.) :5△ = 5 + 4 + 3 + 2 + 1 = 15 (a common billiards arrangement is 15 balls in a triangle.)
    655 bytes (81 words) - 12:49, 25 March 2019
  • Pocklington's theorem
    ...est|Selfridge's]] test can be used to prove primality. If <math>f^{10} > n^3</math>, the [[KonyaginPomerance|Konyagin-Pomerance Test]] can be used. If <
    2 KB (346 words) - 19:51, 30 August 2019
  • Keyboard shortcuts
    !rowspan="3"|{{Key|d}}
    3 KB (431 words) - 10:20, 7 March 2019
  • GIMPS type of work
    ...ic curve method]], and work units of this type are typically distributed 1-3 curves at a time from PrimeNet (one can change the number of curves by modi
    4 KB (757 words) - 15:17, 25 July 2020
  • How to get started with GIMPS
    *'''Windows 3.1''': Download ''prime.zip''. This version is not fully automatic, but you ==Step 3==
    4 KB (623 words) - 13:39, 26 March 2019
  • P+1 factorization method
    E = 2<sup>3</sup> &times; 3<sup>2</sup> &times; 5 &times; 7 *Multiply index by 3: <math>427936^2 - 2\equiv 299066</math>, so the first pair is <math>(V_n ,
    8 KB (1,536 words) - 11:35, 12 February 2019
  • SNFS polynomial selection
    3. If your exponent is divisible by 3, 5 or 7, you can divide out an algebraic factor and immediately get a polyn :<math>(b^{11}-1)/(b-1) = b^{10} + b^9 + b^8 + b^7 + b^6 + b^5 + b^4 + b^3 + b^2 + b + 1</math>
    7 KB (1,238 words) - 16:14, 12 February 2019
  • NFSNET
    |<math>3^{523}-1</math> || 118660861315644501826386980212508132942915206257779375740
    4 KB (237 words) - 12:17, 13 February 2019
  • Mersenneplustwo factorizations
    ...ible by 3 (it's assumed to be prime) and 2<sup>p</sup> is not divisible by 3 (it's only prime factor is 2).
    2 KB (215 words) - 13:33, 5 March 2019
  • ECMclient
    3. Open ecmclient.ini
    2 KB (383 words) - 11:16, 26 February 2019
  • GMP-ECM
    ....tar.bz2 MPIR] and [https://gforge.inria.fr/frs/download.php/30965/ecm-6.4.3.tar.gz GMP-ECM] (don't unpack them, just place them on your desktop). 3. Now move the MPIR and GMP-ECM to C:\YourMsysDirectory\1.0\home\YourUser\.
    4 KB (567 words) - 10:54, 6 December 2019
  • Gerbicz error checking
    # <math>d(j)</math> (for identity (3)) ...<math>n/L</math> [[Modular arithmetic#Modular multiplication|mulmods]] in (3) and <math>n / L^2 * L = n/L</math> [[Modular arithmetic#Modular exponentia
    3 KB (528 words) - 14:59, 3 October 2023
  • System requirements and compatible hardware
    :Windows NT (3 / 4 / 4 SP 1 / 4 SP 2 / 4 SP 3 / 4 SP 4 / 4 SP 5 / 4 SP 6) :Windows 2000 (SP 1 / SP 2 / SP 3 / SP 4)
    766 bytes (95 words) - 12:25, 19 February 2019
  • PrimeNet summary report
    ...st vertical divider is the '''Exponent Range''' section and is broken into 3 columns.
    7 KB (1,072 words) - 13:10, 19 February 2019
  • Square number
    ...two square integers is also a square number (e.g. 2/3&nbsp;&times;&nbsp;2/3 = 4/9). :3<sup>2</sup> = 9
    3 KB (408 words) - 13:56, 19 February 2019
  • Editing
    === Level 3 === === Level 3 ===
    5 KB (805 words) - 06:50, 1 May 2019
  • Sierpiński number base 5
    ...i problem]] article, it was found that {{Kbn|+|159986|5|n}} is multiple of 3, 7, 13, 31 or 601 (the [[covering set]]) depending on the value of {{Vn}},
    556 bytes (83 words) - 10:57, 14 October 2020
  • Riesel number base 5
    ...l problem]] article, it was found that {{Kbn|-|346802|5|n}} is multiple of 3, 7, 13, 31 or 601 (the [[covering set]]) depending on the value of n, so it
    589 bytes (90 words) - 10:30, 26 March 2024
  • Riesel problem 1
    | 2 || 3 || {{Num|214734}} || {{Num|{{PAGESINCATEGORY:Riesel 2 1Intervals1|pages|R}} ! scope="row" | [[:Category:Riesel 2 1Intervals3|3]]
    6 KB (689 words) - 18:14, 4 April 2024
  • Peano postulates
    ...; it characterises the set (class, condition) of [[natural number]]s 1, 2, 3, etc., and consists of the following '''Peano postulates''' (also called ''
    2 KB (269 words) - 17:04, 24 October 2020
  • Mersenne.ca
    ...g of the 1000M to 4294M range in September 2012 eliminated approximately 1/3 of the candidates (roughly 50 million factors from approximately 150 millio
    9 KB (1,396 words) - 15:42, 25 February 2019
  • Aurifeuillian factor
    **<math>t\equiv 2, 3 \pmod 4</math> and <math>n\equiv 2t \pmod{4t}</math> ....edu/~ssw/cun/pmain1215 Main Cunningham Tables]. At the end of tables 2LM, 3+, 5-, 6+, 7+, 10+, 11+ and 12+ are formulae detailing the Aurifeuillian fac
    10 KB (1,257 words) - 08:04, 24 June 2019
  • Cullen number
    ...me/guenter/gc/status.html Generalized Cullen Search, G&uuml;nter L&ouml;h (3 &le; base &le; 100), dated Sept. 2017]
    2 KB (252 words) - 17:39, 31 August 2021
  • Carol-Kynea prime 8
    |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 2|CKMaxn}}/3)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 2|CKClist|3}}
    389 bytes (47 words) - 10:33, 10 June 2019
  • Carol-Kynea prime 290
    3
    1 KB (119 words) - 19:02, 21 June 2021
  • Multifactorial number
    :<math>n! = 1 \cdot 2 \cdot 3 \cdots (n{-}2) \cdot (n{-}1) \cdot n</math> :<math>n!!! = (n) \cdot (n-3) \cdot (n-6) \cdots</math>
    560 bytes (81 words) - 14:36, 20 July 2021
  • Riesel prime 2 1
    3;T:W;C:'''[[M2]]''', {{NWo|2}}, {{NWo|8|1}} 5;C:'''[[M3]]''', {{NWo|+|3}}, {{NWo|4|2}}, {{NWo|32|1}}
    2 KB (288 words) - 11:41, 3 April 2023
  • Riesel prime 2 3
    |Rk=3 3;T:SW;C:{{NWo|3}}
    5 KB (523 words) - 09:47, 5 October 2023
  • Riesel prime 2 2145
    3;T:S
    3 KB (329 words) - 07:59, 17 August 2021
  • Carol-Kynea prime 50
    3
    490 bytes (45 words) - 12:30, 3 July 2019
  • Williams prime MM 10
    3
    1 KB (143 words) - 02:41, 5 November 2020
  • Williams prime PM 2
    |WiMaxn={{GP|Riesel prime 2 3|RMaxn}} |WiDate={{GP|Riesel prime 2 3|RDate}}
    246 bytes (35 words) - 14:04, 1 August 2021
  • Williams prime PP 2
    |WiMaxn={{GP|Proth prime 2 3|PMaxn}} |WiDate={{GP|Proth prime 2 3|PDate}}
    259 bytes (36 words) - 10:52, 13 July 2021
  • Williams prime MM 4
    |WiMaxn={{#expr:floor({{GP|Riesel prime 2 3|RMaxn}}/2)}} |WiDate={{GP|Riesel prime 2 3|RDate}}
    265 bytes (37 words) - 20:50, 31 July 2021
  • Williams prime MM 3
    |WiBase=3 |WiMaxn={{GP|Riesel prime 3 2|RMaxn}}
    248 bytes (35 words) - 09:56, 16 March 2023
  • Williams prime PM 3
    |WiBase=3 |WiMaxn={{GP|Riesel prime 3 4|RMaxn}}
    248 bytes (35 words) - 13:40, 16 March 2023
  • Williams prime MM 8
    |WiMaxn={{#expr:floor({{GP|Riesel prime 2 7|RMaxn}}/3)}} |WiNlist={{Reuse Primelist|Riesel prime 2 7|RNlist|3}}
    291 bytes (42 words) - 20:52, 31 July 2021
  • Williams prime MM 9
    |WiRemarks=Should be (re)used from {{NRi|8|3|n}}.<br>The {{OEIS|l|A268356}} and halved even values of {{OEIS|l|A005541}}
    412 bytes (45 words) - 20:59, 31 July 2021
  • Williams prime MM 11
    3
    366 bytes (36 words) - 20:54, 31 July 2021
  • Williams prime MM 14
    3
    402 bytes (44 words) - 11:53, 21 May 2019
  • Williams prime MM 17
    3
    214 bytes (19 words) - 12:20, 21 May 2019
  • Williams prime MM 27
    3 |WiRemarks=Should be (re)used from {{NRi|26|3|n}}.
    282 bytes (26 words) - 20:58, 31 July 2021
  • Proth prime 2 3
    |Pk=3
    3 KB (336 words) - 16:58, 15 April 2024
  • Generalized Fermat number 12 5 1
    |GFNDigits=3 3,2
    128 bytes (12 words) - 09:57, 30 July 2021
  • Generalized Fermat number 12 7 1
    |GFNDigits=3
    125 bytes (12 words) - 15:10, 17 August 2021
  • GF Divisor 3 20909
    |GFk=3 3,2,20905#1996#Anders Björn,Hans Riesel
    656 bytes (73 words) - 21:56, 16 August 2021
  • GF Divisor 46409657301841 16
    3,1,15#2008#Geoffrey Reynolds
    153 bytes (10 words) - 08:55, 23 September 2021
  • Proth prime 2 5
    3;T:G
    1 KB (144 words) - 11:12, 24 August 2021
  • Proth prime 2 9
    3;T:GT
    3 KB (432 words) - 18:48, 9 April 2023
  • GF Divisor 9 6
    9,8,3#1996#Anders Björn,Hans Riesel
    264 bytes (33 words) - 17:56, 23 August 2021
  • GF Divisor 9 7
    3,2,5#1996#Anders Björn,Hans Riesel
    305 bytes (38 words) - 18:11, 23 August 2021
  • Proth prime 2 11
    3;T:G
    2 KB (240 words) - 08:58, 11 January 2023
  • Proth prime 2 17
    3;T:G
    1 KB (141 words) - 13:50, 25 August 2021
  • Proth prime 2 1527888802614951
    3
    371 bytes (31 words) - 08:06, 18 September 2021
  • Sieving a range of sequences
    Sieving a range {{Kbn|3|2|n}} to {{Kbn|20|19|n}} (in general {{Kbn|(b+1)|b|n}}) create a batch file
    775 bytes (124 words) - 08:39, 22 April 2019
  • LLR testing a range of sequences
    Testing a range {{Kbn|3|2|n}} to {{Kbn|20|19|n}} (in general {{Kbn|(b+1)|b|n}}) create a batch file
    871 bytes (147 words) - 12:29, 23 April 2019
  • Carol-Kynea prime 12
    3
    713 bytes (72 words) - 16:32, 12 February 2020
  • Carol-Kynea prime 22
    3
    362 bytes (28 words) - 15:25, 15 July 2019
  • Carol-Kynea prime 30
    3
    450 bytes (38 words) - 01:20, 8 July 2019
  • Woodall prime 6
    3
    593 bytes (52 words) - 10:32, 17 August 2023
  • Woodall prime 4
    2;C:{{NRi|5}}, {{NWo|+|3}} 3;T:T;C:{{NRi|3|6}}, {{NWo|+|5}}
    1 KB (122 words) - 17:00, 31 August 2021
  • Woodall prime 3
    |WoBase=3 2;T:T;C:{{NRi|2|3|2}}
    1 KB (115 words) - 07:13, 17 August 2023
  • Woodall prime 2
    2;C:{{NRi|3}} 3;C:{{NRi|3|3}}
    2 KB (230 words) - 10:36, 27 March 2023
  • Woodall prime 8
    1;C:{{NRi|3}} 12;C:{{NRi|3|38}}
    702 bytes (72 words) - 10:58, 17 August 2023
  • Woodall prime 9
    10;C:{{NRi|10|3|20}} 58;C:{{NRi|58|3|116}}
    469 bytes (46 words) - 21:51, 28 February 2024
  • Woodall prime 10
    3
    684 bytes (71 words) - 08:21, 30 April 2023
  • Cullen prime 3
    |CuBase=3 54;C:{{NPr|2|3|57}}
    697 bytes (65 words) - 18:55, 19 July 2023
  • Cullen prime 4
    3;C:{{NPr|3|6}}
    849 bytes (85 words) - 19:15, 14 July 2023
  • Carol-Kynea prime 42
    3 3
    882 bytes (79 words) - 08:41, 15 October 2021
  • Carol-Kynea prime 44
    3
    423 bytes (36 words) - 12:34, 1 July 2019
  • Carol-Kynea prime 1968
    3
    352 bytes (31 words) - 11:43, 4 July 2019
  • Williams prime PP least
    Values of bases {{Vb}} ≡ 1 mod 3 are always divisible by 3, so not listed here.
    2 KB (306 words) - 09:54, 7 September 2020
  • Williams prime MP 3
    |WiBase=3 4217;35890;C:Divides Phi(3^4217,2)
    2 KB (151 words) - 00:47, 25 May 2020
  • Williams prime MM 33
    3
    210 bytes (19 words) - 21:30, 16 May 2019
  • Williams prime MM 35
    3
    209 bytes (19 words) - 21:40, 16 May 2019
  • Williams prime MM 39
    3
    215 bytes (19 words) - 08:44, 17 May 2019
  • Williams prime MM 42
    3
    196 bytes (17 words) - 09:38, 17 May 2019
  • Williams prime MM 46
    3
    195 bytes (17 words) - 09:49, 17 May 2019
  • Williams prime MM 48
    3
    184 bytes (17 words) - 09:53, 17 May 2019
  • Williams prime MM 53
    3
    168 bytes (17 words) - 10:51, 17 May 2019
  • Williams prime MM 57
    3
    170 bytes (17 words) - 10:58, 17 May 2019
  • Williams prime MM 59
    3
    171 bytes (17 words) - 11:00, 17 May 2019
  • Williams prime MM 63
    3
    212 bytes (19 words) - 11:33, 17 May 2019
  • Riesel prime 2 63
    3
    2 KB (224 words) - 06:12, 9 May 2024
  • Williams prime MP 4
    |WiMaxn={{Reuse Primelist|Proth prime 2 3|PMaxn|2}} |WiDate={{GP|Proth prime 2 3|PDate}}
    258 bytes (36 words) - 08:07, 1 August 2021
  • Williams prime MP 8
    |WiMaxn={{Reuse Primelist|Proth prime 2 7|PMaxn|3}} |WiNlist={{Reuse Primelist|Proth prime 2 7|PNlist|3}}
    284 bytes (41 words) - 08:16, 1 August 2021
  • Williams prime MP 9
    |WiMaxn={{#expr:floor({{GP|Proth prime 3 8|PMaxn}}/2)}} |WiDate={{GP|Proth prime 3 8|PDate}}
    387 bytes (53 words) - 08:30, 12 July 2021
  • Williams prime MP 10
    3
    1 KB (131 words) - 07:33, 23 April 2024
  • Williams prime MP 12
    3
    210 bytes (20 words) - 09:46, 20 May 2019
  • Williams prime PM 6
    3
    444 bytes (35 words) - 12:23, 12 March 2024
  • Riesel prime 2 9
    3;T:T
    4 KB (357 words) - 23:04, 19 April 2024
  • Williams prime PM 8
    |WiMaxn={{#expr:floor({{GP|Riesel prime 2 9|RMaxn}}/3)}} |WiNlist={{Reuse Primelist|Riesel prime 2 9|RNlist|3}}
    265 bytes (37 words) - 14:09, 1 August 2021
  • Williams prime PM 9
    |WiRemarks=This list should be a (re)use of {{Kbn|10|3|n}}!<br>Halved even values of the {{OEIS|l|A005542}}
    428 bytes (42 words) - 22:03, 20 April 2024
  • Williams prime PM 11
    3
    250 bytes (17 words) - 11:02, 23 May 2019
  • Williams prime MM 88
    3
    173 bytes (16 words) - 13:38, 21 May 2019
  • Williams prime MP 15
    3
    290 bytes (23 words) - 19:22, 30 September 2020
  • Williams prime MP 21
    3
    313 bytes (23 words) - 18:30, 19 November 2020
  • Williams prime MP 27
    |WiMaxn={{#expr:floor({{GP|Proth prime 3 26|PMaxn}}/3)}} |WiDate={{GP|Proth prime 3 26|PDate}}
    443 bytes (56 words) - 08:44, 12 July 2021
  • Williams prime PM 13
    3
    221 bytes (17 words) - 11:11, 23 May 2019
  • Williams prime PM 18
    3
    218 bytes (18 words) - 12:46, 23 May 2019
  • Williams prime PM 24
    3
    230 bytes (18 words) - 13:16, 23 May 2019
  • Williams prime PM 27
    |WiRemarks=Should be (re)used from {{Kbn|28|3|n}}.
    277 bytes (26 words) - 13:23, 23 May 2019
  • Riesel prime 2 33
    3
    3 KB (295 words) - 22:47, 5 July 2023
  • Williams prime PM 38
    3
    232 bytes (18 words) - 14:14, 23 May 2019
  • Williams prime PM 107
    3
    197 bytes (18 words) - 14:22, 23 May 2019
  • Williams prime PM 113
    3
    221 bytes (18 words) - 14:23, 23 May 2019
  • Williams prime PP 3
    |WiBase=3 |WiMaxn={{GP|Proth prime 3 4|PMaxn}}
    293 bytes (41 words) - 11:57, 13 July 2021
  • Williams prime PP 5
    3
    567 bytes (52 words) - 06:08, 18 June 2020
  • Williams prime PP 8
    |WiMaxn={{#expr:floor({{GP|Proth prime 2 9|PMaxn}}/3)}} |WiNlist={{Reuse Primelist|Proth prime 2 9|PNlist|3}}
    278 bytes (38 words) - 11:59, 13 July 2021
  • Williams prime PP 9
    |WiMaxn={{#expr:floor({{GP|Proth prime 3 10|PMaxn}}/2)}} |WiDate={{GP|Proth prime 3 10|PDate}}
    268 bytes (37 words) - 08:34, 12 July 2021
  • Williams prime PP 11
    3
    234 bytes (19 words) - 16:38, 26 May 2019
  • Williams prime PP 14
    3
    202 bytes (17 words) - 10:22, 27 May 2019
  • Williams prime PP 15
    3
    206 bytes (17 words) - 10:24, 27 May 2019
  • Williams prime PP 24
    3
    210 bytes (18 words) - 10:40, 27 May 2019
  • Williams prime PP 27
    |WiRemarks=Should be (re)used from {{Kbn|+|28|3|n}}.
    246 bytes (26 words) - 10:58, 27 May 2019
  • Williams prime PP 71
    3
    210 bytes (18 words) - 11:34, 27 May 2019
  • Williams prime PP 93
    3
    211 bytes (18 words) - 11:38, 27 May 2019
  • Williams prime PP 113
    3
    198 bytes (18 words) - 11:41, 27 May 2019
  • Williams prime MM 497
    3
    198 bytes (19 words) - 22:09, 27 May 2019
  • Carol-Kynea prime 52
    3
    268 bytes (23 words) - 12:39, 1 July 2019
  • Carol-Kynea prime 56
    3
    324 bytes (28 words) - 12:46, 1 July 2019
  • Carol-Kynea prime 68
    3
    230 bytes (19 words) - 09:00, 13 July 2019
  • Carol-Kynea prime 74
    3
    463 bytes (49 words) - 10:35, 20 May 2021
  • Carol-Kynea prime 76
    3
    249 bytes (19 words) - 08:54, 13 July 2019
  • Carol-Kynea prime 78
    3
    213 bytes (19 words) - 08:52, 13 July 2019
  • Carol-Kynea prime 82
    3
    218 bytes (19 words) - 08:51, 13 July 2019
  • Carol-Kynea prime 86
    3
    222 bytes (19 words) - 09:02, 13 July 2019
  • Carol-Kynea prime 92
    3
    229 bytes (19 words) - 08:56, 13 July 2019
  • Riesel prime small bases least n
    {{#get_web_data:url=https://www.rieselprime.de/z/images/3/3e/Riesel_prime_small_bases_least_n_wanted.csv|format=csv with header|delim ! data-sort-type="number" class="fixhead" {{!}} {{Vk}}&nbsp;=&nbsp;3
    6 KB (684 words) - 09:40, 17 March 2024
  • Proth prime small bases least n
    {{HistF|2022-07-30|&nbsp;{{Kbn|+|3|912|132173}}|(Anonymous)|610485}} ==={{Vk}} = 3===
    7 KB (795 words) - 08:03, 5 May 2024
  • Carol-Kynea prime 102
    3
    297 bytes (23 words) - 08:48, 13 July 2019
  • Carol-Kynea prime 106
    3
    283 bytes (23 words) - 08:54, 13 July 2019
  • Carol-Kynea prime 108
    3
    271 bytes (23 words) - 08:45, 13 July 2019
  • Carol-Kynea prime 114
    3
    279 bytes (23 words) - 08:49, 13 July 2019
  • Carol-Kynea prime 216
    |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 6|CKMaxn}}/3)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 6|CKClist|3}}
    391 bytes (47 words) - 10:37, 11 June 2019
  • Williams prime PM 34
    3
    224 bytes (18 words) - 23:07, 17 June 2019
  • Williams prime PM 39
    3
    245 bytes (18 words) - 23:14, 17 June 2019
  • Williams prime PM 43
    3
    187 bytes (18 words) - 23:19, 17 June 2019
  • Williams prime PM 49
    3
    238 bytes (18 words) - 23:26, 17 June 2019
  • Williams prime PM 52
    3
    204 bytes (18 words) - 23:30, 17 June 2019
  • Williams prime PM 57
    3
    218 bytes (18 words) - 23:36, 17 June 2019
  • Williams prime PM 58
    3
    206 bytes (18 words) - 23:37, 17 June 2019
  • Williams prime MP 46
    3
    226 bytes (18 words) - 12:21, 18 June 2019
  • Williams prime MP 55
    3
    203 bytes (18 words) - 12:22, 18 June 2019
  • Williams prime MP 57
    3
    198 bytes (18 words) - 12:23, 18 June 2019
  • Riesel prime 2 129
    3;T:ST
    2 KB (178 words) - 05:51, 9 May 2024
  • Riesel prime 2 257
    {{HistC|2022-03-09|2222000|RPS Megabit Drive 3|601408}} {{HistF|2021-04-12|2108554|Gary Barnes, RPS Megabit Drive 3|575751}}
    1 KB (126 words) - 03:35, 6 May 2024
  • Williams prime PP 35
    3
    201 bytes (18 words) - 10:33, 25 June 2019
  • Williams prime PP 36
    3
    191 bytes (18 words) - 10:34, 25 June 2019
  • Williams prime PP 39
    3
    211 bytes (18 words) - 10:49, 25 June 2019
  • Williams prime PP 44
    3
    194 bytes (18 words) - 11:06, 25 June 2019
  • Williams prime PP 53
    3
    197 bytes (18 words) - 12:00, 25 June 2019
  • Williams prime PP 56
    3
    208 bytes (18 words) - 12:03, 25 June 2019
  • Proth prime 2 129
    3;T:T
    2 KB (186 words) - 18:58, 9 April 2023
  • Carol-Kynea prime 142
    3
    351 bytes (34 words) - 13:42, 30 May 2020
  • Carol-Kynea prime 146
    3
    597 bytes (54 words) - 17:15, 18 May 2023

View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://www.rieselprime.de/ziki/Special:Search"