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

Combinatorics | Number Theory

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

Download Answer

Learn more about our help with Assignments: Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. Let a, b, c be any three integers. Define gcd(a, b, c), the gcd od a, b, c as a positive integer d s
2. When eggs in a basket are taken out 2, 3 , 4, 5 , 6at a time, there remain respectively 1, 2, 3, 4,
3. solve the linear congruence 17x≅9(mod 276), by using Chinese Remainder Theorem.
4. Find all integers which are equal to 11 times the sum of their digits.
5. If a pizza costs £2.85 to produce and is sold to the guest for £9.95, what percentage gross profit
6. Explain how would you find the empirical probability of rolling a 4 on a die?
7. A card is drawn at random from a standard deck. Find the theoretical probability that the card is ne