Search results

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

Page title matches

• Proth prime 3 6
  |Pb=3 3
  473 bytes (37 words) - 18:11, 2 August 2021
• Free-DC Drive 3
  *Started: [https://www.free-dc.org/showthread.php?19810-Drive-3 2009-08-08] [[Category:Free-DC's Prime Search|Drive 3]]
  292 bytes (36 words) - 10:32, 15 May 2021
• GF Divisor 3 201
  |GFk=3 3,1,198#1992#Harvey Dubner
  614 bytes (65 words) - 08:58, 17 August 2021
• GF Divisor 3 189
  |GFk=3 3,1,187#1992#Harvey Dubner
  637 bytes (67 words) - 09:00, 17 August 2021
• GF Divisor 3 66
  |GFk=3 3,1,63#1992#Harvey Dubner
  652 bytes (74 words) - 09:03, 17 August 2021
• GF Divisor 3 41
  |GFk=3 3,1,38#1992#Harvey Dubner
  466 bytes (51 words) - 14:26, 17 August 2021
• GF Divisor 3 36
  |GFk=3 3,1,32#1992#Harvey Dubner
  635 bytes (74 words) - 14:28, 17 August 2021
• GF Divisor 3 2
  |GFk=3 11,3,1
  109 bytes (8 words) - 14:11, 23 August 2021
• GF Divisor 3 5
  |GFk=3 5,3,4
  154 bytes (8 words) - 15:18, 17 August 2021
• GF Divisor 3 6
  |GFk=3 3,1,3
  154 bytes (8 words) - 15:11, 17 August 2021
• GF Divisor 3 8
  |GFk=3 3,2,6#1996#Anders Björn,Hans Riesel
  595 bytes (75 words) - 15:02, 17 August 2021
• GF Divisor 3 12
  |GFk=3 3,1,8#1987#Cunningham project
  556 bytes (67 words) - 14:37, 17 August 2021
• GF Divisor 3 18
  |GFk=3 3,1,15#1992#Harvey Dubner
  559 bytes (67 words) - 14:33, 17 August 2021
• GF Divisor 3 30
  |GFk=3 3,1,26#1992#Harvey Dubner
  568 bytes (67 words) - 14:30, 17 August 2021
• Generalized Fermat number 3 2 2
  |GFNa=3
  122 bytes (12 words) - 11:02, 18 May 2024
• Generalized Fermat number 2 1 3
  |GFNn=3 |GFNDigits=3
  124 bytes (12 words) - 08:55, 5 July 2021
• GF Divisor 3 276
  |GFk=3 3,1,271#1992#Harvey Dubner
  730 bytes (74 words) - 08:36, 17 August 2021
• GF Divisor 3 353
  |GFk=3 3,2,350#1996#Anders Björn,Hans Riesel
  649 bytes (62 words) - 08:28, 17 August 2021
• GF Divisor 3 408
  |GFk=3 3,1,403#1992#Harvey Dubner
  768 bytes (74 words) - 08:26, 17 August 2021
• Generalized Fermat number 3 2 3
  |GFNa=3 |GFNn=3
  130 bytes (12 words) - 19:57, 1 August 2021

Page text matches

• 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²(2³ - 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₁, x₂, x₃ and so on by iterating the polynomial, and at the same time computing ...sub> - x₂, N), gcd(x₂ - x₄, N), gcd(x₃ - x₆, 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⁴ &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

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