Ask your own question, for FREE!
Mathematics 16 Online
OpenStudy (anonymous):

i'm confused on a problem, it says that i need to write a proof for: For each integer m, if m is congruent to 5(mod 6), then.....

OpenStudy (anonymous):

if i were to say that m = 6^n-1 for it to be true for some integer n. would that be true

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!