enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. 41 (number) - Wikipedia

    en.wikipedia.org/wiki/41_(number)

    the largest lucky number of Euler: the polynomial f(k) = k 2 − k + 41 yields primes for all the integers k with 1 ≤ k < 41. the sum of two squares (4 2 + 5 2), which makes it a centered square number. [4] the sum of the first three Mersenne primes, 3, 7, 31. [5] the sum of the sum of the divisors of the first 7 positive integers.

  3. List of prime numbers - Wikipedia

    en.wikipedia.org/wiki/List_of_prime_numbers

    A prime number (or prime) is a natural number greater than 1 that has no positive divisors other than 1 and ... 31, 41, 61, 71, 101, 131, 151, 181, 191, 211, 241 ...

  4. Integer - Wikipedia

    en.wikipedia.org/wiki/Integer

    The word integer comes from the Latin integer meaning "whole" or (literally) "untouched", from in ("not") plus tangere ("to touch"). "Entire" derives from the same origin via the French word entier, which means both entire and integer. [9] Historically the term was used for a number that was a multiple of 1, [10] [11] or to the whole part of a ...

  5. List of types of numbers - Wikipedia

    en.wikipedia.org/wiki/List_of_types_of_numbers

    Such a number is algebraic and can be expressed as the sum of a rational number and the square root of a rational number. Constructible number: A number representing a length that can be constructed using a compass and straightedge. Constructible numbers form a subfield of the field of algebraic numbers, and include the quadratic surds.

  6. Natural number - Wikipedia

    en.wikipedia.org/wiki/Natural_number

    To avoid such paradoxes, the formalism was modified so that a natural number is defined as a particular set, and any set that can be put into one-to-one correspondence with that set is said to have that number of elements. [41] In 1881, Charles Sanders Peirce provided the first axiomatization of natural-number arithmetic.

  7. Table of divisors - Wikipedia

    en.wikipedia.org/wiki/Table_of_divisors

    Plot of the number of divisors of integers from 1 to 1000. Highly composite numbers are in bold and superior highly composite numbers are starred. ... 41: 1, 41 2 42 ...

  8. List of integer sequences - Wikipedia

    en.wikipedia.org/wiki/List_of_integer_sequences

    A number that has the same number of digits as the number of digits in its prime factorization, including exponents but excluding exponents equal to 1. A046758: Extravagant numbers: 4, 6, 8, 9, 12, 18, 20, 22, 24, 26, 28, 30, 33, 34, 36, 38, ... A number that has fewer digits than the number of digits in its prime factorization (including ...

  9. Formula for primes - Wikipedia

    en.wikipedia.org/wiki/Formula_for_primes

    The differences between the terms are 2, 4, 6, 8, 10... For n = 40, it produces a square number, 1681, which is equal to 41 × 41, the smallest composite number for this formula for n ≥ 0. If 41 divides n, it divides P(n) too. Furthermore, since P(n) can be written as n(n + 1) + 41, if 41 divides n + 1 instead, it also divides P(n).