Update

Muft Shiksha™ एक 100% Free Education Portal है 🇮🇳, जिसका उद्देश्य Class 9–12 के हर विद्यार्थी तक High-Quality Education को पूरी तरह मुफ्त पहुँचाना है। 🇮🇳 हम मानते हैं कि अच्छी शिक्षा किसी student की आर्थिक स्थिति पर निर्भर नहीं होनी चाहिए। 🇮🇳 हर विद्यार्थी को वही Quality Study Material, MCQs, Quizzes, Exam Preparation, Concept-Based Learning और Bilingual Support मिलना चाहिए, जो आमतौर पर महंगी Coaching या Premium Platforms में मिलता है। Muft Shiksha™ 🇮🇳 इसी सोच के साथ बनाया गया है

Subjects
0 reads0 ratings0 helpful

If (m,n) are coprime and both are proved even, what is the correct contradiction about (\gcd(m,n))?

Answer and explanation

Correct answer: \(\gcd(m,n)=1\) and \(\gcd(m,n)\ge 2\) cannot both be true

For coprime numbers, \(\gcd(m,n)=1\). However, if both \(m\) and \(n\) are even, then 2 is a common divisor, so \(\gcd(m,n)\ge 2\). The greatest common divisor cannot be 1 and at least 2 at the same time; this is the contradiction that disproves the initial assumption. Exam tip: whenever both numbers are even, immediately identify 2 as their common divisor.

Related tags

Number SystemsGreatest Common DivisorProof By ContradictionIrrationality ProofsProof Of Irrationality Of Square Root 2 And Square Root 3MathematicsClass 9 Mcq

Was this question useful?

No ratings yetWrite a review / Rate this question

Student Reviews

No published reviews yet.

Add Muft Shiksha to your Home Screen

In Safari, tap Share, then Add to Home Screen.