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: 6

1985 IMO Longlists, 9
Tags: polyhedron , 3d geometry , euler s theorem , angle , geometry
A polyhedron has $12$ faces and is such that: [b][i](i)[/i][/b] all faces are isosceles triangles, [b][i](ii)[/i][/b] all edges have length either $x$ or $y$, [b][i](iii)[/i][/b] at each vertex either $3$ or $6$ edges meet, and [b][i](iv)[/i][/b] all dihedral angles are equal. Find the ratio $x/y.$

1971 IMO, 3
Tags: euler s theorem , sequence , relatively prime , number theory
Prove that we can find an infinite set of positive integers of the from $2^n-3$ (where $n$ is a positive integer) every pair of which are relatively prime.

1985 IMO Shortlist, 2
Tags: angle , 3d geometry , polyhedron , euler s theorem , geometry
A polyhedron has $12$ faces and is such that: [b][i](i)[/i][/b] all faces are isosceles triangles, [b][i](ii)[/i][/b] all edges have length either $x$ or $y$, [b][i](iii)[/i][/b] at each vertex either $3$ or $6$ edges meet, and [b][i](iv)[/i][/b] all dihedral angles are equal. Find the ratio $x/y.$

1971 IMO Shortlist, 10
Tags: relatively prime , number theory , euler s theorem , sequence
Prove that we can find an infinite set of positive integers of the from $2^n-3$ (where $n$ is a positive integer) every pair of which are relatively prime.

1971 IMO Longlists, 35
Tags: relatively prime , number theory , euler s theorem , sequence
Prove that we can find an infinite set of positive integers of the from $2^n-3$ (where $n$ is a positive integer) every pair of which are relatively prime.

2017 India PRMO, 28
Tags: prime number , fermat pseudo-primes , euler s theorem , carmichael s number , number theory
Let $p,q$ be prime numbers such that $n^{3pq}-n$ is a multiple of $3pq$ for [b]all[/b] positive integers $n$. Find the least possible value of $p+q$.