For each positive integer n nn , define f(n) f(n)f(n) as the number of digits 0 00 in its decimal representation. For example, f(2)=0 f(2)={}0f(2)=0 , f(2009)=2 f(2009)={}2f(2009)=2 , etc. Please, calculate S=∑k=1n2f(k), S={}\sum_{k={}1}^{n}2^{f(k)},S=∑k=1n2f(k), for…
Let nnn be a positive integer, and let AAA be a subset of {1,⋯ ,n}\{ 1,\cdots ,n\}{1,⋯,n} . An AAA -partition of nnn into kkk parts is a representation of n as a sum n=a1+⋯+akn = a_1 + \cdots + a_kn=a1+⋯+ak , where the parts a1,⋯ ,aka_1 , \cdots , a_k a1,⋯,ak belong to…
An arithmetic progression (A.P.) has an even number of terms. The sum of the odd-numbered terms is 30, and the sum of the even-numbered terms is 36. The last term of the A.P. exceeds the first term by 15. Determine the number of terms in th…
An infinite sequence of numbers xnx_nxn is defined by the condition xn+1=1−∣1−2xn∣x_{n+1} = 1 - \left| 1 - 2x_n \right|xn+1=1−∣1−2xn∣, with 0≤x1≤10 \leq x_1 \leq 10≤x1≤1. Prove that the sequence, starting from some point, is periodic a) if and b) only if x1x_1x1 i…
Let nnn be a positive integer, and define a sequence {ak}\{a_k\}{ak} as follows: a1=na_1 = na1=n, and for each k>1k > 1k>1, aka_kak is the unique integer satisfying 0≤ak≤k−10 \leq a_k \leq k-10≤ak≤k−1 such that a1+a2+⋯+aka_1 + a_2 + \cdots + a_ka1+a2+⋯+ak is div…
The sequence {xn}\{x_{n}\}{xn} is defined as follows: x1=23,xn+1=xn2(2n+1)xn+1(n∈Z+).x_{1} = \frac{2}{3}, \quad x_{n+1} = \frac{x_{n}}{2(2n+1)x_{n} + 1} \quad (n \in \mathbb{Z}_{+}).x1=32,xn+1= Find the sum x1+x2+⋯+x2014x_{1} + x_{2} + \cdots + x_{2014}x1+x2+⋯+x.
Define a sequence recursively by x0=7x_0=7x0=7 and xn+1=xn2+6xn+5xn+7x_{n+1}=\frac{x_n^2 + 6x_n + 5}{x_n+7}xn+1=xn+7xn2+6xn for all nonnegative integers nnn. Let mmm be the least positive integer such that xm≤6+1218.x_m\leq 6+\frac{1}{2^{18}}.xm≤6+2181 In which of the following intervals…
Players AAA, BBB, CCC, and DDD start a game with 202020, 191919, 181818, and 171717 tokens respectively. The game's rule is modified such that in each round, the player with the most tokens gives one token to each of the other three players and pla…
Among the natural numbers a1,…,aka_1, \ldots, a_ka1,…,ak, none are the same, and the difference between the largest and smallest is less than 1000. What is the maximum possible kkk for which all quadratic equations…
The angles of a hexagon are in arithmetic progression. One of the angles in degrees, must be: - (no choices yet)
Show that the sequence an=(n+1)nn2−n7n2+1 a_n ={} \frac {(n +{} 1)^nn^{2 -{} n}}{7n^2 +{} 1}an=7n2+1(n+1)nn2−n is strictly monotonically increasing, where n=0,1,2,… n ={} 0,1,2, \dotsn=0,1,2,… .
Given that the sequence {an}\left\{a_{n}\right\}{an} is an arithmetic sequence and {bn}\left\{b_{n}\right\}{bn} is a geometric sequence, and that a1+2b1,a3+4b3,a5+8b5a_{1}+2 b_{1}, a_{3}+4 b_{3}, a_{5}+8 b_{5}a1+2b1,a form an arithmetic sequence. Find…
Given the sequence {an}\left\{a_{n}\right\}{an} satisfying: when n=2k−1 (k∈N∗)n=2k-1 \ (k \in \mathbf{N}^{*})n=2k−1 (k∈N∗), an=na_{n}=nan=n; when n=2k (k∈N∗)n=2k \ (k \in \mathbf{N}^{*})n=2k (k∈N∗), an=aka_{n}=a_{k}an=ak. Let Tn=a1+a2+a3+⋯+a2n−1+a2nT_{n}=a_{1}+a_{2}+a_{3}+\cdots+a_{2^{n}-1}+a_{2^{n}}Tn=a1+a. Prove: For…
Sophia did push-ups every day for 7 days. Each day after the first day, she did 5 more push-ups than the day before. In total she did 175 push-ups. How many push-ups did Sophia do on the last day?
Given a real number α>1\alpha > 1α>1. The sequence {an}\left\{a_{n}\right\}{an} satisfies: a1∈(0,1),an+1=an+(ann)α.a_{1} \in (0,1), \quad a_{n+1} = a_{n} + \left( \frac{a_{n}}{n} \right)^{\alpha}.a1∈(0,1),an+1=an Prove that there exists a constant MMM such that for any positive inte…
Given the sequence 11;21;12;31;22;13;41;32;23;14;…\frac{1}{1} ; \frac{2}{1} ; \frac{1}{2} ; \frac{3}{1} ; \frac{2}{2} ; \frac{1}{3} ; \frac{4}{1} ; \frac{3}{2} ; \frac{2}{3} ; \frac{1}{4} ; \ldots11;12;21;13;22;31;14;23;32;41;… At what position in this sequence is the number…
Show that 133+143+...+1n3<112\frac{1}{3^3} + \frac{1}{4^3} + ... + \frac{1}{n^3} < \frac{1}{12}331+431+...+n31<121.
Given 2000 points on a circle, starting from one point labeled with the number 1, move clockwise to the second point and label it with the number 2. Continue this process such that from the point labeled with number nnn, move clockwise…
An input NNN into a machine results in output OOO according to the rule: if NNN is odd, O=3N+1O = 3N + 1O=3N+1, if NNN is even, O=N2O = \frac{N}{2}O=2N. After repeatedly inputting the output back into the machine for a total of seven steps starting from…
Using only digits 1, 2, 3, 4, and 5, a sequence is created as follows: one 1, two 2's, three 3's, four 4's, five 5's, six 1's, seven 2's, and so on. The sequence appears as: 1,2,2,3,3,3,4,4,4,4,5,5,5,5,5,1,1,1,1,1,1,2,2,... The 100th digi…