menu
QAmmunity.org
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Ask a Question
Questions
Unanswered
Tags
Categories
Ask a Question
Let p be a prime number such that p>2. Use the proof by contradiction to show that at least one of numbers p−1 and p+1 is divisible by 4.
asked
Sep 24, 2021
53.6k
views
3
votes
Let p be a prime number such that p>2. Use the proof by contradiction to show that at least one of numbers p−1 and p+1 is divisible by 4.
Mathematics
middle-school
ErsatzRyan
asked
by
ErsatzRyan
6.1k
points
answer
comment
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
4
votes
p can be 11
-11 is a prime number because it can only be divided by 11 or 1
- 11 + 1 is 12
- 12 is divisible be 4
p can also be 13
-13 is a prime number because it can only be divided by 13 or 1
- 13 minus 1 is 12
- 12 is divisible by 4
Paquetp
answered
Sep 28, 2021
by
Paquetp
5.8k
points
ask related question
comment
share this
0 Comments
Please
log in
or
register
to add a comment.
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.
7.2m
questions
9.6m
answers
Other Questions
How do you estimate of 4 5/8 X 1/3
Please solve the following equation. x-6x=56
whats the most accurate estimation of 65+77
Find the additive inverse of 18/23
What is 25% of 500.00
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
Search QAmmunity.org