On sets with more products than quotients

From MaRDI portal
Publication:2188443

DOI10.1216/RMJ.2020.50.499zbMATH Open1469.11018arXiv1908.00057OpenAlexW3031044732MaRDI QIDQ2188443FDOQ2188443


Authors: Hùng Viẹt Chu Edit this on Wikidata


Publication date: 11 June 2020

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Abstract: Given a finite set , define �egin{align*}&Acdot A = {a_icdot a_j,|, a_i,a_jin A},\ &A/A = {a_i/a_j,|,a_i,a_jin A},\ &A + A = {a_i + a_j,|, a_i,a_jin A},\ &A - A = {a_i - a_j,|,a_i,a_jin A}.end{align*} The set A is said to be MPTQ (more product than quotient) if |AcdotA|>|A/A| and MSTD (more sum than difference) if |A+A|>|AA|. Since multiplication and addition are commutative while division and subtraction are not, it is natural to think that MPTQ and MSTD sets are very rare. However, they do exist. This paper first shows an efficient search for MPTQ subsets of 1,2,ldots,n and proves that as nightarrowinfty, the proportion of MPTQ subsets approaches 0. Next, we prove that MPTQ sets of positive numbers must have at least 8 elements, while MPTQ sets of both negative and positive numbers must have at least 5 elements. Finally, we investigate several sequences that do not have MPTQ subsets.


Full work available at URL: https://arxiv.org/abs/1908.00057




Recommendations




Cites Work


Cited In (2)





This page was built for publication: On sets with more products than quotients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188443)