Search Results for ""
131 - 140 of 248 for gaussSearch Results
Polynomial identities involving sums and differences of like powers include x^2-y^2 = (x-y)(x+y) (1) x^3-y^3 = (x-y)(x^2+xy+y^2) (2) x^3+y^3 = (x+y)(x^2-xy+y^2) (3) x^4-y^4 = ...
A generalization of the Gaussian sum. For p and q of opposite parity (i.e., one is even and the other is odd), Schaar's identity states ...
The transformation T(x) = frac(1/x) (1) = 1/x-|_1/x_|, (2) where frac(x) is the fractional part of x and |_x_| is the floor function, that takes a continued fraction ...
The curlicue fractal is a figure obtained by the following procedure. Let s be an irrational number. Begin with a line segment of unit length, which makes an angle phi_0=0 to ...
If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient ...
The term "integral" can refer to a number of different concepts in mathematics. The most common meaning is the the fundamenetal object of calculus corresponding to summing ...
A generalized hypergeometric function _pF_q(a_1,...,a_p;b_1,...,b_q;x) is a function which can be defined in the form of a hypergeometric series, i.e., a series for which the ...
The arithmetic-geometric mean agm(a,b) of two numbers a and b (often also written AGM(a,b) or M(a,b)) is defined by starting with a_0=a and b_0=b, then iterating a_(n+1) = ...
For every positive integer n, there exists a circle which contains exactly n lattice points in its interior. H. Steinhaus proved that for every positive integer n, there ...
The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...
...
View search results from all Wolfram sites (125297 matches)

