mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2007-05-30, 23:33   #1
meknowsnothing
 
May 2007

3 Posts
Default Congruence notation

I read about the AKS primality test. That algorithm uses the relation (x - a)^n = (x^n - a) mod (n, x^r - 1). What does it mean? I know that a=b mod c <=> c|a-b but the notation a=b mod (c,d) is new for me. Or is (n,x^r-1) just the greatest common divisor of n and x^r-1?
meknowsnothing is offline   Reply With Quote
Old 2007-05-31, 03:32   #2
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

44768 Posts
Default

Quote:
Originally Posted by meknowsnothing View Post
I read about the AKS primality test. That algorithm uses the relation (x - a)^n = (x^n - a) mod (n, x^r - 1). What does it mean?
Must be something going around. fetofs asked the same question earlier this month. The answers are pretty good.

http://www.mersenneforum.org/showthread.php?t=8119
wblipp is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Linear Congruence order 4 sequence not testing in PFGW? carpetpool Software 14 2017-07-13 19:54
Congruence relations Lee Yiyuan Miscellaneous Math 7 2012-05-08 12:55
Congruence storm5510 Math 27 2009-09-22 23:14
prime 95 notation spyros Information & Answers 19 2009-06-19 20:28
congruence mod 2^p-1 abiessuunreg Miscellaneous Math 3 2005-03-07 21:03

All times are UTC. The time now is 12:00.


Sat Jul 17 12:00:25 UTC 2021 up 50 days, 9:47, 1 user, load averages: 1.95, 1.45, 1.33

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.