Exercise 2.7.14* (Mysterious congruence)

Suppose that p is an odd prime, and write 1 1 1 2 + 1 3 1 ( p 1 ) = a ( p 1 ) ! . Show that a ( 2 2 p ) p ( mod p )

Answers

We give here two estimations of a (I found the second first), with two distinct results. The comparison of these two results give a non trivial smart congruence.

Proof. First estimation of a .

Write [ a ] p the class of a in pℤ . By definition of a ,

a = ( p 1 ) ! 1 ( p 1 ) ! 2 + ( p 1 ) ! 3 ( p 1 ) ! p 1 .

By Wilson’s theorem, ( p 1 ) ! 1 ( mod p ) , thus

[ a ] p = [ ( p 1 ) ! ] p ( [ 1 ] p 1 [ 2 ] p 1 + [ 3 ] p 1 [ p 1 ] p 1 = [ 1 ] p 1 + [ 2 ] p 1 [ 3 ] p 1 + + [ p 1 ] p 1 = k = 1 p 1 ( 1 ) k [ k ] p 1 .

Moreover 2 p = ( 1 + 1 ) p = 2 + k = 1 p 1 ( p k ) . If we write b = ( 2 p 2 ) p , by Fermat’s theorem, b is an integer, and

b = 2 p 2 p = k = 1 p 1 1 p ( p k ) = k = 1 p 1 ( p 1 ) ( p 2 ) ( p ( k 1 ) ) k ! .

Therefore, using k ! 0 for all k [ [ 1 , p 1 ] ] ,

[ b ] p = k = 1 p 1 [ ( 1 ) k 1 ( k 1 ) ! k ( k 1 ) ! ] p = k = 1 p 1 ( 1 ) k 1 [ k ] p 1 .

We obtain [ b ] p = [ a ] p , so a 2 2 p p ( mod p ) . The solution is done. To conclude,

[ 1 ] p 1 [ 2 ] p 1 + [ 3 ] p 1 [ p 1 ] p 1 = [ 2 2 p p ] p .

(By problem (10), we have also

[ 1 ] p 1 + [ 2 ] p 1 + [ 3 ] p 1 + + [ p 1 ] p 1 = 0 . )

Second estimation of a .

Let g ( x ) [ x ] be the polynomial given by

g ( x ) = ( x 1 ) ( x + 2 ) ( x 3 ) ( x ( p 2 ) ) ( x + ( p 1 ) = j = 1 p 1 ( x j ( 1 ) j + 1 ) ,

whose roots are

α j = j ( 1 ) j + 1 , j = 1 , , p 1 .

We write, as in the proof of Wolstenholme’s congruence,

g ( x ) = x p 1 τ 1 x p 1 + + τ p 3 x 2 τ p 2 x + τ p 1 .

Here

τ p 1 = g ( 0 ) = j = 1 p 1 α j = ( 1 ) ( p 1 ) 2 ( p 1 ) ! .

Moreover, by definition of a ,

a = ( p 1 ) ! 1 ( p 1 ) ! 2 + ( p 1 ) ! 3 ( p 1 ) ! p 1 .

Then

τ p 2 = 1 i 1 < i 2 < < i p 2 p 1 α i 1 α i p 2 = α 1 α p α 1 + α 1 α p α 2 + + α 1 α p α p 1 = ( 1 ) ( p 1 ) 2 [ ( p 1 ) ! 1 ( p 1 ) ! 2 + ( p 1 ) ! 3 ( p 1 ) ! p 1 ] = ( 1 ) ( p 1 ) 2 a .

The idea is to compute two evaluations of g ( p ) modulo p 2 , to obtain τ p 2 modulo p .

  • First

    g ( p ) = p p 1 τ 1 p p 1 + + τ p 3 p 2 τ p 2 p + τ p 1 ,

    therefore

    g ( p ) τ p 2 p + τ p 1 ( mod p 2 ) . (1)
  • Next

    g ( p ) = ( p 1 ) ( p + 2 ) ( p 3 ) ( p ( p 2 ) ) ( p + ( p 1 ) ) = [ ( p 1 ) ( p 3 ) 2 ] [ ( p + 2 ) ( p + 4 ) ( p + ( p + 1 ) ) = 2 ( p 1 ) 2 [ p 1 2 p 3 2 1 ] ( p + 1 ) ( p + 2 ) ( p + 3 ) ( p + 4 ) ( p + p ) ( p + 1 ) ( p + 3 ) ( p + p ) = 2 ( p 1 ) 2 ( p 1 2 ) ! ( 2 p ) ! p ! 1 2 ( p + 1 ) 2 ( p + 1 2 ) ( p + 3 2 ) p = 1 2 ( p 1 2 ) ! ( 2 p ) ! p ! ( p 1 2 ) ! p ! = 1 2 ( 2 p p ) [ ( p 1 2 ! ) ] 2 = ( 2 p 1 p 1 ) [ ( p 1 2 ) ! ] 2

    By Problem 12, we know that ( 2 p 1 p 1 ) 1 ( mod p 2 ) (even if p = 3 ), thus

    g ( p ) [ ( p 1 2 ) ! ] 2 ( mod p 2 ) , (2)

    where we saw in the solution of exercise 2.1.18 that

    [ ( p 1 2 ) ! ] 2 ( 1 ) ( p + 1 ) 2 ( mod p ) . (3)

    Then (1) and (2) give

    τ p 2 p + τ p 1 [ ( p 1 2 ) ! ] 2 ( mod p 2 ) ,

    that is

    ( 1 ) ( p 1 ) 2 a p + ( 1 ) ( p 1 ) 2 ( p 1 ) ! [ ( p 1 2 ) ! ] 2 ( mod p 2 ) .

    Therefore

    a ( p 1 ) ! ( 1 ) ( p 1 ) 2 [ ( p 1 2 ) ! ] 2 p ( mod p ) ,

    where the numerator is divisible by p , by(3) and Wilson’s theorem.

    This is not the expected result. If we compare the two results, we obtain as promised the smart congruence, true for every odd prime,

    ( p 1 ) ! ( 1 ) ( p 1 ) 2 [ ( p 1 2 ) ! ] 2 p 2 2 p p ( mod p ) ,

    (or equivalently ( p 1 ) ! ( 1 ) ( p 1 ) 2 [ ( p 1 2 ) ! ] 2 2 2 p ( mod p 2 ) .)

User profile picture
2024-09-10 08:45
Comments