Mathematics · Number Theory
For positive integers m and n, let gcd(m, n) denote their greatest common divisor. Let m > n be such that gcd(m, n) = 1. Which of the following statements is true?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1gcd(m - n, m + n) can be an odd prime
- 2There always exist integers x, y such that nx - my = 3
- 3gcd(m - n, m + n) can have a prime divisor✓
- 4gcd(m - n, m + n) is always equal to 1
Correct answer
gcd(m - n, m + n) can have a prime divisor
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Number Theory MCQs →Want more practice questions on Number Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Number Theory