Re: [algogeeks] divisible by 3

how abt using FSA ? consider state as a remainder when the given no. is divided by 3. Then we get a FSA for any length no. as [image: fsa.JPG] On Sun, Jun 6, 2010 at 12:15 AM, divya sweetdivya@gmail.com wrote: Find if a number is divisible my 3, without using %,/ or *. You can

[algogeeks] divisible by 3

Find if a number is divisible my 3, without using %,/ or *. You can use atoi(). -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to

Re: [algogeeks] divisible by 3

this problem has been discussed i think.. On Sun, Jun 6, 2010 at 12:15 AM, divya sweetdivya@gmail.com wrote: Find if a number is divisible my 3, without using %,/ or *. You can use atoi(). -- You received this message because you are subscribed to the Google Groups Algorithm Geeks