Section 0.2

Problems

[6/100%]
Show
LaTeX
Problem 0.10

Find the error in the following proof that 2=12=1. Consider the equation a=ba=b. Multiply both sides by aa to obtain a2=aba^{2}=a b. Subtract b2b^{2} from both sides to get a2−b2=ab−b2a^{2}-b^{2}=a b-b^{2}. Now factor each side, (a+b)(a−b)=b(a−b)(a+b)(a-b)=b(a-b), and divide each side by (a−b)(a-b) to get a+b=ba+b=b. Finally, let aa and bb equal 1, which shows that 2=12=1.

?
Problem 0.11

Let S(n)=1+2+⋯+nS(n)=1+2+\cdots +n be the sum of the first nn natural numbers and let C(n)=13+23+⋯+n3C(n)=1^{3}+2^{3}+\cdots +n^{3} be the sum of the first nn cubes. Prove the following equalities by induction on nn, to arrive at the curious conclusion that C(n)=S2(n)C(n)=S^{2}(n) for every nn.

?
(a)

S(n)=12n(n+1)S(n)=\frac{1}{2} n(n+1).

(b)

C(n)=14(n4+2n3+n2)=14n2(n+1)2C(n)=\frac{1}{4}\left(n^{4}+2 n^{3}+n^{2}\right)=\frac{1}{4} n^{2}(n+1)^{2}.

Problem 0.12

Find the error in the following proof that all horses are the same color. Claim: In any set of hh horses, all horses are the same color. Proof: By induction on hh. Basis: For h=1h=1. In any set containing just one horse, all horses clearly are the same color. Induction step: For k≥1k \geq 1, assume that the claim is true for h=kh=k and prove that it is true for h=k+1h=k+1. Take any set HH of k+1k+1 horses. We show that all the horses in this set are the same color. Remove one horse from this set to obtain the set H1H_{1} with just kk horses. By the induction hypothesis, all the horses in H1H_{1} are the same color. Now replace the removed horse and remove a different one to obtain the set H2H_{2}. By the same argument, all the horses in H2H_{2} are the same color. Therefore, all the horses in HH must be the same color, and the proof is complete.

?
Problem 0.13

Show that every graph with two or more nodes contains two nodes that have equal degrees.

?
Problem 0.14
  • ᴬ Ramsey's theorem. Let GG be a graph. A clique in GG is a subgraph in which every two nodes are connected by an edge. An anti-clique, also called an independent set, is a subgraph in which every two nodes are not connected by an edge. Show that every graph with nn nodes contains either a clique or an anti-clique with at least 12log⁡2n\frac{1}{2} \log_{2} n nodes.
?
Problem 0.15

ᴬ Use Theorem 0.25 to derive a formula for calculating the size of the monthly payment for a mortgage in terms of the principal PP, the interest rate II, and the number of payments tt. Assume that after tt payments have been made, the loan amount is reduced to 0. Use the formula to calculate the dollar amount of each monthly payment for a 30 -year mortgage with 360 monthly payments on an initial loan amount of $100,000 with a 5 annual interest rate.

?