Fermat*s Little Theorem (2/24)
... 341 is called a 2-pseudoprime (i.e., “false prime with respect to base 2”). There are in fact infinitely many. The smallest 3-pseudoprime is 91. Etc. Really disturbing: A Carmichael number is a k-pseudoprime for every base k to which it is relatively prime. 561 is the smallest. There are infinitely ...
... 341 is called a 2-pseudoprime (i.e., “false prime with respect to base 2”). There are in fact infinitely many. The smallest 3-pseudoprime is 91. Etc. Really disturbing: A Carmichael number is a k-pseudoprime for every base k to which it is relatively prime. 561 is the smallest. There are infinitely ...
![[Part 2]](http://s1.studyres.com/store/data/008795852_1-cad52ff07db278d6ae8b566caa06ee72-300x300.png)
18.781 Problem Set 3
... that’s linear in p for an inverse of 2 modulo p. (I’m not looking for the formula 2p−2 from the text; that is not linear in p. Here’s a hint: if p is odd, then p + 1 is even, so you can divide it by two.) 2(c). The integer 3 is invertible modulo p for any prime p except 3. By breaking the problem in ...
... that’s linear in p for an inverse of 2 modulo p. (I’m not looking for the formula 2p−2 from the text; that is not linear in p. Here’s a hint: if p is odd, then p + 1 is even, so you can divide it by two.) 2(c). The integer 3 is invertible modulo p for any prime p except 3. By breaking the problem in ...
Solving a Quadratic Equation
... Solving a Quadratic Equation by Using the Quadratic Formula Remember those equations that you were told were un-factorable or prime, and thus could not be solved? Take for example: x 2 10 x 7 0 You cannot solve this equation unless you use either Completing the Square, or the Quadratic Formula ...
... Solving a Quadratic Equation by Using the Quadratic Formula Remember those equations that you were told were un-factorable or prime, and thus could not be solved? Take for example: x 2 10 x 7 0 You cannot solve this equation unless you use either Completing the Square, or the Quadratic Formula ...