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 "3" on this wiki! See also the search results found.

Page title matches

Page text matches

  • Integer
    ...umber]]s (1, 2, 3, …), their negatives (−1, −2, −3, ...) and the number zero. The set of all integers is usually denoted in [[
    3 KB (404 words) - 14:58, 26 March 2023
  • Factorial number
    :<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
  • Subtraction
    ...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
  • Division
    :<math>2 \times 3 = 6</math>.
    2 KB (368 words) - 16:58, 29 August 2022
  • Remainder
    ...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
  • Factoring Database
    **Greatest prime factor ^2+1, ^2+2, ^2-1, ^2-2, ^3+1, ^3-1
    1 KB (144 words) - 13:44, 24 January 2019
  • Factorization
    ...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
  • Odd number
    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
  • M46
    | 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
  • Riesel prime 2 187605
    3
    490 bytes (35 words) - 12:22, 11 December 2022
  • Program
    *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
  • M1
    | number= 3
    193 bytes (19 words) - 13:43, 17 February 2019
  • Conjectures 'R Us
    ==Sub-project #3==
    3 KB (503 words) - 02:20, 1 May 2024
  • Fast Fourier transform
    ...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
  • GpuOwL
    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
  • M32
    ...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
  • 2 Plus Tables
    *1 : {{FDBID|3}}
    2 KB (127 words) - 15:28, 17 August 2019
  • Binary
    :0 &rarr; 0 * 2<sup>3</sup> = 0
    1 KB (210 words) - 11:16, 22 January 2019
  • Repunit
    ...) 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).
    1 KB (207 words) - 08:04, 12 March 2024
  • Parallel computing
    | 3 || 300 || x || 1440 || 432000 || ..., they could all be done in parallel. This would cut a 5 step procedure to 3. If the numbers were each 100 digits long and 10 individuals (or cores in a
    3 KB (416 words) - 06:47, 1 May 2019

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

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