Search Results for ""
561 - 570 of 1835 for Definition Of PrimeSearch Results
As first shown by Meyer and Ritchie (1967), do-loops (which have a fixed iteration limit) are a special case of while-loops. A function that can be implemented using only ...
The pseudosquare L_p modulo the odd prime p is the least nonsquare positive integer that is congruent to 1 (mod 8) and for which the Legendre symbol (L_p/q)=1 for all odd ...
Let K_1 be a knot inside a torus, and knot the torus in the shape of a second knot (called the companion knot) K_2, with certain additional mild restrictions to avoid trivial ...
A number n such that sigma^2(n)=sigma(sigma(n))=2n, where sigma(n) is the divisor function is called a superperfect number. Even superperfect numbers are just 2^(p-1), where ...
An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...
A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...
Let the divisor function d(n) be the number of divisors of n (including n itself). For a prime p, d(p)=2. In general, sum_(k=1)^nd(k)=nlnn+(2gamma-1)n+O(n^theta), where gamma ...
The Epstein zeta function for a n×n matrix S of a positive definite real quadratic form and rho a complex variable with R[rho]>n/2 (where R[z] denotes the real part) is ...
A solvable group is a group having a normal series such that each normal factor is Abelian. The special case of a solvable finite group is a group whose composition indices ...
The sporadic groups are the 26 finite simple groups that do not fit into any of the four infinite families of finite simple groups (i.e., the cyclic groups of prime order, ...
...
View search results from all Wolfram sites (46372 matches)

