Two Proofs in Combinatorial Number Theory
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 953246
- scientific article; zbMATH DE number 3993707
- scientific article; zbMATH DE number 493639
- Ein Beitrag zur additiven Zahlentheorie
- Ein Satz über Untermengen einer endlichen Menge.
- On additive bases
- Additive bases with many representations
- Eine obere Schranke für die Reichweite einer Extremalbasis zweiter Ordnung.
- Über die Basen der natürlichen Zahlenreihe.
- A generalization of a theorem of Erdős on asymptotic basis of order 2
Cited in
(15)- Multiplicative representations of integers
- Some applications of Ramsey's theorem to additive number theory
- On multiplicative bases in commutative semigroups
- Erdős and the integers
- Infinitely many composite NSW numbers: an inductive proof
- Tests and Proofs for Enumerative Combinatorics
- Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic
- scientific article; zbMATH DE number 3880787 (Why is no real title available?)
- Inverse problems for representation functions in additive number theory
- Combinatorial properties of products of graphs
- On multiplicative bases in abelian groups
- Multiplicative representations of integers and Ramsey's theorem
- Combinatorial Proofs of Fermat's, Lucas's, and Wilson's Theorems
- On the structure of sets of large doubling
- Some nonstandard Ramsey like applications
This page was built for publication: Two Proofs in Combinatorial Number Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222279)
