1922/01/01 by J. F. Ritt · 4 citations
Mathematics · #Advanced Mathematical Theories #Mathematics and Applications #Mathematics #Prime (order theory) #Composite number #Pure mathematics #Algebra over a field #Discrete mathematics #Combinatorics #Algorithm
paper · doi:10.1090/s0002-9947-1922-1501189-9
openalex publication_date 1922/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23
It is possible for a(z) to be prime even if its degree is composite.For instance, let n be any prime number, and p and q two prime numbers, so large that pq > (p + 8 + 2)».Let pq = kn+r, where 0 < r < n.The most general polynomial a(z), of degree pq and of the form *rg(2") contains k+l parameters.But the most general composite polynomial of degree pq contains only £+g+2 parameters.Hence a(z) is generally prime.t Case (a) with m = 2 can be reduced to Case (6) by a linear transformation.