TOPICS
Search

Search Results for ""


731 - 740 of 3942 for Euler Phi FunctionSearch Results
The conjecture that all integers >1 occur as a value of the totient valence function (i.e., all integers >1 occur as multiplicities). The conjecture was proved by Ford ...
Darboux's formula is a theorem on the expansion of functions in infinite series and essentially consists of integration by parts on a specific integrand product of functions. ...
product_(k=1)^(infty)(1-x^k) = sum_(k=-infty)^(infty)(-1)^kx^(k(3k+1)/2) (1) = 1+sum_(k=1)^(infty)(-1)^k[x^(k(3k-1)/2)+x^(k(3k+1)/2)] (2) = (x)_infty (3) = ...
For n a positive integer, expressions of the form sin(nx), cos(nx), and tan(nx) can be expressed in terms of sinx and cosx only using the Euler formula and binomial theorem. ...
The nth subfactorial (also called the derangement number; Goulden and Jackson 1983, p. 48; Graham et al. 2003, p. 1050) is the number of permutations of n objects in which no ...
p^~=|phi_i(x)><phi_i(t)| (1) p^~sum_(j)c_j|phi_j(t)>=c_i|phi_i(x)> (2) sum_(i)|phi_i(x)><phi_i(x)|=1. (3)
A plot in the complex plane of the points B(t)=S(t)+iC(t), (1) where S(t) and C(t) are the Fresnel integrals (von Seggern 2007, p. 210; Gray 1997, p. 65). The Cornu spiral is ...
There are a great many beautiful identities involving q-series, some of which follow directly by taking the q-analog of standard combinatorial identities, e.g., the ...
The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...
If p is a prime number and a is a natural number, then a^p=a (mod p). (1) Furthermore, if pa (p does not divide a), then there exists some smallest exponent d such that ...
1 ... 71|72|73|74|75|76|77 ... 395 Previous Next

...