Find the smallest integer $n$ such that an $n\times n$ square can be partitioned into $40\times 40$ and $49\times 49$ squares, with both types of squares present in the partition, if a) $40|n$; b) $49|n$; c) $n\in \mathbb N$.

Let $ABCD$ be a convex quadrilateral, and write $\alpha=\angle DAB$; $\beta=\angle ADB$; $\gamma=\angle ACB$; $\delta= \angle DBC$; and $\epsilon=\angle DBA$. Assuming that $\alpha<\pi/2$, $\beta+\gamma=\pi /2$, and $\delta+2\epsilon=\pi$, prove that \[(DB+BC)^2=AD^2+AC^2\] [Moderator edit: Also discussed at http://www.mathlinks.ro/Forum/viewtopic.php?t=30569 .]

The sequence $a_1, a_2,..., a_{2000}$ of real numbers satisfies the condition \[a_1^3+a_2^3+...+a_n^3=(a_1+a_2+...+a_n)^2\] for all $n$, $1\leq n \leq 2000$. Prove that every element of the sequence is an integer.