Search Results for ""
61 - 70 of 634 for Diophantine Equation*th PowersSearch Results
A generating function f(x) is a formal power series f(x)=sum_(n=0)^inftya_nx^n (1) whose coefficients give the sequence {a_0,a_1,...}. The Wolfram Language command ...
The logarithm log_bx for a base b and a number x is defined to be the inverse function of taking b to the power x, i.e., b^x. Therefore, for any x and b, x=log_b(b^x), (1) or ...
Mathematical growth in which one population grows at a rate proportional to the power of another population.
The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.
The function from a given nonempty set X to the power set P(X) that maps every element x of X to the set {x}.
Ferrari's identity is the algebraic identity
Let a, b, and k be integers with k>=1. For j=0, 1, 2, let S_j=sum_(i=j (mod 3))(-1)^i(k; i)a^(k-i)b^i. Then 2(a^2+ab+b^2)^(2k)=(S_0-S_1)^4+(S_1-S_2)^4+(S_2-S_0)^4.
The Lebesgue identity is the algebraic identity (Nagell 1951, pp. 194-195).
The square-triangle theorem states that any nonnegative integer can be represented as the sum of a square, an even square, and a triangular number (Sun 2005), i.e., ...
Hardy and Littlewood (1914) proved that the sequence {frac(x^n)}, where frac(x) is the fractional part, is equidistributed for almost all real numbers x>1 (i.e., the ...
...
View search results from all Wolfram sites (28500 matches)

