Search Results for ""

Let p be an odd prime, a be a positive number such that pa (i.e., p does not divide a), and let x be one of the numbers 1, 2, 3, ..., p-1. Then there is a unique x^', called ...

A natural number n>3 such that n|(a^(n-2)-a) whenever (a,n)=1 (a and n are relatively prime) and a<=n. (Here, n|m means that n divides m.) There are an infinite number of ...

For any two integers a and b, suppose d|ab. Then if d is relatively prime to a, then d divides b. This results appeared in Euclid's Elements, Book VII, Proposition 30. This ...

An algebraic equation is algebraically solvable iff its group is solvable. In order that an irreducible equation of prime degree be solvable by radicals, it is necessary and ...

The Diophantine equation x^2+y^2=p can be solved for p a prime iff p=1 (mod 4) or p=2. The representation is unique except for changes of sign or rearrangements of x and y. ...

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 ...