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 "1" on this wiki! See also the search results found.
Page title matches
- |GFk=1 4,3,1178 bytes (8 words) - 14:10, 23 August 2021
- |GFk=1 3,1,7#1981#Cunningham project467 bytes (20 words) - 08:05, 7 June 2024
- |GFk=1 3,1,15#1992#Harvey Dubner509 bytes (22 words) - 14:11, 22 August 2021
- |GFNb=1130 bytes (12 words) - 12:32, 6 July 2021
- |GFNb=1 |GFNDigits=1120 bytes (12 words) - 08:54, 5 July 2021
- |GFNb=1 |GFNn=1120 bytes (12 words) - 18:11, 1 August 2021
- |GFNb=1122 bytes (12 words) - 08:54, 5 July 2021
- |GFNb=1124 bytes (12 words) - 08:55, 5 July 2021
- |GFNb=1128 bytes (12 words) - 08:55, 5 July 2021
- |GFNb=1140 bytes (12 words) - 00:56, 23 June 2021
- |GFNb=1159 bytes (12 words) - 10:46, 23 June 2021
- |GFNb=1 1,4129 bytes (12 words) - 14:07, 28 July 2021
- |GFNb=1178 bytes (12 words) - 08:18, 16 September 2021
- |GFNb=1122 bytes (12 words) - 16:02, 17 August 2021
- |GFNb=1 |GFNn=1120 bytes (12 words) - 15:52, 17 August 2021
- |GFNb=1134 bytes (12 words) - 16:10, 17 August 2021
- |GFNb=1149 bytes (12 words) - 16:14, 17 August 2021
- |GFNb=1169 bytes (12 words) - 16:19, 17 August 2021
- |GFNb=1177 bytes (13 words) - 10:30, 2 July 2021
- |GFNb=1 1,8204 bytes (12 words) - 14:01, 28 July 2021
Page text matches
- ...vement to the [[Lucas primality test]] for [[Mersenne prime]]s <math>2^p{-}1</math>, extending its application to all odd prime exponents ''p'', and ena6 KB (1,033 words) - 01:13, 15 January 2024
- {| border="1" cellpadding="4px" style="border:3px; border-color:#000; border-collapse:co {| border="1" cellpadding="4px" style="border:3px; border-color:#000; border-collapse:co2 KB (175 words) - 18:45, 14 December 2023
- ...to find the complete [[factorization]] 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 ex :<math>(b^{kn}-1) = (b^n-1) \sum _{r=0}^{k-1} b^{rn}</math>7 KB (1,150 words) - 05:23, 7 June 2024
- ==Factorizations Of Cunningham Numbers C<sup>-</sup>(2,n) = 2<sup>n</sup> - 1== * 001 - 100 : {{FDBCunningham|2|-|1|100}}2 KB (176 words) - 12:01, 13 February 2019
- M25 is 2<sup>{{Num|21701}}</sup>-1, a number of {{Num|6533}} [[digit]]s. ...heory and that Tuckerman's discovery of [[M24]] (2<sup>{{Num|19937}}</sup>-1) was the start of this island.2 KB (303 words) - 11:01, 26 February 2019
- ...905 - 1991) provided a complete proof that this was not only true when p = 1 (mod 4), but for all odd prime exponents. The test therefore takes its name ...> - 1 divides S<sub>3</sub> (37634 / 31 = 1214) shows that 2<sup>5</sup> - 1 is prime.20 KB (3,572 words) - 14:30, 17 February 2019
- ...ucas-Lehmer test]]. In 1876, Lucas proved the primality of <math>2^{127}{-}1</math> ([[M12]]) and this remained the highest [[Mersenne prime]] for almos2 KB (296 words) - 01:09, 15 January 2024
- ...rious 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.1 KB (190 words) - 10:23, 18 January 2019
- | 1 || '''1''' || 12 KB (399 words) - 10:37, 18 January 2019
- *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
- ...positive [[natural number]]s (1, 2, 3, …), their negatives (−1, −2, −3, ...) and the number zero. The set of all integers is u ...e operation of [[division]], since the quotient of two integers (''e.g.'', 1 divided by 2), need not be an integer.3 KB (404 words) - 14:58, 26 March 2023
- :1 + 5 = 6333 bytes (43 words) - 16:55, 29 August 2022
- ...ponent|exponentiation]] (<math>a^0=1</math>) and [[factorial number]]s (0!=1).2 KB (271 words) - 17:00, 29 August 2022
- ...<math>a^p</math> means that we are notating the number <math>\large \frac{1}{a*a*a*a...}</math> where, you guess it, the [[absolute value]] of p repres ...th> equals the reciprocal (or the multiplicative inverse) of a, that means 1/a.1 KB (273 words) - 16:56, 29 August 2022
- :<math>n! = 1 \cdot 2 \cdot 3 \cdots (n{-}2) \cdot (n{-}1) \cdot n</math> for <math>n \ge 1</math>.729 bytes (93 words) - 13:40, 5 November 2023
- ...is a [[prime]] number, and a number that has factors other than itself and 1 is called a [[composite number]].576 bytes (107 words) - 19:03, 5 February 2019
- ...ive [[integer]] is '''composite''' if it is neither [[prime]] nor equal to 1. The smallest composite is 4. ...where the integers <math>a</math> and <math>b</math> are both greater than 1, the number is composite.358 bytes (56 words) - 23:30, 26 October 2020
- **Greatest prime factor ^2+1, ^2+2, ^2-1, ^2-2, ^3+1, ^3-11 KB (144 words) - 13:44, 24 January 2019
- ...ion method|p-1]]: It finds a factor ''p'' if the largest prime factor of p-1 is small. *[[p+1 factorization method|p+1]]: Similar to p-1, but succeeds if p+1 has no large factors.4 KB (642 words) - 12:57, 5 March 2019
- The official discovery date for 2<sup>{{Num|57885161}}</sup>-1 was 2013-01-25. See the [http://www.mersenne.org/primes/?press=M57885161 pr .../watch?v=QSEKzFGpCQs New Largest Known Prime Number 2<sup>57,885,161</sup>-1] at YouTube channel Numberphile2 KB (235 words) - 11:49, 18 February 2019