On an extremal problem in number theory
type: Item
instance of: scholarly article
title: On an extremal problem in number theory
zbMATH Open document ID: 0277.10041
DOI: 10.1016/0022-314X(74)90048-1
author: S. L. G. Choi
published in: Journal of Number Theory
publication date: 1974-01-01T00:00:00Z
review text: Let \(h(n)\) be the largest function of \(n\) such that, from any set of \(n\) nonzero integers, one can always extract a subset of \(h(n)\) integers with the property that any two sums formed from its elements are equal only if they have equal number of summands. The aim of this paper to obtain the result \[ h(n) \gg n^{1/3}(\log n)^{1/3} \] which is a refinement over a previous estimate of Erdős, namely \(h(n) \gg n^{1/3}\).
Mathematics Subject Classification ID: 11B75
zbMATH DE Number: 3435596
zbMATH Keywords: extremal problem
zbMATH Keywords: Erdős problem
MaRDI profile type: Publication
cites work: Q5520751
cites work: Q5528765
full work available at URL: 0022-314x(74)90048-1
OpenAlex ID: W2048098955
description: scientific article; zbMATH DE number 3435596