- #1
K Sengupta
- 113
- 0
N is a seven digit base-8 positive integer having the form ABCDEFG that uses each of the nonzero base-8 digits 1 to 7 exactly once, and satisfies these conditions:
(i) ABCDEFG is divisible by 7.
(ii) ABCDEF is divisible by 6.
(iii) ABCDE divisible by 5.
(iv) ABCD is divisible by 4.
(v) ABC is divisible by 3.
(vi) AB is divisible by 2.
Determine all possible value(s) that N can take.
(i) ABCDEFG is divisible by 7.
(ii) ABCDEF is divisible by 6.
(iii) ABCDE divisible by 5.
(iv) ABCD is divisible by 4.
(v) ABC is divisible by 3.
(vi) AB is divisible by 2.
Determine all possible value(s) that N can take.