#Divisible by 7 proof
20 messages · Page 1 of 1 (latest)
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close
- Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
what
ive always used last digit times 2 and minus the original
oh its the same thing
uhh try like 100a+10b+c
if 7 | a + 5b, then 7 | n(a + 5b) for any n, see if you can find something convenient
Are you familiar with modular arithmetic?
@rare oxide yep, I tried to approach it but couldn't figure how to start it
like I get the last digit is n (mod 10) but like im not sure on the next steps
e
I have taken a different route that I think makes sense.
i think this is a little bit easier but yeah
50b = 7*7b+b so 7|a+5b => 7|10a+50b => 7|10a+b
+close