Fundamental 1-unit in Z√d
Proposition Suppose there exists a nontrivial element of \( \mathbb { Z } [ \sqrt { d } ] ^ { \times , 1 } \). Then every element of \( \mathbb { Z } [ \sqrt { d } ] ^ { \times , 1 } \) is of the form \( \pm \epsilon ^ { n } \) for some \( n \) in \( \mathbb { Z } \), where \( \epsilon \) is the fundamental 1-unit.
Quadratic algebraic integer
Proposition If \( \alpha \) is an algebraic integer of degree two, then \( \mathbb Z [\alpha] \) is equal to the set of complex numbers of the form \( x + y\alpha \), where x and y are integers.
Representing primes by quadratic forms
Theorem Suppose that unique factorization holds in \( \mathbb { Z } [ \alpha ] \), and let p be an integer prime such that the polynomial \( P ( x , 1 ) = x ^ { 2 } - b x + c \) has a root mod p. Then there exist integers x and y such that \( P (x, y) = p \). Conversely, if there exist such x and y, then \( x^2 - bx + c \) has a root mod p.
Alternative proof for Fermat’s Two-Square Theorem
Prime in Z𝑖
Proposition (Prime in \( {\mathbb Z [i] } \)) Primes in \( {\mathbb Z [i] } \) are either of the form a +bi, where \( a^2 +b^2 \) is an integer prime, or, q and its associate, where q is an integer prime that is not the sum of two squares.
Fermat’s Two-Square Theorem
Fermat’s Two-Square Theorem Every prime congruent to \( 1 \bmod 4 \) is the sum of two squares.
Primitive root proposition
Proposition a is a primitive root modulo n then it is also a primitive root modulo d, for any d dividing n.
323 post articles, 36 pages.