Prove by contradiction: (\sqrt2) is irrational.
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.
Find all cube roots of (-8).
Show (\sqrt3) is irrational.
Find remainder when (x^100) is divided by (x^2-1).
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).
Choose 2 positions for evens: (\binom42=6). Fill evens: (5^2) ways (0–8 evens). Fill odds: (5^2) ways. Total = (6 \times 25 \times 25 = 3750).
[ A\cup B = 1,2,3,4,\quad A\cap B = 2,3 ] [ A\setminus B = 1,\quad B\setminus A = 4 ] Remark : Set difference removes elements of the second set from the first.
Solve (3x \equiv 5 \pmod11).
Induction: Base (n=1): (1-1=0) divisible by 3. Assume (3 \mid k^3-k). Then [ (k+1)^3-(k+1) = k^3+3k^2+3k+1 - k -1 = (k^3-k) + 3(k^2+k) ] Both terms divisible by 3 → sum divisible by 3. QED. Chapter 3 – Integers and Modular Arithmetic Exercise 3.2 Find the remainder when (2^100) is divided by 7.
But must exclude numbers starting with 0? If first digit is 0, it’s not a 4‑digit number. Count invalid: Fix first digit=0 and it’s one of the two even positions. Choose other even position (3 ways), fill that even (5 ways). Fill two odd positions (5^2). So invalid = (3\times 5\times 25 = 375). Valid = (3750 - 375 = 3375).
(x^2 < 1 \Rightarrow x^2 -1 < 0 \Rightarrow (x-1)(x+1) < 0). Product negative iff one factor positive, the other negative. Case 1: (x-1<0) and (x+1>0) → (x<1) and (x>-1) → (-1<x<1). Case 2: (x-1>0) and (x+1<0) impossible (would require (x>1) and (x<-1)). Thus (-1<x<1).
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).
: 3375. Chapter 9 – Sequences and Series Exercise 9.1 Prove (\lim_n\to\infty \frac3n+12n+5 = \frac32).
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.