Explore topic-wise InterviewSolutions in .

This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.

1.

Show that from a set of 11 square integers one can select six numbers a2, b2, c2, d2, e2, f2 such thata2 + b2 + c2 ≡ d2 + e2 + f2 (mod 12)

Answer»

If I2 ≡ x(mod 12) then x can take 4-values 0, 1, 4, 9.

Now let set L1 contains all number which are congruent mod 12.

similarly, L2, L3, L4 are defined

Now if out of 11-given square integers if

C-1

6 or more numbers belong to either of Li, i = 1, 2, 3, 4 then we are through select 6 out of these numbers and these are required a2, b2,.......,f2.

C-2 

If 5 or 4 are selected from a lot say from Li then at least 2. must come from one of lot out of remaining 3 say Lj. Now select 4-from Li and 2 from Lj and set a2, b2, d2, e2 from first 4 and c2, f2 from second set.

C-3

Now if maximum 3 are selected from one set out of '4' then selection must be 3, 3, 3, 2 Now say Li, Lj, Lk three are selected

where (i ≠ j ≠ k) then select 2-from Li and set then as a2 and d2. Similarly select 2 from Lj and set then as b2, e2 and select 2-from Lk and set then as c2, f2. Clearly from this, given condition is satisfied.

Note that if α is maximum numbers of elements selected from a set out of four sets then α ≥ 3.