Discussion of Question with ID = 715 under Alphabet-Number-Series

This is the discussion forum for this question. If you find any mistakes in the solution, or if you have a better solution, then this is the right place to discuss. A healthy discussion helps all of us, so you are requested to be polite and soft, even if you disagree with the views of others. The question and its current solution has also been given on this page.

Advertisement

Question

Below is a series of numbers from 1 through 9. Some of them repeat. How many 6 does it contain such that they are completely divisible by both the two predecessors to their left?

7 6 6 7 5 6 2 8 8 5 4 9 2 4 9 6 4 6 9

A

0

B

2

C

1

D

3

Soln.
Ans: a

None.


Comments and Discussion