Show that if n is an odd prime number it is not necessarily true that n + 2 is prime.
Added by Dream F.
Step 1
Examples of odd prime numbers are 3, 5, 7, 11, 13, etc. Now, let's consider the statement that n + 2 is prime. This means that if n is an odd prime number, then the number that is two more than n is also a prime number. Let's test this statement with an example. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Vysakh M and 66 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Show that if n is an odd prime number, it is not necessarily true that n + 2 is prime. 2. Prove that the sum of two distinct odd integers is even.
Nick J.
Prove or disprove: For every positive integer n, n2-2 is not prime, it is not necessary for n to be odd.
Madhur L.
Show that $n$ is prime if and only if $\phi(n)=n-1$
Number Theory and Cryptography
Primes and Greatest Common Divisors
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD