Found problems: 85335
In a school there are 1200 students. Each student must join exactly $k$ clubs. Given that there is a common club joined by every 23 students, but there is no common club joined by all 1200 students, find the smallest possible value of $k$.
If a polynomial $P$ with integer coefficients has three distinct integer zeroes , then show that $P(n)\neq 1$ for any integer $n$.
$2^{n-1}$ subsets are choosen from a set with $n$ elements, such that every three of these subsets have an element in common. Show that all subsets have an element in common.
$ABCDEF$ is a cyclic hexagon with $AB=BC=CD=DE$. $K$ is a point on segment $AE$ satisfying $\angle BKC=\angle KFE, \angle CKD = \angle KFA$. Prove that $KC=KF$.
Show that the equation \[x^{3}+y^{3}+z^{3}+t^{3}=1999\] has infinitely many integral solutions.
Let $a_1, a_2, \ldots, a_{2021}$ be a sequence, where each $a_i$ is a positive factor of $2021$. How many possible values are there for the product $a_1 a_2 \cdots a_{2021}$?
A capacitor is made with two square plates, each with side length $L$, of negligible thickness, and capacitance $C$. The two-plate capacitor is put in a microwave which increases the side length of each square plate by $ 1 \% $. By what percent does the voltage between the two plates in the capacitor change?
$ \textbf {(A) } \text {decreases by } 2\% \\ \textbf {(B) } \text {decreases by } 1\% \\ \textbf {(C) } \text {it does not change} \\ \textbf {(D) } \text {increases by } 1\% \\ \textbf {(E) } \text {increases by } 2\% $
[i]Problem proposed by Ahaan Rungta[/i]
Show that, for each integer $z \ge 3$, there exist two two-digit numbers $A$ and $B$ in base $z$, one equal to the other one read in reverse order, such that the equation $x^2 -Ax+B$ has one double root. Prove that this pair is unique for a given $z$. For instance, in base $10$ these numbers are $A = 18, B = 81$.
Let $\{f_n\}_{n\ge 1}$ be the Fibonacci sequence, defined by $f_1 = f_2 = 1$, and for all positive integers $n$, $f_{n+2} = f_{n+1} + f_n$. Prove that the following inequality takes place for all positive integers $n$:
$${n \choose 1}f_1 +{n \choose 2}f_2+... +{n \choose n}f_n < \frac{(2n + 2)^n}{n!}$$
.
Let $ f$ be a function such that for all integers $ x$ and $ y$ applies $ f(x\plus{}y) \equal{} f(x) \plus{} f(y) \plus{} 6xy \plus{} 1$ and $ f(x) \equal{} f(\minus{}x)$. Then $ f(3)$ equals
$ \text{(A)}\ 26 \qquad \text{(B)}\ 27 \qquad \text{(C)}\ 52 \qquad \text{(D)}\ 53 \qquad \text{(E)}\ 54$
There are $n{}$ currencies in a country, numbered from 1 to $n{}.$ In each currency, only non-negative integers are possible amounts of money. A person can have only one currency at any time.
A person can exchange all the money he has from currency $i{}$ to currency $j{}$ at the rate of $\alpha_{ij}$ which is a positive real number. If he had $d{}$ units of currency $i{}$ he instead receives $\alpha_{ij}d$ units of currency $j{}$ while this number is rounded to the nearest integer; a number of the form $t-1/2$ is rounded to $t{}$ for any integer $t{}.$
It is known that $\alpha_{ij}\alpha_{jk}=\alpha_{ik}$ and $\alpha_{ii}=1$ for every $i,j,k.$ Can there be a person who can get rich indefinitely?
[i]Proposed by I. Bogdanov[/i]
It is known that a circle can be inscribed in a trapezium $ABCD$.
Prove that the two circles, constructed on its oblique sides as diameters, touch each other.
(D. Fomin, Leningrad)
If $n$ is an integer such that $2 \leq n \leq 2017$, for how many values of $n$ is $\left(1 + \frac{1}{2}\right)\left(1 + \frac{1}{3}\right)\cdots\left(1 + \frac{1}{n}\right)$ equal to a positive integer?
$\mathrm{(A) \ } 0 \qquad \mathrm{(B) \ } 1 \qquad \mathrm {(C) \ } 1007 \qquad \mathrm{(D) \ } 1008 \qquad \mathrm{(E) \ } 2016$
Two sets $M=\{x,xy,\lg(xy)\},N=\{0,|x|,y\}$, if $M=N$, then $(x+\frac{1}{y})+(x^2+\frac{1}{y^2})+\cdots+(x^{2001}+\frac{1}{y^{2001}})=$________.
Let $ABCD$ be a parallelogram. $E$ and $F$ are on $BC, CD$ respectively such that the triangles $ABE$ and $BCF$ have the same area. Let $BD$ intersect $AE, AF$ at $M, N$ respectively. Prove there exists a triangle whose side lengths are $BM, MN, ND$.
Emilia and Julieta have a pile of 2024 cards and play the following game: they take turns, and each player removes a number of cards that must be a power of two, i.e., \(1, 2, 4, 8, \dots\). The player who removes the last card wins. Julieta starts the game. Prove that there exists a strategy for Julieta that guarantees her victory, no matter how Emilia plays.
$ n\geq 4 $ points are given in a plane such that any 3 of them are not collinear. Prove that a triangle exist such that all the points are in its interior and there is exactly one point laying on each side.
Let $ x,y\in \mathbb{R} $. Show that if the set $ A_{x,y}=\{ \cos {(n\pi x)}+\cos {(n\pi y)} \mid n\in \mathbb{N}\} $ is finite then $ x,y \in \mathbb{Q} $.
[i]Vasile Pop[/i]
There is a lamp in space.(Consider lamp a point)
Do there exist finite number of equal sphers in space that the light of the lamp can not go to the infinite?(If a ray crash in a sphere it stops)
$F(0)=3$ and $F(n)=F(n-1)+4$ when $n$ is positive. Find $F(F(F(5)))$.
Let $a,b,c \in \mathbb{C}$ such that $a|bc| + b|ca| + c|ab| = 0$. Prove that $|(a-b)(b-c)(c-a)| \ge 3\sqrt{3}|abc|$.
Let $S_n$ denote the set of permutations of the sequence $(1,2,\dots, n)$. For every permutation $\pi=(\pi_1, \dots, \pi_n)\in S_n$, let $\mathrm{inv}(\pi)$ be the number of pairs $1\le i < j \le n$ with $\pi_i>\pi_j$; i. e. the number of inversions in $\pi$. Denote by $f(n)$ the number of permutations $\pi\in S_n$ for which $\mathrm{inv}(\pi)$ is divisible by $n+1$.
Prove that there exist infinitely many primes $p$ such that $f(p-1)>\frac{(p-1)!}{p}$, and infinitely many primes $p$ such that $f(p-1)<\frac{(p-1)!}{p}$.
(Proposed by Fedor Petrov, St. Petersburg State University)
Suppose that $\tan \alpha =\frac{p}{q}$, where $p$ and $q$ are integers and $q \neq 0$. Prove the number $\tan \beta$ for which $\tan 2\beta =\tan 3\alpha$ is rational only when $p^2 +q^2$ is the square of an integer.
Determine all positive integers $n$ for which there exists a partition of the set
\[\{n,n+1,n+2,\ldots ,n+8\}\]
into two subsets such that the product of all elements of the first subset is equal to the product of all elements of the second subset.
Two noncongruent integer-sided isosceles triangles have the same perimeter and the same area. The ratio of the lengths of the bases of the two triangles is $ 8: 7$. Find the minimum possible value of their common perimeter.