Find a number that increases by a factor of $1996$ if the digits in the first and fifth places after the decimal place are swapped in its decimal notation.

Suppose $ \,G\,$ is a connected graph with $ \,k\,$ edges. Prove that it is possible to label the edges $ 1,2,\ldots ,k\,$ in such a way that at each vertex which belongs to two or more edges, the greatest common divisor of the integers labeling those edges is equal to 1. [b]Note: Graph-Definition[/b]. A [b]graph[/b] consists of a set of points, called vertices, together with a set of edges joining certain pairs of distinct vertices. Each pair of vertices $ \,u,v\,$ belongs to at most one edge. The graph $ G$ is connected if for each pair of distinct vertices $ \,x,y\,$ there is some sequence of vertices $ \,x \equal{} v_{0},v_{1},v_{2},\cdots ,v_{m} \equal{} y\,$ such that each pair $ \,v_{i},v_{i \plus{} 1}\;(0\leq i < m)\,$ is joined by an edge of $ \,G$.

Let $ M $ be a set of nonzero real numbers and $ f:M\longrightarrow M $ be a function having the property that the identity function is $ f+f^{-1} . $ [b]1)[/b] Prove that $ m\in M\iff -m\in M. $ [b]2)[/b] Show that $ f $ is odd. [b]3)[/b] Determine the cardinal of $ M. $

[hide=C stands for Cantor, G stands for Gauss]they had two problem sets under those two names[/hide] [u]Set 4[/u] [b]G.16[/b] A number $k$ is the product of exactly three distinct primes (in other words, it is of the form $pqr$, where $p, q, r$ are distinct primes). If the average of its factors is $66$, find $k$. [b]G.17[/b] Find the number of lattice points contained on or within the graph of $\frac{x^2}{3} +\frac{y^2}{2}= 12$. Lattice points are coordinate points $(x, y)$ where $x$ and $y$ are integers. [b]G.18 / C.23[/b] How many triangles can be made from the vertices and center of a regular hexagon? Two congruent triangles with different orientations are considered distinct. [b]G.19[/b] Cindy has a cone with height $15$ inches and diameter $16$ inches. She paints one-inch thick bands of paint in circles around the cone, alternating between red and blue bands, until the whole cone is covered with paint. If she starts from the bottom of the cone with a blue strip, what is the ratio of the area of the cone covered by red paint to the area of the cone covered by blue paint? [b]G.20 / C.25[/b] An even positive integer $n$ has an odd factorization if the largest odd divisor of $n$ is also the smallest odd divisor of n greater than 1. Compute the number of even integers $n$ less than $50$ with an odd factorization. [u] Set 5[/u] [b]G.21[/b] In the magical tree of numbers, $n$ is directly connected to $2n$ and $2n + 1$ for all nonnegative integers n. A frog on the magical tree of numbers can move from a number $n$ to a number connected to it in $1$ hop. What is the least number of hops that the frog can take to move from $1000$ to $2018$? [b]G.22[/b] Stan makes a deal with Jeff. Stan is given 1 dollar, and every day for $10$ days he must either double his money or burn a perfect square amount of money. At first Stan thinks he has made an easy $1024$ dollars, but then he learns the catch - after $10$ days, the amount of money he has must be a multiple of $11$ or he loses all his money. What is the largest amount of money Stan can have after the $10$ days are up? [b]G.23[/b] Let $\Gamma_1$ be a circle with diameter $2$ and center $O_1$ and let $\Gamma_2$ be a congruent circle centered at a point $O_2 \in \Gamma_1$. Suppose $\Gamma_1$ and $\Gamma_2$ intersect at $A$ and $B$. Let $\Omega$ be a circle centered at $A$ passing through $B$. Let $P$ be the intersection of $\Omega$ and $\Gamma_1$ other than $B$ and let $Q$ be the intersection of $\Omega$ and ray $\overrightarrow{AO_1}$. Define $R$ to be the intersection of $PQ$ with $\Gamma_1$. Compute the length of $O_2R$. [b]G.24[/b] $8$ people are at a party. Each person gives one present to one other person such that everybody gets a present and no two people exchange presents with each other. How many ways is this possible? [b]G.25[/b] Let $S$ be the set of points $(x, y)$ such that $y = x^3 - 5x$ and $x = y^3 - 5y$. There exist four points in $S$ that are the vertices of a rectangle. Find the area of this rectangle. PS. You should use hide for answers. C1-15/ G1-10 have been posted [url=https://artofproblemsolving.com/community/c3h2790674p24540132]here [/url] and C16-30/G10-15, G25-30 [url=https://artofproblemsolving.com/community/c3h2790676p24540145]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url]

Let $S_n$ and $T_n$ be the respective sums of the first $n$ terms of two arithmetic series. If $S_n:T_n=(7n+1):(4n+27)$ for all $n$, the ratio of the eleventh term of the first series to the eleventh term of the second series is: $\textbf{(A) }4:3\qquad \textbf{(B) }3:2\qquad \textbf{(C) }7:4\qquad \textbf{(D) }78:71\qquad \textbf{(E) }\text{undetermined}$

An equilateral triangle $ABC$ is given. With $BC$ as diameter, a semicircle is drawn outside the triangle. On the semicircle, points $D$ and $E$ are chosen such that the arc lengths $BD, DE$ and $EC$ are equal. Prove that the line segments $AD$ and $AE$ divide the side $BC$ into three equal parts. [img]https://1.bp.blogspot.com/-hQQV-Of96Ls/XzXCZjCledI/AAAAAAAAMV0/SwXa4mtEEm04onYbFGZiTc5NSpkoyvJLwCLcBGAsYHQ/s0/2010%2BMohr%2Bp5.png[/img]

Show that if real numbers $x<1<y$ satisfy the inequality $$2\log x+\log(1-x)\ge3\log y+\log(y-1),$$then $x^3+y^3<2$.

Let $f(x)=x^5-3x^4+2x^3+6x^2+x-14=a(x-1)^5+b(x-1)^4+c(x-1)^3+d(x-1)^2+e(x-1)+f,$ for some real constants $a,b,c,d,e,f.$ Determine the value of $ab+bc+cd+de+ad+be.$

A knight is placed on each square of the first column of a $2017 \times 2017$ board. A [i]move[/i] consists in choosing two different knights and moving each of them to a square which is one knight-step away. Find all integers $k$ with $1 \leq k \leq 2017$ such that it is possible for each square in the $k$-th column to contain one knight after a finite number of moves. Note: Two squares are a knight-step away if they are opposite corners of a $2 \times 3$ or $3 \times 2$ board.

Find the integral solutions of the equation $7(x+y)=3(x^2-xy+y^2)$

Ali and Veli goes to hunting. The probability that each will successfully hit a duck is $1/2$ on any given shot. During the hunt, Ali shoots $12$ times, and Veli shoots $13$ times. What is the probability that Veli hits more ducks than Ali? $ \textbf{(A)}\ \dfrac 12 \qquad\textbf{(B)}\ \dfrac{13}{25} \qquad\textbf{(C)}\ \dfrac{13}{24} \qquad\textbf{(D)}\ \dfrac{7}{13} \qquad\textbf{(E)}\ \dfrac{3}{4} $

For $-1\leq x\leq 1$ and $n\in\mathbb N$ define $T_{n}(x)=\frac{1}{2^{n}}[(x+\sqrt{1-x^{2}})^{n}+(x-\sqrt{1-x^{2}})^{n}]$. a)Prove that $T_{n}$ is a monic polynomial of degree $n$ in $x$ and that the maximum value of $|T_{n}(x)|$ is $\frac{1}{2^{n-1}}$. b)Suppose that $p(x)=x^{n}+a_{n-1}x^{n-1}+...+a_{1}x+a_{0}\in\mathbb{R}[x]$ is a monic polynomial of degree $n$ such that $p(x)>-\frac{1}{2^{n-1}}$ forall $x$, $-1\leq x\leq 1$. Prove that there exists $x_{0}$, $-1\leq x_{0}\leq 1$ such that $p(x_{0})\geq\frac{1}{2^{n-1}}$.

Let $A, B$, and $C$ be three points on the edge of a circular chord such that $B$ is due west of $C$ and $ABC$ is an equilateral triangle whose side is $86$ meters long. A boy swam from $A$ directly toward $B$. After covering a distance of $x$ meters, he turned and swam westward, reaching the shore after covering a distance of $y$ meters. If $x$ and $y$ are both positive integers, determine $y.$

Let $S(n)$ be the sum of digits for any positive integer n (in decimal notation). Let $N=\displaystyle\sum_{k=10^{2003}}^{10{^{2004}-1}} S(k)$. Determine $S(N)$.

There are integers $m$ and $n$ so that $9 +\sqrt{11}$ is a root of the polynomial $x^2 + mx + n.$ Find $m + n.$

How many pairs of integers $x, y$ are there between $1$ and $1000$ such that $x^2 + y^2$ is divisible by $7$?

$N$ coins are placed on a table, $N - 1$ are genuine and have the same weight, and one is fake, with a different weight. Using a two pan balance, the goal is to determine with certainty the fake coin, and whether it is lighter or heavier than a genuine coin. Whenever one can deduce that one or more coins are genuine, they will be inmediately discarded and may no longer be used in subsequent weighings. Determine all $N$ for which the goal is achievable. (There are no limits regarding how many times one may use the balance). Note: the only difference between genuine and fake coins is their weight; otherwise, they are identical.

Katie Ledecky and Michael Phelps each participate in $7$ swimming events in the Olympics (and there is no event that they both participate in). Ledecky receives $g_L$ gold, $s_L$ silver, and $b_L$ bronze medals, and Phelps receives $g_P$ gold, $s_P$ silver, and $b_P$ bronze medals. Ledecky notices that she performed objectively better than Phelps: for all positive real numbers $w_b<w_s<w_g$, we have $$w_gg_l+w_ss_L+w_bb_L>w_gg_P+w_ss_P+w_bb_P.$$ Compute the number of possible $6$-tuples $(g_L,s_L,b_L,g_P,s_P,b_P).$

We call a positive integer $n$ is $good$ , if there exist integers $a,b,c,x,y$ such that $n=ax^2+bxy+cy^2$ and $b^2-4ac=-20$. Prove that the product of any two good numbers is also a good number.

Let $n$ be an integer greater than $1$. For a positive integer $m$, let $S_{m}= \{ 1,2,\ldots, mn\}$. Suppose that there exists a $2n$-element set $T$ such that (a) each element of $T$ is an $m$-element subset of $S_{m}$; (b) each pair of elements of $T$ shares at most one common element; and (c) each element of $S_{m}$ is contained in exactly two elements of $T$. Determine the maximum possible value of $m$ in terms of $n$.

Consider the factorials of the first $100$ positive integers, namely, $1!, 2!$, $...$, $100!$. Is it possible to delete one of them so that the product of the remaining ones is a perfect square? (S Tokarev)

Let $n>2$ be a positive integer. Masha writes down $n$ natural numbers along a circle. Next, Taya performs the following operation: Between any two adjacent numbers $a$ and $b$, she writes a divisor of the number $a+b$ greater than $1$, then Taya erases the original numbers and obtains a new set of $n$ numbers along the circle. Can Taya always perform these operations in such a way that after some number of operations, all the numbers are equal? [i]Proposed by T. Korotchenko[/i]

There are 1000 doors $D_1, D_2, . . . , D_{1000}$ and 1000 persons $P_1, P_2, . . . , P_{1000}$. Initially all the doors were closed. Person $P_1$ goes and opens all the doors. Then person $P_2$ closes door $D_2, D_4, . . . , D_{1000}$ and leaves the odd numbered doors open. Next $P_3$ changes the state of every third door, that is, $D_3, D_6, . . . , D_{999}$ . (For instance, $P_3$ closes the open door $D_3$ and opens the closed door D6, and so on). Similarly, $P_m$ changes the state of the the doors $D_m, D_{2m}, D_{3m}, . . . , D_{nm}, . . .$ while leaving the other doors untouched. Finally, $P_{1000}$ opens $D_{1000}$ if it was closed or closes it if it were open. At the end, how many doors will remain open?

Let ${R^* = R-\{0\}}$ be the set of non-zero real numbers. Find all functions ${f : R^* \rightarrow R^*}$ satisfying ${f(x) + f(y) = f(xy f(x + y))}$, for ${x, y \in R^*}$ and ${ x + y\ne 0 }$.

For any positive integer $n$, we have the set $P_n = \{ n^k \mid k=0,1,2, \ldots \}$. For positive integers $a,b,c$, we define the group of $(a,b,c)$ as lucky if there is a positive integer $m$ such that $a-1$, $ab-12$, $abc-2015$ (the three numbers need not be different from each other) belong to the set $P_m$. Find the number of lucky groups.