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

What is the correct argument involving the prime number 3 in the proof of √3?

Answer and explanation

Correct answer: If 3 divides u², then 3 divides u

The governing concept is the prime-divisor property of a square. If a prime p divides the square of an integer u, then p must divide u itself. This follows from prime factorisation: every prime factor in u² appears with twice its exponent, so the presence of 3 in u² means that 3 already occurs in the factorisation of u. Consequently, 3 ∣ u² implies 3 ∣ u. In the proof of √3, an equation such as u²=3v² first shows that 3 divides u², and this rule then gives 3 ∣ u. Option A states exactly this valid implication. Option B uses the wrong prime, option C wrongly requires u to be zero, and option D introduces an unrelated equality.

Related tags

Number-SystemsPrime-DivisibilitySqrt3Irrationality-ProofProof Of Irrationality Of Square Root 2 And Square Root 3Number SystemsMathematicsClass 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.