Does there exist a subset $M$ of positive integers such that for all positive rational numbers $r<1$ there exists exactly one finite subset of $M$ like $S$ such that sum of reciprocals of elements in $S$ equals $r$.

If $a,b,c,x$ are positive reals, show that $$\frac{a^{x+2}+1}{a^xbc+1}+\frac{b^{x+2}+1}{b^xac+1}+\frac{c^{x+2}+1}{c^xab+1}\geq 3$$

Hi guys, I was just reading over old posts that I made last year ( :P ) and saw how much the level of Getting Started became harder. To encourage more people from posting, I decided to start a Problem of the Day. This is how I'll conduct this: 1. In each post (not including this one since it has rules, etc) everyday, I'll post the problem. I may post another thread after it to give hints though. 2. Level of problem.. This is VERY important. All problems in this thread will be all AHSME or problems similar to this level. No AIME. Some AHSME problems, however, that involve tough insight or skills will not be posted. The chosen problems will be usually ones that everyone can solve after working. Calculators are allowed when you solve problems but it is NOT necessary. 3. Response.. All you have to do is simply solve the problem and post the solution. There is no credit given or taken away if you get the problem wrong. This isn't like other threads where the number of problems you get right or not matters. As for posting, post your solutions here in this thread. Do NOT PM me. Also, here are some more restrictions when posting solutions: A. No single answer post. It doesn't matter if you put hide and say "Answer is ###..." If you don't put explanation, it simply means you cheated off from some other people. I've seen several posts that went like "I know the answer" and simply post the letter. What is the purpose of even posting then? Huh? B. Do NOT go back to the previous problem(s). This causes too much confusion. C. You're FREE to give hints and post different idea, way or answer in some cases in problems. If you see someone did wrong or you don't understand what they did, post here. That's what this thread is for. 4. Main purpose.. This is for anyone who visits this forum to enjoy math. I rememeber when I first came into this forum, I was poor at math compared to other people. But I kindly got help from many people such as JBL, joml88, tokenadult, and many other people that would take too much time to type. Perhaps without them, I wouldn't be even a moderator in this forum now. This site clearly made me to enjoy math more and more and I'd like to do the same thing. That's about the rule.. Have fun problem solving! Next post will contain the Day 1 Problem. You can post the solutions until I post one. :D

Find all functions $f :\mathbb{N} \rightarrow \mathbb{N}$ such that $f(m + f(n)f(m)) = nf(m) + m$ holds for all $m,n \in \mathbb{N}$.

In a mathematical contest, three problems, $A,B,C$ were posed. Among the participants ther were 25 students who solved at least one problem each. Of all the contestants who did not solve problem $A$, the number who solved $B$ was twice the number who solved $C$. The number of students who solved only problem $A$ was one more than the number of students who solved $A$ and at least one other problem. Of all students who solved just one problem, half did not solve problem $A$. How many students solved only problem $B$?

A function $f : \mathbb{Z}_+ \to \mathbb{Z}_+$, where $\mathbb{Z}_+$ is the set of positive integers, is non-decreasing and satisfies $f(mn) = f(m)f(n)$ for all relatively prime positive integers $m$ and $n$. Prove that $f(8)f(13) \ge (f(10))^2$.

Let $\mathbb{R}$ be the set of real numbers. Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a function such that \[f(x+y)f(x-y)\geqslant f(x)^2-f(y)^2\] for every $x,y\in\mathbb{R}$. Assume that the inequality is strict for some $x_0,y_0\in\mathbb{R}$. Prove that either $f(x)\geqslant 0$ for every $x\in\mathbb{R}$ or $f(x)\leqslant 0$ for every $x\in\mathbb{R}$.

Define $f$ on the positive integers by $f(n) = k^2 + k + 1$, where $n=2^k(2l+1)$ for some $k,l$ nonnegative integers. Find the smallest $n$ such that $f(1) + f(2) + ... + f(n) \geq 123456$.

Find the number of $16$-tuples $(x_1, x_2,..., x_{16})$ such that (i) $x_i = \pm 1$ for $i = 1,..., 16$, (ii) $0 \le x_1 + x_2 +... + x_r < 4$, for $r = 1, 2,... , 15$, (iii) $x_1 + x_2 +...+ x_{10} = 4$

Let $u_1, u_2, \dots, u_{2019}$ be real numbers satisfying \[u_{1}+u_{2}+\cdots+u_{2019}=0 \quad \text { and } \quad u_{1}^{2}+u_{2}^{2}+\cdots+u_{2019}^{2}=1.\] Let $a=\min \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$ and $b=\max \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$. Prove that \[ a b \leqslant-\frac{1}{2019}. \]

Given integer $n\geq 2$ and real numbers $x_1,x_2,\cdots, x_n$ in the interval $[0,1]$. Prove that there exist real numbers $a_0,a_1,\cdots,a_n$ satisfying the following conditions: (1) $a_0+a_n=0$; (2) $|a_i|\leq 1$, for $i=0,1,\cdots,n$; (3) $|a_i-a_{i-1}|=x_i$, for $i=1,2,\cdots,n$.

Find all quadrupels $(a, b, c, d)$ of positive real numbers that satisfy the following two equations: \begin{align*} ab + cd &= 8,\\ abcd &= 8 + a + b + c + d. \end{align*}

For real numbers, $a,b,c$ with $bc \ne 0$ we have to $\frac{1-c^2}{bc} \ge 0$. Prove that $$5( a^2+b^2+c^2 -bc^3) \ge ab.$$

Let the real numbers $a, b, c$ be such that $a \ge b \ge c > 0$. Show that $$\frac{a^2-b^2}{c}+ \frac{c^2-b^2}{a}+ \frac{a^2-c^2}{b}\ge 3a - 4b + c.$$ When does equality hold?

The polynomial $ P(x) \equal{} x^3 \plus{} ax^2 \plus{} bx \plus{} c$ has the property that the mean of its zeros, the product of its zeros, and the sum of its coefficients are all equal. If the $ y$-intercept of the graph of $ y \equal{} P(x)$ is 2, what is $ b$? $ \textbf{(A)} \ \minus{} 11 \qquad \textbf{(B)} \ \minus{} 10 \qquad \textbf{(C)} \ \minus{} 9 \qquad \textbf{(D)} \ 1 \qquad \textbf{(E)} \ 5$

Positive integers $a,b,c,x,y,z$ satisfy: $a^2+b^2=c^2$, $x^2+y^2=z^2$ and $|x-a| \leq 1$ , $|y-b| \leq 1$. Prove that sets $\{a,b\}$ and $\{x,y\}$ are equal.

Are there such $x,y$ that $\lg{(x+y)}=\lg x \lg y$ and $\lg{(x-y)}=\frac{\lg x}{\lg y}$ ?

Let $n\ge 3$. Suppose $a_1, a_2, ... , a_n$ are $n$ distinct in pairs real numbers. In terms of $n$, find the smallest possible number of different assumed values by the following $n$ numbers: $$a_1 + a_2, a_2 + a_3,..., a_{n- 1} + a_n, a_n + a_1$$

Determine all positive integers $n$ for which there exists a polynomial $P_n(x)$ of degree $n$ with integer coefficients that is equal to $n$ at $n$ different integer points and that equals zero at zero.

Find all positive integers $n$ such that there exist a permutation $\sigma$ on the set $\{1,2,3, \ldots, n\}$ for which \[\sqrt{\sigma(1)+\sqrt{\sigma(2)+\sqrt{\ldots+\sqrt{\sigma(n-1)+\sqrt{\sigma(n)}}}}}\] is a rational number.

Find all real numbers $x$ satisfying the equation \[\left\lfloor \frac{20}{x+18}\right\rfloor+\left\lfloor \frac{x+18}{20}\right\rfloor=1.\]

Suppose $S$ is a finite subset of $\mathbb{R}$. If $f: S \rightarrow S$ is a function such that, $$ \left|f\left(s_{1}\right)-f\left(s_{2}\right)\right| \leq \frac{1}{2}\left|s_{1}-s_{2}\right|, \forall s_{1}, s_{2} \in S $$ Prove that, there exists a $x \in S$ such that $f(x)=x$

Find all functions $f : Z^+ \to Z^+$ such that $f(k + 1) >f(f(k))$ for $k > 1$, where $Z^+$ is the set of positive integers.

$(CZS 6)$ Let $d$ and $p$ be two real numbers. Find the first term of an arithmetic progression $a_1, a_2, a_3, \cdots$ with difference $d$ such that $a_1a_2a_3a_4 = p.$ Find the number of solutions in terms of $d$ and $p.$

Evaluate $\sum_{n=1}^{1994}{\left((-1)^{n}\cdot\left(\frac{n^2 + n + 1}{n!}\right)\right)}$ .