Computational proof of some theorems on class numbers
Stanislav Jakubec (2004)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Sequences of reducible -polynomials modulo a prime.”
Computational proof of some theorems on class numbers
Some modular results on the Euler and Bernoulli polynomials
John Brillhart (1972)
Acta Arithmetica
Similarity:
Reducibility of polynomials and covering systems of congruences
Andrzej Schinzel (1967)
Acta Arithmetica
Similarity:
Some generalisations of Chebyshev polynomials and their induced group structure over a finite field
Rex Matthews (1982)
Acta Arithmetica
Similarity:
On a conjecture concerning sequences of the third order
Stanislav Jakubec, Karol Nemoga (1986)
Mathematica Slovaca
Similarity:
Distribution of coefficients of Eisenstein series in residue classes
W. Narkiewicz (1983)
Acta Arithmetica
Similarity:
On the irreducibility of -quadrinomials.
Finch, Carrie, Jones, Lenny (2006)
Integers
Similarity: