Home
Class 10
MATHS
Use Euclid's division lemma to show that...

Use Euclid's division lemma to show that the cube of any positive integer is of the form `9m`, `9m +1` or `9m + 8`.

Text Solution

Verified by Experts

The correct Answer is:
9m+8
Promotional Banner

Topper's Solved these Questions

  • REAL NUMBERS

    ZEN PUBLICATION|Exercise TEXTUAL EXERCISES (8.2)|7 Videos

  • REAL NUMBERS

    ZEN PUBLICATION|Exercise TEXTUAL EXERCISES (8.3)|5 Videos

  • REAL NUMBERS

    ZEN PUBLICATION|Exercise ADDITIONAL QUESTIONS(LONG ANSWER TYPE QUESTIONS )|5 Videos

  • QUADRATIC EQUATIONS

    ZEN PUBLICATION|Exercise ZEN ADDITIONAL QUESTIONS (IIT FOUNDATION)|5 Videos

  • SOME APPLICATIONS OF TRIGONOMETRY

    ZEN PUBLICATION|Exercise ADDITIONAL QUESTIONS (VALUE BASED QUESTIONS )|2 Videos

Similar Questions

Explore conceptually related problems

Use division algorithm to show that the cube of any positive integer is of the form 9 m, 9m + 1 or 9m + 8.

Use Euclid's division lemma to show that the square of any positive integer is either of the form 3m or 3m + 1 for some integer m . (Hint : Let x be any positive integer then it is of the form 3q , 3q +1 or 3q + 2 . Now square each of these and show that they can be rewritten in the form 3m or 3m + 1 .]

Use Euclid's division lemma to show that the square of any positive integer is either of the form 3m or 3m+1 for some integer m. [Hint : Let x be any positive integer then it is of the form 3q, 3q+1 or 3q+2. Now square each of these and show that they can be rewritten in the form 3m or 3m+1].

By Euclid's division lemma, show that the square of any positive integer is either of the form 3m or 3m+1 for some integer m.

Use division algorithm to show that the square of any positive integer is of the form 3p or 3p + 1.

Show that the square of any positive odd integer is of the form 4q + 1 for any integer q.

Show that the square of any odd integer is of the form 4q +1 for any integer q.

Show that square of any odd integer is of the form 4q + 1 for some integer q.

Use division algorithm to show that any positive odd integer is of the form 6q + 1, or 6q + 3 or 6q + 5, where q is some integer