Have you tried repeated subtraction until the answer is less than B?
count = 1
temp(count) = A - B
do
count = count + 1
temp(count) = temp(count-1) - B
while (temp(count)>B)
ans = temp(count-1)/B
or sumit like that
I am trying to find a logic which can give me one digit (first digit on the left of decimal dot) after division.
The ultimate goal is given below,
number A / number B mod 2 =?
The concern is the two numbers (A & B) are two large. Any trick can help.
Example: 913695089923267549815145223638290430 / 70369745177664
I am a database developer (IT Professional) and finding it difficult to do. I am not sure I chose correct forum (type) or not?