enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Waring's problem - Wikipedia

    en.wikipedia.org/wiki/Waring's_problem

    G(3) is at least 4 (since cubes are congruent to 0, 1 or −1 mod 9); for numbers less than 1.3 × 10 9, 1 290 740 is the last to require 6 cubes, and the number of numbers between N and 2N requiring 5 cubes drops off with increasing N at sufficient speed to have people believe that G(3) = 4; [22] the largest number now known not to be a sum of ...

  3. Polite number - Wikipedia

    en.wikipedia.org/wiki/Polite_number

    In number theory, a polite number is a positive integer that can be written as the sum of two or more consecutive positive integers. A positive integer which is not polite is called impolite . [ 1 ] [ 2 ] The impolite numbers are exactly the powers of two , and the polite numbers are the natural numbers that are not powers of two.

  4. List of integer sequences - Wikipedia

    en.wikipedia.org/wiki/List_of_integer_sequences

    0, 1, 3, 6, 2, 7, 13, 20, 12, 21, 11, 22, 10, 23, 9, 24, 8, 25, 43, 62, ... "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.

  5. List of prime numbers - Wikipedia

    en.wikipedia.org/wiki/List_of_prime_numbers

    This is a list of articles about prime numbers.A prime number (or prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. By Euclid's theorem, there are an infinite number of prime numbers.

  6. Harshad number - Wikipedia

    en.wikipedia.org/wiki/Harshad_number

    The number 18 is a harshad number in base 10, because the sum of the digits 1 and 8 is 9, and 18 is divisible by 9.; The Hardy–Ramanujan number (1729) is a harshad number in base 10, since it is divisible by 19, the sum of its digits (1729 = 19 × 91).

  7. Sums of three cubes - Wikipedia

    en.wikipedia.org/wiki/Sums_of_three_cubes

    Semi-log plot of solutions of + + = for integer , , and , and .Green bands denote values of proven not to have a solution.. In the mathematics of sums of powers, it is an open problem to characterize the numbers that can be expressed as a sum of three cubes of integers, allowing both positive and negative cubes in the sum.

  8. Zeckendorf's theorem - Wikipedia

    en.wikipedia.org/wiki/Zeckendorf's_theorem

    where F n is the n th Fibonacci number. Such a sum is called the Zeckendorf representation of N. The Fibonacci coding of N can be derived from its Zeckendorf representation. For example, the Zeckendorf representation of 64 is 64 = 55 + 8 + 1. There are other ways of representing 64 as the sum of Fibonacci numbers 64 = 55 + 5 + 3 + 1 64 = 34 ...

  9. Table of prime factors - Wikipedia

    en.wikipedia.org/wiki/Table_of_prime_factors

    The first in decimal: 4, 6, 8, 9, 12, 18, 20, 22, 24, 26, 28, 30 (sequence A046760 in the OEIS). An economical number has been defined as a frugal number, but also as a number that is either frugal or equidigital.