64 667
Assignments Done
Successfully Done
In September 2018

Answer to Question #33895 in Combinatorics | Number Theory for eka

Question #33895
prove that gcd (n-1, n+1)= 1 or 2 for each n>=2 and gcd (2n-1, 2n+1)= 1 for each n>=7.
Expert's answer

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!


No comments. Be first!

Leave a comment

Ask Your question

Privacy policy Terms and Conditions