enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Sum of two cubes - Wikipedia

    en.wikipedia.org/wiki/Sum_of_two_cubes

    A Cabtaxi number is the smallest positive number that can be expressed as a sum of two integer cubes in n ways, allowing the cubes to be negative or zero as well as positive. The smallest cabtaxi number after Cabtaxi (1) = 0, is Cabtaxi (2) = 91, [5] expressed as: Cabtaxi (3), the smallest Cabtaxi number expressed in 3 different ways, is 4104 ...

  3. Sums of three cubes - Wikipedia

    en.wikipedia.org/wiki/Sums_of_three_cubes

    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. A necessary condition for an integer to equal such a sum is that cannot equal 4 or 5 modulo 9, because the cubes modulo 9 are 0, 1, and −1, and ...

  4. List of sums of reciprocals - Wikipedia

    en.wikipedia.org/wiki/List_of_sums_of_reciprocals

    Then the triangle is in Euclidean space if the sum of the reciprocals of p, q, and r equals 1, spherical space if that sum is greater than 1, and hyperbolic space if the sum is less than 1. A harmonic divisor number is a positive integer whose divisors have a harmonic mean that is an integer. The first five of these are 1, 6, 28, 140, and 270.

  5. Squared triangular number - Wikipedia

    en.wikipedia.org/wiki/Squared_triangular_number

    He does not go further than this, but from this it follows that the sum of the first n cubes equals the sum of the first ⁠ n(n + 1) / 2 ⁠ odd numbers, that is, the odd numbers from 1 to n(n + 1) − 1. The average of these numbers is obviously ⁠ n(n + 1) / 2 ⁠, and there are ⁠ n(n + 1) / 2 ⁠ of them, so their sum is (⁠ n(n + 1 ...

  6. Divisor function - Wikipedia

    en.wikipedia.org/wiki/Divisor_function

    Sum of cubes of divisors, σ3 (n) up to n = 250. In mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts the number of divisors of an integer (including 1 and the number itself). It appears in a number of remarkable ...

  7. 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.

  8. 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; [17] the largest number now known not to be a sum of ...

  9. Taxicab number - Wikipedia

    en.wikipedia.org/wiki/Taxicab_number

    In mathematics, the n th taxicab number, typically denoted Ta (n) or Taxicab (n), is defined as the smallest integer that can be expressed as a sum of two positive integer cubes in n distinct ways. [1] The most famous taxicab number is 1729 = Ta (2) = 1 3 + 12 3 = 9 3 + 10 3, also known as the Hardy-Ramanujan number. [2][3]