Search Results for ""

If the period of a repeating decimal for a/p, where p is prime and a/p is a reduced fraction, has an even number of digits, then dividing the repeating portion into halves ...

An integer which is expressible in only one way in the form x^2+Dy^2 or x^2-Dy^2 where x^2 is relatively prime to Dy^2. If the integer is expressible in more than one way, it ...

An integer which is expressible in more than one way in the form x^2+Dy^2 or x^2-Dy^2 where x^2 is relatively prime to Dy^2. If the integer is expressible in only one way, it ...

A proposition is a mathematical statement such as "3 is greater than 4," "an infinite set exists," or "7 is prime." An axiom is a proposition that is assumed to be true. With ...

When a prime l divides the elliptic discriminant of a elliptic curve E, two or all three roots of E become congruent (mod l). An elliptic curve is semistable if, for all such ...

A subsequence of {a} is a sequence {b} defined by b_k=a_(n_k), where n_1<n_2<... is an increasing sequence of indices (D'Angelo and West 2000). For example, the prime numbers ...

Let p be a prime number, G a finite group, and |G| the order of G. 1. If p divides |G|, then G has a Sylow p-subgroup. 2. In a finite group, all the Sylow p-subgroups are ...

d is called an e-divisor (or exponential divisor) of a number n with prime factorization n=p_1^(a_1)p_2^(a_2)...p_r^(a_r) if d|n and d=p_1^(b_1)p_2^(b_2)...p_r^(b_r), where ...

A deeper result than the Hardy-Ramanujan theorem. Let N(x,a,b) be the number of integers in [n,x] such that inequality a<=(omega(n)-lnlnn)/(sqrt(lnlnn))<=b (1) holds, where ...

A method for computing the prime counting function. Define the function T_k(x,a)=(-1)^(beta_0+beta_1+...+beta_(a-1))|_x/(p_1^(beta_0)p_2^(beta_1)...p_a^(beta_(a-1)))_|, (1) ...