0 like 0 dislike
0 like 0 dislike
Divisibility proof help pls

2 Answers

0 like 0 dislike
0 like 0 dislike
Hint: if n-3 = 7k, n-5 = 7j, then 2 = (n-3)-(n-5) = 7(k-j)
0 like 0 dislike
0 like 0 dislike
the reason youre not going to arrive at a contradiction usijg the parity of the two (even oddness) is because both n-3 and n-5 differ by 2, so they will have the same parity as each other and have opposite parity of n. if you know how to work with integers mod m, then I would work mod 7 and use some arithmetic to arrive a contradiction. if you haven't learned modular arithmetic, I would write the two numbers as a multiple of 7, then work with n and see how much more of a multiple of 7 it is.

No related questions found

24.8k questions

103k answers

0 comments

33.7k users

OhhAskMe is a math solving hub where high school and university students ask and answer loads of math questions, discuss the latest in math, and share their knowledge. It’s 100% free!