Академический Документы
Профессиональный Документы
Культура Документы
(1)Brilliant
Next problem
Correct answer: 19
33 solutions
Krutarth Patel
22, India
Write a solution.
Insert an image
PREVIEW
Sambit Senapati
19, India
Upvote (45)
(where
Home
Topics
Stats
Community
Therefore
Search
Reply
Subscribe to comments
Calvin Lin
30, USA
STAFF
Nice solution. Note that you didn't need to use Wilson's Theorem at all, since you
already pointed out that the cancellation will occur. This is very similar to the proof
of Lucas Theorem.
Here's a vote boost from me :)
2
Reply
Sambit Senapati
19, India
https://brilliant.org/
1/12
7/16/2015
(1)Brilliant
1
Reply
Ruskin Bond
19, United Kingdom
Reply
Jean Lee
19, South Korea
Whoa. NICE.
1
Reply
Abul Ahmed
15, Bangladesh
Reply
Yunhao King
17, Singapore
No Lucas!Nice!
1
Reply
Sri Kanth
28, India
Reply
Hero P.
39, USA
Upvote (18)
An elementary proof without resorting to Lucas' Theorem follows. First, we claim for
all primes , positive integers , and integers
,
For
is prime, and
cannot divide
under
and induction on
https://brilliant.org/
2/12
7/16/2015
(1)Brilliant
For
. For
, we write
, we find
when divided by
Reply
leaves a remainder
Subscribe to comments
Muhammad Al Kahfi
18, Indonesia
Upvote (18)
Reply
Subscribe to comments
Rindell Mabunga
17, Philippines
wow amazing i did not know that there was an existing theorem like that
2
https://brilliant.org/
Reply
3/12
7/16/2015
(1)Brilliant
Vishwa Iyer
16, USA
and
into
and
Reply
Jimmy Kariznov
25, USA
Reply
Sotiri Komissopoulos
19, USA
Upvote (10)
. We see that
, we have each of
Reply
is divided by
is
Subscribe to comments
Kiriti Mukherjee
17, Bangladesh
Upvote (7)
Upvote (6)
Reply
Subscribe to comments
Jimmy Kariznov
25, USA
Note that
by Lucas' Theorem, we have:
and
. Then, since
is prime,
Reply
Subscribe to comments
George Williams
https://brilliant.org/
Upvote (5)
4/12
7/16/2015
(1)Brilliant
George Williams
21, USA
Upvote (5)
This is a nice solution, the source of the corresponding exercise is Apostol's. For all ,
we have that:
Note that this is a special case of Lucas theorem, which has already been described
here.
Reply
Subscribe to comments
Alyosha Latyntsev
19, United Kingdom
Reply
Yunhao King
17, Singapore
Reply
Yunhao King
17, Singapore
Reply
Mayank Kaushik
21, India
I did the same as you did , But I didn't know that this result is the special case of
Lucas Theorem (which i never heard)
1
Reply
Oscar Harmon
18, USA
We can see that
Upvote (4)
equivalent since
https://brilliant.org/
5/12
7/16/2015
(1)Brilliant
Reply
Subscribe to comments
Calvin Lin
30, USA
STAFF
Reply
Daniel Chiu
16, USA
Upvote (3)
Reply
Subscribe to comments
Xuming Liang
17, USA
Upvote (2)
, which is equal to
, thus we have
. Since
is prime, thus
and
are
Reply
Subscribe to comments
Atonu Mukherjee
20, Bangladesh
Upvote (2)
Upvote (1)
Reply
Subscribe to comments
https://brilliant.org/
6/12
7/16/2015
(1)Brilliant
30, Singapore
Note that
Hence
(Note: all the divisions are valid (mod 101) because the denominators of every fraction,
except the first, are coprime to 101.)
Reply
Subscribe to comments
Abhishek Pushp
16, India
Upvote (1)
Reply
Subscribe to comments
Hesto Plowkeeper
15, USA
Upvote (1)
Reply
Subscribe to comments
Jorge Fernndez
19, Mexico
Upvote (0)
Jul 12
Reply
Subscribe to comments
Patrick Corn
39, USA
https://brilliant.org/
We have
Upvote (0)
7/12
7/16/2015
(1)Brilliant
We have
of
The numbers
left in the
numerator run through all of the nonzero congruence classes mod
exactly once.
So, modulo
, the numerator is congruent to
. Since
is prime,
is
invertible mod
, so it makes sense to rewrite:
mod
Reply
Subscribe to comments
Rahul Nahata
19, India
According to Lucas' theorem since
Therefore
Reply
Upvote (0)
and
Subscribe to comments
Ayush Saini
21, India
Upvote (0)
Reply
B La Bc Khi
18, Vietnam
Upvote (0)
Since 2013=19.101+94 then according to the lucas theorem we have ${2013 \choose
101} \equiv {19 \choose 1}{94 \choose 0} \equiv 19 \pmod{101}$ Ans: 19.
Reply
Douglas Zare
38, USA
Upvote (0)
https://brilliant.org/
8/12
7/16/2015
(1)Brilliant
So, the product is 19 mod 101.
Reply
Ashwath Thirumalai
17, Uganda
Upvote (0)
By Lucas' Theorem, since 101 is prime, this binomial coefficient is equal to a bunch of
stuff choose 0 (which is just 1) times 19 choose 1 (modulo 101). This is clearly 19 mod
101.
Reply
Thomas Baxter
21, Canada
Upvote (0)
equivalent to modulo
, as a
inclusive?"
Note that the first fraction on the right-hand side is equivalent to modulo
,
because the top and bottom each include a number equivalent to modulo
for
each integer
, so their modular products are equal and non-zero.
Then, modulo
Reply
Jason Martin
23, USA
We know
Upvote (0)
Reply
Christopher Boo
18, Malaysia
Upvote (0)
This is a typical problem to be solved by Lucas Theorem. (The proof and explanation
of Lucas Theorem is too complicated, I will only write the way to tackle this problem,
for more information you can Google it)
Next,
https://brilliant.org/
Reply
when divided by
is
9/12
7/16/2015
(1)Brilliant
Reply
Upvote (0)
Reply
Evan Chien
16, USA
Upvote (0)
Upvote (0)
2013=19.101^1+94
101=1.101^1+0
by Lucas theorem:
m1=19
m0=94
n1=1
n2=0
C(2013 101)C(19 1).C(94 0)
19(mod 101) So 19 is the answer
Reply
Utsav Singhal
16, India
It means.....2013 c 101 = 2013! ____ 101! (2013-101)! solve this and divide it by 101
which will give the remainder 19
Reply
Abhishek Srivastava
18, India
Upvote (0)
Reply
Ajay Kumar
20, India
Upvote (0)
Reply
https://brilliant.org/
10/12
7/16/2015
(1)Brilliant
Tan Likai
17, Singapore
Since
Upvote (0)
. Note that
numbers from 1913 to 2013 exculding 1919 are 1 to 100 modulo 101. By Wilson's
Theorem,
Reply
Abhishek Kumar
17, India
Upvote (0)
Upvote (0)
Reply
Debjit Mandal
20, India
I am going to use the result that, if p is a prime and m and n are positive integers
satisfying m=ap+r , n=bp+s where 0\leq r,s<p, then {m \choose n}{a \choose b}{r
\choose s}\pmod{p}. Here, m=2013= 101 \times 19 + 94, and n=101 \times 1 + 0. So,
{2013 \choose 101}{19 \choose 1}{94 \choose 0}19 \times 119\pmod{101}. So,
the answer is 19.
Reply
Harsa Mitra
21, India
Upvote (0)
Reply
https://brilliant.org/
11/12
7/16/2015
(1)Brilliant
Stats
0 Day Streak
Continue Practicing
Level 5 Calculus
35 Quizzes
Level 5 Algebra
899 Solved
Level 1 Algebra
See more
About
https://brilliant.org/
Help
Terms
Privacy
Mobile App
Brilliant 2015
12/12