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

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Topic Video
Question
Use Euclid's division lemma to show that the cube of any positive integer is of the form 9m ,9m+1,or9m+8 ?
5. Use Euclid's division lemma to show that the cube of any positive integer is of the form
9m, 9m+1 or 9m+8.
1.3 The Fundamental Theorem of Arithmetic
In your earlier classes, you have seen that any natural number can be written as a
product of its prime factors. For instance, 2 2, 4 2 x 2, 253 = 11 x 23, and so on.
Now, let us try and look at natural numbers from the other direction. That is, can any
natural number be obtained by multiplying prime numbers? Let us see.
Take any collection of prime numbers, say 2, 3, 7, 11 and 23. If we multiply
some or all of these numbers, allowing them to repeat as many times as we wish,
we can produce a large collection of posi
Let us list a few:
integers (In fact, infinitely many).
7x 11 x 23 1771
3 x7x11 x 23 = 5313
2x 3x7x 11 x 23 = 10626
2 x 3 x 7 8232
22 x 3 x 7x 11 x 23 = 21252
and so on.
Now, let us suppose your collection of primes includes all the possible primes.
What is your guess about the size of this collection? Does it contain only a finite
number of integers, or infinitely many? Infact, there are infinitely many primes. So, if
we ombine all these primes in all possible ways, we will get an infinite collection of
SHOT ON OPPO
Transcribed Image Text:5. Use Euclid's division lemma to show that the cube of any positive integer is of the form 9m, 9m+1 or 9m+8. 1.3 The Fundamental Theorem of Arithmetic In your earlier classes, you have seen that any natural number can be written as a product of its prime factors. For instance, 2 2, 4 2 x 2, 253 = 11 x 23, and so on. Now, let us try and look at natural numbers from the other direction. That is, can any natural number be obtained by multiplying prime numbers? Let us see. Take any collection of prime numbers, say 2, 3, 7, 11 and 23. If we multiply some or all of these numbers, allowing them to repeat as many times as we wish, we can produce a large collection of posi Let us list a few: integers (In fact, infinitely many). 7x 11 x 23 1771 3 x7x11 x 23 = 5313 2x 3x7x 11 x 23 = 10626 2 x 3 x 7 8232 22 x 3 x 7x 11 x 23 = 21252 and so on. Now, let us suppose your collection of primes includes all the possible primes. What is your guess about the size of this collection? Does it contain only a finite number of integers, or infinitely many? Infact, there are infinitely many primes. So, if we ombine all these primes in all possible ways, we will get an infinite collection of SHOT ON OPPO
A SHOT ON OPPO
5. Use Euclid's division lemma to show that the cube of any positive integer is of the form
9m, 9m+ 1 or 9m+8.
3 The Fundamental Theorem of Arithmetic
a your earlier classes, you have seen that any natural number can be written as a
roduct of its prime factors. For instance, 2 = 2, 4 = 2 x 2, 253 = 11 × 23, and so on.
Fow, let us try and look at natural numbers from the other direction. That is, can any
atural number be obtained by multiplying prime numbers? Let us see.
Take any collection of prime numbers, say 2, 3, 7, 11 and 23. If we multiply
me or all of these numbers, allowing them to repeat as many times as we wish,
e can produce a large collection of positive integers (In
t us list a few :
infinitely many).
7x 11 x 23 = 1771
3 x 7x 11 x 23 = 5313
2x 3x 7x 11 x 23 = 10626
2x 3 x 7x 11 x 23 = 21252
2 x 3 x 73 8232
SO on.
Now, let us suppose your collection of primes includes all the possible primes.
is your guess about the size of this collection? Does it contain only a finite
er of integers, or infinitely many? Infact, there are infinitely many primes. So, if
mbine all these primes in all possible ways, we will get an infinite collection of
ers, all the primes and all possible products of primes,
on is
Transcribed Image Text:A SHOT ON OPPO 5. Use Euclid's division lemma to show that the cube of any positive integer is of the form 9m, 9m+ 1 or 9m+8. 3 The Fundamental Theorem of Arithmetic a your earlier classes, you have seen that any natural number can be written as a roduct of its prime factors. For instance, 2 = 2, 4 = 2 x 2, 253 = 11 × 23, and so on. Fow, let us try and look at natural numbers from the other direction. That is, can any atural number be obtained by multiplying prime numbers? Let us see. Take any collection of prime numbers, say 2, 3, 7, 11 and 23. If we multiply me or all of these numbers, allowing them to repeat as many times as we wish, e can produce a large collection of positive integers (In t us list a few : infinitely many). 7x 11 x 23 = 1771 3 x 7x 11 x 23 = 5313 2x 3x 7x 11 x 23 = 10626 2x 3 x 7x 11 x 23 = 21252 2 x 3 x 73 8232 SO on. Now, let us suppose your collection of primes includes all the possible primes. is your guess about the size of this collection? Does it contain only a finite er of integers, or infinitely many? Infact, there are infinitely many primes. So, if mbine all these primes in all possible ways, we will get an infinite collection of ers, all the primes and all possible products of primes, on is
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 6 steps

Blurred answer
Knowledge Booster
Propositional Calculus
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,