Find remainder when (x^100) is divided by (x^2-1).
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.
[ 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. Concise Introduction To Pure Mathematics Solutions Manual
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.
Digits 0–9, evens = 0,2,4,6,8, odds = 1,3,5,7,9. Find remainder when (x^100) is divided by (x^2-1)
[ \left|\frac3n+12n+5 - \frac32\right| = \left|\frac2(3n+1) - 3(2n+5)2(2n+5)\right| = \left|\frac-132(2n+5)\right| = \frac132(2n+5) < \frac134n ] Given (\varepsilon>0), choose (N > \frac134\varepsilon). Then for (n\ge N), (\frac134n<\varepsilon), so the difference (<\varepsilon). QED. Chapter 10 – Continuity and Limits Exercise 10.4 Show (f(x)=x^2) is continuous at (x=2).
Subcase A: first digit is even. Then first digit ∈ 2,4,6,8 (4 ways), other even digit ∈ 0,2,4,6,8 \ first digit choice? Wait, repetition allowed? Usually yes unless stated. Let’s assume repetition allowed unless “exactly two even digits” means count of even digits =2, not positions. Then easier: Write (100 = 3\cdot 33 + 1)
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.