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.
Multiply numerator and denominator by conjugate (1+i): [ \frac(2+3i)(1+i)(1-i)(1+i) = \frac2+2i+3i+3i^21+1 = \frac2+5i-32 = \frac-1+5i2 = -\frac12 + \frac52i ] Concise Introduction To Pure Mathematics Solutions Manual
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). Case 1: first digit odd (4 choices: 1,3,5,7,9
[ 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. Multiply numerator and denominator by conjugate (1+i): [
Let remainder be (ax+b). Write (x^100 = (x^2-1)Q(x) + ax+b). Set (x=1): (1 = a+b). Set (x=-1): (1 = -a+b). Solve: adding → (2=2b \Rightarrow b=1,\ a=0). Remainder = 1. Chapter 7 – Relations and Functions Exercise 7.2 Define relation (R) on (\mathbbZ) by (aRb) if (a-b) is even. Prove (R) is an equivalence relation.
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.