Structure of the Multiplication Table for [ modulo P ]

by Frank Charles Fung ( 1st published in June , 2006 )

Top Of Page

Epilog I : A Question on Mersenne Prime

This question arose at 9:10 p.m. on Tuesday 2006-7-11 , while the author was walking thru the { Hong Kong Park } in Hong Kong .

• but re-phrasing the question properly took another 3-days .

Anyways , here it is .

The { Mersenne Prime } [ 2^31 - 1 ] :

• For the { Mersenne Prime } [ 2^31 - 1 ] , we set-up the value [ P ] , such that :
  • [ P ] = 2,147,483,647 = [ 2^31 - 1 ] .

  And we can write , alternately :

  • [ P ] = 2 x 9 x 7 x 11 x 31 x 151 x 331 + 1

  Therefore :

  • [ P ] = [ L.C.M. of ( 2 , 9 , 7 , 11 , 31 , 151 , 331 ) ] + 1

  And consequently ,

  • [ P ] is 'relatively prime' with respect to [ 2 ] , [ 9 ] , [ 7 ] , [ 11 ] , [ 31 ] , [ 151 ] , & [ 331 ] .

Setting-up the [ Upper-Limit ] & the [ Lower-Limit ] :

We note here that the { Square-Root of [ P ] } is roughly [ 46,340.95 ] .

We then set-up the [ Upper Limit ] & the [ Lower-Limit ] as follows :

• Up[ 2,147,395,600 ] = 46,340 x 46,340
• [ 2,147,488,281 ] = 46,341 x 46,341

• [ 2,147,395,600 ] < [ N ] < [ 2,147,488,281 ]

  with :

The QUESTION here is :

• whether the fact that :
  • [ N ] is 'relatively prime' with respect to [ 2 ] , [ 9 ] , [ 7 ] , [ 11 ] , [ 31 ] , [ 151 ] & [ 331 ] ,

    is already a { sufficient condition } that [ N ] is 'prime' ;

    • And if so , why so ?

    • And if not , why not ?

• 

  with :

  • [ X ] = 1,897,507,765
  • [ Y ] = 433,738,152
  • [ Z ] = 2,147,483,647

• 

  with :

  • [ U ] = 43,813
  • [ V ] = 4,698
  • [ W ] = 2,147,483,647

go to Top Of Page

go to the next section : Epilog II --- The Fractions Equation

go to the last section : Section VII --- The { Chinese Remainder Theorem } revisited

return to the HomePage for { Structure of the Multiplication Table for [ Modulo P ] }

Original dated 2006-6-25 / Updated 2006-12-31