Find the conditions that the functions $M(x, y)$ and $N (x, y)$ must satisfy in order that the differential equation $Mdx + Ndy =0$ shall have an integrating factor of the form $f(xy).$ You may assume that $M$ and $N$ have continuous partial derivatives of all orders.

We define a sequence with $a_1=850$ and $$a_{n+1}=\frac{a_n^2}{a_n-1}$$ for $n\geq 1$. Find all values of $n$ for which $\lfloor a_n\rfloor =2024$.

Calculate the sum of matrix commutators $[A, [B, C]] + [B, [C, A]] + [C, [A, B]]$, where $[A, B] = AB-BA$

$4$ men stand at the entrance of a dark tunnel. Man $A$ needs $10$ minutes to pass through the tunnel, man $B$ needs $5$ minutes, man $C$ needs $2$ minutes and man $D$ needs $1$ minute. There is only one torch, that may be used from anyone that passes through the tunnel. Additionaly, at most $2$ men can pass through at the same time using the existing torch. Determine the smallest possible time the four men need to reach the exit of the tunnel.

With $ \$1000$ a rancher is to buy steers at $ \$25$ each and cows at $ \$26$ each. If the number of steers $ s$ and the number of cows $ c$ are both positive integers, then: $ \textbf{(A)}\ \text{this problem has no solution}\qquad\\ \textbf{(B)}\ \text{there are two solutions with }{s}\text{ exceeding }{c}\qquad \\ \textbf{(C)}\ \text{there are two solutions with }{c}\text{ exceeding }{s}\qquad \\ \textbf{(D)}\ \text{there is one solution with }{s}\text{ exceeding }{c}\qquad \\ \textbf{(E)}\ \text{there is one solution with }{c}\text{ exceeding }{s}$

A computer program generates a sequence of numbers with the following rule: the first number is written by Camilo; thereafter, the program calculates the integer division of the last number generated by $18$; thus obtains a quotient and a remainder. The sum of that quotient plus that remainder is the next number generated. For example, if Camilo's number is $5291,$ the computer makes $5291 = 293 \times 18 + 17$, and generates $310 = 293 + 17$. The next number generated will be $21$, since $310 = 17 \times 18 + 4$ and $17 + 4= 21$; etc Whatever Camilo's initial number is, from some point on, the computer always generates the same number. Determine what is that number that will be repeated indefinitely, if Camilo's initial number is equal to $2^{110}.$

Let $ABDE, BCFZ$ and $CAKL$ be three arbitrary rectangles constructed outside a triangle $ABC$. Let $EF$ meet $ZK$ at $M$, and $N$ be the intersection of the lines through $F,Z$ perpendicular to $FL,ZD$. Prove that $A,M,N$ are collinear. Kostas Vittas

Fill in each white hexagon with a positive digit from $1$ to $9$. Some digits have been given to you. Each of the seven gray hexagons touches six hexagons; these six hexagons must contain six distinct digits, and the sum of these six digits must equal the number inside the gray hexagon. [img]https://cdn.artofproblemsolving.com/attachments/2/8/a00d0605bc81430e8ed4ae108befb037c4b00b.png[/img] You do not need to prove that your answer is the only one possible; you merely need to find an answer that satisfies the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable.)

If a triangle has side lengths $a,b,c$ where $a\leq 2 \leq b \leq 3$, what is the largest possible value of its area? $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 6 \qquad\textbf{(E)}\ \text{None of above} $

Let $BCB'C'$ be a rectangle, let $M$ be the midpoint of $B'C'$, and let $A$ be a point on the circumcircle of the rectangle. Let triangle $ABC$ have orthocenter $H$, and let $T$ be the foot of the perpendicular from $H$ to line $AM$. Suppose that $AM=2$, $[ABC]=2020$, and $BC=10$. Then $AT=\frac{m}{n}$, where $m$ and $n$ are positive integers with $\gcd(m,n)=1$. Compute $100m+n$. [i]Proposed by Ankit Bisain[/i]

For integers $n \ge k \ge 0$ we define the [i]bibinomial coefficient[/i] $\left( \binom{n}{k} \right)$ by \[ \left( \binom{n}{k} \right) = \frac{n!!}{k!!(n-k)!!} .\] Determine all pairs $(n,k)$ of integers with $n \ge k \ge 0$ such that the corresponding bibinomial coefficient is an integer. [i]Remark: The double factorial $n!!$ is defined to be the product of all even positive integers up to $n$ if $n$ is even and the product of all odd positive integers up to $n$ if $n$ is odd. So e.g. $0!! = 1$, $4!! = 2 \cdot 4 = 8$, and $7!! = 1 \cdot 3 \cdot 5 \cdot 7 = 105$.[/i]

What is the greatest number of rays in space beginning at one point and forming pairwise obtuse angles?

In a $5 \times 5$ checkered square, the middle row and middle column are colored gray. You leave the corner cell and move to the cell adjacent to the side with each move. For each transition from a gray cell to a gray one you need to pay a ruble. What is the smallest number of rubles you need to pay to go around all the squares of the board exactly once (it is not necessary to return to the starting square)?

For every triangle $ ABC$, let $ D,E,F$ be a point located on segment $ BC,CA,AB$, respectively. Let $ P$ be the intersection of $ AD$ and $ EF$. Prove that: \[ \frac{AB}{AF}\times DC\plus{}\frac{AC}{AE}\times DB\equal{}\frac{AD}{AP}\times BC\]

Let $ r$, $ s$ be two positive integers and $ P$ a 'chessboard' with $ r$ rows and $ s$ columns. Let $ M$ denote the maximum value of rooks placed on $ P$ such that no two of them attack each other. (a) Determine $ M$. (b) How many ways to place $ M$ rooks on $ P$ such that no two of them attack each other? [Note: In chess, a rook moves and attacks in a straight line, horizontally or vertically.]

Starting with the sequence $\text{AAAIEE}$, we replace $\text{AIE}$ with $\text{EA}$, $\text{AE}$ with $\text{IE}$, $\text{E}$ with $\text{AI}$. After repeating replace operations many times, which of the following cannot be got? $ \textbf{(A)}\ \text{AIAIIAI} \qquad\textbf{(B)}\ \text{AIAIAI} \qquad\textbf{(C)}\ \text{AIAAA} \qquad\textbf{(D)}\ \text{AIAA} \qquad\textbf{(E)}\ \text{None of the preceding} $

The math problem book contains $300$ problems. The teacher has cards with numbers. She pins these cards to a special stand and indicates the numbers of four problems that need to be solved during the lesson. What is the smallest number of cards that a teacher can use in order to be able to indicate the numbers of any four problems from the problem book?