First Idea. Wilson's Theorem. But

Is 7746 ! + 1 7746!+1 divisible by 7747 7747 ?

Notation: ! ! is the factorial notation. For example: 10 ! = 1 × 2 × 3 × . . . × 9 × 10 10!=1 \times 2 \times 3 \times ... \times 9 \times 10

No Yes

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.

1 solution

Tapas Mazumdar
Mar 30, 2017

Wilson's theorem actually states that if

( n 1 ) ! + 1 0 ( m o d n ) (n-1)! + 1 \equiv 0 \pmod{n}

then n n is prime. The converse is also true that if n n is a prime then ( n 1 ) ! 1 ( m o d n ) (n-1)! \equiv -1 \pmod{n} .

A common observation tells us that in the problem it is stated 7747 ! 7747! not 7747 7747 and 7747 ! > 7746 ! + 1 7747! > 7746! + 1 so the division of 7746 ! + 1 7746!+1 by 7747 ! 7747! is certainly not an integer. Furthermore, wilson's theorem has no application here as 7747 = 61 × 127 7747 = 61 \times 127 is a composite number.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...