Long division with zero to nine substitution

[K Sengupta]

Substitute the letters by a different digit from 0 to 9 to satisfy this cryptarithmic long division problem.

.............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.

[davee123]

Actually, I think that as long as you state that none of the letters represent the *same* digit, you don't need to give the hint about which ones aren't 0. Figuring out which is 0 is pretty simple.


A = 2
B = 7
F = 3
I = 0
K = 8
M = 5
N = 9
O = 6
R = 1
T = 4


DaveE