Find the greatest common divisor of the two numbers, 8 8 6 ! + 1 and 8 8 7 ! .
Notation
:
!
denotes the
factorial
notation. For example,
1
0
!
=
1
×
2
×
3
×
⋯
×
1
0
.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
A little logic would suffice too.Note that 886!+1 887! could have gcd less than them 1,2,3,4,............................887 Since All of them leave remainder 1 when divided by first number there gcd is either 1 or 877 Try both and BINGO!!! I did use wilson theorem but i thought this would be a good way too for logic
Log in to reply
Why can't 1 be the gcd then? :-P
Log in to reply
U see U have three answer trials
Log in to reply
@Kaustubh Miglani – How was your JSTSE result?
Log in to reply
@Kushagra Sahni – He came 2nd.
Log in to reply
@Mehul Arora – And what about you?
Log in to reply
@Kushagra Sahni – I'm 82nd. Isn't as good, but It'll have to do :/
Log in to reply
@Mehul Arora – Getting selected also is a great achievement, keep it up.
@Mehul Arora – Please I am Ashamed of it.Pls dont tell anyone about this @Mehul Arora @Kushagra Sahni
@Kaustubh Miglani – Lol! I posted this question!
Log in to reply
@Akshat Sharda – LOL. @Kaustubh Miglani you must uphold the spirit of solving a problem. If I post a question saying 1+1 for example, you can't try 0,1 and 2 to get the answer right.
You should be able to get it right in one go, and not rely on luck to get the answer correct for you. Three tries are provided if in case you commit a calculation error, you can start over and get the correct answer.
However, I am not accusing you of anything.
Log in to reply
@Mehul Arora – As I said I did it by Wilsons theorem.It just came to me and I thought it would be better too
Brilliant use of Wilson's theorem. +1.
I think there is a flaw : Your last but one statement says 8 8 7 ∣ ( 8 8 6 ! + 1 ) and 8 8 7 ∣ 8 8 7 ! . But this need not directly mean that g c d ( 8 8 6 ! + 1 , 8 8 7 ! ) = 8 8 7 .
Log in to reply
I have posted the explanation in my solution now.
Log in to reply
@Svatejas Shivakumar The other posted solution was indeed wrong, and the flaw didn't come across me that time. Thanks for pointing it out :).
Can anyone explain to me how 887 x gcd(886!, n) = 887 (as stated in Svatejas' answer)
First, we got: k ∣ 8 8 6 ! ( ∀ k ∈ 1 ; 8 8 6 ) So 8 8 6 ! + 1 ≡ 1 ( m o d k ) And apply Wilson's Theorem, we have: 8 8 6 ! + 1 ≡ ( − 1 + 1 ) ≡ 0 ( m o d 8 8 7 ) ( b e c a u s e 8 8 7 i s p r i m e ) So the only common factor, which is also the answer, is 8 8 7
Problem Loading...
Note Loading...
Set Loading...
Notice that 8 8 7 is prime. Wilson's theorem states that ( p − 1 ) ! ≡ − 1 ( m o d p ) where p is a prime number. Therefore 8 8 6 ! + 1 is divisible by 8 8 7 and so is 8 8 7 !
This is indeed the greatest common factor which is possible as g cd ( 8 8 7 ! , 8 8 6 ! + 1 ) = g cd ( 8 8 7 ! , 8 8 7 n ) = 8 8 7 × g cd ( 8 8 6 ! , n ) = 8 8 7 as for some integer n ,
8 8 7 n divides 8 8 6 ! + 1 , an odd number which implies n is odd and the result.