meetforever/GRPO_CL huggingface dataset:
user: Let $f$ be defined as below for integers $n \ge 0$ and $a_0, a_1, ...$ such that $\sum_{i\ge 0}a_i$ is finite:
$$f(n; a_0, a_1, ...) = \begin{cases} a_{2020}, & \text{ $n = 0$} \\
\sum_{i\ge 0} a_i f(n-1;a_0,...,a_{i-1},a_i-1,a_{i+1}+1,a_{i+2},...)/ \sum_{i\ge 0}a_i & \text{$n > 0$} \end{cases}$$.
Find the nearest integer to $f(2020^2; 2020, 0, 0, ...)$.
Answer: 18
user: Let $P$ be a $10$-degree monic polynomial with roots $r_1, r_2, . . . , r_{10} \ne $ and let $Q$ be a $45$-degree monic polynomial with roots $\frac{1}{r_i}+\frac{1}{r_j}-\frac{1}{r_ir_j}$ where $i < j$ and $i, j \in \{1, ... , 10\}$. If $P(0) = Q(1) = 2$, then $\log_2 (|P(1)|)$ can be written as $a/b$ for relatively prime integers $a, b$. Find $a + b$.
Answer: 19
user: Let $ABCD$ be a cyclic quadrilateral with circumcenter $O$ and radius $10$. Let sides $AB$, $BC$, $CD$, and $DA$ have midpoints $M, N, P$, and $Q$, respectively. If $MP = NQ$ and $OM + OP = 16$, then what is the area of triangle $\vartriangle OAB$?
Answer: 78
user: We say that a positive integer $n$ is [i]divable [/i] if there exist positive integers $1 < a < b < n$ such that, if the base-$a$ representation of $n$ is $\sum_{i=0}^{k_1} a_ia^i$ , and the base-$b$ representation of $n$ is $\sum_{i=0}^{k_2}  b_ib^i$ , then for all positive integers $c > b$, we have that $\sum_{i=0}^{k_2}  b_ic^i$ divides $\sum_{i=0}^{k_1}  a_ic^i$. Find the number of non-divable $n$ such that $1 \le n \le  100$.
Answer: 27
user: Let there be a tiger, William, at the origin. William leaps $ 1$ unit in a random direction, then leaps $2$ units in a random direction, and so forth until he leaps $15$ units in a random direction to celebrate PUMaC’s 15th year.
There exists a circle centered at the origin such that the probability that William is contained in the circle (assume William is a point) is exactly $1/2$ after the $15$ leaps. The area of that circle can be written as $A\pi$. What is $A$?
Answer: 1240
user: Given a sequence $a_0, a_1, a_2, ... , a_n$, let its [i]arithmetic approximant[/i] be the arithmetic sequence $b_0, b_1, ... , b_n$ that minimizes the quantity $\sum_{i=0}^{n}(b_i -a_i)^2$, and denote this quantity the sequence’s anti-arithmeticity. Denote the number of integer sequences whose arithmetic approximant is the sequence $4$, $8$, $12$, $16$ and whose anti-arithmeticity is at most $20$.
Answer: 15
user: Let $f(x) =\frac{x+a}{x+b}$ satisfy $f(f(f(x))) = x$ for real numbers $a, b$. If the maximum value of a is $p/q$, where $p, q$ are relatively prime integers, what is $|p| + |q|$?
Answer: 7
user: Let $N$ be the number of sequences of positive integers greater than $ 1$ where the product of all of the terms of the sequence is $12^{64}$. If $N$ can be expressed as $a(2^b)$ ), where $a$ is an odd positive integer, determine $b$.
Answer: 128
user: Let $ABC$ be a triangle with sides $AB = 34$, $BC = 15$, $AC = 35$ and let $\Gamma$ be the circle of smallest possible radius passing through $A$ tangent to $BC$. Let the second intersections of $\Gamma$ and sides $AB$, $AC$ be the points $X, Y$ . Let the ray $XY$ intersect the circumcircle of the triangle $ABC$ at $Z$. If $AZ =\frac{p}{q}$ for relatively prime integers $p$ and $q$, find $p + q$.
Answer: 173
user: Let $\{x\} = x- \lfloor x \rfloor$ . Consider a function f from the set $\{1, 2, . . . , 2020\}$ to the half-open interval $[0, 1)$. Suppose that for all $x, y,$ there exists a $z$ so that $\{f(x) + f(y)\} = f(z)$. We say that a pair of integers $m, n$ is valid if $1 \le m, n \le 2020$ and there exists a function $f$ satisfying the above so $f(1) = \frac{m}{n}$. Determine the sum over all valid pairs $m, n$ of ${m}{n}$.
Answer: 1019595
user: Gary is baking cakes, one at a time. However, Gary’s not been having much success, and each failed cake will cause him to slowly lose his patience, until eventually he gives up. Initially, a failed cake has a probability of $0$ of making him give up. Each cake has a $1/2$ of turning out well, with each cake independent of every other cake. If two consecutive cakes turn out well, the probability resets to $0$ immediately after the second cake. On the other hand, if the cake fails, assuming that he doesn’t give up at this cake, his probability of breaking on the next failed cake goes from p to $p + 0.5$. If the expected number of successful cakes Gary will bake until he gives up is$ p/q$, for relatively prime $p, q$, find $p + q$.
Answer: 86
user: Let $\phi (x, u)$ be the smallest positive integer $n$ so that $2^u$ divides $x^n + 95$ if it exists, or $0$ if no such positive integer exists. Determine$ \sum_{i=0}^{255} \phi(i, 8)$.
Answer: 2704
user: Suppose we have a sequence $a_1, a2_, ...$ of positive real numbers so that for each positive integer $n$, we have that $\sum_{k=1}^{n} a_ka_{\lfloor \sqrt{k} \rfloor} = n^2$. Determine the first value of $k$ so $a_k > 100$.
Answer: 1018
user: Find the sum (in base $10$) of the three greatest numbers less than $1000_{10}$ that are palindromes in both base $10$ and base $5$.
Answer: 1584
user: Let $f(k)$ denote the number of triples $(a, b, c)$ of positive integers satisfying $a + b + c = 2020$ with $(k - 1)$ not dividing $a, k$ not dividing $b$, and $(k + 1)$ not dividing $c$. Find the product of all integers $k$ in the range 3 \le k \le 20 such that $(k + 1)$ divides $f(k)$.
Answer: 360
user: Three (not necessarily distinct) points in the plane which have integer coordinates between $ 1$ and $2020$, inclusive, are chosen uniformly at random. The probability that the area of the triangle with these three vertices is an integer is $a/b$ in lowest terms. If the three points are collinear, the area of the degenerate triangle is $0$. Find $a + b$.
Answer: 13
user: Let $X, Y$ , and $Z$ be concentric circles with radii $1$, $13$, and $22$, respectively. Draw points $A, B$, and $C$ on $X$, $Y$ , and $Z$, respectively, such that the area of triangle $ABC$ is as large as possible. If the area of the triangle is $\Delta$, find $\Delta^2$.
Answer: 24300
user: What is the smallest integer $a_0$ such that, for every positive integer $n$, there exists a sequence of positive integers $a_0, a_1, ..., a_{n-1}, a_n$ such that the first $n-1$ are all distinct, $a_0 = a_n$, and for $0 \le i \le n -1$, $a_i^{a_{i+1}}$ ends in the digits $\overline{0a_i}$ when expressed without leading zeros in base $10$.
Answer: 7
user: Last year, the U.S. House of Representatives passed a bill which would make Washington, D.C. into the $51$st state. Naturally, the mathematicians are upset that Congress won’t prioritize mathematical interest of flag design in choosing how many U.S. states there should be. Suppose the U.S. flag must contain, as it does now, stars arranged in rows alternating between $n$ and $n - 1$ stars, starting and ending with rows of n stars, where $n \ge 2$ is some integer and the flag has more than one row. What is the minimum number of states that the U.S. would need to contain so that there are at least three different ways, excluding rotations, to arrange the stars on the flag?
Answer: 53
user: Given two positive integers $a \ne b$, let $f(a, b)$ be the smallest integer that divides exactly one of $a, b$, but not both. Determine the number of pairs of positive integers $(x, y)$, where $x \ne y$, $1\le x, y, \le 100$ and $\gcd(f(x, y), \gcd(x, y)) = 2$.
Answer: 706
user: You are walking along a road of constant width with sidewalks on each side. You can only walk on the sidewalks or cross the road perpendicular to the sidewalk. Coming up on a turn, you realize that you are on the “outside” of the turn; i.e., you are taking the longer way around the turn. The turn is a circular arc. Assuming that your destination is on the same side of the road as you are currently, let $\theta$ be the smallest turn angle, in radians, that would justify crossing the road and then crossing back after the turn to take the shorter total path to your destination. What is $\lfloor 100 \cdot \theta \rfloor$ ?
Answer: 200
user: How many ordered triples of nonzero integers $(a, b, c)$ satisfy $2abc = a + b + c + 4$?
Answer: 6
user: Will and Lucas are playing a game. Will claims that he has a polynomial $f$ with integer coefficients in mind, but Lucas doesn’t believe him. To see if Will is lying, Lucas asks him on minute $i$ for the value of $f(i)$, starting from minute $ 1$. If Will is telling the truth, he will report $f(i)$. Otherwise, he will randomly and uniformly pick a positive integer from the range $[1,(i+1)!]$. Now, Lucas is able to tell whether or not the values that Will has given are possible immediately, and will call out Will if this occurs. If Will is lying, say the probability that Will makes it to round $20$ is $a/b$. If the prime factorization of $b$ is $p_1^{e_1}... p_k^{e_k}$ , determine the sum $\sum_{i=1}^{k} e_i$.
Answer: 289
user: Find the number of points $P \in Z^2$ that satisfy the following two conditions:
1) If $Q$ is a point on the circle of radius $\sqrt{2020}$ centered at the origin such that the line $PQ$ is tangent to the circle at $Q$, then $PQ$ has integral length.
2) The x-coordinate of $P$ is $38$.
Answer: 16
user: Jacob has a piece of bread shaped like a figure $8$, marked into sections and all initially connected as one piece of bread. The central part of the “$8$” is a single section, and each of the two loops of “$8$” is divided into an additional $1010$ pieces. For each section, there is a $50$ percent chance that Jacob will decide to cut it out and give it to a friend, and this is done independently for each section. The remaining sections of bread form some number of connected pieces. If $E$ is the expected number of these pieces, and $k$ is the smallest positive integer so that $2^k(E - \lfloor E \rfloor ) \ge 1$, find $\lfloor E \rfloor +k$. (Here, we say that if Jacob donates all pieces, there are $0$ pieces left).
Answer: 1515
user: Let $C$ denote the curve $y^2 =\frac{x(x+1)(2x+1)}{6}$. The points $(1/2, a)$,$(b, c)$, and $(24, d)$ lie on $C$ and are collinear, and $ad < 0$. Given that $b, c$ are rational numbers, find $100b^2 + c^2$.
Answer: 101
user: Katie has a chocolate bar that is a $5$-by-$5$ grid of square pieces, but she only wants to eat the center piece. To get to it, she performs the following operations:
i. Take a gridline on the chocolate bar, and split the bar along the line.
ii. Remove the piece that doesn’t contain the center.
iii. With the remaining bar, repeat steps $1$ and $2$.
Determine the number of ways that Katie can perform this sequence of operations so that eventually she ends up with just the center piece.
Answer: 6384
user: Consider a regular $2020$-gon circumscribed into a circle of radius $ 1$. Given three vertices of this polygon such that they form an isosceles triangle, let $X$ be the expected area of the isosceles triangle they create. $X$ can be written as $\frac{1}{m \tan((2\pi)/n)}$ where $m$ and $n$ are integers. Compute $m + n$.
Answer: 5049
user: Hexagon $ABCDEF$ has an inscribed circle $\Omega$ that is tangent to each of its sides. If $AB = 12$, $\angle FAB = 120^o$, and $\angle ABC = 150^o$, and if the radius of $\Omega$  can be written as $m +\sqrt{n}$ for positive integers $m, n$, find $m + n$.
Answer: 36
user: Consider a $2021$-by-$2021$ board of unit squares. For some integer $k$, we say the board is tiled by $k$-by-$k$ squares if it is completely covered by (possibly overlapping) $k$-by-$k$ squares with their corners on the corners of the unit squares. What is the largest integer k such that the minimum number of $k$-by-$k$ squares needed to tile the $2021$-by-$2021$ board is exactly equal to $100$?
Answer: 224
user: Runey is speaking his made-up language, Runese, that consists only of the “letters” zap, zep, zip, zop, and zup. Words in Runese consist of anywhere between $1$ and $5$ letters, inclusive. As well, Runey can choose to add emphasis on any letter(s) that he chooses in a given word, hence making it a totally distinct word! What is the maximum number of possible words in Runese?
Answer: 111110
user: Heron is going to watch a show with $n$ episodes which are released one each day. Heron wants to watch the first and last episodes on the days they first air, and he doesn’t want to have two days in a row that he watches no episodes. He can watch as many episodes as he wants in a day. Denote by $f(n)$ the number of ways Heron can choose how many episodes he watches each day satisfying these constraints. Let $N$ be the $2021$st smallest value of $n$ where $f(n) \equiv 2$ mod $3$. Find $N$.
Answer: 265386
user: There are n lilypads in a row labeled $1, 2, \dots, n$ from left to right. Fareniss the Frog picks a lilypad at random to start on, and every second she jumps to an adjacent lilypad; if there are two such lilypads, she is twice as likely to jump to the right as to the left. After some finite number of seconds, there exists two lilypads $A$ and $B$ such that Fareniss is more than $1000$ times as likely to be on $A$ as she is to be on $B$. What is the minimal number of lilypads $n$ such that this situation must occur?
Answer: 12
user: We say that a polynomial $p$ is respectful if $\forall x, y \in Z$, $y - x$ divides $p(y) - p(x)$, and $\forall x \in Z$, $p(x)  \in Z$. We say that a respectful polynomial is disguising if it is nonzero, and all of its non-zero coefficients lie between $0$ and $ 1$, exclusive. Determine $\sum deg(f)\cdot  f(2)$, where the sum includes all disguising polynomials $f$ of degree at most $5$.
Answer: 290
user: Select two distinct diagonals at random from a regular octagon. What is the probability that the two diagonals intersect at a point strictly within the octagon? Express your answer as $a + b$, where the probability is $\tfrac{a}{b}$ and $a$ and $b$ are relatively prime positive integers.
Answer: 26
user: Suppose that $f : Z\times Z \to R$, satisfies the equation $f(x, y) = f(3x+y, 2x+ 2y)$ for all $x, y \in Z$. Determine the maximal number of distinct values of $f(x, y)$ for $1 \le x, y \le  100$.
Answer: 8983
user: Let $f(n) = \sum_{gcd(k,n)=1,1\le k\le n}k^3$ . If the prime factorization of $f(2020)$ can be written as $p^{e_1}_1 p^{e_2}_2 ... p^{e_k}_k$, find $\sum^k_{i=1} p_ie_i$.
Answer: 818
user: Let $f$ be a polynomial. We say that a complex number $p$ is a double attractor if there exists a polynomial $h(x)$ so that $f(x)-f(p) = h(x)(x-p)^2$ for all x \in R. Now, consider the polynomial $$f(x) = 12x^5 - 15x^4 - 40x^3 + 540x^2 - 2160x + 1,$$ and suppose that it’s double attractors are $a_1, a_2, ... , a_n$. If the sum $\sum^{n}_{i=1}|a_i|$ can be written as $\sqrt{a} +\sqrt{b}$, where $a, b$ are positive integers, find $a + b$.
Answer: 49
user: A [i]substring [/i] of a number $n$ is a number formed by removing some digits from the beginning and end of $n$ (possibly a different number of digits is removed from each side). Find the sum of all prime numbers $p$ that have the property that any substring of $p$ is also prime.
Answer: 576
user: $ABC$ is a triangle where $AB = 10$, $BC = 14$, and $AC = 16$. Let $DEF$ be the triangle with smallest area so that $DE$ is parallel to $AB$, $EF$ is parallel to $BC$, $DF$ is parallel to $AC$, and the circumcircle of $ABC$ is $DEF$’s inscribed circle. Line $DA$ meets the circumcircle of $ABC$ again at a point $X$. Find $AX^2$
.
Answer: 196
user: A nonempty word is called pronounceable if it alternates in vowels (A, E, I, O, U) and consonants (all other letters) and it has at least one vowel. How many pronounceable words can be formed using the letters P, U, M, A, C at most once each? Words of length shorter than $5$ are allowed.
Answer: 68
user: Compute the sum of all real numbers x which satisfy the following equation $$\frac {8^x - 19 \cdot 4^x}{16 - 25 \cdot 2^x}= 2$$
Answer: 5
user: Given a positive integer $n$ with prime factorization $p_1^{e_1}p_2^{e_2}... p_k^{e_k}$ , we define $f(n)$ to be  $\sum^k_{i=1}p_ie_i$. In other words, $f(n)$ is the sum of the prime divisors of $n$, counted with multiplicities. Let $M$ be the largest odd integer such that $f(M) = 2023$, and $m$ the smallest odd integer so that $f(m) = 2023$. Suppose that $\frac{M}{m}$ equals $p_1^{e_1}p_2^{e_2}... p_l^{e_l}$ , where the $e_i$ are all nonzero integers and the $p_i$ are primes. Find $\left| \sum^l_{i=1} (p_i + e_i) \right|$.
Answer: 2695
user: Determine the number of pairs $(a, b)$, where $1 \le a \le b \le 100$ are positive integers, so that $\frac{a^3+b^3}{a^2+b^2}$ is an integer.
Answer: 122
user: Compute the number of ordered pairs of non-negative integers $(x, y)$ which satisfy $x^2 + y^2 = 32045.$
Answer: 16
user: Let $f(n) = \sum^n_{i=1}\frac{gcd(i,n)}{n}$. Find the sum of all positive integers $ n$ for which $f(n) = 6$.
Answer: 1192
user: The roots of the polynomial $f(x) = x^8 +x^7 -x^5 -x^4 -x^3 +x+ 1 $ are all roots of unity. We say that a real number $r \in [0, 1)$ is nice if $e^{2i \pi r} = \cos 2\pi r + i \sin 2\pi r$ is a root of the polynomial $f$ and if $e^{2i \pi r}$  has positive imaginary part. Let $S$ be the sum of the values of nice real numbers $r$. If $S =\frac{p}{q}$  for relatively prime positive integers $p, q$, find $p + q$.
Answer: 31
user: Nelson is having his friend drop his unique bouncy ball from a $12$ foot building, and Nelson will only catch the ball at the peak of its trajectory between bounces. On any given bounce, there is an $80\%$ chance that the next peak occurs at $\frac13$ the height of the previous peak and a $20\%$ chance that the next peak occurs at $3$ times the height of the previous peak (where the first peak is at $12$ feet). If Nelson can only reach $4$ feet into the air and will catch the ball as soon as possible, the probability that Nelson catches the ball after exactly $13$ bounces is $2^a \times 3^b  \times 5^c  \times 7^d  \times 11^e$ for integers $a, b, c, d$, and $e$. Find $|a| + |b| + |c| + |d| + |e|$.
Answer: 31
user: Neel and Roshan are going to the Newark Liberty International Airport to catch separate flights. Neel plans to arrive at some random time between 5:30 am and 6:30 am, while Roshan plans to arrive at some random time between 5:40 am and 6:40 am. The two want to meet, however briefly, before going through airport security. As such, they agree that each will wait for $n$ minutes once he arrives at the airport before going through security. What is the smallest $n$ they can select such that they meet with at least 50% probability? The answer will be of the form $a + b\sqrt{c}$ for integers $a$, $b$, and $c$, where $c$ has no perfect square factor other than $1$. Report $a + b + c.$
Answer: 67
user: For a bijective function $g : R \to R$, we say that a function $f : R \to R$ is its superinverse if it satisfies the following identity $(f \circ g)(x) = g^{-1}(x)$, where $g^{-1}$ is the inverse of $g$. Given $g(x) = x^3 + 9x^2 + 27x + 81$ and $f$ is its superinverse, find $|f(-289)|$.
Answer: 7
user: A Princeton slot machine has $100$ pictures, each equally likely to occur. One is a picture of a tiger. Alice and Bob independently use the slot machine, and each repeatedly makes independent plays. Alice keeps playing until she sees a tiger, at which point she stops. Similarly, Bob keeps playing until he sees a tiger. Given that Bob plays twice as much as Alice, let the expected number of plays for Alice be $\tfrac{a}{b}$ with $a, b$ relatively prime positive integers. Find the remainder when $a + b$ is divided by $1000$.
Answer: 701
user: Let $f(N) = N \left( \frac{9}{10} \right)^N$ , and let $\frac{m}{n}$ denote the maximum value of $f(N)$, as $N$ ranges over the positive integers. If $m$ and $n$ are relatively prime positive integers, find the remainder when $m + n$ is divided by $1000$.
Answer: 401
user: Given a real number $t$ with $0 < t < 1$, define the real-valued function $f(t, \theta) = \sum^{\infty}_{n=-\infty} t^{|n|}\omega^n$, where $\omega = e^{i \theta} = \cos  \theta + i\sin  \theta$. For $\theta \in [0, 2\pi)$, the polar curve $r(\theta) = f(t, \theta)$ traces out an ellipse $E_t$ with a horizontal major axis whose left focus is at the origin. Let $A(t)$ be the area of the ellipse $E_t$. Let $A\left( \frac12 \right) = \frac{a\pi}{b}$ , where $a, b$ are relatively prime positive integers. Find $100a +b$ .
Answer: 503
user: Consider the sum $$S =\sum^{2021}_{j=1} \left|\sin \frac{2\pi j}{2021}\right|.$$
The value of $S$ can be written as $\tan \left( \frac{c\pi}{d} \right)$ for some relatively prime positive integers $c, d$, satisfying $2c < d$. Find the value of $c + d$.
Answer: 3031
user: Consider the sequence given by $a_0 = 3$ and such that for $i \ge 1$, we have $ai = 2^{a_{i-1}} + 1$. Let $m$ be the smallest integer such that $a^3_3$ divides $a_m$. Let $m'$ the smallest integer such that $a^3_m$ divides $a_{m'}$ . Find the value of $m'$.
Answer: 35
user: Compute the remainder when $2^{3^5}+ 3^{5^2}+ 5^{2^3}$ is divided by $30$.
Answer: 6
user: Eighteen people are standing in a (socially-distanced) line to enter a grocery store. Five people are wearing a black mask, $6$ are wearing a gray mask, and $7$ are wearing a white mask. Suppose that these $18$ people got on line in a random order. The expected number of pairs of adjacent people wearing different-colored masks can be given by $\tfrac{a}{b}$, where $\gcd(a, b) = 1$. Compute $a+b$.
Answer: 116
user: Kris is asked to compute $\log_{10} (x^y)$, where $y$ is a positive integer and $x$ is a positive real number. However, they misread this as $(\log_{10} x)^y$ , and compute this value. Despite the reading error, Kris still got the right answer. Given that $x > 10^{1.5}$ , determine the largest possible value of $y$.
Answer: 4
user: Given an integer $a_0$, we define a sequence of real numbers $a_0, a_1, . . .$ using the relation $$a^2_i = 1 + ia^2_{i-1},$$
for $i \ge 1$. An index $j$ is called [i]good [/i] if $a_j$ can be an integer for some $a_0$. Determine the sum of the indices $j$ which lie in the interval $[0, 99]$ and which are not good.
Answer: 4946
user: Jack plays a game in which he first rolls a fair six-sided die and gets some number $n$, then, he flips a coin until he flips $n$ heads in a row and wins, or he flips $n$ tails in a row in which case he rerolls the die and tries again. What is the expected number of times Jack must flip the coin before he wins the game.
Answer: 40
user: The smallest three positive proper divisors of an integer n are $d_1 < d_2 < d_3$ and they satisfy $d_1 + d_2 + d_3 = 57$. Find the sum of the possible values of $d_2$.
Answer: 42
user: Consider the following expression
$$S = \log_2 \left( \sum^{2019}_{k=1}\sum^{2020}_{j=2}\log_{2^{1/k}} (j) \log_{j^2} \left(\sin \frac{\pi k}{2020}\right) \right).$$
Find the smallest integer $n$ which is bigger than $S$ (i.e. find $\lceil S \rceil$).
Answer: 31
user: Abby and Ben have a little brother Carl who wants candy. Abby has $7$ different pieces of candy and Ben has $15$ different pieces of candy. Abby and Ben then decide to give Carl some candy. As Ben wants to be a better sibling than Abby, so he decides to give two more pieces of candy to Carl than Abby does. Let $N$ be the number of ways Abby and Ben can give Carl candy. Compute the number of positive divisors of $N$.
Answer: 96
user: Consider the sequence of Fibonacci numbers $F_0, F_1, F_2, ... $, given by $F_0 = F_1= 1$ and $F_{n+1} =F_n + F_{n-1}$ for $n\ge 1$. Define the sequence $x_0, x_1, x_2, ....$ by $x_0 = 1$ and $x_{k+1} = x^2_k + F^2_{2^k}$ for $k \ge 0$. Define the sequence $y_0, y_1, y_2, ...$ by $y_0 = 1$ and $y_{k+1} = 2x_ky_k - y^2_k$ for $k \ge 0$. If $$\sum^{\infty}_{k=0} \frac{1}{y_k}= \frac{a -\sqrt{b}}{c}$$
for positive integers a$, b, c$ with $gcd (a, c) = 1$, find $a + b + c$.
Answer: 14
user: The new PUMaC tournament hosts $2020$ students, numbered by the following set of labels $1, 2, . . . , 2020$. The students are initially divided up into $20$ groups of $101$, with each division into groups equally likely. In each of the groups, the contestant with the lowest label wins, and the winners advance to the second round. Out of these $20$ students, we chose the champion uniformly at random. If the expected value of champion’s number can be written as $\frac{a}{b}$, where $a, b$ are relatively prime integers, determine $a + b$.
Answer: 2123