Found problems: 85335
Find the first degree polynomial function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that satisfy the equation
$$ f(x-1)=-3x-5-f(2), $$
for all real numbers $ x. $
Let $n$ be a given positive integer. Prove that there exist infinitely many integer triples $(x,y,z)$ such that
\[nx^2+y^3=z^4,\ \gcd (x,y)=\gcd (y,z)=\gcd (z,x)=1.\]
Players $A$ and $B$ play a game with $N \geq 2012$ coins and $2012$ boxes arranged around a circle. Initially $A$ distributes the coins among the boxes so that there is at least $1$ coin in each box. Then the two of them make moves in the order $B,A,B,A,\ldots $ by the following rules:
[b](a)[/b] On every move of his $B$ passes $1$ coin from every box to an adjacent box.
[b](b)[/b] On every move of hers $A$ chooses several coins that were [i]not[/i] involved in $B$'s previous move and are in different boxes. She passes every coin to an adjacent box.
Player $A$'s goal is to ensure at least $1$ coin in each box after every move of hers, regardless of how $B$ plays and how many moves are made. Find the least $N$ that enables her to succeed.
In a trapezoid $ABCD$ with $AB // CD$, the diagonals $AC$ and $BD$ intersect at point $E$. Let $F$ and $G$ be the orthocenters of the triangles $EBC$ and $EAD$. Prove that the midpoint of $GF$ lies on the perpendicular from $E$ to $AB$.
Solve the equation \[2^{x^{2}+x}+\log_{2}x = 2^{x+1}\]
Consider a positive integer $n=\overline{a_1a_2...a_k},k\ge 2$.A [i]trunk[/i] of $n$ is a number of the form $\overline{a_1a_2...a_t},1\le t\le k-1$.(For example,the number $23$ is a [i]trunk[/i] of $2351$.)
By $T(n)$ we denote the sum of all [i]trunk[/i] of $n$ and let $S(n)=a_1+a_2+...+a_k$.Prove that $n=S(n)+9\cdot T(n)$.
Let \( P(x) \) be a polynomial with natural coefficients. We denote by \( d(n) \) the number of positive divisors of the natural number \( n \), and by \( \sigma(n) \), the sum of these divisors. The sequence \( a_n \) is defined as follows:
\[
a_{n+1} \in \left\{
\begin{array}{ll}
\sigma(P(d(a_n))) \\
d(P(\sigma(a_n)))
\end{array}
\right.
\]
That is, \( a_{n+1} \) is one of the two terms above. Show that there exists a constant \( C \), depending on \( a_1 \) and \( P(x) \), such that for all \( i \), \( a_i < C \); in other words, show that the sequence \( a_n \) is bounded.
In a triangle $ABC$, $I$ is the incenter and $D,E, F$ are the points of tangency of the incircle with $BC,CA,AB$, respectively. The bisector of angle $BIC$ meets $BC$ at $M$, and the line $AM$ intersects $EF$ at $P$. Prove that $DP$ bisects the angle $FDE$.
Find all prime numbers of the form $\tfrac{1}{11} \cdot \underbrace{11\ldots 1}_{2n \textrm{ ones}}$, where $n$ is a natural number.
Let $n\geqslant 3$ be a positive integer. A circular necklace is called [i]fun[/i] if it has $n{}$ black beads and $n{}$ white beads. A move consists of cutting out a segment of consecutive beads and reattaching it in reverse. Prove that it is possible to change any fun necklace into any other fun necklace using at most $(n-1)$ moves.
[i]Note:[/i] Necklaces related by rotations or reflections are considered to be the same.
[i]Proposed by Dylan Toh[/i]
Let $n$ and $a \leq n$ be two positive integers. There's $2n$ people sitting around a circle reqularly. Two people are friend iff one of their distance in the circle is $a$(that is , $a-1$ people are between them). Find all integers $a$ in terms of $n$ st we can choose $n$ of these people , no two of them positioned in front of each other(means they're not antipodes of each other in the circle) and the total friendship between them is an odd number.
If I have 100 cards with all the numbers 1 through 100 on them, how should I put them in order to create the largest possible number?
How many integers $ x$ satisfy the equation
\[ (x^2 \minus{} x \minus{} 1)^{x \plus{} 2} \equal{} 1
\]$ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ \text{none of these}$
In conference there $n>2$ mathematicians. Every two mathematicians communicate in one of the $n$ offical languages of the conference. For any three different offical languages the exists three mathematicians who communicate with each other in these three languages. Find all $n$ such that this is possible.
Let $a,b$ be real numbers. Prove the inequality
\[ 2(a^4+a^2b^2+b^4)\ge 3(a^3b+ab^3).\]
For any positive integer $ n$, prove that there exists a polynomial $ P$ of degree $ n$ such that all coeffients of this polynomial $ P$ are integers, and such that the numbers $ P\left(0\right)$, $ P\left(1\right)$, $ P\left(2\right)$, ..., $ P\left(n\right)$ are pairwisely distinct powers of $ 2$.
Let us consider a matrix $T$ with n rows denoted $1,\ldots,n$ and $p$ columns $1,\ldots,p$. Its entries $a_{ik}~(1\le i\le n,1\le k\le p)$ are integers such that $1\le a_{ik}\le N$, where $N$ is a given natural number. Let $E_i$ be the set of numbers that appear on the $i$-th row. Answer question (a) or (b).
(a) Assume $T$ satisfies the following conditions: $(1)$ $E_i$ has exactly $p$ elements for each $i$, and $(2)$ all $E_i$'s are mutually distinct. Let $m$ be the smallest value of $N$ that permits a construction of such an $n\times p$ table $T$.
i. Compute $m$ if $n=p+1$.
ii. Compute $m$ if $n=10^{30}$ and $p=1998$.
iii. Determine $\lim_{n\to\infty}\frac{m^p}n$, where $p$ is fixed.
(b) Assume $T$ satisfies the following conditions instead: $(1)$ $p=n$, $(2)$ whenever $i,k$ are integers with $i+k\le n$, the number $a_{ik}$ is not in the set $E_{i+k}$.
i. Prove that all $E_i$'s are mutually distinct.
ii. Prove that if $n\ge2^q$ for some integer $q>0$, then $N\ge q+1$.
iii. Let $n=2^r-1$ for some integer $r>0$. Prove that $N\ge r$ and show that there is such a table with $N=r$.
Define the sequence $a_1, a_2,...$ as follows: $a_1 = 1$, and for every $n \ge 2$, $a_n = n - 2$ if $a_{n-1} = 0$ and $a_n = a_{n-1} - 1$, otherwise. Find the number of $1 \le k \le 2016$ such that there are non-negative integers $r, s$ and a positive integer $n$ satisfying $k = r + s$ and $a_{n+r} = a_n + s$.
Three positive reals $x , y , z $ satisfy \\
$x^2 + y^2 = 3^2 \\
y^2 + yz + z^2 = 4^2 \\
x^2 + \sqrt{3}xz + z^2 = 5^2 .$ \\
Find the value of $2xy + xz + \sqrt{3}yz$
Rows 1, 2, 3, 4, and 5 of a triangular array of integers are shown below:
[asy]
size(4.5cm);
label("$1$", (0,0));
label("$1$", (-0.5,-2/3));
label("$1$", (0.5,-2/3));
label("$1$", (-1,-4/3));
label("$3$", (0,-4/3));
label("$1$", (1,-4/3));
label("$1$", (-1.5,-2));
label("$5$", (-0.5,-2));
label("$5$", (0.5,-2));
label("$1$", (1.5,-2));
label("$1$", (-2,-8/3));
label("$7$", (-1,-8/3));
label("$11$", (0,-8/3));
label("$7$", (1,-8/3));
label("$1$", (2,-8/3));
[/asy]
Each row after the first row is formed by placing a 1 at each end of the row, and each interior entry is 1 greater than the sum of the two numbers diagonally above it in the previous row. What is the units digit of the sum of the 2023 numbers in the 2023rd row?
$\textbf{(A) }1\qquad\textbf{(B) }3\qquad\textbf{(C) }5\qquad\textbf{(D) }7\qquad\textbf{(E) }9$
Are there any triples $(a,b,c)$ of positive integers such that $(a-2)(b-2)(c-2)+12$ is a prime number that properly divides the positive number $a^2+b^2+c^2+abc-2017$?
Find $\lim_{n\to\infty}\left(\frac{1}{n}\int_0^n (\sin ^ 2 \pi x)\ln (x+n)dx-\frac 12\ln n\right).$
Let $n$ be a natural composite number. Prove that there are integers $a_1, a_2,. . . , a_k$ all greater than $ 1$, such that $$a_1 + a_2 +... + a_k = n \left(\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_k}\right)$$
Consider $(f_n)_{n\ge 0}$ the Fibonacci sequence, defined by $f_0 = 0$, $f_1 = 1$, $f_{n+1} = f_n + f_{n-1}$ for all positive integers $n$. Solve the following equation in positive integers $$nf_nf_{n+1} = (f_{n+2} - 1)^2.$$
.
Let $ a_1, a_2, \ldots, a_{2n}$ be $ 2n$ real numbers satisfying the condition $ \sum_{i \equal{} 1}^{2n \minus{} 1} (a_{i \plus{} 1} \minus{} a_i)^2 \equal{} 1$. Find the greatest possible value of $ (a_{n \plus{} 1} \plus{} a_{n \plus{} 2} \plus{} \ldots \plus{} a_{2n}) \minus{} (a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n)$.