scientific article
From MaRDI portal
Publication:3645525
zbMath1187.11001MaRDI QIDQ3645525
Publication date: 18 November 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Waring's problem and variants (11P05) Applications of sieve methods (11N36) Arithmetic functions; related numbers; inversion formulas (11A25) Distribution of primes (11N05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Cyclotomy (11T22) Power residues, reciprocity (11A15) Primes (11A41) Sieves (11N35)
Related Items (27)
Generating random factored Gaussian integers, easily ⋮ On the construction of holomorphic foliations without invariant subvarieties of positive dimension ⋮ The Euclidean Criterion for Irreducibles ⋮ Quotients of Fibonacci Numbers ⋮ On the diophantine equation x3 + y3 + z3 = q ⋮ Polynomials with divisors of every degree ⋮ On some series with gaps ⋮ Orders of reductions of elliptic curves with many and few prime factors ⋮ Computers as a novel mathematical reality. II: Waring's problem ⋮ Lateral Movement in Undergraduate Research: Case Studies in Number Theory ⋮ Torsion points on CM elliptic curves over real number fields ⋮ Restricted Steinhaus sets in the plane ⋮ The Bateman-Horn conjecture: heuristic, history, and applications ⋮ Variations on a question concerning the degrees of divisors of \(x^{n}-1\) ⋮ A compendium of results in additive number theory ⋮ Small prime $k$th power residues for $k=2,3,4$: A reciprocity laws approach ⋮ Connected components of complex divisor functions ⋮ Cubic congruences and sums involving 3k k ⋮ A Dissection Proof of Euler′s Series for 1 – γ ⋮ On the number of primes for which a polynomial is Eisenstein ⋮ Unnamed Item ⋮ On near-perfect numbers ⋮ Unnamed Item ⋮ Universal sums of three quadratic polynomials ⋮ Unnamed Item ⋮ Discriminants of classical quasi-orthogonal polynomials with application to Diophantine equations ⋮ A purely combinatorial approach to simultaneous polynomial recurrence modulo 1
This page was built for publication: