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
7.3k
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
6.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.
8.8m
questions
11.4m
answers
Other Questions
How do you can you solve this problem 37 + y = 87; y =
How do you estimate of 4 5/8 X 1/3
A bathtub is being filled with water. After 3 minutes 4/5 of the tub is full. Assuming the rate is constant, how much longer will it take to fill the tub?
i have a field 60m long and 110 wide going to be paved i ordered 660000000cm cubed of cement how thick must the cement be to cover field
Write words to match the expression. 24- ( 6+3)
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
Search QAmmunity.org