Search results

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

Page title matches

• Riesel prime 2 3
  |Rk=3 3;T:SW;C:{{NWo|3}}
  5 KB (523 words) - 09:47, 5 October 2023
• 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
• Proth prime 2 3
  |Pk=3
  3 KB (336 words) - 16:58, 15 April 2024
• GF Divisor 3 20909
  |GFk=3 3,2,20905#1996#Anders Björn,Hans Riesel
  656 bytes (73 words) - 21:56, 16 August 2021
• Woodall prime 3
  |WoBase=3 2;T:T;C:{{NRi|2|3|2}}
  1 KB (115 words) - 07:13, 17 August 2023
• Cullen prime 3
  |CuBase=3 54;C:{{NPr|2|3|57}}
  697 bytes (65 words) - 18:55, 19 July 2023
• 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 PP 3
  |WiBase=3 |WiMaxn={{GP|Proth prime 3 4|PMaxn}}
  293 bytes (41 words) - 11:57, 13 July 2021
• Leyland prime P 3 2
  |LeX=3 |LeNr=3
  152 bytes (17 words) - 23:05, 17 July 2019
• Leyland prime M 3 4
  |LeX=3
  147 bytes (15 words) - 19:41, 23 July 2019
• Leyland prime P 56 3
  |LeY=3
  151 bytes (16 words) - 20:36, 23 July 2019
• Leyland prime P 10112 3
  |LeY=3
  176 bytes (20 words) - 14:08, 22 July 2019
• Leyland prime P 63880 3
  |LeY=3
  141 bytes (14 words) - 13:14, 1 August 2019
• Leyland prime P 78296 3
  |LeY=3
  141 bytes (14 words) - 10:07, 2 August 2019
• Leyland prime P 125330 3
  |LeY=3
  238 bytes (26 words) - 07:15, 10 January 2023
• Leyland prime P 222748 3
  |LeY=3
  147 bytes (14 words) - 11:44, 6 August 2019
• 3 Minus Tables
  ==Factorizations Of Cunningham Numbers C^-(3,n) = 3ⁿ - 1== * 001 - 100 : {{FDBCunningham|3|-|1|100}}
  1 KB (110 words) - 15:55, 17 August 2019
• Woodall prime P 3
  |WoBase=3 3
  380 bytes (29 words) - 16:37, 31 August 2021
• Woodall prime M 3
  |WoBase=3 3
  431 bytes (39 words) - 16:53, 31 August 2021

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₂}}, {{V|M₃}}, {{V|M₅}}, {{V|M₇}} 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}}₀ = {{Kbn|+|1}} = 3 :{{V|F}}₃ = {{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₁₀ = 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
  ...² - 2 = 37634. So the fact that 2⁵ - 1 divides S₃ (37634 / 31 = 1214) shows that 2⁵ - 1 is prime. ...4 (= 2²) bits, the value of S₂ has about 8 (= 2³) bits, and the value of S_50000000 (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

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