Problems

Solution: \(c_r = \binom{n}{r}a^{n-r}b^r\) \begin{align*} && c_m &\geq c_{m+1} \\ \Rightarrow && \binom{n}{m} a^{n-m}b^m &\geq \binom{n}{m+1} a^{n-m-1}b^{m+1} \\ \Rightarrow && \frac{1}{(n-m)}a &\geq \frac{1}{m+1}b \\ \Rightarrow && (m+1)a &\geq (n-m)b \\ \Rightarrow && m(a+b) &\geq nb -a \\ \Rightarrow && m &\geq \frac{n(b+1)-a-b}{a+b}=\frac{n(b+1)}{a+b} - 1 \\ \\ && c_m &\geq c_{m-1} \\ \Rightarrow && \binom{n}{m} a^{n-m}b^m &\geq \binom{n}{m-1} a^{n-m+1}b^{m-1} \\ \Rightarrow && \frac{1}m b &\geq \frac{a}{(n-m+1)} \\ \Rightarrow && (n-m+1)b &\geq ma \\ \Rightarrow && (n+1)b &\geq m(a+b) \\ \Rightarrow && m &\leq \frac{(n+1)b}{a+b} \end{align*} Since \(m\) lies between two values \(1\) apart is is either equal to one of those two values or is the unique integer between them. Let \(\displaystyle G(n,a,b) = \left \lfloor \frac{b(n+1)}{a+b} \right \rfloor\), so

1. \(\,\) \begin{align*} && G(9,1,3) &= \left \lfloor \frac{3(9+1)}{1+3} \right \rfloor \\ &&&= \left \lfloor \frac{30}{4} \right \rfloor \\ &&&= 7 \\ \\ && G(9,2,3) &= \left \lfloor \frac{3(9+1)}{2+3} \right \rfloor \\ &&&= \left \lfloor \frac{30}{5} \right \rfloor \\ &&&= 6 \end{align*}
2. \(\,\) \begin{align*} && G(2k, a, a) &= \left \lfloor \frac{a(2k+1)}{a+a} \right \rfloor \\ && &= \left \lfloor \frac{2k+1}{2} \right \rfloor \\ &&&= k \\ \\ && G(2k-1, a, a) &= \left \lfloor \frac{a(2k-1+1)}{a+a} \right \rfloor \\ && &= \left \lfloor k\right \rfloor \\ &&&= k \\ \end{align*}
3. \(G(n,a,b)\) is decreasing in \(a\), therefore take \(a = 1\).
4. For fixed \(n\), we are looking at \(\frac{a(n+1)}{a+b}\) and we want this to be as large as possible. By considering \((n+1) - \frac{b(n+1)}{a+b}\) we can see this is increasing in \(b\) and the largest value possible is \(n\). This is achieved when \begin{align*} && \frac{b(n+1)}{a+b} & \geq n \\ \Leftrightarrow && bn + b &\geq na + bn \\ \Leftrightarrow && b& \geq na \end{align*}

Solution: We can always rotate the circle so that sides are parallel to the \(x\) and \(y\) axes. Therefore if one corner is \((a,b)\) the other coordinates are \((-a,b), (a,-b), (-a,-b)\) and the perimeter will be \(4(a+b)\). Therefore we wish to maximise \(4(a+b)\) subject to \(a^2+b^2 = \text{some constant}\). Notice that \(\frac{a+b}{2} \leq \sqrt{\frac{a^2+b^2}{2}}\) with equality when \(a = b\), therefore the maximum is a square. If \(n = 2\) then we are looking at \(2((2a)^2+(2b)^2) = 8(a^2+b^2)\) which is constant for all rectangles. If \(n=3\) we are maximising \(16(a^3+b^3) = 16(a^3+(c^2-a^2)^{3/2})\) which is maximised when \(a = 0, c\)

Solution: The area for \(\alpha\) fixed is \(\frac12 r^2 \sin \alpha + \frac12 r^2 \sin \theta + \frac12 r^2 \sin (\pi - \theta - \alpha)\) So we wish to maximise \(V = \sin \theta + \sin(\pi - \theta-\alpha)\) \begin{align*} && V &= \sin \theta + \sin(\pi - \theta-\alpha)\\ &&&= 2\sin \l \frac{\pi-\alpha}2\r\cos \l \frac{2\theta + \alpha - \pi}{2}\r \end{align*} The largest \(\cos\) can be is \(1\) when \(\displaystyle 2\theta + \alpha - \pi = 0 \Rightarrow \theta = \frac{\pi-\alpha}2\). (ie we split the remaining area exactly in half). We are now trying to maximise \(W = \sin \alpha + 2 \sin \frac{\pi - \alpha}2\) ie \begin{align*} && W &= \sin \alpha + 2 \cos \frac{\alpha}{2} \\ \Rightarrow && \frac{\d W}{\d \alpha} &= \cos \alpha-\sin \frac{\alpha}{2} \\ &&&= 1-2 \sin^2 \frac{\alpha}{2} - \sin \frac{\alpha}{2} \\ &&&= (1+\sin \frac{\alpha}{2})(1-2\sin \frac{\alpha}{2}) \end{align*} Therefore \(\frac{\alpha}{2} = -\frac{3\pi}{2}, \frac{\alpha}{2} = \frac{\pi}{6}, \frac{5\pi}{6} \Rightarrow \alpha = -3\pi, \frac{\pi}{3}, \frac{5\pi}{3}\). The only turning point in our range is \(\frac{\pi}{3}\). This is obvious a a maximum by symmetry or checking the end points, but we could also check the second derivative \(\frac{\d^2 W}{\d \alpha^2} = -\sin \frac{\pi}{3}-\cos \frac{\pi}{3} < 0\) so we have a maximum. Therefore the largest possible area is: \(\displaystyle \frac{3\sqrt{3}}{4}r^2\)