TOPICS
Search

Search Results for ""


551 - 560 of 4349 for prime numbersSearch Results
Given relatively prime integers p and q (i.e., (p,q)=1), the Dedekind sum is defined by s(p,q)=sum_(i=1)^q((i/q))(((pi)/q)), (1) where ((x))={x-|_x_|-1/2 x not in Z; 0 x in ...
An integer j(n) is called a jumping champion if j(n) is the most frequently occurring difference between consecutive primes <=n (Odlyzko et al. 1999). This term was coined by ...
Trigonometric functions of npi/13 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 13 is not a ...
The number k in the expression s(n)=kn for a multiperfect number is called its class.
A generalization by Kronecker of Kummer's theory of prime ideal factors. A divisor on a full subcategory C of mod(A) is an additive mapping chi on C with values in a ...
The prime link 02-0201 which has Jones polynomial V(t)=-t-t^(-1) and HOMFLY polynomial P(z,alpha)=z^(-1)(alpha^(-1)-alpha^(-3))+zalpha^(-1). It has braid word sigma_1^2.
If a subset S of the elements of a field F satisfies the field axioms with the same operations of F, then S is called a subfield of F. In a finite field of field order p^n, ...
Given the sum-of-factorials function Sigma(n)=sum_(k=1)^nk!, SW(p) is the smallest integer for p prime such that Sigma[SW(p)] is divisible by p. If pSigma(n) for all n<p, ...
Highly composite numbers are numbers such that divisor function d(n)=sigma_0(n) (i.e., the number of divisors of n) is greater than for any smaller n. Superabundant numbers ...
The Mangoldt function is the function defined by Lambda(n)={lnp if n=p^k for p a prime; 0 otherwise, (1) sometimes also called the lambda function. exp(Lambda(n)) has the ...
1 ... 53|54|55|56|57|58|59 ... 435 Previous Next

...