A Survey of Problems in Combinatorial Number Theory

DOI10.1016/S0167-5060(08)70697-6zbMath0448.10002OpenAlexW1663749032MaRDI QIDQ3893989

Paul Erdős

Publication date: 1980

Published in: Combinatorial Mathematics, Optimal Designs and Their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70697-6

zbMATH Keywords

sieve methodsproblemscovering congruencesdense sets of integersinfinite subsets of integers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Problem books (00A07) Goldbach-type theorems; other additive questions involving primes (11P32) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Special sequences and polynomials (11B83) Distribution of primes (11N05) Arithmetic progressions (11B25) Elementary number theory (11A99)

Related Items (11)

New primitive covering numbers and their properties ⋮ Discordant sets and ergodic Ramsey theory ⋮ The structure and number of Erdős covering systems ⋮ \(k\)-fold Sidon sets ⋮ A proof of a sumset conjecture of Erdős ⋮ Unnamed Item ⋮ Integer sets with prescribed pairwise differences being distinct ⋮ Dense edge-magic graphs and thin additive bases ⋮ Finite products sets and minimally almost periodic groups ⋮ Minimum coprime graph labelings ⋮ Hamiltonicity of a coprime graph

This page was built for publication: A Survey of Problems in Combinatorial Number Theory