TOPICS
Search

Search Results for ""


8391 - 8400 of 13135 for Discrete Fourier TransformSearch Results
A number n is called equidigital if the number of digits in the prime factorization of n (including powers) uses the same number of digits as the number of digits in n. The ...
The equilateral cevian triangle point of a triangle is the unique point P such that the Cevian triangle of P is equilateral. This point is Kimberling center X_(370).
A quadrilateral in which a pair of opposite sides have the same length and are inclined at 60 degrees to each other (or equivalently, satisfy <A>+<B>=120 degrees). Some ...
Two statements in logic are said to be equipollent if they are deducible from each other. Two sets A and B are said to be equipollent iff there is a one-to-one correspondence ...
p is an equireciprocal point if, for every chord [x,y] of a curve C, p satisfies |x-p|^(-1)+|y-p|^(-1)=c for some constant c. The foci of an ellipse are equichordal points.
An equivalence class is defined as a subset of the form {x in X:xRa}, where a is an element of X and the notation "xRy" is used to mean that there is an equivalence relation ...
The Erdős-Borwein constant E, sometimes also denoted alpha, is the sum of the reciprocals of the Mersenne numbers, E = sum_(n=1)^(infty)1/(2^n-1) (1) = ...
A deeper result than the Hardy-Ramanujan theorem. Let N(x,a,b) be the number of integers in [n,x] such that inequality a<=(omega(n)-lnlnn)/(sqrt(lnlnn))<=b (1) holds, where ...
The Diophantine equation sum_(j=1)^(m-1)j^n=m^n. Erdős conjectured that there is no solution to this equation other than the trivial solution 1^1+2^1=3^1, although this ...
The Erdős-Selfridge function g(k) is defined as the least integer bigger than k+1 such that the least prime factor of (g(k); k) exceeds k, where (n; k) is the binomial ...
1 ... 837|838|839|840|841|842|843 ... 1314 Previous Next

...