Abstract
Given a finite set , define \begin{align*}&A\cdot A \ =\ \{a_i\cdot a_j\,|\, a_i,a_j\in A\},\\ &A/A \ =\ \{a_i/a_j\,|\,a_i,a_j\in A\},\\ &A + A \ =\ \{a_i + a_j\,|\, a_i,a_j\in A\},\\ &A - A \ =\ \{a_i - a_j\,|\,a_i,a_j\in A\}.\end{align*} The set is said to be MPTQ (more product than quotient) if and MSTD (more sum than difference) if . 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 and proves that as , the proportion of MPTQ subsets approaches . Next, we prove that MPTQ sets of positive numbers must have at least elements, while MPTQ sets of both negative and positive numbers must have at least elements. Finally, we investigate several sequences that do not have MPTQ subsets.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.