Finite state machine to detect if a number is divisible by 5 if LSB comes first

Asked Mar 25 '19 at 21:13

Active Mar 28 '19 at 23:59

Viewed 1,356 times

If MSB comes in first, we can keep track of the remainder for each new bit since the additional bit will either cause the number to be 2x or 2x+1.

But if LSB comes in first, how can we come up with the fsm? I found some fsm but I wasn't able to understand how they came up with it. Can someone please explain how to go about doing this?

I was just wondering how one can come up with this fsm? I didn't really understand the description in the other post.

edited Mar 28 '19 at 23:59

asked Mar 25 '19 at 21:13

freezies

Sounds like homework to me – Voltage Spike Mar 25 '19 at 22:28
Does the source of that FSM that you show explain WHY it works? – TimWescott Mar 25 '19 at 22:48
Can you show your work so far? See [this thread on homework questions](https://meta.stackoverflow.com/questions/334822/how-do-i-ask-and-answer-homework-questions) – TimWescott Mar 25 '19 at 23:21
We covered this [about a year ago](https://electronics.stackexchange.com/q/345189/11683), with answers covering both LSB-first and MSB-first. – Dave Tweed Mar 26 '19 at 01:01

Finite state machine to detect if a number is divisible by 5 if LSB comes first

0 Answers0