![]() |
![]() |
#1 |
May 2007
3 Posts |
![]()
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?
|
![]() |
![]() |
![]() |
#2 | |
"William"
May 2003
Near Grandkid
3×7×113 Posts |
![]() Quote:
http://www.mersenneforum.org/showthread.php?t=8119 |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
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 |