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 a 1 , a 2 , , a n be any sequence of positive integers. Let k be the total number of distinct prime factors of the product of the integers. If n 2 k , prove that there is a consecutive block of integers in the sequence whose product is a perfect square.

Answers

Proof. Let a 1 , a 2 , , a n be any sequence of positive integers. Let k be the total number of distinct prime factors of the product of the integers. Then we can write

a i = p 1 u i , 1 p 2 u i , 2 p k u i , k ( 0 u i , j , 1 i n , 1 j k ) .

Let α i , j = u i , j ¯ denote the class of u i , j in the field 𝔽 2 = 2 . Then the product j = i l a j of a consecutive block of integers in the sequence is a perfect square if and only if

( α i , 1 + α i + 1 , 1 + + α l , 1 , α i , 2 + α i + 1 , 2 + + α l , 2 , , α i , k + α i + 1 , k + + α l , k ) = ( 0 , 0 , , 0 ) .

Let us write w i = ( α i , 1 , α i , 2 , , α i , k ) 𝔽 2 k for 1 i n . Then the previous condition is written more concisely in the form

w i + w i + 1 + + w l = 0 .

Consider now the cumulative sums

s m = i [ [ 1 , m ] ] w i ( 0 m n ) .

(In particular, s 0 = i w i = 0 ). There are n + 1 such sums s 0 , s 1 , , s n in the vector space 𝔽 2 k , which has 2 k elements. By hypothesis, n + 1 > 2 k . Therefore, the map

{ [ [ 0 , n ] ] 𝔽 2 k i s i

cannot be injective (one-to-one) so there are two sums

s i = s j , 0 i < j n .

with the same values (this is the “pigeonhole principle”). Then

0 = s j s i = w i + 1 + w i + 2 + + w j .

This shows that a i + 1 a i + 2 a j is a perfect square. If n 2 k , there is a consecutive block of integers in the sequence ( a 1 , a 2 , , a n ) whose product is a perfect square. □

User profile picture
2025-03-29 09:21
Comments