Misplaced Pages

Kronecker's congruence

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Theorem on a polynomial involving the elliptic modular function

In mathematics, Kronecker's congruence, introduced by Kronecker, states that

Φ p ( x , y ) ( x y p ) ( x p y ) mod p , {\displaystyle \Phi _{p}(x,y)\equiv (x-y^{p})(x^{p}-y){\bmod {p}},}

where p is a prime and Φp(x,y) is the modular polynomial of order p, given by

Φ n ( x , j ) = τ ( x j ( τ ) ) {\displaystyle \Phi _{n}(x,j)=\prod _{\tau }(x-j(\tau ))}

for j the elliptic modular function and τ running through classes of imaginary quadratic integers of discriminant n.

References

Stub icon

This number theory-related article is a stub. You can help Misplaced Pages by expanding it.

Categories: