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 n² is divisible by 3 for an integer n, which statement about n must be true?

Answer and explanation

Correct answer: n is divisible by 3

Since 3 is prime, an integer leaves remainder 0, 1, or 2 on division by 3. The squares of remainders 1 and 2 both leave remainder 1. Thus, for n² to leave remainder 0, n must leave remainder 0 and be divisible by 3. Exam tip: this result is central to the proof that √3 is irrational.

Related tags

Number SystemsIrrationality ProofSquare Root 3DivisibilityPrime NumbersProof 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.