TOPICS
Search

Search Results for ""


2991 - 3000 of 13131 for eulerstotienttheorem.htmlSearch Results
kappa(d)={(2lneta(d))/(sqrt(d)) for d>0; (2pi)/(w(d)sqrt(|d|)) for d<0, (1) where eta(d) is the fundamental unit and w(d) is the number of substitutions which leave the ...
Given any real number theta and any positive integer N, there exist integers h and k with 0<k<=N such that |ktheta-h|<1/N. A slightly weaker form of the theorem states that ...
A.k.a. the pigeonhole principle. Given n boxes and m>n objects, at least one box must contain more than one object. This statement has important applications in number theory ...
If g is continuous and mu,nu>0, then int_0^t(t-xi)^(mu-1)dxiint_0^xi(xi-x)^(nu-1)g(xi,x)dx =int_0^tdxint_x^t(t-xi)^(mu-1)(xi-x)^(nu-1)g(xi,x)dxi.
int_0^pi(sin[(n+1/2)x])/(2sin(1/2x))dx=1/2pi, where the integral kernel is the Dirichlet kernel.
Dirichlet's principle, also known as Thomson's principle, states that there exists a function u that minimizes the functional D[u]=int_Omega|del u|^2dV (called the Dirichlet ...
Let |sum_(n=1)^pa_n|<K, (1) where K is independent of p. Then if f_n>=f_(n+1)>0 and lim_(n->infty)f_n=0, (2) it follows that sum_(n=1)^inftya_nf_n (3) converges.
Given an arithmetic progression of terms an+b, for n=1, 2, ..., the series contains an infinite number of primes if a and b are relatively prime, i.e., (a,b)=1. This result ...
A polynomial form which is the sum of two polynomial forms involving separate sets of variables.
A graph G is said to be disconnected if it is not connected, i.e., if there exist two nodes in G such that no path in G has those nodes as endpoints. The numbers of ...
1 ... 297|298|299|300|301|302|303 ... 1314 Previous Next

...