Exercise 2.9. Explain why the division theorem for a = 3 can be restated as follows: For a positive integer b, there exists a nonnegative integer q such that b equals either 3q, 3q + 1, or 3q + 2. Prove this result by induction, following the outline below: 1. First show that 1 can be written in the desired form. 2. Now suppose an integer b that is greater than or equal to 1 can be written in the desired form. Show that b+1 can also be so written. (Hint: There would appear to be three cases here, depending on whether b has the form 3q, 3q+1, or 3q+2, but really the first two can be combined into a single case. First assume thatb has the form 3q or 3g +1 for some nonnegative integer q and show that b+1 can be written in one of the three forms. Then assume that b has the form 3q + 2 for some nonnegative integer q and show that b+1 can be written in one of the three forms.) 3. Conclude by the principle of induction that every positive integer b can be written as 3q, 3q+ 1, or 3q + 2 for some nonnegative integer q. These two examples serve as models for a proof of the division theorem in general.

Exercise 2.9. Explain why the division theorem for a = 3 can be restated as follows: For a positive integer b, there exists a nonnegative integer q such that b equals either 3q, 3q + 1, or 3q + 2. Prove this result by induction, following the outline below: 1. First show that 1 can be written in the desired form. 2. Now suppose an integer b that is greater than or equal to 1 can be written in the desired form. Show that b+1 can also be so written. (Hint: There would appear to be three cases here, depending on whether b has the form 3q, 3q+1, or 3q+2, but really the first two can be combined into a single case. First assume thatb has the form 3q or 3g +1 for some nonnegative integer q and show that b+1 can be written in one of the three forms. Then assume that b has the form 3q + 2 for some nonnegative integer q and show that b+1 can be written in one of the three forms.) 3. Conclude by the principle of induction that every positive integer b can be written as 3q, 3q+ 1, or 3q + 2 for some nonnegative integer q. These two examples serve as models for a proof of the division theorem in general.

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

Suppose you're faced with 2 scenarios: (1) A negative value inside the parenthesis raised to an even power and (2) A negative value with no parenthesis raised to an even power. Do these two scenarios lead to the same result?
Please help me with these two questions. I am having trouble understanding what to do. Thank you
Hello, can you please help me with at least items d and e? I hope it's also explained well and has calculations if there are. I hope you don't do it in image form for easy copy. NOTE: Can you also not do it like this one: P(all three have disease)===≈P(D1∩D2∩D3)P(D1)·P(D2)·P(D3)(0.049)·(0.023)·(0.078)0.000088 Instead do it more simple like this: c)The probability that none of the three people have Alzheimer's =(1−0.049)*(1−0.023)*(1−0.078)=0.856655=(1-0.049)*(1-0.023)*(1-0.078)=0.856655 The probability that at least one of the individual have Alzheimer's =1−P(none of them have Alzheimers)=1−0.856655=0.143345
Please help solve this question into details for me. I want to use it to understand the concept of permutation and combinations. Thanks a lot. For this Big Problem, we’re going to investigate the different combinatorial formulas tofigure out why they are the way they are. Using Zoom! (1) Suppose you are organizing a Zoom meeting and invite ten people. You don’t knowwho all is coming so you watch people sign on one at a time. How many possibilitiesare there for the first, second, and third people to sign on? (2) What formula did you use for question one, and why? (3) Suppose you are running late so by the time you log on three people have alreadyarrived. How many possibilities are there for which three people are logged on? (4) What formula did you use for question three, and why? (5) You know that Person A, Person B, and Person C logged on before you but you don’tknow who came first. How many possibilities are there for the order of A, B, and Cto have signed on before you? (6) What…
Please elaborate more on this i could not understand
Help me fast so that I will give Upvote
This is a follow-up question. Please continue to solve from question 3 to 6. Thank you very much.
Question#10 Please provide justified answer for each part asap to get a upvote
Hello, I understand how to do it that way( I mean the way it's done in the picture send you) but how could I do it using the formula, n(n+1)/2 Is that the formula used for that question? Also if not, what formula could I use?
Please help me solve this abstract algebra problem with a better explanation. The MI stands for mathematical induction. Thank you.
You are looking at a math problem you did in the past with regards to Combinatorics. However, most of the work you are looking at is virtually unreadable and doesn't make sense. However, you are able to read the last line of your work. It's stated below: 20! 12! 14712 Ways. 15!5! 7!5! For this thinking evaluation, you have to come up with the original (but realistic) application word problem that could have had the above line written as the last step of the solution to this problem. To ensure maximum success, you should probably explain why you came up with the problem you did, as well as prove how the step written above must be the last line in the solution of the problem. Additionally, you probably want to talk about the step itself in terms of the mathematical components/key ideas/key features of Combinatorics that you have learned in Chapters 2 and 3. Good Luck!!
I am confused on how they got the numbers for the table. Can you explain it in a easy way that is not extremely long, thanks!