Proving that no 2-state DFA decides the language A = {x ∈ {0, 1}* | bnum(x) is divisible by 3}
Remainder values is indeed the clue! Obviously the strings $1$ and $10$ cannot end in a final state as they represent number 1 and 2 respectively. But can they end in the same state?