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 "2" on this wiki! See also the search results found.
Page title matches
- |Rb=2621 bytes (42 words) - 16:58, 14 March 2023
- |LeY=2 |LeDigits=2152 bytes (17 words) - 23:05, 17 July 2019
- |LeY=2155 bytes (17 words) - 20:21, 23 July 2019
- |LeY=2156 bytes (17 words) - 23:12, 17 July 2019
- |LeY=2156 bytes (17 words) - 20:22, 23 July 2019
- |LeY=2150 bytes (16 words) - 20:35, 23 July 2019
- |Rb=2692 bytes (60 words) - 08:15, 25 January 2024
- |LeY=2 |LeProgram=Titanix 2.1.0 (ECPP)176 bytes (19 words) - 13:05, 27 July 2019
- |LeY=2 |LeProgram=Titanix 2.1.0 (ECPP)176 bytes (19 words) - 13:06, 27 July 2019
- |LeY=2 |LeProgram=Titanix 2.1.0 (ECPP)178 bytes (19 words) - 13:08, 27 July 2019
- |LeY=2174 bytes (19 words) - 00:08, 24 July 2019
- |LeY=2181 bytes (20 words) - 19:52, 24 July 2019
- |LeY=2141 bytes (14 words) - 20:13, 24 July 2019
- |LeY=2141 bytes (14 words) - 20:14, 24 July 2019
- |Rb=2550 bytes (50 words) - 08:13, 25 January 2024
- |Rb=2823 bytes (62 words) - 08:12, 25 January 2024
- |Rb=2635 bytes (48 words) - 08:11, 25 January 2024
- |Pb=21 KB (116 words) - 09:29, 14 May 2024
- |Rb=2685 bytes (63 words) - 08:10, 25 January 2024
- |Rb=2241 bytes (24 words) - 00:15, 17 July 2021
Page text matches
- ...umbers using only two [[digit]]s (usually, 0 and 1). Thus it is a [[base]] 2 numbering system. Example: 10110011<sub>2</sub> = 179<sub>10</sub>1 KB (210 words) - 11:16, 22 January 2019
- ...eing the number referred to as "unity") 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). A '''Generalized repunit''' for any base {{Vb}} ≥ 2 is defined as1 KB (207 words) - 08:04, 12 March 2024
- ...hen a single [[processor]], multiple processors, or multiple cores perform 2 or more operations (similar or different) at once, that is '''parallel comp ! Step !! Input 1 !! Operation !! Input 2 !! Result !! 1440<br>x 3653 KB (416 words) - 06:47, 1 May 2019
- ...0. Computers normally use a very similar 'shift and add' algorithm in base 2. [[Prime95]] does not use this form of multiplication for large numbers, us2 KB (165 words) - 17:01, 29 August 2022
- ...to use as 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 ...< \sqrt{N}</math>) there is no need to try 7 since 2*7 is excluded because 2 will have been tried, 3*7 is excluded because 3 will have been tried, and 57 KB (1,221 words) - 13:20, 11 February 2019
- | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2 GHz Dell Dimension ...hort hand used to refer to the 40th [[Mersenne prime]]. Specifically it is 2<sup>{{Num|20996011}}</sup>-1. This number was discovered to be [[prime]] on1 KB (189 words) - 11:17, 18 February 2019
- '''Michael Shafer''' discovered the [[M40|40th]] [[Mersenne prime]], 2<sup>{{Num|20996011}}</sup>-1 at [[GIMPS]] project.660 bytes (88 words) - 00:39, 15 January 2024
- ...nt. He is credited with discovery of the [[M41|41st known Mersenne prime]] 2<sup>{{Num|24036583}}</sup>-1.695 bytes (93 words) - 11:46, 14 January 2024
- ...hort hand used to refer to the 39th [[Mersenne prime]]. Specifically it is 2<sup>{{Num|13466917}}</sup>-1. This number was discovered to be [[prime]] on868 bytes (109 words) - 11:14, 18 February 2019
- ...efer to the 44th [[Mersenne prime]]. Currently that designation belongs to 2<sup>{{Num|32582657}}</sup>-1.997 bytes (129 words) - 11:35, 18 February 2019
- | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2.83 GHz Core 2 Duo [[Personal computer|PC]] '''M45''' normally refers to 2<sup>{{Num|37156667}}</sup>-1, the 45th [[Mersenne prime]] in order of size2 KB (251 words) - 11:40, 18 February 2019
- ...way who discovered the [[M46|46th Mersenne prime]] (chronologically 47th), 2<sup>{{Num|42643801}}</sup>-1. Strindmo goes by the alias '''Stig M. Valstad Strindmo's 3 GHz Core 2 Duo PC first reported the prime to GIMPS on 2009-04-12. However, due to a s991 bytes (141 words) - 00:33, 15 January 2024
- His Erdös number is 2. He was one of the primary verifiers of [[M32]], [[M33]], and [[M34]].3 KB (431 words) - 11:36, 14 January 2024
- | top5000id=2 ...hort hand used to refer to the 38th [[Mersenne prime]]. Specifically it is 2<sup>{{Num|6972593}}</sup>-1. This number was discovered to be [[prime]] on1 KB (165 words) - 11:10, 18 February 2019
- ...ers employee from Michigan who discovered the [[M38|38th Mersenne prime]], 2<sup>{{Num|6972593}}</sup>-1.809 bytes (109 words) - 23:55, 14 January 2024
- ...s are coprime with a probability over 60% (the exact number is <math>6/\pi^2</math>).738 bytes (112 words) - 09:50, 23 January 2019
- ...s arithmetic 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>. ...</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
- ...math>ab\,\equiv \,c\,\pmod{m}</math>. We will also assume that <math>m\,<\,2^n</math>. :<math>a'=2^n\,a\,\bmod{m}</math>.4 KB (582 words) - 17:01, 29 August 2022
- ...iplication|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 on ...,9</math> is a quadratic expression (because the highest power of ''x'' is 2).19 KB (3,181 words) - 22:27, 6 July 2023
- Specifically 2<sup>{{Num|1398269}}</sup>-1, written out in full [http://www.mersenneforum.2 KB (224 words) - 11:00, 18 February 2019