Document Type


Source Publication Title

Technical Report 96


It has been conjectured that there are infinitely many distinct pd-equivalence classes of non-splitting unitary perfect polynomials over GF(pd) for each prime p and each odd integer d > 1. The conjecture is proved in the affirmative in the cases i) p < 97, ii) 2 ^ GF(p) is not a square, iii) 2 ^ GF(p) is a square and all of the positive integer intervals determined by distinct odd powers of ^t contain a square, where GF*(p) = (^). In addition, it has been determined that iii) is satisfied by 314 primes p > 97.2


Mathematics | Physical Sciences and Mathematics

Publication Date




Included in

Mathematics Commons



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.