This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 2265

1987 AIME Problems, 3

By a proper divisor of a natural number we mean a positive integral divisor other than 1 and the number itself. A natural number greater than 1 will be called "nice" if it is equal to the product of its distinct proper divisors. What is the sum of the first ten nice numbers?

2018 ITAMO, 1

$1.$A bottle in the shape of a cone lies on its base. Water is poured into the bottle until its level reaches a distance of 8 centimeters from the vertex of the cone (measured vertically). We now turn the bottle upside down without changing the amount of water it contains; This leaves an empty space in the upper part of the cone that is 2 centimeters high. Find the height of the bottle.

2021 Sharygin Geometry Olympiad, 22

A convex polyhedron and a point $K$ outside it are given. For each point $M$ of a polyhedron construct a ball with diameter $MK$. Prove that there exists a unique point on a polyhedron which belongs to all such balls.

2001 AIME Problems, 12

A sphere is inscribed in the tetrahedron whose vertices are $A=(6,0,0), B=(0,4,0), C=(0,0,2),$ and $D=(0,0,0).$ The radius of the sphere is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

1976 IMO, 3

A box whose shape is a parallelepiped can be completely filled with cubes of side $1.$ If we put in it the maximum possible number of cubes, each of volume $2$, with the sides parallel to those of the box, then exactly $40$ percent of the volume of the box is occupied. Determine the possible dimensions of the box.

2008 Stanford Mathematics Tournament, 10

Six people play the following game: They have a cube, initially white. One by one, the players mark an $ X$ on a white face of the cube, and roll it like a die. The winner is the first person to roll an $ X$ (for example, player 1 wins with probability $ \frac {1}{6}$, while if none of players 1-5 win, player 6 will place an $ X$ on the last square and win for sure). What is the probability that the sixth player wins?

KoMaL A Problems 2017/2018, A. 724

A sphere $S$ lies within tetrahedron $ABCD$, touching faces $ABD, ACD$, and $BCD$, but having no point in common with plane $ABC$. Let $E$ be the point in the interior of the tetrahedron for which $S$ touches planes $ABE$, $ACE$, and $BCE$ as well. Suppose the line $DE$ meets face $ABC$ at $F$, and let $L$ be the point of $S$ nearest to plane $ABC$. Show that segment $FL$ passes through the centre of the inscribed sphere of tetrahedron $ABCE$. KöMaL A.723. (April 2018), G. Kós

2017 CMI B.Sc. Entrance Exam, 2

Tags: 3d geometry
Let $L$ be the line of intersection of the planes $~x+y=0~$ and $~y+z=0$. [b](a)[/b] Write the vector equation of $L$, i.e. find $(a,b,c)$ and $(p,q,r)$ such that $$L=\{(a,b,c)+\lambda(p,q,r)~~\vert~\lambda\in\mathbb{R}\}$$ [b](b)[/b] Find the equation of a plane obtained by $x+y=0$ about $L$ by $45^{\circ}$.

2021 BMT, 6

A toilet paper roll is a cylinder of radius $8$ and height $6$ with a hole in the shape of a cylinder of radius $2$ and the same height. That is, the bases of the roll are annuli with inner radius $2$ and outer radius $8$. Compute the surface area of the roll.

2009 Germany Team Selection Test, 1

Consider cubes of edge length 5 composed of 125 cubes of edge length 1 where each of the 125 cubes is either coloured black or white. A cube of edge length 5 is called "big", a cube od edge length is called "small". A posititve integer $ n$ is called "representable" if there is a big cube with exactly $ n$ small cubes where each row of five small cubes has an even number of black cubes whose centres lie on a line with distances $ 1,2,3,4$ (zero counts as even number). (a) What is the smallest and biggest representable number? (b) Construct 45 representable numbers.

2013 Purple Comet Problems, 28

Let $A$, $B$, $C$, $D$, $E$, $F$, $G$, $H$ be the eight vertices of a $30 \times30\times30$ cube as shown. The two figures $ACFH$ and $BDEG$ are congruent regular tetrahedra. Find the volume of the intersection of these two tetrahedra. [asy] import graph; size(12.57cm); real labelscalefactor = 0.5; pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); pen dotstyle = black; real xmin = -3.79, xmax = 8.79, ymin = 0.32, ymax = 4.18; /* image dimensions */ pen ffqqtt = rgb(1,0,0.2); pen ffzzzz = rgb(1,0.6,0.6); pen zzzzff = rgb(0.6,0.6,1); draw((6,3.5)--(8,1.5), zzzzff); draw((7,3)--(5,1), blue); draw((6,3.5)--(7,3), blue); draw((6,3.5)--(5,1), blue); draw((5,1)--(8,1.5), blue); draw((7,3)--(8,1.5), blue); draw((4,3.5)--(2,1.5), ffzzzz); draw((1,3)--(2,1.5), ffqqtt); draw((2,1.5)--(3,1), ffqqtt); draw((1,3)--(3,1), ffqqtt); draw((4,3.5)--(1,3), ffqqtt); draw((4,3.5)--(3,1), ffqqtt); draw((-3,3)--(-3,1), linewidth(1.6)); draw((-3,3)--(-1,3), linewidth(1.6)); draw((-1,3)--(-1,1), linewidth(1.6)); draw((-3,1)--(-1,1), linewidth(1.6)); draw((-3,3)--(-2,3.5), linewidth(1.6)); draw((-2,3.5)--(0,3.5), linewidth(1.6)); draw((0,3.5)--(-1,3), linewidth(1.6)); draw((0,3.5)--(0,1.5), linewidth(1.6)); draw((0,1.5)--(-1,1), linewidth(1.6)); draw((-3,1)--(-2,1.5)); draw((-2,1.5)--(0,1.5)); draw((-2,3.5)--(-2,1.5)); draw((1,3)--(1,1), linewidth(1.6)); draw((1,3)--(3,3), linewidth(1.6)); draw((3,3)--(3,1), linewidth(1.6)); draw((1,1)--(3,1), linewidth(1.6)); draw((1,3)--(2,3.5), linewidth(1.6)); draw((2,3.5)--(4,3.5), linewidth(1.6)); draw((4,3.5)--(3,3), linewidth(1.6)); draw((4,3.5)--(4,1.5), linewidth(1.6)); draw((4,1.5)--(3,1), linewidth(1.6)); draw((1,1)--(2,1.5)); draw((2,3.5)--(2,1.5)); draw((2,1.5)--(4,1.5)); draw((5,3)--(5,1), linewidth(1.6)); draw((5,3)--(6,3.5), linewidth(1.6)); draw((5,3)--(7,3), linewidth(1.6)); draw((7,3)--(7,1), linewidth(1.6)); draw((5,1)--(7,1), linewidth(1.6)); draw((6,3.5)--(8,3.5), linewidth(1.6)); draw((7,3)--(8,3.5), linewidth(1.6)); draw((7,1)--(8,1.5)); draw((5,1)--(6,1.5)); draw((6,3.5)--(6,1.5)); draw((6,1.5)--(8,1.5)); draw((8,3.5)--(8,1.5), linewidth(1.6)); label("$ A $",(-3.4,3.41),SE*labelscalefactor); label("$ D $",(-2.16,4.05),SE*labelscalefactor); label("$ H $",(-2.39,1.9),SE*labelscalefactor); label("$ E $",(-3.4,1.13),SE*labelscalefactor); label("$ F $",(-1.08,0.93),SE*labelscalefactor); label("$ G $",(0.12,1.76),SE*labelscalefactor); label("$ B $",(-0.88,3.05),SE*labelscalefactor); label("$ C $",(0.17,3.85),SE*labelscalefactor); label("$ A $",(0.73,3.5),SE*labelscalefactor); label("$ B $",(3.07,3.08),SE*labelscalefactor); label("$ C $",(4.12,3.93),SE*labelscalefactor); label("$ D $",(1.69,4.07),SE*labelscalefactor); label("$ E $",(0.60,1.15),SE*labelscalefactor); label("$ F $",(2.96,0.95),SE*labelscalefactor); label("$ G $",(4.12,1.67),SE*labelscalefactor); label("$ H $",(1.55,1.82),SE*labelscalefactor); label("$ A $",(4.71,3.47),SE*labelscalefactor); label("$ B $",(7.14,3.10),SE*labelscalefactor); label("$ C $",(8.14,3.82),SE*labelscalefactor); label("$ D $",(5.78,4.08),SE*labelscalefactor); label("$ E $",(4.6,1.13),SE*labelscalefactor); label("$ F $",(6.93,0.96),SE*labelscalefactor); label("$ G $",(8.07,1.64),SE*labelscalefactor); label("$ H $",(5.65,1.90),SE*labelscalefactor); dot((-3,3),dotstyle); dot((-3,1),dotstyle); dot((-1,3),dotstyle); dot((-1,1),dotstyle); dot((-2,3.5),dotstyle); dot((0,3.5),dotstyle); dot((0,1.5),dotstyle); dot((-2,1.5),dotstyle); dot((1,3),dotstyle); dot((1,1),dotstyle); dot((3,3),dotstyle); dot((3,1),dotstyle); dot((2,3.5),dotstyle); dot((4,3.5),dotstyle); dot((4,1.5),dotstyle); dot((2,1.5),dotstyle); dot((5,3),dotstyle); dot((5,1),dotstyle); dot((6,3.5),dotstyle); dot((7,3),dotstyle); dot((7,1),dotstyle); dot((8,3.5),dotstyle); dot((8,1.5),dotstyle); dot((6,1.5),dotstyle); [/asy]

2017 China Team Selection Test, 1

Find out the maximum value of the numbers of edges of a solid regular octahedron that we can see from a point out of the regular octahedron.(We define we can see an edge $AB$ of the regular octahedron from point $P$ outside if and only if the intersection of non degenerate triangle $PAB$ and the solid regular octahedron is exactly edge $AB$.

1988 ITAMO, 5

Given four non-coplanar points, is it always possible to find a plane such that the orthogonal projections of the points onto the plane are the vertices of a parallelogram? How many such planes are there in general?

1990 AIME Problems, 1

The increasing sequence $2,3,5,6,7,10,11,\ldots$ consists of all positive integers that are neither the square nor the cube of a positive integer. Find the 500th term of this sequence.

1999 Slovenia National Olympiad, Problem 3

A section of a rectangular parallelepiped by a plane is a regular hexagon. Prove that this parallelepiped is a cube.

1999 Harvard-MIT Mathematics Tournament, 7

Find an ordered pair $(a,b)$ of real numbers for which $x^2+ax+b$ has a non-real root whose cube is $343$.

2001 Tournament Of Towns, 2

The decimal expression of the natural number $a$ consists of $n$ digits, while that of $a^3$ consists of $m$ digits. Can $n + m$ be equal to 2001?

2008 Princeton University Math Competition, A9

In tetrahedron $ABCD$ with circumradius $2$, $AB = 2$, $CD = \sqrt{7}$, and $\angle ABC = \angle BAD = \frac{\pi}{2}$. Find all possible angles between the planes containing $ABC$ and $ABD$.

2007 Princeton University Math Competition, 6

A sphere of radius $\sqrt{85}$ is centered at the origin in three dimensions. A tetrahedron with vertices at integer lattice points is inscribed inside the sphere. What is the maximum possible volume of this tetrahedron?

2022 AMC 10, 21

Tags: 3d geometry , area
A bowl is formed by attaching four regular hexagons of side 1 to a square of side 1. The edges of adjacent hexagons coincide, as shown in the figure. What is the area of the octagon obtained by joining the top eight vertices of the four hexagons, situated on the rim of the bowl? [asy] size(200); defaultpen(linewidth(0.8)); draw((342,-662) -- (600, -727) -- (757,-619) -- (967,-400) -- (1016,-300) -- (912,-116) -- (651,-46) -- (238,-90) -- (82,-204) -- (184, -388) -- (447,-458) -- (859,-410) -- (1016,-300)); draw((82,-204) -- (133,-490) -- (342, -662)); draw((652,-626) -- (600,-727)); draw((447,-458) -- (652,-626) -- (859,-410)); draw((133,-490) -- (184, -388)); draw((967,-400) -- (912,-116)^^(342,-662) -- (496, -545) -- (757,-619)^^(496, -545) -- (446, -262) -- (238, -90)^^(446, -262) -- (651, -46),linewidth(0.6)+linetype("5 5")+gray(0.4)); [/asy] $\textbf{(A) }6\qquad\textbf{(B) }7\qquad\textbf{(C) }5+2\sqrt{2}\qquad\textbf{(D) }8\qquad\textbf{(E) }9$

2014 All-Russian Olympiad, 2

The sphere $ \omega $ passes through the vertex $S$ of the pyramid $SABC$ and intersects with the edges $SA,SB,SC$ at $A_1,B_1,C_1$ other than $S$. The sphere $ \Omega $ is the circumsphere of the pyramid $SABC$ and intersects with $ \omega $ circumferential, lies on a plane which parallel to the plane $(ABC)$. Points $A_2,B_2,C_2$ are symmetry points of the points $A_1,B_1,C_1$ respect to midpoints of the edges $SA,SB,SC$ respectively. Prove that the points $A$, $B$, $C$, $A_2$, $B_2$, and $C_2$ lie on a sphere.

1967 German National Olympiad, 6

Prove the following theorem: If there are $n$ pairs of different points $P_i$, $i = 1, 2, ..., n$, $n > 2$ in three dimensions space, such that each of them is at a smaller distance from one and the same point $Q$ than any other $P_i$, then $n < 15$.

III Soros Olympiad 1996 - 97 (Russia), 10.2

Let $ABCD$ be a regular triangular pyramid with base $ABC$ (this means that $ABC$ is a regular triangle, and edges $AD$, $BD$ and $CD$ are equal) and plane angles at the opposite vertex equal to $a$. A plane parallel to $ABC$ intersects $AD$, $BD$ and $CD$, respectively, at points $A_1$, $B_1$ and $C_1$. The surface of the polyhedron $ABCA_1B_1C_1$ is cut along five edges: $A_1B_1$, $B_1C_1$, $C_1C$, $CA$ and $AB$, after which this surface is turned onto a plane. At what values of $a$ will the resulting scan necessarily cover itself?

2014 Moldova Team Selection Test, 1

Prove that there do not exist $4$ points in the plane such that the distances between any pair of them is an odd integer.

2007 IMO, 6

Let $ n$ be a positive integer. Consider \[ S \equal{} \left\{ (x,y,z) \mid x,y,z \in \{ 0, 1, \ldots, n\}, x \plus{} y \plus{} z > 0 \right \} \] as a set of $ (n \plus{} 1)^{3} \minus{} 1$ points in the three-dimensional space. Determine the smallest possible number of planes, the union of which contains $ S$ but does not include $ (0,0,0)$. [i]Author: Gerhard Wöginger, Netherlands [/i]