How can i find a/b mod m in c++?
created
Aug '13last reply
Aug '13- 8
replies
- 695
views
- 2
users
- 1
link
There are a couple of different ways that depend on what the constraints on a b and m are.
Not knowing any of that information the best answer that you are likely looking for is multiplicative inverse.
Type of a and b is double.
I have read what multiplicative inverse is from http://en.wikipedia.org/wiki/Modular_multiplicative_inverse6.
Due to double type, i cannot apply conventional gcd() approach. However, by computing the multiplicative inverse in decimal form, i can get results close but not accurate.
What problem are you trying to solve? I don't understand the requirement. Maybe some details would help.
If you're working with double then there is no trouble with dividing all items in a by its corresponding item in b to begin with.
Also, when computing a*2, where a is of type double some error is induced automatically.
say for example,
a = 1680.000000
a = a*2;
then value of 'a' shown is
a = 3359.999999