title: Design DFA accepting binary strings divisible by a number 'n'
body: <p>I need to learn how to design a DFA such that given any number 'n', it accepts binary strings {0, 1} whose decimal equivalent number is divisible by 'n'.</p>
  
  <p>There will be different DFAs for different 'n', but can somebody give a basic approach that I should follow to proceed with any number 0 &lt; n &lt; 10 .</p>