TOPICS
Search

Search Results for ""


3011 - 3020 of 13134 for Extremal graph theorySearch Results
The first quadratic nonresidue mod p of a number is always less than 3(lnp)^2/2 (Wedeniwski 2001).
The degree (or relative degree, or index) of an extension field K/F, denoted [K:F], is the dimension of K as a vector space over F, i.e., [K:F]=dim_FK. If [K:F] is finite, ...
The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.
A game which is not biased toward any player. A game in which a given player can always win by playing correctly is therefore called an unfair game.
A group action phi:G×X->X is called faithful if there are no group elements g (except the identity element) such that gx=x for all x in X. Equivalently, the map phi induces ...
Let f(theta) be Lebesgue integrable and let f(r,theta)=1/(2pi)int_(-pi)^pif(t)(1-r^2)/(1-2rcos(t-theta)+r^2)dt (1) be the corresponding Poisson integral. Then almost ...
A partial order defined by (i-1, i), (i+1, i) for odd i.
A number of the form 2^n-1 obtained by setting x=1 in a Fermat-Lucas polynomial, more commonly known as a Mersenne number.
The compositeness test consisting of the application of Fermat's little theorem.
The Diophantine equation x^n+y^n=z^n. The assertion that this equation has no nontrivial solutions for n>2 has a long and fascinating history and is known as Fermat's last ...
1 ... 299|300|301|302|303|304|305 ... 1314 Previous Next

...