Community

Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!
Login Register Memberlist Search AoPS Blogs Contests Galleries Forum Index
The time now is Thu Nov 26, 2009 3:28 am
All times are UTC - 8
View posts since last visit
View unanswered posts
Application of Wilson's Theorem
Moderators: djshowdown2, krustyteklown, nealth, Silverfalcon, worthawholebean
Post new topic   Reply to topic View previous topicView next topic
3 Posts • Page 1 of 1
Author Message
NuncChaos
Poincare Conjecture
Poincare Conjecture

Offline
Joined: 03 Feb 2008
Posts: 140

To rate posts you must be logged in
#1
Application of Wilson's Theorem
from some old mock amc

Given that 1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} +.... + \frac{1}{23} = \frac{n}{23!}

Find the remained when n is divided by 13.

the answer is
7


My question is, how exactly does one apply Wilson's to this problem?
And is there a more elementary method?

PostPosted: Sat Oct 31, 2009 9:46 pm  Back to top 
  ProfilePM
zapi2007
Navier-Stokes Equations
Navier-Stokes Equations


Offline
Joined: 22 Sep 2007
Posts: 1268
Location: San Marino, CA
United States

To rate posts you must be logged in
#2
here we go

1. Multiply by 23!
2. Take mod 13
3. Find 23!/13 term.
4. Look up Wilson's Theorem
5. Use 12!= -1 mod 13.
6 14*15*16...*23mod13=(13+1)(13+2)...(13+10)mod13=10!mod13
7. 10! is easy enough to bash (i hope for you it is) 10! is 3628800
8. 3628800/13 has a remainder of 6 (after some brute force)
9. multiply them together 12!*10!=-1*6mod13=7mod13
10. Done



wondering if there's an easier way to clean up steps 6, 7, and 8... maybe

for an elementary method, well, the first few steps are straightforward. But, it gets messy when you need to find \frac{23!}{13} mod 13 Sad
Brute force? The most elementary thing there is. Very Happy

But if you didn't know Wilson's Theorem, I'd bash 10! twice, then multiply by 11 and 12, knowing that 11=13-2 and 12=13-1. You can also do it with 9! if you feel like you need to make it more balanced between finding the factorial and long dividing, or multiplying it later with mod 13 in mind.
_________________
"There is only one difference between a madman and me. The madman thinks he is sane. I know I am mad." -Salvador Dali

PostPosted: Sat Oct 31, 2009 10:16 pm  Back to top 
  ProfilePM
JAM
Riemann Hypothesis
Riemann Hypothesis

Offline
Joined: 14 Jun 2004
Posts: 495
United States

To rate posts you must be logged in
#3
zapi2007 wrote:


wondering if there's an easier way to clean up steps 6, 7, and 8... maybe



Click to reveal hidden content

7') 10! \equiv \frac{12!}{11\cdot 12} \equiv \frac{-1}{(-1)(-2)} \equiv -\frac{1}{2}\pmod{13}
8') 2\cdot 7\equiv 1\pmod{13}\Rightarrow \frac{1}{2} \equiv 7\pmod{13}, so 10!\equiv 6\pmod{13}

Inverses modulo a prime tend to simplify calculations a lot (and incidentally are how you prove Wilson's theorem in the first place).

_________________
Wishing it was the first week again
Wishing we could turn back time...


PostPosted: Sun Nov 01, 2009 9:22 am  Back to top 
  ProfilePM
Display posts from previous:   Sort by:   
3 Posts • Page 1 of 1
Post new topic   Reply to topic View previous topicView next topic
Jump to:  

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum
You cannot post calendar events in this forum


© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us