Assign a grade of A (correct), C (partially correct), or F (failure) to each. Justify assignments of grades other than A.
(a) Claim. For all natural numbers n, 5 divides 8n − 3n
“Proof.” Suppose there is such that 5 does not divide8n − 3n. Then by the WOP there is a smallest such natural number t. Now since 5 does divide 81 – 31. Therefore t – 1 is a natural number smaller than t, so 5 divides 8t−1 − 3 t−1 But then 5 divides 8(8t−1 − 3 t−1 ) and 5 divides 5(3 t−1) so 5 divides their sum, which is 8t − 3t. This is a contradiction. Therefore, 5 divides 8n − 3n for all
_ (b) Claim. For every natural number n, 3 divides n3 + 2n + 1.
“Proof.” Suppose there is a natural number n such that 3 does not divide n3 + 2n + 1 By the WOP, there is a smallest such number. Call this number m. Then m − 1 is a natural number and 3 does divide
But 3 also divides 3m2 − 3m + 3 so 3 divides the sum of these two expressions, which is m3 + 2m + 1. This contradicts what we know about m. Therefore, the set must be empty. Therefore, 3 divides n3 + 2n + 1, for every natural number n.
(c) Claim. The PCI implies the WOP.
“Proof.” Assume the PCI. Let T be a nonempty subset of Then T has some element x. Then By the PCI,
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.