Designing a 4-bit binary number divider circuit
It can be easily solved using its truth table and K-map.

As far as I understand the question only asks for the quotient.So in order to write the 
truth table you need only two output variables.This is because the maximum number that can 
be represented using 4 bits is 15 (1111), which when divided by 5 yields quotient 3 (0011).

Here is the truth table required.



A3 to A0 represent the input in binary.F1 and F0 represents the output in binary.

This table is easily obtained since numbers 0 to 4 upon division with 5 gives 0 quotient.
5 to 9 yields 1. 10 to 14 yields 2 and so on.

Now you can draw K-maps for F1 and F0.

If you need you can form expression for remainder also in a similar manner.Just remember that,in that case you require 3 output bits, as maximum remainder upon division by 5 is 4 (100).