Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 4.5.10* (There is a consecutive block of integers in the sequence whose product is a perfect square)
Exercise 4.5.10* (There is a consecutive block of integers in the sequence whose product is a perfect square)
Let be any sequence of positive integers. Let be the total number of distinct prime factors of the product of the integers. If , prove that there is a consecutive block of integers in the sequence whose product is a perfect square.
Answers
Proof. Let be any sequence of positive integers. Let be the total number of distinct prime factors of the product of the integers. Then we can write
Let denote the class of in the field . Then the product of a consecutive block of integers in the sequence is a perfect square if and only if
Let us write for . Then the previous condition is written more concisely in the form
Consider now the cumulative sums
(In particular, ). There are such sums in the vector space , which has elements. By hypothesis, . Therefore, the map
cannot be injective (one-to-one) so there are two sums
with the same values (this is the “pigeonhole principle”). Then
This shows that is a perfect square. If , there is a consecutive block of integers in the sequence whose product is a perfect square. □