Each of $27$ bricks (right rectangular prisms) has dimensions $a \times b \times c$, where $a$, $b$, and $c$ are pairwise relatively prime positive integers. These bricks are arranged to form a $3 \times 3 \times 3$ block, as shown on the left below. A $28$[sup]th[/sup] brick with the same dimensions is introduced, and these bricks are reconfigured into a $2 \times 2 \times 7$ block, shown on the right. The new block is $1$ unit taller, $1$ unit wider, and $1$ unit deeper than the old one. What is $a + b + c$? [img]https://cdn.artofproblemsolving.com/attachments/2/d/b18d3d0a9e5005c889b34e79c6dab3aaefeffd.png[/img] $ \textbf{(A) }88 \qquad \textbf{(B) }89 \qquad \textbf{(C) }90 \qquad \textbf{(D) }91 \qquad \textbf{(E) }92 \qquad $

The number \[ \frac 2{\log_4{2000^6}}+\frac 3{\log_5{2000^6}} \] can be written as $\frac mn$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Let $f(x)=x^2+4x+2$. Let $r$ be the difference between the largest and smallest real solutions of the equation $f(f(f(f(x))))=0$. Then $r=a^{\frac{p}{q}}$ for some positive integers $a$, $p$, $q$ so $a$ is square-free and $p,q$ are relatively prime positive integers. Compute $a+p+q$.

Find all pairs of positive integers $(m,n)$ for which there exist relatively prime integers $a$ and $b$ greater than $1$ such that $$\frac{a^m+b^m}{a^n+b^n}$$ is an integer.

Find the number of rationals $\frac{m}{n}$ such that (i) $0 < \frac{m}{n} < 1$; (ii) $m$ and $n$ are relatively prime; (iii) $mn = 25!$.

How many positive integers less that $200$ are relatively prime to either $15$ or $24$?

Let $n$ be an integer of the form $a^2 + b^2$, where $a$ and $b$ are relatively prime integers and such that if $p$ is a prime, $p \leq \sqrt{n}$, then $p$ divides $ab$. Determine all such $n$.

Trapezoid $ABCD$ has sides $AB=92$, $BC=50$, $CD=19$, and $AD=70$, with $AB$ parallel to $CD$. A circle with center $P$ on $AB$ is drawn tangent to $BC$ and $AD$. Given that $AP=\frac mn$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.

Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$. [i]Proposed by Jaroslaw Wroblewski, Poland[/i]

For all positive integer $ n\geq 2$, prove that product of all prime numbers less or equal than $ n$ is smaller than $ 4^{n}$.

Given $a_0 > 1$, the sequence $a_0, a_1, a_2, ...$ is such that for all $k > 0$, $a_k$ is the smallest integer greater than $a_{k-1}$ which is relatively prime to all the earlier terms in the sequence. Find all $a_0$ for which all terms of the sequence are primes or prime powers.

Given a triangle, its midpoint triangle is obtained by joining the midpoints of its sides. A sequence of polyhedra $P_{i}$ is defined recursively as follows: $P_{0}$ is a regular tetrahedron whose volume is 1. To obtain $P_{i+1}$, replace the midpoint triangle of every face of $P_{i}$ by an outward-pointing regular tetrahedron that has the midpoint triangle as a face. The volume of $P_{3}$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

For each natural number $a$ we denote $\tau (a)$ and $\phi (a)$ the number of natural numbers dividing $a$ and the number of natural numbers less than $a$ that are relatively prime to $a$. Find all natural numbers $n$ for which $n$ has exactly two different prime divisors and $n$ satisfies $\tau (\phi (n))=\phi (\tau (n))$.

A rectangle can be divided by parallel lines to its sides into 200 congruent squares, and also in 288 congruent squares. Prove that the rectangle can also be divided into 392 congruent squares.

Let $n$ be a positive integer. Prove that the number of lines which go through the origin and precisely one other point with integer coordinates $(x,y),0\le x,y\le n$, is at least $\frac{n^2}{4}$.