Search Results for ""
11291 - 11300 of 13135 for Discrete Fourier TransformSearch Results
Let lambda be (possibly complex) eigenvalues of a set of random n×n real matrices with entries independent and taken from a standard normal distribution. Then as n->infty, ...
Any composite number n with p|(n/p-1) for all prime divisors p of n. n is a Giuga number iff sum_(k=1)^(n-1)k^(phi(n))=-1 (mod n) (1) where phi is the totient function and ...
If n>1 and n|1^(n-1)+2^(n-1)+...+(n-1)^(n-1)+1, is n necessarily a prime? In other words, defining s_n=sum_(k=1)^(n-1)k^(n-1), does there exist a composite n such that s_n=-1 ...
The continued fraction of A is [1; 3, 1, 1, 5, 1, 1, 1, 3, 12, 4, 1, 271, 1, ...] (OEIS A087501). A plot of the first 256 terms of the continued fraction represented as a ...
The golden triangle, sometimes also called the sublime triangle, is an isosceles triangle such that the ratio of the hypotenuse a to base b is equal to the golden ratio, ...
The Gömböc (meaning "sphere-like" in Hungarian) is the name given to a class of convex solids which possess a unique stable and a unique unstable point of equilibrium. ...
A googol is a large number equal to 10^(10^2)=10^(100) (i.e., a 1 with 100 zeros following it). Written out explicitly, ...
Let theta(t) be the Riemann-Siegel function. The unique value g_n such that theta(g_n)=pin (1) where n=0, 1, ... is then known as a Gram point (Edwards 2001, pp. 125-126). An ...
A grammar defining formal language L is a quadruple (N,T,R,S), where N is a finite set of nonterminals, T is a finite set of terminal symbols, R is a finite set of ...
A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...
...
View search results from all Wolfram sites (26622 matches)

