enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. List of number theory topics - Wikipedia

    en.wikipedia.org/wiki/List_of_number_theory_topics

    Additive function. Dirichlet convolution. ErdÅ‘s–Kac theorem. Möbius function. Möbius inversion formula. Divisor function. Liouville function. Partition function (number theory) Integer partition.

  3. Number theory - Wikipedia

    en.wikipedia.org/wiki/Number_theory

    t. e. Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics." [1]

  4. Category:Unsolved problems in number theory - Wikipedia

    en.wikipedia.org/wiki/Category:Unsolved_problems...

    Wall–Sun–Sun prime. Waring–Goldbach problem. Waring's problem. Wieferich prime. Wilson prime. Wolstenholme prime. Woodall number. Categories: Unsolved problems in mathematics.

  5. Fermat's theorem on sums of two squares - Wikipedia

    en.wikipedia.org/wiki/Fermat's_theorem_on_sums_of...

    In additive number theory, Fermat 's theorem on sums of two squares states that an odd prime p can be expressed as: with x and y integers, if and only if. The prime numbers for which this is true are called Pythagorean primes. For example, the primes 5, 13, 17, 29, 37 and 41 are all congruent to 1 modulo 4, and they can be expressed as sums of ...

  6. Transcendental number theory - Wikipedia

    en.wikipedia.org/wiki/Transcendental_number_theory

    Noncommutative algebra. v. t. e. Transcendental number theory is a branch of number theory that investigates transcendental numbers (numbers that are not solutions of any polynomial equation with rational coefficients), in both qualitative and quantitative ways.

  7. Proof by infinite descent - Wikipedia

    en.wikipedia.org/wiki/Proof_by_infinite_descent

    In mathematics, a proof by infinite descent, also known as Fermat's method of descent, is a particular kind of proof by contradiction [1] used to show that a statement cannot possibly hold for any number, by showing that if the statement were to hold for a number, then the same would be true for a smaller number, leading to an infinite descent and ultimately a contradiction. [2]

  8. Prime number - Wikipedia

    en.wikipedia.org/wiki/Prime_number

    A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a ...

  9. Eratosthenes - Wikipedia

    en.wikipedia.org/wiki/Eratosthenes

    Eratosthenes was the founder of scientific chronology; [5] he used Egyptian and Persian records to estimate the dates of the main events of the Trojan War, dating the sack of Troy to 1183 BC. In number theory, he introduced the sieve of Eratosthenes, an efficient method of identifying prime numbers and composite numbers.