(New page: this theorem is helpful http://en.wikipedia.org/wiki/Wilson's_Theorem My answer was 50, can anybody confirm?)
 
 
(3 intermediate revisions by 3 users not shown)
Line 3: Line 3:
 
http://en.wikipedia.org/wiki/Wilson's_Theorem
 
http://en.wikipedia.org/wiki/Wilson's_Theorem
  
My answer was 50, can anybody confirm?
+
I got 50, can anybody confirm?
 +
________________________
 +
Yes, use Wilson's Theorem
 +
 
 +
(p-1)! = -1(mod p)
 +
-Sarah
 +
 
 +
I'm still a little unsure how to use Wilson's Theorem here, can anyone help?
 +
 
 +
----
 +
 
 +
Yep...
 +
Since 101 is prime, by wilson's thm. 100! mod 101 = 100 mod 101.
 +
 
 +
(100*99) * 98! = 100<br />
 +
98! = 1/99 = -1/2 (because -2 mod 101 = 99 mod 101)<br />
 +
98! = 100 * 1/2(because -1 mod 101 = 100 mod 101)<br />
 +
98! = 100 * 51 (because 51 * 2 = 1)<br />
 +
98! = 5100 mod 101 = 50

Latest revision as of 14:23, 5 November 2008

this theorem is helpful

http://en.wikipedia.org/wiki/Wilson's_Theorem

I got 50, can anybody confirm? ________________________ Yes, use Wilson's Theorem

(p-1)! = -1(mod p) -Sarah

I'm still a little unsure how to use Wilson's Theorem here, can anyone help?


Yep... Since 101 is prime, by wilson's thm. 100! mod 101 = 100 mod 101.

(100*99) * 98! = 100
98! = 1/99 = -1/2 (because -2 mod 101 = 99 mod 101)
98! = 100 * 1/2(because -1 mod 101 = 100 mod 101)
98! = 100 * 51 (because 51 * 2 = 1)
98! = 5100 mod 101 = 50

Alumni Liaison

Ph.D. 2007, working on developing cool imaging technologies for digital cameras, camera phones, and video surveillance cameras.

Buyue Zhang