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

Jump to: navigation, search

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

Page title matches

Page text matches

  • Williams prime
    ...-> [[Williams prime MM 4|page]] || {{OEIS|A326655}} -> [[Williams prime MP 4|page]] || ||
    5 KB (744 words) - 07:30, 5 August 2019
  • Carol-Kynea prime 2
    4
    5 KB (537 words) - 08:17, 9 October 2020
  • Carol-Kynea prime 6
    4
    1 KB (85 words) - 10:45, 16 April 2023
  • Splitting a sieve file
    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
  • Examples
    <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
  • Mersenne prime
    ...7 = 8 &minus; 1 = {{Kbn|3}}. On the other hand, 15 = 16 &minus; 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
  • Mersenne number
    *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
  • Marin Mersenne
    : <math>\sqrt[4]{\frac{2}{3-\sqrt{2}}}</math>
    11 KB (1,582 words) - 01:17, 15 January 2024
  • George Woltman
    | MersForum=4 Prime95
    1 KB (164 words) - 14:40, 21 August 2019
  • Fermat number
    :{{V|F}}<sub>2</sub> = {{Kbn|+|4}} = 17 :{{V|F}}<sub>4</sub> = {{Kbn|+|16}} = 65537
    12 KB (1,913 words) - 14:35, 9 August 2021
  • Derrick Henry Lehmer
    ...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 using
    6 KB (1,033 words) - 01:13, 15 January 2024
  • Cunningham project
    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 Fermat
    7 KB (1,150 words) - 23:48, 19 April 2023
  • Lucas-Lehmer test
    ...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
  • Édouard Lucas
    '''François Édouard Anatole Lucas''' {{BirthDeath|4. April 1842|3. October 1891}} was born in Amiens, France and educated at th
    2 KB (296 words) - 01:09, 15 January 2024
  • Decimal
    ...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 dig
    1 KB (190 words) - 10:23, 18 January 2019
  • Base
    ...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
  • Addition
    :2 + 2 = 4
    333 bytes (43 words) - 16:55, 29 August 2022
  • Exponent
    ...a &times; a &times; a &times; 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
  • Factorial number
    :5! = 5 * 4 * 3 * 2 * 1 = 120 :10! = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1 = 3628800
    729 bytes (93 words) - 13:40, 5 November 2023
  • Composite number
    ...te''' if it is neither [[prime]] nor equal to 1. The smallest composite is 4.
    358 bytes (56 words) - 23:30, 26 October 2020
  • Subtraction
    ...ion are, minuend &minus; subtrahend = difference. The expression 7 &minus; 4 = 3 can be spoken as "seven minus four equals three", "seven take away four
    893 bytes (128 words) - 16:58, 29 August 2022
  • M47
    **One on 4 quad-core SPARC64 VII 2.52GHz CPUs of a Sun SPARC Enterprise M8000 Server
    5 KB (694 words) - 13:17, 21 August 2019
  • Prime95
    |style="text-align:left"|Intel Pentium 4||3078||1||72.40||162.02||14.91||86 |style="text-align:left"|AMD Phenom II X4||3414||4||34.86||76.27||4.59||125
    11 KB (1,586 words) - 12:24, 7 August 2021
  • Even number
    All numbers ending in 0, 2, 4, 6, or 8 are even.
    425 bytes (61 words) - 11:19, 7 March 2019
  • M41
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2.4 GHz Pentium 4 [[Personal computer|PC]] The discovery took 14 days of computing on 2.4 GHz Pentium 4 Windows XP PC.
    1 KB (203 words) - 11:26, 18 February 2019
  • M43
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2 GHz Pentium 4 [[Personal computer|PC]]
    1 KB (191 words) - 11:31, 18 February 2019
  • Riesel prime 2 21143
    4
    403 bytes (26 words) - 18:40, 2 January 2023
  • Proth prime 2 12321
    4
    498 bytes (31 words) - 13:34, 2 January 2023
  • Program
    ...Programming, Volume 1, 3rd Edition, 1997, Addison-Wesley, ISBN 0-201-89683-4
    2 KB (263 words) - 11:53, 7 February 2019
  • M42
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2.4 GHz Pentium 4 [[Personal computer|PC]]
    934 bytes (118 words) - 11:26, 18 February 2019
  • Fast Fourier transform
    ...he history of the fast Fourier transform," ''IEEE ASSP Magazine'' '''1''' (4), 14-21 (1984).
    17 KB (2,684 words) - 18:50, 28 September 2023
  • Primo
    |latest=4.3.2<br><small>2020-02-06</small> ...ood]] with Primo 4.3.0. The certification process took 21.5 months using a 4 x 12 core AMD 6174.
    1 KB (191 words) - 20:33, 12 May 2020
  • M32
    :"Took 26.562767 minutes to calculate using Maple 4.0 on a 512-MW 4 CPU Cray 2"
    2 KB (279 words) - 08:35, 18 February 2019
  • 2 Plus Tables
    *4 : {{FDBID|17}}
    2 KB (127 words) - 15:28, 17 August 2019
  • Binary
    :1 &rarr; 1 * 2<sup>4</sup> = 16
    1 KB (210 words) - 11:16, 22 January 2019
  • Parallel computing
    | 4 || 7200 || + || 86400 || 93600 ||
    3 KB (416 words) - 06:47, 1 May 2019
  • M40
    The discovery took 19 days of computation on a 2 GHz Pentium 4 Dell Dimension PC at a Michigan State University lab.
    1 KB (189 words) - 11:17, 18 February 2019
  • M44
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 3 GHz Pentium 4 [[Personal computer|PC]]
    997 bytes (129 words) - 11:35, 18 February 2019
  • Modular arithmetic
    ...3 hours = 2 PM). We can also subtract: 2-3 = 11 and even multiply: 5&times;4 = 8 (because 5+5+5+5 = 8). This is arithmetic modulo 12 and the set of numb
    4 KB (625 words) - 10:25, 23 January 2019
  • Montgomery multiplication
    :We get: a' = b' = 3 &times; 8 mod 5 = 4 :x = a' b' = 4 &times; 4 = 16
    4 KB (582 words) - 17:01, 29 August 2022
  • Elliptic curve method
    ...''' = '''S'''. Given a point '''P''', we could compute 2'''P''', 3'''P''', 4'''P''', and so on. For some value <math>g</math>. we will have <math>g</mat where: <math>S = \frac {A+2}4</math> which can be precomputed when the elliptic curve is selected and
    19 KB (3,181 words) - 22:27, 6 July 2023
  • University of California, Los Angeles
    ...ty. [[University of Central Missouri]] has contributed to the discovery of 4, making it second to UCLA.
    2 KB (347 words) - 14:54, 19 September 2021
  • Raphael M. Robinson
    ...universal Turing machine," describing a universal [[Turing machine]] with 4 symbols and 7 states;
    4 KB (526 words) - 14:51, 19 September 2021
  • M36
    | top5000id=4
    2 KB (279 words) - 11:01, 18 February 2019
  • Sierpiński problem
    |0||1||2||3||4||5||6||7||8||9||10||11||12||13||14||15||16||17||18||19||20||21||22||23||24|
    5 KB (650 words) - 10:25, 26 March 2024
  • M4
    | rank= 4 | pdigits= 4
    195 bytes (19 words) - 13:44, 17 February 2019
  • M5
    | digits= 4
    204 bytes (18 words) - 13:46, 17 February 2019
  • Perfect number
    ...sitive divisors and 1 + 2 + 3 = 6. The next perfect number is 28 = 1 + 2 + 4 + 7 + 14. The next perfect numbers are 496 and 8128. :for ''n'' = 5: &nbsp; 2<sup>4</sup>(2<sup>5</sup> - 1) = 496
    6 KB (885 words) - 11:33, 7 March 2019
  • Residue
    ...roneaous residues (meaning they both missed a prime) out of a pool of ~ 18.4 pentillion numbers, this is considered to be impossible. :S0 = 4
    1 KB (235 words) - 10:24, 6 February 2019
  • Mfakto
    ...this will start happening at vector size 8. On a HD6870, a vector size of 4 is fastest except for the barrett92 and barrett72 kernels which run slightl Allowed sizes are 1, 2, 4, 8, 16.
    17 KB (2,524 words) - 12:39, 24 January 2019

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

Retrieved from "https://www.rieselprime.de/ziki/Special:Search"