Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Prove that for each 201 number that we will choose from [1,300] there will be always some x,y that thiers division will be power of 3.

For example:

$18 / 6$

share|cite|improve this question

Suppose you had $201$ distinct integers in $[1,300]$ such that none is a power of $3$ times another. If the least of these $\le 100$, multiply it by $3$ and the property is still satisfied. Repeat until there are no more numbers $\le 100$. But there are only $200$ integers from $101$ to $300$.

share|cite|improve this answer
We can assume that your answer is right,but yesterday I had an exam and that was one of the question that I had to answer on and that will be lovely if you will post a full answer. – Gil Sep 30 '13 at 15:07
Hopefully we can assume that your instructor reads – Robert Israel Sep 30 '13 at 15:11
But it would be even lovelier if you would tell me his or her email address, so I could send it directly and save you the bother of copying the answer yourself. – Robert Israel Sep 30 '13 at 15:32

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.