Primes in quadratic fields

2010/01/28 by Theodorus J. Dekker, Dekker, Theodorus J. · 1 citation
Computer Science · #11R04 #11R11 #11Y40. #Cryptography and Residue Arithmetic #FOS: Mathematics #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.1001.5214

openalex publication_date 2010/01/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper presents algorithms for calculating the quadratic character and the norms of prime ideals in the ring of integers of any quadratic field. The norms of prime ideals are obtained by means of a sieve algorithm using the quadratic character for the field considered. A quadratic field, and its ring of integers, can be represented naturally in a plane. Using such a representation, the prime numbers - which generate the principal prime ideals in the ring - are displayed in a given bounded region of the plane.

Cited by

• Observation of multifractality of light in prime number arrays

Related

• A note on the distribution of prime ideals in real quadratic fields
• On the Representation of Primes by Binary Quadratic Forms, and Elliptic\n Curves
• Computing quadratic subfields of number fields
• Notes on the Quadratic Integers and Real Quadratic Number Fields
• Diophantine Approximation with Prime Restriction in Real Quadratic\n Number Fields