Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

Consider a sequence of $N$ positive integers containing n distinct integers. If $N \geq 2^n$, show that there is a consecutive block of integers whose product is a perfect square. Is this inequality the best possible?

What is the trick to solve this problem?

share|cite|improve this question
up vote 4 down vote accepted

Let $A_j(k)$ be the parity (even or odd) of the number of times the $j$'th distinct integer occurs in the first $k$ members of the sequence. There are $2^n$ possibilities...

share|cite|improve this answer

To show it's best possible, think about the following sequence where you can, for example, take $a,b,c\dots$ to be distinct primes:


share|cite|improve this answer

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.