Substitute the letters by a different digit from 0 to 9 to satisfy this cryptarithmic long division problem.(adsbygoogle = window.adsbygoogle || []).push({});

.............N K T

......-------------------

F A R |...F R M N K B

............A K K N

.......---------------------

.............. A B I K

...............AM O K

...........---------------

..................R T I B

..................R A K T

...........-------------

.....................R A F

Note:

(i) None of F, N, A and R can be 0.

(ii) All the dots are posited with a view to facilitate the formatting, and none of the said dots represent decimal points, or correspond to any arithmetic operations.

**Physics Forums - The Fusion of Science and Community**

# Long division with zero to nine substitution

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

- Similar discussions for: Long division with zero to nine substitution

Loading...

**Physics Forums - The Fusion of Science and Community**