The number of different lengths of irreducible factorization of a natural number in an algebraic number field
S. Allen, P. Pleasants (1980)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On an irreducibility theorem of I. Schur”
The number of different lengths of irreducible factorization of a natural number in an algebraic number field
On the reducibility of polynomials and in particular of trinomials
Andrzej Schinzel (1965)
Acta Arithmetica
Similarity:
The diophantine equation
Maohua Le (1989)
Acta Arithmetica
Similarity:
An upper bound for the h-range of the postage stamp problem
Öystein Rödseth (1990)
Acta Arithmetica
Similarity:
Reducibility of quadrinomials
M. Fried, Andrzej Schinzel (1972)
Acta Arithmetica
Similarity:
Elementary estimates for the Chebyshev function 𝜓(x) and for the Mobius function M(x)
N. Costa Pereira (1989)
Acta Arithmetica
Similarity:
On the relation between two conjectures on polynomials
Andrzej Schinzel (1980)
Acta Arithmetica
Similarity:
A problem on semicubical powers
N. Watt (1989)
Acta Arithmetica
Similarity:
On the greatest prime factor of an arithmetical progression. II
T. Shorey, R. Tijdeman (1990)
Acta Arithmetica
Similarity: