mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2020-11-13, 21:40   #1
bhelmes
 
bhelmes's Avatar
 
Mar 2016

24×19 Posts
Default (a/b) mod p ?

What is the fastest way to calculate a rational number a/b with a, b element N and gcd (b,p)=1 mod p where the result is in N ?
bhelmes is offline   Reply With Quote
Old 2020-11-13, 21:44   #2
Nick
 
Nick's Avatar
 
Dec 2012
The Netherlands

22×11×37 Posts
Default

Quote:
Originally Posted by bhelmes View Post
What is the fastest way to calculate a rational number a/b with a, b element N and gcd (b,p)=1 mod p where the result is in N ?
Is the Euclidean algorithm not fast enough for you?
Nick is offline   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 10:03.

Mon Mar 8 10:03:12 UTC 2021 up 95 days, 6:14, 0 users, load averages: 1.30, 1.23, 1.18

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.