Sequences of reducible -polynomials modulo a prime.
Canner, Judith, Jones, Lenny, Purdom, Joseph (2006)
Journal of Integer Sequences [electronic only]
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 “Computational proof of some theorems on class numbers”
Sequences of reducible -polynomials modulo a prime.
On diophantine equations involving sums of powers with quadratic characters as coefficients, I
Jerzy Urbanowicz (1994)
Compositio Mathematica
Similarity:
On a conjecture concerning sequences of the third order
Stanislav Jakubec, Karol Nemoga (1986)
Mathematica Slovaca
Similarity:
Reducibility of polynomials and covering systems of congruences
Andrzej Schinzel (1967)
Acta Arithmetica
Similarity:
On the congruence , where q is a prime and f is a k-normal polynomial
J. Wójcik (1982)
Acta Arithmetica
Similarity:
Congruences for a class of alternating lacunary sums of binomial coefficients.
Dilcher, Karl (2007)
Journal of Integer Sequences [electronic only]
Similarity: