When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Table of prime factors - Wikipedia

    en.wikipedia.org/wiki/Table_of_prime_factors

    The first: 1, 8, 27, 64, 125, 216, 343, 512, 729, 1000, 1331, 1728 (sequence A000578 in the OEIS). A perfect power has a common divisor m > 1 for all multiplicities (it is of the form a m for some a > 1 and m > 1).

  3. List of integer sequences - Wikipedia

    en.wikipedia.org/wiki/List_of_integer_sequences

    "subtract if possible, otherwise add": a(0) = 0; for n > 0, a(n) = a(n − 1) − n if that number is positive and not already in the sequence, otherwise a(n) = a(n − 1) + n, whether or not that number is already in the sequence.

  4. Outline of arithmetic - Wikipedia

    en.wikipedia.org/wiki/Outline_of_arithmetic

    Prime number – Number divisible by only 1 or itself Prime number theorem; Distribution of primes; Composite number – Number made of two smaller integers; Factor – A number that can be divided from its original number to get a whole number Greatest common factor – Greatest factor that is common between two numbers

  5. Knuth's up-arrow notation - Wikipedia

    en.wikipedia.org/wiki/Knuth's_up-arrow_notation

    In mathematics, Knuth's up-arrow notation is a method of notation for very large integers, introduced by Donald Knuth in 1976. [1]In his 1947 paper, [2] R. L. Goodstein introduced the specific sequence of operations that are now called hyperoperations.

  6. Hyperoperation - Wikipedia

    en.wikipedia.org/wiki/Hyperoperation

    In mathematics, the hyperoperation sequence [nb 1] is an infinite sequence of arithmetic operations (called hyperoperations in this context) [1] [11] [13] that starts with a unary operation (the successor function with n = 0). The sequence continues with the binary operations of addition (n = 1), multiplication (n = 2), and exponentiation (n = 3).

  7. On-Line Encyclopedia of Integer Sequences - Wikipedia

    en.wikipedia.org/wiki/On-Line_Encyclopedia_of...

    Second edition of the book. Neil Sloane started collecting integer sequences as a graduate student in 1964 to support his work in combinatorics. [8] [9] The database was at first stored on punched cards.

  8. Harmonic progression (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Harmonic_progression...

    In mathematics, a harmonic progression (or harmonic sequence) is a progression formed by taking the reciprocals of an arithmetic progression, which is also known as an arithmetic sequence. Equivalently, a sequence is a harmonic progression when each term is the harmonic mean of the neighboring terms.

  9. Salem–Spencer set - Wikipedia

    en.wikipedia.org/wiki/Salem–Spencer_set

    In 1953, Leo Moser proved that there is a single infinite Salem–Spencer sequence achieving the same asymptotic density on every prefix as Behrend's construction. [1] By considering the convex hull of points inside a sphere, rather than the set of points on a sphere, it is possible to improve the construction by a factor of log ⁡ n ...