The only 3 consecutive odd numbers that are primes are 3,5,7

  • Thread starter Thread starter CmbkG
  • Start date Start date
  • Tags Tags
    Numbers Primes
Click For Summary
SUMMARY

The only three consecutive odd prime numbers are 3, 5, and 7. This conclusion is derived from analyzing three consecutive odd numbers represented as p, p+2, and p+4. By applying modular arithmetic, specifically modulo 3, it is established that at least one of these numbers must be divisible by 3. Since the only prime number divisible by 3 is 3 itself, the only valid set of consecutive odd primes is 3, 5, and 7.

PREREQUISITES
  • Understanding of prime numbers and their properties
  • Familiarity with modular arithmetic, specifically modulo 3
  • Basic knowledge of number theory concepts
  • Ability to analyze mathematical proofs
NEXT STEPS
  • Study the properties of prime numbers and their distribution
  • Learn more about modular arithmetic and its applications in number theory
  • Explore proofs involving divisibility and prime factorization
  • Investigate other sets of consecutive prime numbers and their characteristics
USEFUL FOR

Mathematics students, educators, and anyone interested in number theory and prime number properties will benefit from this discussion.

CmbkG
Messages
10
Reaction score
0

Homework Statement


Show that the only three consecutive numbers that are primes are 3,5,7.


Homework Equations





The Attempt at a Solution


let p, p+2, p+4 be three consecutive odd numbers
If p=0(mod3), p is divisible by 3
If p=1(mod 3), p+2 is divisible by 3
If p=2(mod3), p+4 is divisible by 3

This means at least one of p, p+2, p+4 is divisible by 3

Since we are looking for prime numbers 3 can be the only number that is divisible by 3. Therefore we only have 3 possible solutions:

-1,1,3
1,3,5
3,5,7

Since -1 and 1 are not primes the only possible solution is 3,5,7


-I no i have the solution here, its just i was helped with this and i don't quite understand why we bring in (mod3) is that just the way it is done or why do you include it??
 
Physics news on Phys.org
One way of proving that a number (or at least one of 3 numbers) isn't prime, is proving that it is divisible by another prime. We know the numbers are odd, so 3 is the next candidate.

One way of proving a result concerning divisibility by a particular number, is to consider all cases modulo that number, in this case p=0,1,2 (mod 3).
 

Similar threads

Replies
16
Views
3K
Replies
17
Views
3K
Replies
12
Views
4K
Replies
2
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
9
Views
3K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
14
Views
5K
  • · Replies 7 ·
Replies
7
Views
2K