When.com Web Search

  1. Ads

    related to: prime square and triangular numbers worksheets

Search results

  1. Results From The WOW.Com Content Network
  2. Square triangular number - Wikipedia

    en.wikipedia.org/wiki/Square_triangular_number

    Consequently, a square number is also triangular if and only if + is square, that is, there are numbers and such that =. This is an instance of the Pell equation x 2 − n y 2 = 1 {\displaystyle x^{2}-ny^{2}=1} with n = 8 {\displaystyle n=8} .

  3. Squared triangular number - Wikipedia

    en.wikipedia.org/wiki/Squared_triangular_number

    A square whose side length is a triangular number can be partitioned into squares and half-squares whose areas add to cubes. From Gulley (2010).The n th coloured region shows n squares of dimension n by n (the rectangle is 1 evenly divided square), hence the area of the n th region is n times n × n.

  4. Pythagorean prime - Wikipedia

    en.wikipedia.org/wiki/Pythagorean_prime

    The formulas show how to transform any right triangle with integer legs into another right triangle with integer legs whose hypotenuse is the square of the first triangle's hypotenuse. A Pythagorean prime is a prime number of the form +. Pythagorean primes are exactly the odd prime numbers that are the sum of two squares; this characterization ...

  5. Triangular number - Wikipedia

    en.wikipedia.org/wiki/Triangular_number

    A square whose side length is a triangular number can be partitioned into squares and half-squares whose areas add to cubes. This shows that the square of the n th triangular number is equal to the sum of the first n cube numbers. Also, the square of the n th triangular number is the same as the sum of the cubes of the integers 1 to n.

  6. 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. Subsets of the prime numbers may be generated with various formulas for primes.

  7. Sieve of Eratosthenes - Wikipedia

    en.wikipedia.org/wiki/Sieve_of_Eratosthenes

    A prime number is a natural number that has exactly two distinct natural number divisors: the number 1 and itself. To find all the prime numbers less than or equal to a given integer n by Eratosthenes' method: Create a list of consecutive integers from 2 through n: (2, 3, 4, ..., n). Initially, let p equal 2, the smallest prime number.