@article{oai:air.repo.nii.ac.jp:00001183,
 author = {ITO, Hideji and 伊藤, 日出治},
 issue = {53},
 journal = {秋田大学教育学部研究紀要 自然科学},
 month = {Mar},
 note = {We gave an algorithm to compute the modular equation <pn(X,j) of j(z) in [4]. Using the
data accumulated we have found some congruences of values <Pn (i, k) modulo a few primes.
For example, <pn(-1, -1) == 0 mod 7 for all nand <pn(i, -1) == 1 mod 7 (0 :s i :s 5) for all n satisfying deg <P n == 0 mod 6. Knowledge about supersingular elliptic curves enables us to give a proof of those facts. Some related problems are also discussed. In the Appendix, tables of values of <Pn (i, k) mod 7 are given for several n.},
 pages = {17--23},
 title = {Values of Modular Polynomials modulo primes},
 year = {1998}
}