Found problems: 1148
Assume $a,b,c$ are odd integers. Show that the quadratic equation
\[ ax^2 + bx + c = 0 \]
has no rational solutions. (A number is said to be [i]rational[/i], if it can be written as a fraction: $\frac{\text{integer}}{\text{integer}}$.)
For $\pi\leq\theta<2\pi$, let
\[ P=\dfrac12\cos\theta-\dfrac14\sin2\theta-\dfrac18\cos3\theta+\dfrac1{16}\sin4\theta+\dfrac1{32}\cos5\theta-\dfrac1{64}\sin6\theta-\dfrac1{128}\cos7\theta+\ldots
\] and
\[ Q=1-\dfrac12\sin\theta-\dfrac14\cos2\theta+\dfrac1{8}\sin3\theta+\dfrac1{16}\cos4\theta-\dfrac1{32}\sin5\theta-\dfrac1{64}\cos6\theta+\dfrac1{128}\sin7\theta
+\ldots \] so that $\tfrac PQ = \tfrac{2\sqrt2}7$. Then $\sin\theta = -\tfrac mn$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Let $p(x) = x^2 +ax +b$ be a quadratic polynomial with $a,b \in \mathbb{Z}$. Given any integer $n$ , show that there is an integer $M$ such that $p(n) p(n+1) = p(M)$.
Suppose $a$, $b$ and $c$ are integers such that the greatest common divisor of $x^2+ax+b$ and $x^2+bx+c$ is $x+1$ (in the set of polynomials in $x$ with integer coefficients), and the least common multiple of $x^2+ax+b$ and $x^2+bx+c$ $x^3-4x^2+x+6$. Find $a+b+c$.
Two parallel chords in a circle have lengths $10$ and $14$, and the distance between them is $6$. The chord parallel to these chords and midway between them is of length $\sqrt{a}$ where $a$ is
[asy]
// note: diagram deliberately not to scale -- azjps
void htick(pair A, pair B, real r){ D(A--B); D(A-(r,0)--A+(r,0)); D(B-(r,0)--B+(r,0)); }
size(120); pathpen = linewidth(0.7); pointpen = black+linewidth(3);
real min = -0.6, step = 0.5;
pair[] A, B; D(unitcircle);
for(int i = 0; i < 3; ++i) {
A.push(intersectionpoints((-9,min+i*step)--(9,min+i*step),unitcircle)[0]); B.push(intersectionpoints((-9,min+i*step)--(9,min+i*step),unitcircle)[1]);
D(D(A[i])--D(B[i]));
}
MP("10",(A[0]+B[0])/2,N);
MP("\sqrt{a}",(A[1]+B[1])/2,N);
MP("14",(A[2]+B[2])/2,N);
htick((B[1].x+0.1,B[0].y),(B[1].x+0.1,B[2].y),0.06); MP("6",(B[1].x+0.1,B[0].y/2+B[2].y/2),E);[/asy]
$\textbf{(A)}\ 144 \qquad
\textbf{(B)}\ 156 \qquad
\textbf{(C)}\ 168 \qquad
\textbf{(D)}\ 176 \qquad
\textbf{(E)}\ 184$
The families of second degree functions $f_m, g_m: R\to R, $ are considered , $f_m (x) = (m^2 + 1) x^2 + 3mx + m^2 - 1$, $g_m (x) = m^2x^2 + mx - 1$, where $m$ is a real nonzero parameter.
Show that, for any function $h$ of the second degree with the property that $g_m (x) \le h (x) \le f_m (x)$ for any real $x$, there exists $\lambda \in [0, 1]$ which verifies the condition $h (x) = \lambda f_m (x) + (1- \lambda) g_m (x)$, whatever real $x$ is.
Let $ \overline{AB}$ be a diameter of circle $ \omega$. Extend $ \overline{AB}$ through $ A$ to $ C$. Point $ T$ lies on $ \omega$ so that line $ CT$ is tangent to $ \omega$. Point $ P$ is the foot of the perpendicular from $ A$ to line $ CT$. Suppose $ AB \equal{} 18$, and let $ m$ denote the maximum possible length of segment $ BP$. Find $ m^{2}$.
For how many positive integers $n$ is $n^3-8n^2+20n-13$ a prime number?
$\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }\text{more than 4}$
Let $ n\in N^*$. A permutation $ (a_1,a_2,...,a_n)$ of the numbers $ (1,2,...,n)$ is called [i]quadratic [/i] iff at least one of the numbers $ a_1,a_1\plus{}a_2,...,a_1\plus{}a_2\plus{}a\plus{}...\plus{}a_n$ is a perfect square. Find the greatest natural number $ n\leq 2003$, such that every permutation of $ (1,2,...,n)$ is quadratic.
Given that $(1+\sin t)(1+\cos t)=5/4$ and \[ (1-\sin t)(1-\cos t)=\frac mn-\sqrt{k}, \] where $k, m,$ and $n$ are positive integers with $m$ and $n$ relatively prime, find $k+m+n.$
(Wolstenholme's Theorem) Prove that if \[1+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{p-1}\] is expressed as a fraction, where $p \ge 5$ is a prime, then $p^{2}$ divides the numerator.
Determine all real solutions of the equation: \[{ \frac{x^{2}}{x-1}+\sqrt{x-1}+\frac{\sqrt{x-1}}{x^{2}}}=\frac{x-1}{x^{2}}+\frac{1}{\sqrt{x-1}}+\frac{x^{2}}{\sqrt{x-1}} . \]
We call a permutation $ \left(a_1, a_2, ..., a_n\right)$ of $ \left(1, 2, ..., n\right)$ [i]quadratic[/i] if there exists at least a perfect square among the numbers $ a_1$, $ a_1 \plus{} a_2$, $ ...$, $ a_1 \plus{} a_2 \plus{} ... \plus{} a_n$. Find all natural numbers $ n$ such that all permutations in $ S_n$ are quadratic.
[i]Remark.[/i] $ S_{n}$ denotes the $ n$-th symmetric group, the group of permutations on $ n$ elements.
Determine all natural numbers $n$ such that for each natural number $a$ relatively prime with $n$ and $a \le 1 + \left\lfloor \sqrt{n} \right\rfloor$ there exists some integer $x$ with $a \equiv x^2 \mod n$.
Remark: "Natural numbers" is the set of positive integers.
Let $a$ be positive real number such that $a^{3}=6(a+1)$. Prove that the equation $x^{2}+ax+a^{2}-6=0$ has no real solution.
Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$.
[i]Proposed by Jaroslaw Wroblewski, Poland[/i]
Let $f(x) = x^2 - 2x$. A set of real numbers $S$ is [i]valid[/i] if it satisfies the following:
$\bullet$ If $x \in S$, then $f(x) \in S$.
$\bullet$ If $x \in S$ and $\underbrace{f(f(\dots f}_{k\ f\text{'s}}(x)\dots )) = x$ for some integer $k$, then $f(x) = x$.
Compute the number of 7-element valid sets.
[i]Proposed by Lewis Chen[/i]
The diagonals $AC$ and $BD$ of a convex cyclic quadrilateral $ABCD$ intersect at point $E$. Given that $AB = 39, AE = 45, AD = 60$ and $BC = 56$, determine the length of $CD.$
Two circles of equal radius can tightly fit inside right triangle $ABC$, which has $AB=13$, $BC=12$, and $CA=5$, in the three positions illustrated below. Determine the radii of the circles in each case.
[asy]
size(400); defaultpen(linewidth(0.7)+fontsize(12)); picture p = new picture; pair s1 = (20,0), s2 = (40,0); real r1 = 1.5, r2 = 10/9, r3 = 26/7; pair A=(12,5), B=(0,0), C=(12,0);
draw(p,A--B--C--cycle); label(p,"$B$",B,SW); label(p,"$A$",A,NE); label(p,"$C$",C,SE);
add(p); add(shift(s1)*p); add(shift(s2)*p);
draw(circle(C+(-r1,r1),r1)); draw(circle(C+(-3*r1,r1),r1));
draw(circle(s1+C+(-r2,r2),r2)); draw(circle(s1+C+(-r2,3*r2),r2));
pair D=s2+156/17*(A-B)/abs(A-B), E=s2+(169/17,0), F=extension(D,E,s2+A,s2+C);
draw(incircle(s2+B,D,E)); draw(incircle(s2+A,D,F));
label("Case (i)",(6,-3)); label("Case (ii)",s1+(6,-3)); label("Case (iii)",s2+(6,-3));[/asy]
The operations below can be applied on any expression of the form \(ax^2+bx+c\).
$(\text{I})$ If \(c \neq 0\), replace \(a\) by \(4a-\frac{3}{c}\) and \(c\) by \(\frac{c}{4}\).
$(\text{II})$ If \(a \neq 0\), replace \(a\) by \(-\frac{a}{2}\) and \(c\) by \(-2c+\frac{3}{a}\).
$(\text{III}_t)$ Replace \(x\) by \(x-t\), where \(t\) is an integer. (Different values of \(t\) can be used.)
Is it possible to transform \(x^2-x-6\) into each of the following by applying some sequence of the above operations?
$(\text{a})$ \(5x^2+5x-1\)
$(\text{b})$ \(x^2+6x+2\)
Compute $ \sum_{n \equal{} 1}^\infty\sum_{k \equal{} 1}^{n \minus{} 1}\frac {k}{2^{n \plus{} k}}$.
For $ n\geq2$ let $ a_1, a_2, \ldots a_n$ be positive real numbers such that
\[ (a_1 \plus{} a_2 \plus{} \cdots \plus{} a_n)\left(\frac {1}{a_1} \plus{} \frac {1}{a_2} \plus{} \cdots \plus{} \frac {1}{a_n}\right) \leq \left(n \plus{} \frac {1}{2}\right)^2.
\]
Prove that $ \max(a_1, a_2, \ldots, a_n)\leq 4\min(a_1, a_2, \ldots, a_n)$.
Consider the sequence $(a^n + 1)_{n\geq 1}$, with $a>1$ a fixed integer.
i) Prove there exist infinitely many primes, each dividing some term of the sequence.
ii) Prove there exist infinitely many primes, none dividing any term of the sequence.
[i](Dan Schwarz)[/i]
Find the sum of all positive integers $n$ for which $n^2-19n+99$ is a perfect square.
How many integers $0\leq x < 121$ are there such that $x^5+5x^2 + x + 1 \equiv 0 \pmod{121}$?
$
\textbf{(A)}\ 0
\qquad\textbf{(B)}\ 1
\qquad\textbf{(C)}\ 2
\qquad\textbf{(D)}\ 4
\qquad\textbf{(E)}\ 5
$