Search Results for ""

A number theoretic character, also called a Dirichlet character (because Dirichlet first introduced them in his famous proof that every arithmetic progression with relatively ...

A quotient ring (also called a residue-class ring) is a ring that is the quotient of a ring A and one of its ideals a, denoted A/a. For example, when the ring A is Z (the ...

Trigonometric functions of npi/11 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 11 is not a ...

The prime link 05-0201, illustrated above, with braid word sigma_1^2sigma_2^2sigma_1^(-1)sigma_2^(-2) or sigma_1sigma_2^(-1)sigma_1sigma_2^(-2) and Jones polynomial ...

The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...

The Chebotarev density theorem is a complicated theorem in algebraic number theory which yields an asymptotic formula for the density of prime ideals of a number field K that ...

In August 2002, M. Agrawal and colleagues announced a deterministic algorithm for determining if a number is prime that runs in polynomial time (Agrawal et al. 2004). While ...

Define E(x;q,a)=psi(x;q,a)-x/(phi(q)), (1) where psi(x;q,a)=sum_(n<=x; n=a (mod q))Lambda(n) (2) (Davenport 1980, p. 121), Lambda(n) is the Mangoldt function, and phi(q) is ...

The figure eight knot, also known as the Flemish knot and savoy knot, is the unique prime knot of four crossings 04-001. It has braid word ...

Let t(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Then if S_m=sum_(t(m))1/t, (1) then {S_m=0 (mod m^2) ...