Solutions Manual - Concise Introduction To Pure Mathematics

Assume (\sqrt2 = p/q) in lowest terms ((p,q\in\mathbbZ), (\gcd(p,q)=1)). Squaring: (2q^2 = p^2 \Rightarrow p^2) even (\Rightarrow p) even. Write (p=2k). Then (2q^2 = 4k^2 \Rightarrow q^2 = 2k^2 \Rightarrow q) even. Contradiction since (\gcd(p,q)\ge 2). Hence (\sqrt2) irrational. Chapter 2 – Natural Numbers and Induction Exercise 2.3 Prove by induction: (1 + 2 + \dots + n = \fracn(n+1)2) for all (n\in\mathbbN).

Case 1: first digit odd (4 choices: 1,3,5,7,9? Actually 5 odds, but careful: first digit ≠0, so even allowed but handled separately). Better systematic: Choose positions for the two even digits: (\binom42=6) ways.

Digits 0–9, evens = 0,2,4,6,8, odds = 1,3,5,7,9. Concise Introduction To Pure Mathematics Solutions Manual

Work mod 7: (2^1\equiv 2,\ 2^2\equiv 4,\ 2^3\equiv 1 \pmod7) (since (8\equiv 1)). Thus (2^3k\equiv 1). Write (100 = 3\cdot 33 + 1). (2^100 = (2^3)^33\cdot 2^1 \equiv 1^33\cdot 2 \equiv 2 \pmod7). Remainder = 2.

Inverse of 3 mod 11: (3\times 4 = 12\equiv 1), so inverse is 4. Multiply both sides by 4: (x \equiv 20 \equiv 9 \pmod11). Check: (3\times 9=27\equiv 5) ✓. Chapter 4 – Real Numbers Exercise 4.1 Prove: if (x) is real and (x^2 < 1), then (-1 < x < 1). Assume (\sqrt2 = p/q) in lowest terms ((p,q\in\mathbbZ),

Find all cube roots of (-8).

Prove by contradiction: (\sqrt2) is irrational. Then (2q^2 = 4k^2 \Rightarrow q^2 = 2k^2 \Rightarrow q) even

Show (\sqrt3) is irrational.

Find remainder when (x^100) is divided by (x^2-1).