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 "4" on this wiki! See also the search results found.
Page title matches
- |CKBase=4389 bytes (47 words) - 10:31, 10 June 2019
- |WiBase=4265 bytes (37 words) - 20:50, 31 July 2021
- |WoBase=41 KB (122 words) - 17:00, 31 August 2021
- |CuBase=4849 bytes (85 words) - 19:15, 14 July 2023
- |WiBase=4258 bytes (36 words) - 08:07, 1 August 2021
- |WiBase=4265 bytes (37 words) - 14:05, 1 August 2021
- |LeY=4147 bytes (15 words) - 19:41, 23 July 2019
- This is team drive #4 for [[No Prime Left Behind]]. This searched the following {{Vk}}'s for {{Vn [[Category:No Prime Left Behind|Drive 4]]488 bytes (56 words) - 11:48, 5 September 2021
- |Pk=4459 bytes (40 words) - 09:57, 12 July 2021
- |Pk=4 |PRemarks=The {{OEIS|l|A005537}}<br>For all even {{Vn}}-values {{Kbn|+|4|3|n}} is a [[Generalized Fermat number]].1 KB (120 words) - 21:11, 1 August 2021
- |GFn=4 4,3,3302 bytes (8 words) - 07:36, 23 August 2021
- |GFNn=4128 bytes (12 words) - 08:55, 5 July 2021
- |GFn=484 bytes (8 words) - 11:41, 23 June 2021
- |GFNn=4134 bytes (12 words) - 16:10, 17 August 2021
- |GFNa=4124 bytes (12 words) - 16:32, 17 August 2021
- |GFNa=4120 bytes (12 words) - 16:30, 17 August 2021
- This is team Mini Drive #4 of [[No Prime Left Behind]] [[Category:No Prime Left Behind|Mini Drive 4]]435 bytes (52 words) - 11:57, 5 September 2021
- |GFNa=4125 bytes (12 words) - 23:08, 20 August 2021
- |GFNb=4127 bytes (12 words) - 00:28, 31 July 2021
- |GFNb=4126 bytes (12 words) - 01:54, 31 July 2021
Page text matches
- ...-> [[Williams prime MM 4|page]] || {{OEIS|A326655}} -> [[Williams prime MP 4|page]] || ||5 KB (744 words) - 07:30, 5 August 2019
- 45 KB (537 words) - 08:17, 9 October 2020
- 41 KB (85 words) - 10:45, 16 April 2023
- Split the sieve file <code>t16_b999.prp</code> into 4 separate files. *Call <code>gawk -f split.awk files=4 t16_b999.prp</code>.1 KB (203 words) - 18:52, 2 October 2022
- <pre><math>\sideset{_1^2}{_3^4}\prod_a^b</math></pre> :<math>\sideset{_1^2}{_3^4}\prod_a^b</math>11 KB (1,236 words) - 14:41, 3 September 2020
- ...7 = 8 − 1 = {{Kbn|3}}. On the other hand, 15 = 16 − 1 = {{Kbn|4}}, for example, is not a prime, because 15 is divisible by 3 and 5. ...f {{V|M<sub>p</sub>}} evenly divides <math>S_{p-2}</math>, where <math>S_0=4</math> and for <math>k>0</math>, <math>S_k=S_{k-1}^2-2</math>.5 KB (857 words) - 14:53, 19 September 2021
- *Let <math>q = 3 \pmod{4}</math> be a prime. <math>2q+1</math> is also a prime if and only if <math>2 KB (351 words) - 11:28, 7 March 2019
- : <math>\sqrt[4]{\frac{2}{3-\sqrt{2}}}</math>11 KB (1,582 words) - 01:17, 15 January 2024
- | MersForum=4 Prime951 KB (164 words) - 14:40, 21 August 2019
- :{{V|F}}<sub>2</sub> = {{Kbn|+|4}} = 17 :{{V|F}}<sub>4</sub> = {{Kbn|+|16}} = 6553712 KB (1,913 words) - 14:35, 9 August 2021
- ...math> dealing with two cases of the [[Ramanujan conjecture]], that <math>5^4 | p(599)</math> and <math>11^3 | p(721)</math>, computing the values using6 KB (1,033 words) - 01:13, 15 January 2024
- Only the first five Fermat numbers, k = 0, 1, 2, 3, 4 corresponding to 3, 5, 17, 257 and 65537 are known to be prime. All Fermat7 KB (1,150 words) - 23:48, 19 April 2023
- ...991) 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 from t ...he smallest unit of computer memory). The value of S<sub>1</sub> has about 4 (= 2<sup>2</sup>) bits, the value of S<sub>2</sub> has about 8 (= 2<sup>3</20 KB (3,572 words) - 14:30, 17 February 2019
- '''François Édouard Anatole Lucas''' {{BirthDeath|4. April 1842|3. October 1891}} was born in Amiens, France and educated at th2 KB (296 words) - 01:09, 15 January 2024
- ...bols (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 dig1 KB (190 words) - 10:23, 18 January 2019
- ...16) is used because every 4 digits can be used as short for binary. Every 4 binary digits turns into one hexadecimal digit when changing between them.2 KB (399 words) - 10:37, 18 January 2019
- :2 + 2 = 4333 bytes (43 words) - 16:55, 29 August 2022
- ...a × a × a × a is written as <math>a^4</math>, the number 4 is the index, or exponent.1 KB (273 words) - 16:56, 29 August 2022
- :5! = 5 * 4 * 3 * 2 * 1 = 120 :10! = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1 = 3628800729 bytes (93 words) - 13:40, 5 November 2023
- ...te''' if it is neither [[prime]] nor equal to 1. The smallest composite is 4.358 bytes (56 words) - 23:30, 26 October 2020