Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T09:50:07.295Z Has data issue: false hasContentIssue false

On multiplicative representations of integers

Published online by Cambridge University Press:  09 April 2009

P. Erdös
Affiliation:
Department of Computer Science, Stanford University, California, U.S.A.
A. Szemerédi
Affiliation:
Department of Computer Science, Stanford University, California, U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let 1 ≦ a1 < … < ak ≦ x; b1 < … b1 ≦ x. Assume that the number of solutions of a1b1 = m is less than c. The authors prove that then . They also give a simple proof of Szemerédi's theorem: If the products aibj are all distinct then . They conjecture that (2) holds for c2 = 1 + ε if x > x0(ε). Several other unsolved problems are stated.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1976