### Prime valued polynomials and class numbers of quadratic fields.

Mollin, Richard A. (1990)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Mollin, Richard A. (1990)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Kazimierz Szymiczek (1996)

Acta Mathematica et Informatica Universitatis Ostraviensis

Similarity:

J. Browkin, A. Schinzel (2011)

Colloquium Mathematicae

Similarity:

We prove that for every quadratic binomial f(x) = rx² + s ∈ ℤ[x] there are pairs ⟨a,b⟩ ∈ ℕ² such that a ≠ b, f(a) and f(b) have the same prime factors and min{a,b} is arbitrarily large. We prove the same result for every monic quadratic trinomial over ℤ.

Kelley, James (2001)

International Journal of Mathematics and Mathematical Sciences

Similarity:

John Myron Masley (1976)

Compositio Mathematica

Similarity:

Busch, Cornelia Minette (2006)

The New York Journal of Mathematics [electronic only]

Similarity:

Schielzeth, Daniel, Pohst, Michael E. (2005)

Experimental Mathematics

Similarity:

Peter Stevenhagen (1995)

Journal de théorie des nombres de Bordeaux

Similarity:

We present a density result for the norm of the fundamental unit in a real quadratic order that follows from an equidistribution assumption for the infinite Frobenius elements in the class groups of these orders.

Stefan Bettner, Reinhard Schertz (2001)

Journal de théorie des nombres de Bordeaux

Similarity:

In the previous paper [Sch2] it has been shown that ray class fields over quadratic imaginary number fields can be generated by simple products of singular values of the Klein form defined below. In the present article the second named author has constructed more general products that are contained in ray class fields thereby correcting Theorem 2 of [Sch2]. An algorithm for the computation of the algebraic equations of the numbers in Theorem 1 of this paper has been implemented in a...

Michal Křížek, Lawrence Somer (2001)

Mathematica Bohemica

Similarity:

We examine primitive roots modulo the Fermat number ${F}_{m}={2}^{{2}^{m}}+1$. We show that an odd integer $n\ge 3$ is a Fermat prime if and only if the set of primitive roots modulo $n$ is equal to the set of quadratic non-residues modulo $n$. This result is extended to primitive roots modulo twice a Fermat number.