Twin Primes remainders

Twin primes are multiplied together and then divided by 9, what is the remainder?

This holds true except for 1 exception.

Note: Twin primes are primes that differ by 2. For example, 3 and 5 are twin primes because they are primes and 2 apart.

5 2 7 8 1 4 3

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.

2 solutions

William Allen
Feb 28, 2019

The twin primes will take the form 3 n 1 3n-1 and 3 n + 1 3n+1

So we have ( 3 n 1 ) ( 3 n + 1 ) = 9 n 2 1 9 ( n 2 9 ) + 8 (3n-1)(3n+1) = 9n^2-1 \\ \implies 9(n^2-9) + 8

So we have remainder 8

Exception is 3 × 5 6 ( m o d 9 ) 3\times 5 \equiv 6 \pmod{9}

Unsure as to why this has just been noticed but should read;

( 3 n 1 ) ( 3 n + 1 ) = 9 n 2 1 = 9 ( n 2 1 ) + 8 (3n-1)(3n+1)=9n^2-1=9(n^2-1)+8

William Allen - 1 year, 10 months ago
Daniel Hinds
Feb 28, 2019

Let p p and p + 2 p+2 be twin primes. Assuming p 3 p\neq3 , neither p p nor p + 2 p+2 can be a multiple of 3, and since every triple of consecutive integers must contain one multiple of 3, that means p + 1 p+1 is a multiple of 3. Thus, we have p = 3 k 1 p=3k-1 and p + 2 = 3 k + 1 p+2=3k+1 for some integer k k , so:

p ( p + 2 ) = ( 3 k 1 ) ( 3 k + 1 ) = 9 k 2 1 = 9 ( k 2 1 ) + 8 p ( p + 2 ) 8 ( m o d 9 ) p 3 \begin{aligned} p(p+2) &= (3k-1)(3k+1) &\\ &= 9k^2 - 1 &\\ &= 9(k^2-1) + 8 &\\\\ \therefore p(p+2) &\equiv 8 \pmod{9} & p \neq 3 \end{aligned}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...