Found problems: 85335
$PQ, CD$ are parallel chords of a circle. The tangent at $D$ cuts $PQ$ at $T$ and $B$ is the point of contact of the other tangent from $T$ (Fig. ). Prove that $BC$ bisects $PQ$.
[img]https://cdn.artofproblemsolving.com/attachments/2/f/22f69c03601fbb8e388e319cd93567246b705c.png[/img]
Determine all positive integers n such that $n^2/ (n - 1)!$
Let $a_1, a_2, \ldots, a_{2024}$ be a permutation of $1, 2, \ldots, 2024$. Find the minimum possible value of\[\sum_{i=1} ^{2023} \Big[(a_i+a_{i+1})\Big(\frac{1}{a_i}+\frac{1}{a_{i+1}}\Big)+\frac{1}{a_ia_{i+1}}\Big]\]
[i]Proposed by Md. Ashraful Islam Fahim[/i]
Find the greatest possible integer value of the side length of an equilateral triangle whose vertices belong to the interior region of a square with side length $100$.
Let $n$ be a positive integer. There are $n$ purple and $n$ white cows queuing in a line in some order. Tim wishes to sort the cows by colour, such that all purple cows are at the front of the line. At each step, he is only allowed to swap two adjacent groups of equally many consecutive cows. What is the minimal number of steps Tim needs to be able to fulfill his wish, regardless of the initial alignment of the cows?
The function $f(x,y)$ satisfies: $f(0,y)=y+1, f(x+1,0) = f(x,1), f(x+1,y+1)=f(x,f(x+1,y))$ for all non-negative integers $x,y$. Find $f(4,1981)$.
Given the binary operation $\ast$ defined by $a\ast b=a^b$ for all positive numbers $a$ and $b$. The for all positive $a,b,c,n,$ we have
$\textbf{(A) }a\ast b=b\ast a\qquad\textbf{(B) }a\ast (b\ast c)=(a\ast b)\ast c\qquad$
$\textbf{(C) }(a\ast b^n)=(a\ast n)\ast b\qquad\textbf{(D) }(a\ast b)^n=a\ast (bn)\qquad \textbf{(E) }\text{None of these}$
Given a square $ABCD$, let $P, Q, R$, and $S$ be four variable points on the sides $AB, BC, CD$, and $DA$, respectively. Determine the positions of the points $P, Q, R$, and $S$ for which the quadrilateral $PQRS$ is a parallelogram, a rectangle, a square, or a trapezoid.
A rectangle $ D$ is partitioned in several ($ \ge2$) rectangles with sides parallel to those of $ D$. Given that any line parallel to one of the sides of $ D$, and having common points with the interior of $ D$, also has common interior points with the interior of at least one rectangle of the partition; prove that there is at least one rectangle of the partition having no common points with $ D$'s boundary.
[i]Author: Kei Irie, Japan[/i]
Let $n$ be a positive integer, with prime factorization $$n = p_1^{e_1}p_2^{e_2} \cdots p_r^{e_r}$$ for distinct primes $p_1, \ldots, p_r$ and $e_i$ positive integers. Define $$rad(n) = p_1p_2\cdots p_r,$$ the product of all distinct prime factors of $n$.
Find all polynomials $P(x)$ with rational coefficients such that there exists infinitely many positive integers $n$ with $P(n) = rad(n)$.
The product of any three of these four natural numbers is a perfect square.
Prove that these numbers themselves are perfect squares.
Let $ABCDEFGHIJ$ be a regular $10$-gon. Let $T$ be a point inside the $10$-gon, such that the $DTE$ is isosceles: $DT = ET$ , and its angle at the apex is $72^\circ$. Prove that there exists a point $S$ such that $FTS$ and $HIS$ are both isosceles, and for both of them the angle at the apex is $72^\circ$.
Point $P$ is chosen in the plane of triangle $ABC$ such that $\angle{ABP}$ is congruent to $\angle{ACP}$ and $\angle{CBP}$ is congruent to $\angle{CAP}$. Show $P$ is the orthocentre.
For a given integer $n\ge 2$, let $\{a_1,a_2,…,a_m\}$ be the set of positive integers less than $n$ that are relatively prime to $n$. Prove that if every prime that divides $m$ also divides $n$, then $a_1^k+a_2^k + \dots + a_m^k$ is divisible by $m$ for every positive integer $k$.
[i]Proposed by Ivan Borsenco[/i]
Consider a function real-valued function with $C^{\infty}$-class on $\mathbb{R}$ such that:
(a) $f(0)=\frac{df}{dx}(0)=0,\ \frac{d^2f}{dx^2}(0)\neq 0.$
(b) For $x\neq 0,\ f(x)>0.$
Judge whether the following integrals $(i),\ (ii)$ converge or diverge, justify your answer.
$(i)$ \[\int\int_{|x_1|^2+|x_2|^2\leq 1} \frac{dx_1dx_2}{f(x_1)+f(x_2)}.\]
$(ii)$ \[\int\int_{|x_1|^2+|x_2|^2+|x_3|^2\leq 1} \frac{dx_1dx_2dx_3}{f(x_1)+f(x_2)+f(x_3)}.\]
[i]2010 Kyoto University, Master Course in Mathematics[/i]
There are $k$ stones on the table. Alper, Betul and Ceyhun take one or two stones from the table one by one. The player who cannot make a move loses the game and then the game finishes. The game is played once for each $k=5,6,7,8,9$. If Alper is always the first player, for how many of the games can Alper guarantee that he does not lose the game?
$
\textbf{(A)}\ 1
\qquad\textbf{(B)}\ 2
\qquad\textbf{(C)}\ 3
\qquad\textbf{(D)}\ 4
\qquad\textbf{(E)}\ 5
$
A natural number is written in each square of an $ m \times n$ chess board. The allowed move is to add an integer $ k$ to each of two adjacent numbers in such a way that non-negative numbers are obtained. (Two squares are adjacent if they have a common side.) Find a necessary and sufficient condition for it to be possible for all the numbers to be zero after finitely many operations.
A subsum of $n$ real numbers $a_1,\dots,a_n$ is a sum of elements of a subset of the set $\{a_1,\dots,a_n\}$. In other words a subsum is $\epsilon_1a_1+\dots+\epsilon_na_n$ in which for each $1\leq i \leq n$ ,$\epsilon_i$ is either $0$ or $1$.
Years ago, there was a valuable list containing $n$ real not necessarily distinct numbers and their $2^n-1$ subsums. Some mysterious creatures from planet Tarator has stolen the list, but we still have the subsums.
(a) Prove that we can recover the numbers uniquely if all of the subsums are positive.
(b) Prove that we can recover the numbers uniquely if all of the subsums are non-zero.
(c) Prove that there's an example of the subsums for $n=1392$ such that we can not recover the numbers uniquely.
Note: If a subsum is sum of element of two different subsets, it appears twice.
Time allowed for this question was 75 minutes.
Find the area of the domain expressed by the following system inequalities.
\[x\geq 0,\ y\geq 0,\ x^{\frac{1}{p}}+y^{\frac{1}{p}} \leq 1\ (p=1,2,\cdots)\]
A wizard thinks of a number from $1$ to $n$. You can ask the wizard any number of yes/no questions about the number. The wizard must answer all those questions, but not necessarily in the respective order. What is the least number of questions that must be asked in order to know what the number is for sure. (In terms of $n$.)
Fresh translation.
In the sequence
\[ ..., a, b, c, d, 0, 1, 1, 2, 3, 5, 8,... \]
each term is the sum of the two terms to its left. Find $a$.
$ \textbf{(A)}\ -3 \qquad\textbf{(B)}\ -1 \qquad\textbf{(C)}\ 0 \qquad\textbf{(D)}\ 1 \qquad\textbf{(E)}\ 3 $
The fi gure below shows a $9\times7$ arrangement of $2\times2$ squares. Alternate squares of the grid are split into two triangles with one of the triangles shaded. Find the area of the shaded region.
[asy]
size(5cm);
defaultpen(linewidth(.6));
fill((0,1)--(1,1)--(1,0)--cycle^^(0,3)--(1,3)--(1,2)--cycle^^(1,2)--(2,2)--(2,1)--cycle^^(2,1)--(3,1)--(3,0)--cycle,rgb(.76,.76,.76));
fill((0,5)--(1,5)--(1,4)--cycle^^(1,4)--(2,4)--(2,3)--cycle^^(2,3)--(3,3)--(3,2)--cycle^^(3,2)--(4,2)--(4,1)--cycle^^(4,1)--(5,1)--(5,0)--cycle,rgb(.76,.76,.76));
fill((0,7)--(1,7)--(1,6)--cycle^^(1,6)--(2,6)--(2,5)--cycle^^(2,5)--(3,5)--(3,4)--cycle^^(3,4)--(4,4)--(4,3)--cycle^^(4,3)--(5,3)--(5,2)--cycle^^(5,2)--(6,2)--(6,1)--cycle^^(6,1)--(7,1)--(7,0)--cycle,rgb(.76,.76,.76));
fill((2,7)--(3,7)--(3,6)--cycle^^(3,6)--(4,6)--(4,5)--cycle^^(4,5)--(5,5)--(5,4)--cycle^^(5,4)--(6,4)--(6,3)--cycle^^(6,3)--(7,3)--(7,2)--cycle^^(7,2)--(8,2)--(8,1)--cycle^^(8,1)--(9,1)--(9,0)--cycle,rgb(.76,.76,.76));
fill((4,7)--(5,7)--(5,6)--cycle^^(5,6)--(6,6)--(6,5)--cycle^^(6,5)--(7,5)--(7,4)--cycle^^(7,4)--(8,4)--(8,3)--cycle^^(8,3)--(9,3)--(9,2)--cycle,rgb(.76,.76,.76));
fill((6,7)--(7,7)--(7,6)--cycle^^(7,6)--(8,6)--(8,5)--cycle^^(8,5)--(9,5)--(9,4)--cycle,rgb(.76,.76,.76));
fill((8,7)--(9,7)--(9,6)--cycle,rgb(.76,.76,.76));
draw((0,0)--(0,7)^^(1,0)--(1,7)^^(2,0)--(2,7)^^(3,0)--(3,7)^^(4,0)--(4,7)^^(5,0)--(5,7)^^(6,0)--(6,7)^^(7,0)--(7,7)^^(8,0)--(8,7)^^(9,0)--(9,7));
draw((0,0)--(9,0)^^(0,1)--(9,1)^^(0,2)--(9,2)^^(0,3)--(9,3)^^(0,4)--(9,4)^^(0,5)--(9,5)^^(0,6)--(9,6)^^(0,7)--(9,7));
draw((0,1)--(1,0)^^(0,3)--(3,0)^^(0,5)--(5,0)^^(0,7)--(7,0)^^(2,7)--(9,0)^^(4,7)--(9,2)^^(6,7)--(9,4)^^(8,7)--(9,6));
[/asy]
Find all positive integers $n$ which satisfy the following tow conditions:
(a) $n$ has at least four different positive divisors;
(b) for any divisors $a$ and $b$ of $n$ satisfying $1<a<b<n$, the number $b-a$ divides $n$.
[i](4th Middle European Mathematical Olympiad, Individual Competition, Problem 4)[/i]
A player repeatedly throwing a die is to play until their score reaches or passes a total $n$. Denote by $p(n)$ the probability of making exactly the total $n,$ and find the value of $\lim_{n \to \infty} p(n).$
Sketch the evolvent of the cubic parabola $y=x^3$ (the evolvent is the locus of the points $\overrightarrow{r}(s)+(c-s)\dot{\overrightarrow{r}}(s)$, where $s$ is the arc-length of the curve $\overrightarrow{r}(s)$ and $c$ is a constant).