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

Page title matches

Page text matches

  • {{#babel:de|en-3}} !rowspan="3" style="background-color:#E0CEF2;"|2
    3 KB (328 words) - 07:35, 3 July 2020
  • background: url("https://upload.wikimedia.org/wikipedia/commons/3/38/Database.png") center right no-repeat; padding-right: 20px; /* References in 3 columns */
    5 KB (621 words) - 23:56, 29 April 2024
  • ...|he|kk-arab|kk-cn|ks|ku-arab|mzn|pnb|prd|ps|sd|ug|ur|ydd|yi={{{2|rtl}}}|{{{3|ltr}}}}}<noinclude>[[Category:Multilanguage]]</noinclude>
    217 bytes (36 words) - 22:35, 15 December 2018
  • 3
    917 bytes (86 words) - 12:13, 22 May 2019
  • ...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
  • + "&maxage=259200" // 3 d
    2 KB (192 words) - 13:05, 13 December 2018
  • /* (3) find nearest tag pair (same depth) around the cursor position */ + "(-(3[01]|[012][0-9])"
    129 KB (11,879 words) - 13:07, 13 December 2018
  • Users in this category indicate they have skill level 3 for language English.
    2 members (0 subcategories, 0 files) - 21:07, 20 December 2018
  • 3 3
    5 KB (537 words) - 08:17, 9 October 2020
  • 3
    1 KB (85 words) - 10:45, 16 April 2023
  • *<nowiki>{{GP|GF Divisor 3 209|GFList}}</nowiki> {{GP|GF Divisor 3 209|GFList}}
    3 KB (311 words) - 18:08, 13 August 2021
  • 695631;121906;T:WTC;C:[[Test]]<br>'''Divides:''' F(38), GF(38,3), GF(33,6), GF(38,12) *{{NVal|695631;121906;T:WTC;C:[[Test]]<br>'''Divides:''' F(38), GF(38,3), GF(33,6), GF(38,12)}}
    3 KB (440 words) - 16:51, 22 March 2024
  • <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) - 08:27, 15 May 2024
  • ...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<sub>2</sub>}}, {{V|M<sub>3</sub>}}, {{V|M<sub>5</sub>}}, {{V|M<sub>7</sub>}} were known in antiquity.
    5 KB (857 words) - 14:53, 19 September 2021
  • ...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
  • : <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
  • :{{V|F}}<sub>0</sub> = {{Kbn|+|1}} = 3 :{{V|F}}<sub>3</sub> = {{Kbn|+|8}} = 257
    12 KB (1,913 words) - 14:35, 9 August 2021
  • ...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
  • The length of such chains is also of interest, in this case #HP(25) = 3. :21<sub>10</sub> = 3 &times; 7 (11 &times; 111)
    980 bytes (143 words) - 13:22, 6 March 2019
  • | style="text-align:right;"|{{{3}}}||style="text-align:right;"|{{{4}}}||style="text-align:right;"|{{{5}}}||{
    1 KB (140 words) - 13:49, 16 January 2019
  • The extension recognize standard ISO 639 (1-3) country codes. You can find your language code by searching this [https:// |3||You're able to write in this language with almost no errors.
    1 KB (235 words) - 10:44, 21 March 2024
  • Die Erweiterung erkennt standard ISO 639 (1–3) Ländercodes. Du kannst Deine Sprache finden, indem du die Liste von [http |3||Du kannst in dieser Sprache mit nur wenigen Fehlern schreiben.
    2 KB (269 words) - 00:11, 17 January 2019
  • *[[3 Minus Tables]] *[[3 Plus Tables]]
    614 bytes (69 words) - 12:08, 13 February 2019
  • ...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
  • ...C=on&EV=on&OD=on&PR=on&FF=on&PRP=on&CF=on&U=on&C=on&perpage={{{4}}}&format=3&sent=Show Text]'''</span></includeonly>
    1 KB (189 words) - 12:00, 13 February 2019
  • *2 : {{FDBID|3}} / M1 *3 : {{FDBID|7}} / M2
    2 KB (176 words) - 12:01, 13 February 2019
  • ...<sup>2</sup> - 2 = 37634. So the fact that 2<sup>5</sup> - 1 divides S<sub>3</sub> (37634 / 31 = 1214) shows that 2<sup>5</sup> - 1 is prime. ...4 (= 2<sup>2</sup>) bits, the value of S<sub>2</sub> has about 8 (= 2<sup>3</sup>) bits, and the value of S<sub>50000000</sub> (which would need to be
    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 the Ecole Normal
    2 KB (296 words) - 01:09, 15 January 2024
  • 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
  • ...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
  • | 3 || '''11''' || 3
    2 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
  • ...umber]]s (1, 2, 3, &hellip;), their negatives (&minus;1, &minus;2, &minus;3, ...) and the number zero. The set of all integers is usually denoted in [[
    3 KB (404 words) - 14:58, 26 March 2023
  • :<math>n! = 1 \cdot 2 \cdot 3 \cdots (n{-}2) \cdot (n{-}1) \cdot n</math> :5! = 5 * 4 * 3 * 2 * 1 = 120
    729 bytes (93 words) - 13:40, 5 November 2023
  • ...are, minuend &minus; subtrahend = difference. The expression 7 &minus; 4 = 3 can be spoken as "seven minus four equals three", "seven take away four lea
    893 bytes (128 words) - 16:58, 29 August 2022
  • :<math>2 \times 3 = 6</math>.
    2 KB (368 words) - 16:58, 29 August 2022
  • ...ng. Dividing 13 into groups of 5 would yield 2 groups, with a remainder of 3.
    245 bytes (34 words) - 14:07, 18 January 2019
  • **Greatest prime factor ^2+1, ^2+2, ^2-1, ^2-2, ^3+1, ^3-1
    1 KB (144 words) - 13:44, 24 January 2019
  • ...factors (half of the numbers are multiples of 2, a third are multiples of 3 and so on) it pays to run factorization methods in the first category and t
    4 KB (642 words) - 12:57, 5 March 2019
  • When expressed in decimal notation, the odd numbers end in 1, 3, 5, 7 or 9. All prime numbers except 2 are odd.
    316 bytes (42 words) - 11:21, 7 March 2019
  • | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 3 GHz Core 2 [[Personal computer|PC]] ...since 1996 testing over 1400 candidates. The calculation took 29 days on a 3.0 GHz Intel Core2 processor.
    2 KB (248 words) - 11:45, 18 February 2019
  • 3
    490 bytes (35 words) - 12:22, 11 December 2022
  • *Knuth, Donald E., The Art of Computer Programming, Volume 3, 3rd Edition, 1997, Addison-Wesley, ISBN 0-201-89685-0
    2 KB (263 words) - 11:53, 7 February 2019
  • | number= 3
    193 bytes (19 words) - 13:43, 17 February 2019
  • ==Sub-project #3==
    3 KB (507 words) - 08:29, 29 May 2024
  • ...key algorithm is O(&epsilon; log ''n''), compared to O(&epsilon; ''n''<sup>3/2</sup>) for the naive DFT formula (Gentleman and Sande, 1966), where &epsi ...achlass: Theoria interpolationis methodo nova tractata," ''Werke'' band '''3''', 265&ndash;327 (K&ouml;nigliche Gesellschaft der Wissenschaften, G&ouml;
    17 KB (2,684 words) - 18:50, 28 September 2023
  • Apart from the LL test, gpuOwL also implements a base-3 [[probable prime|PRP]] test with [[Gerbicz error checking]] ensuring correc
    1 KB (216 words) - 05:22, 1 December 2020
  • ...nski was notified and tested the number on a 16 CPU Cray-C90, taking about 3 hours. Later it was verified on a different computer architecture, using di
    2 KB (279 words) - 08:35, 18 February 2019
  • *1 : {{FDBID|3}}
    2 KB (127 words) - 15:28, 17 August 2019
  • :0 &rarr; 0 * 2<sup>3</sup> = 0
    1 KB (210 words) - 11:16, 22 January 2019

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