1THIS SHOULD NOT BE THAT EASY
Several successive number was written in a row.Determine the least value of the number of this sequence such that: there exist a way to order it again such that all 3 adjacent numbers(ie written one -next- the other) have sum which is divisible the previous number and the last number of this sequence is odd!
well this is not for jee, just a woonderful question which i could not keep without sharing
-
UP 0 DOWN 0 1 9
9 Answers
62I did not understand the language of this question :(
1) I mean what is that we have to find (The number of ways or the numbers themselves or the least number)
From what I understood it should be
1, 1, 1, 3
rearrange
to get 3, 1, 1, 1
last digit is odd. The last 3 are divisible by the number preceeding them!
but i am not sure if this is what the question asked for!