Question: (a) Suppose (11,02, . . . an is a sequence of n integers none of which is divisible by n. Show that at least one

 (a) Suppose (11,02, . . . an is a sequence of

(a) Suppose (11,02, . . . an is a sequence of n integers none of which is divisible by n. Show that at least one of the differences at (1;; (fort, i 3') must be divisible by \"-l (b) Show that every nite sequence (11, a2, . . . , an of n integers has a consecutive subsequence (1H1, a194,. . . , Qj whose sum is divisible by n. For example, the sequence of 5 integers, 3, 4, 17, 7, 16, has the consecutive subsequence 17, 7, 16 whose sum is divisible by 5

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!