When.com Web Search

  1. Ads

    related to: rectangular numbers up to 100 to 20 in math worksheets

Search results

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

    en.wikipedia.org/wiki/Composite_number

    A composite number is a positive integer that can be formed by multiplying two smaller positive integers. Equivalently, it is a positive integer that has at least one divisor other than 1 and itself. [1][2] Every positive integer is composite, prime, or the unit 1, so the composite numbers are exactly the numbers that are not prime and not a ...

  3. Pronic number - Wikipedia

    en.wikipedia.org/wiki/Pronic_number

    A pronic number is a number that is the product of two consecutive integers, that is, a number of the form (+). [1] The study of these numbers dates back to Aristotle.They are also called oblong numbers, heteromecic numbers, [2] or rectangular numbers; [3] however, the term "rectangular number" has also been applied to the composite numbers.

  4. Kaktovik numerals - Wikipedia

    en.wikipedia.org/wiki/Kaktovik_numerals

    30,561 10 3,G81 20 ÷ ÷ ÷ 61 10 31 20 = = = 501 10 151 20 30,561 10 ÷ 61 10 = 501 10 3,G81 20 ÷ 31 20 = 151 20 ÷ = (black) The divisor goes into the first two digits of the dividend one time, for a one in the quotient. (red) fits into the next two digits once (if rotated), so the next digit in the quotient is a rotated one (that is, a five). (blue) The last two digits are matched once for ...

  5. Triangular number - Wikipedia

    en.wikipedia.org/wiki/Triangular_number

    Triangular numbers are a type of figurate number, other examples being square numbers and cube numbers. The n th triangular number is the number of dots in the triangular arrangement with n dots on each side, and is equal to the sum of the n natural numbers from 1 to n. The sequence of triangular numbers, starting with the 0th triangular number ...

  6. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    Packing squares in a square: Optimal solutions have been proven for n from 1-10, 14-16, 22-25, 33-36, 62-64, 79-81, 98-100, and any square integer. The wasted space is asymptotically O(a 3/5). Packing squares in a circle: Good solutions are known for n ≤ 35. The optimal packing of 10 squares in a square

  7. Squared triangular number - Wikipedia

    en.wikipedia.org/wiki/Squared_triangular_number

    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 nth coloured region shows n squares of dimension n by n (the rectangle is 1 evenly divided square), hence the area of the nth region is n times n x n.