The number of multiplicative Sidon sets of integers

Abstract

A set S of natural numbers is multiplicative Sidon if the products of all pairs in S are distinct. Erdős in 1938 studied the maximum size of a multiplicative Sidon subset of {1,…,n}, which was later determined up to the lower order term: π(n)+Θ(n3/4(log⁡n)3/2). We show that the number of multiplicative Sidon subsets of {1,…,n} is T(n)⋅2Θ(n3/4(log⁡n)3/2) for a certain function T(n)≈21.815π(n) which we specify. This is a rare example in which the order of magnitude of the lower order term in the exponent is determined. It resolves the enumeration problem for multiplicative Sidon sets initiated by Cameron and Erdős in the 80s.We also investigate its extension for generalised multiplicative Sidon sets. Denote by Sk, k≥2, the number of multiplicative k-Sidon subsets of {1,…,n}. We show that Sk(n)=(βk+o(1))π(n) for some βk we define explicitly. Our proof is elementary.