Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: For positive integer $n$ , let $s(n)$ denote the sum of the digits of $n$ .  Find the smallest positive integer satisfying $s(n) = s(n+864) = 20$

Solution: First, note that to compute $s(m+n)$ (for any positive integers $m$ and $n$ ), one can simply find the sum of $s(m)$ and $s(n)$ minus 9 times the number of times one regroups when adding $m$ to $n$ .  One can see why this is by noticing that if one were to "forget" to regroup, and leave, say, a 10 in  the ones' place, the sum of the digits would be 9 higher than if one did regroup.  Anyway, one can see that the smallest 3-digit number (on AIME, all the answers are integers from 0 to 999) whose digits sum to 20 is 299.  If we add this number to 864, we have to regroup 3 times, so $s(299+864)$ will be $9=9\cdot3-(8+6+4)$ smaller than $s(299)$ .  We want this difference to be 0, so we need to find a way to only regroup two times.
We now notice that regrouping the hundreds is inevitable, so we must either prevent regrouping the ones or the tens.  Preventing regrouping the tens would require moving many of the tens to the hundreds' place (the ones' place is already full), which is bad when we are trying to minimize the number, but preventing regrouping the ones requires moving fewer ones to the hundreds' place.
We find that to preventing regrouping the ones, the ones' place of our number must be at most 5 (a larger number would sum to ten when added to 4).  Because we want to minimize the number of ones we move to the hundreds' place, we leave exactly 5 by moving four ones to the hundreds' place: $299\to\boxed{695}$

Answer:  695
Problem: For positive integer $n$ , let $s(n)$ denote the sum of the digits of $n$ .  Find the smallest positive integer satisfying $s(n) = s(n+864) = 20$

Solution: Bashing out modulo $9$ and getting lucky we get that if the $8$ and $6$ carry over when adding $n$ and $864$ , that $100a+10b+c \equiv 1+100(a-1)+10(b-4)+c+4 \pmod{9}$ such that $n=100a+10b+c$ and after maximizing $b$ and $c$ such that $c<6$ to not make the $4$ carry over to minimize $a$ we get that $\boxed{695}$ is our answer after confirming there are no lesser solutions.

Answer:  695
Problem: Let $S$ be the set of all ordered triple of integers $(a_1,a_2,a_3)$ with $1 \le a_1,a_2,a_3 \le 10$ . Each ordered triple in $S$ generates a sequence according to the rule $a_n=a_{n-1}\cdot | a_{n-2}-a_{n-3} |$ for all $n\ge 4$ . Find the number of such sequences for which $a_n=0$ for some $n$

Solution: Let $a_1=x, a_2=y, a_3=z$ . First note that if any absolute value equals 0, then $a_n=0$ .
Also note that if at any position, $a_n=a_{n-1}$ , then $a_{n+2}=0$ .
Then, if any absolute value equals 1, then $a_n=0$ .
Therefore, if either $|y-x|$ or $|z-y|$ is less than or equal to 1, then that ordered triple meets the criteria.
Assume that to be the only way the criteria is met.
To prove, let $|y-x|>1$ , and $|z-y|>1$ . Then, $a_4 \ge 2z$ $a_5 \ge 4z$ , and $a_6 \ge 4z$ .
However, since the minimum values of $a_5$ and $a_6$ are equal, there must be a scenario where the criteria was met that does not meet our earlier scenarios. Calculation shows that to be $z=1$ $|y-x|=2$ . Again assume that any other scenario will not meet criteria.
To prove, divide the other scenarios into two cases: $z>1$ $|y-x|>1$ , and $|z-y|>1$ ; and $z=1$ $|y-x|>2$ , and $|z-y|>1$ .
For the first one, $a_4 \ge 2z$ $a_5 \ge 4z$ $a_6 \ge 8z$ , and $a_7 \ge 16z$ , by which point we see that this function diverges.
For the second one, $a_4 \ge 3$ $a_5 \ge 6$ $a_6 \ge 18$ , and $a_7 \ge 54$ , by which point we see that this function diverges.
Therefore, the only scenarios where $a_n=0$ is when any of the following are met: $|y-x|<2$ (280 options) $|z-y|<2$ (280 options, 80 of which coincide with option 1) $z=1$ $|y-x|=2$ . (16 options, 2 of which coincide with either option 1 or option 2)
Adding the total number of such ordered triples yields $280+280-80+16-2=\boxed{494}$

Answer:  494
Problem: Let $S$ be the set of all ordered triple of integers $(a_1,a_2,a_3)$ with $1 \le a_1,a_2,a_3 \le 10$ . Each ordered triple in $S$ generates a sequence according to the rule $a_n=a_{n-1}\cdot | a_{n-2}-a_{n-3} |$ for all $n\ge 4$ . Find the number of such sequences for which $a_n=0$ for some $n$

Solution: Note that the only way for a $0$ to be produced at $a_n$ is if either $a_{n-1} = 0$ or $a_{n-2} = a_{n-3}$ . Since the first one will eventually get to the first three assuming that there is no $a_{n-2} = a_{n-3}$ for any $n$ , that is not possible because $a_1 , a_2 , a_3 >= 1$ . Therefore, we need $a_{n - 2} = a_{n - 3}$
If $2$ consecutive numbers out of $a_1 , a_2 , a_3$ are equal, then those cases work( $a_1$ and $a_2$ or $a_2$ and $a_3$ $\textbf{NOT}$ $a_1$ and $a_3$ ). This is simply $10 \cdot 10 + 10 \cdot 10 - 10 = 190$ by PIE.
Now, note that if any of the first three numbers have difference of $1$ , we have another working case. First, we calculate how many there are given exactly one of $a_1,a_2$ or $a_2,a_3$ have difference $1$ . Given $3$ numbers such that the first $2$ have difference $1$ , exactly $4$ permutations work(assuming the numbers are $x,y,$ and $z$ such that $|x-y| = 1$ ): $x,y,z$ $y,x,z$ $z,x,y$ ; and $z,y,x$ . If the two consecutive numbers are $1$ and $2$ , then the last number has $7$ possiblities: $4,5,6,\cdots , 10$ . This is symmetric for $9$ and $10$ . If the consecutive numbers are $(2,3),\cdots , (8,9)$ , there are $6$ possibilities( $10$ minus the numbers themselves and the numbers directly above and below). Note that we are not counting any cases already counted in the first case. Therefore, this case gives you $4(7 + 6 * 7 + 7) = 224$ . Now we consider the case that there both adjacent $a$ s have increments of $1$ \[+1 , +1 \rightarrow 8\] \[-1 , -1 \rightarrow 8\] \[+1 , -1 \rightarrow 9\] \[-1 , +1 \rightarrow 9\] Therefore this gives $224 + 8 + 8 + 9 + 9 = 258$ . However, note that we have to add the case where you have $3$ consecutive numbers in arrangement such that only $2$ consecutive numbers have difference $1$ . For example, $1,3,2$ is one such triple. There are $8$ triples of consecutive numbers and $4$ ways to arrange each one(e.x: $(1,3,2);(3,1,2);(2,1,3);(2,3,1)$ ). This adds on 32 working cases, so this case gives $258 + 32 = 290$
Note that there is an ultraspecial(Yes, I know that's not a word) case where we generate a pair of $a_i$ that have difference one. This can only happen if $a_3 = 1$ and $a_1$ and $a_2$ have difference $2$ . This contributes $14$ cases( $2 * 8$ and then subtract $2$ because of the cases $3,1,1$ and $4,2,1$ ).
Therefore, our answer is $190 + 290 + 14 = \boxed{494}$ .
Solution by hyxue

Answer:  494
Problem: Let $f(x)$ be a third-degree polynomial with real coefficients satisfying \[|f(1)|=|f(2)|=|f(3)|=|f(5)|=|f(6)|=|f(7)|=12.\] Find $|f(0)|$

Solution: Let $f(x)$ $ax^3+bx^2+cx+d$ .
Since $f(x)$ is a third degree polynomial, it can have at most two bends in it where it goes from up to down, or from down to up.
By drawing a coordinate axis, and two lines representing $12$ and $-12$ , it is easy to see that $f(1)=f(5)=f(6)$ , and $f(2)=f(3)=f(7)$ ; otherwise more bends would be required in the graph. Since only the absolute value of $f(0)$ is required, there is no loss of generalization by stating that $f(1)=12$ , and $f(2)=-12$ . This provides the following system of equations. \[a +     b +   c +   d =  12\] \[8a +   4b + 2c +   d = -12\] \[27a +   9b + 3c +   d = -12\] \[125a + 25b + 5c +   d =  12\] \[216a + 36b + 6c +   d =  12\] \[343a + 49b + 7c +   d = -12\] Using any four of these functions as a system of equations yields $d = |f(0)| = \boxed{072}$

Answer:  072
Problem: Let $f(x)$ be a third-degree polynomial with real coefficients satisfying \[|f(1)|=|f(2)|=|f(3)|=|f(5)|=|f(6)|=|f(7)|=12.\] Find $|f(0)|$

Solution: By drawing the function, and similar to Solution 1, WLOG let $f(1)=f(5)=f(6)=12$ . Then, $f(2)=f(3)=f(7)$ . Set $g(x)+12=f(x)$ . Then the roots of $g(x)$ are $1,5,6$ . So, $g(x)=a(x-1)(x-5)(x-6)$ . Plug in $x=2$ to find a. We know \[-24=-12-12=f(2)-12=g(2)=a(1)(-3)(-4)=12a\] .
So, $a=-2$ . Thus, $f(x)=g(x)+12=-2(x-1)(x-5)(x-6)+12$ , and then $|f(0)|=60+12=\boxed{072}$

Answer:  072
Problem: Let $f(x)$ be a third-degree polynomial with real coefficients satisfying \[|f(1)|=|f(2)|=|f(3)|=|f(5)|=|f(6)|=|f(7)|=12.\] Find $|f(0)|$

Solution: Without loss of generality, let $f(1) = 12$ . (If $f(1) = -12$ , then take $-f(x)$ as the polynomial, which leaves $|f(0)|$ unchanged.) Because $f$ is third-degree, write \[f(x) - 12 = a(x - 1)(x - b)(x - c)\] \[f(x) + 12 = a(x - d)(x - e)(x - f)\] where $\{b, c, d, e, f \}$ clearly must be a permutation of $\{2, 3, 5, 6, 7\}$ from the given condition. Thus $b + c + d + e + f = 2 + 3 + 5 + 6 + 7 = 23.$ However, subtracting the two equations gives $-24 = a[(x - 1)(x - b)(x - c) - (x - d)(x - e)(x - f)]$ , so comparing $x^2$ coefficients gives $1 + b + c = d + e + f$ and thus both values equal to $\dfrac{24}{2} = 12$ . As a result, $\{b, c \} = \{5, 6 \}$ . As a result, $-24 = a (12)$ and so $a = -2$ . Now, we easily deduce that $f(0) = (-2) \cdot (-1) \cdot (-5) \cdot (-6) + 12 = 72,$ and so removing the without loss of generality gives $|f(0)| = \boxed{072}$ , which is our answer.

Answer:  072
Problem: Let $f(x)$ be a third-degree polynomial with real coefficients satisfying \[|f(1)|=|f(2)|=|f(3)|=|f(5)|=|f(6)|=|f(7)|=12.\] Find $|f(0)|$

Solution: The following solution is similar to solution 3, but assumes nothing. Let $g(x)=(f(x))^2-144$ . Since $f$ has degree 3, $g$ has degree 6 and has roots 1,2,3,5,6, and 7. Therefore, $g(x)=k(x-1)(x-2)(x-3)(x-5)(x-6)(x-7)$ for some $k$ . Hence $|f(0)|=\sqrt{g(0)+144}=\sqrt{1260k+144}$ . Note that $g(x)=(f(x)+12)(f(x)-12)$ . Since $f$ has degree 3, so do $f(x)+12$ and $f(x)-12$ ; and both have the same leading coefficient. Hence $f(x)+12=a(x-q)(x-r)(x-s)$ and $f(x)-12=a(x-t)(x-u)(x-v)$ for some $a\neq 0$ (else $f$ is not cubic) where $\{q,r,s,t,u,v\}$ is the same as the set $\{1,2,3,5,6,7\}$ . Subtracting the second equation from the first, expanding, and collecting like terms, we have that \[24=a((t+u+v-(q+r+s))x^2-a(tu+uv+tv-(qr+qs+rs))x+a(tuv-qrs)\] which must hold for all $x$ . Since $a\neq 0$ we have that (1) $t+u+v=q+r+s$ , (2) $tu+uv+tv=qr+qs+rs$ and (3) $a(tuv-qrs)=24$ . Since $q+r+s+t+u+v$ is the sum of 1,2,3,5,6, and 7, we have $q+r+s+t+u+v=24$ so that by (1) we have $q+r+s=12$ and $t+u+v=12$ . We must partition 1,2,3,5,6,7 into 2 sets each with a sum of 12. Consider the set that contains 7. It can't contain 6 or 5 because the sum of that set would already be $\geq 12$ with only 2 elements. If 1 is in that set, the other element must be 4 which is impossible. Hence the two sets must be $\{2,3,7\}$ and $\{1,5,6\}$ . Note that each of these sets happily satisfy (2). By (3), since the sets have products 42 and 30 we have that $|a|=\frac{24}{|tuv-qrs|}=\frac{24}{12}=2$ . Since $a$ is the leading coefficient of $f(x)$ , the leading coefficient of $(f(x))^2$ is $a^2=|a|^2=2^2=4$ . Thus the leading coefficient of $g(x)$ is 4, i.e. $k=4$ . Then from earlier, $|f(0)|=\sqrt{g(0)+144}=\sqrt{1260k+144}=\sqrt{1260\cdot4+144}=\sqrt{5184}=72$ so that the answer is $\boxed{072}$

Answer:  072
Problem: Let $f(x)$ be a third-degree polynomial with real coefficients satisfying \[|f(1)|=|f(2)|=|f(3)|=|f(5)|=|f(6)|=|f(7)|=12.\] Find $|f(0)|$

Solution: Express $f(x)$ in terms of powers of $(x-4)$ \[f(x) = a(x-4)^3 + b(x-4)^2 + c(x-4) + d\] By the same argument as in the first Solution, we see that $f(x)$ is an odd function about the line $x=4$ , so its coefficients $b$ and $d$ are 0. From there it is relatively simple to solve $f(2)=f(3)=-12$ (as in the above solution, but with a smaller system of equations): \[a(1)^3 + c(1) = -12\] \[a(2)^3 + c(2) = -12\] $a=2$ and $c=-14$ \[|f(0)| = |2(-4)^3 - 14(-4)| = \boxed{072}\]

Answer:  072
Problem: Let $f(x)$ be a third-degree polynomial with real coefficients satisfying \[|f(1)|=|f(2)|=|f(3)|=|f(5)|=|f(6)|=|f(7)|=12.\] Find $|f(0)|$

Solution: Because a cubic must come in a "wave form" with two points of inflection, we can see that $f(1)=f(5)=f(6)$ , and $f(2)=f(3)=f(7)$ . By symmetry, $f(4)=0$ . Now, WLOG let $f(1)=12$ , and $f(2)=f(3)=-12$ . Then, we can use finite differences to get that the third (constant) difference is $12$ , and therefore $f(0)=12+(24+(24+12))=\boxed{072}$

Answer:  072
Problem: Let $f(x)$ be a third-degree polynomial with real coefficients satisfying \[|f(1)|=|f(2)|=|f(3)|=|f(5)|=|f(6)|=|f(7)|=12.\] Find $|f(0)|$

Solution: We can rewrite our function as two different cubics, $f(x)=k(x-a)(x-b)(x-c)\pm12=k(x-d)(x-e)(x-f)\mp12$ . Note that $k$ is the same in both because they must be equal, so their leading terms must be. We must then, following Vieta's, choose our roots such that $a+b+c=d+e+f$ and verify that the other Vieta's formulas hold. Additionally, a cubic must only cross the x-axis thrice, restricting our choices for roots further. Choosing $a=1$ $b=5$ $c=6$ $d=2$ $e=3$ $f=7$ yields: \[kx^3-12kx^2+41kx-30k\pm12=kx^3-12kx^2+41kx-42k\mp12\] For the constant terms to have a difference of 24 ( $|\pm12-\mp12|$ ), we must have $k=\pm2$ , so the constant term of our polynomial is $\pm72$ , the absolute value of which is $\boxed{072}$ . -- Solution by eiis1000

Answer:  072
Problem: Triangle $ABC$ has positive integer side lengths with $AB=AC$ . Let $I$ be the intersection of the bisectors of $\angle B$ and $\angle C$ . Suppose $BI=8$ . Find the smallest possible perimeter of $\triangle ABC$

Solution: Let $D$ be the midpoint of $\overline{BC}$ . Then by SAS Congruence, $\triangle ABD \cong \triangle ACD$ , so $\angle ADB = \angle ADC = 90^o$
Now let $BD=y$ $AB=x$ , and $\angle IBD = \dfrac{\angle ABD}{2} = \theta$
Then $\mathrm{cos}{(\theta)} = \dfrac{y}{8}$
and $\mathrm{cos}{(2\theta)} = \dfrac{y}{x} = 2\mathrm{cos^2}{(\theta)} - 1 = \dfrac{y^2-32}{32}$
Cross-multiplying yields $32y = x(y^2-32)$
Since $x,y>0$ $y^2-32$ must be positive, so $y > 5.5$
Additionally, since $\triangle IBD$ has hypotenuse $\overline{IB}$ of length $8$ $BD=y < 8$
Therefore, given that $BC=2y$ is an integer, the only possible values for $y$ are $6$ $6.5$ $7$ , and $7.5$
However, only one of these values, $y=6$ , yields an integral value for $AB=x$ , so we conclude that $y=6$ and $x=\dfrac{32(6)}{(6)^2-32}=48$
Thus the perimeter of $\triangle ABC$ must be $2(x+y) = \boxed{108}$

Answer:  108
Problem: Triangle $ABC$ has positive integer side lengths with $AB=AC$ . Let $I$ be the intersection of the bisectors of $\angle B$ and $\angle C$ . Suppose $BI=8$ . Find the smallest possible perimeter of $\triangle ABC$

Solution: Angle bisectors motivate trig bash. 
Define angle $IBC = x$ . Foot of perpendicular from $I$ to $BC$ is point $P$ $\overline{BC} = 2\overline{BP} = 2(8\cos(x)) = N$ , where $N$ is an integer. Thus, $\cos(x) = \frac{N}{16}$ . Via double angle, we calculate $\overline{AB}$ to be $\frac{8\cos(x)}{2\cos(x)^2 - 1} = \frac{64N}{N^2 - 128}$ . This is to be an integer.  We can bound $N$ now, as $N > 11$ to avoid negative values and $N < 16$ due to triangle inequality. Testing, $N = 12$ works, giving $\overline{AB} = 48, \overline{BC} = 12$ .
Our answer is $2 * 48 + 12 = \boxed{108}$ .
- whatRthose

Answer:  108
Problem: Triangle $ABC$ has positive integer side lengths with $AB=AC$ . Let $I$ be the intersection of the bisectors of $\angle B$ and $\angle C$ . Suppose $BI=8$ . Find the smallest possible perimeter of $\triangle ABC$

Solution: Let $M$ be midpoint $BC, BM = x, AB = y, \angle IBM = \alpha.$
$BI$ is the bisector of $\angle ABM$ in $\triangle ABM.$ $BI = \frac {2 xy \cos \alpha}{x+y} = 8, \cos \alpha = \frac {x}{8} \implies \frac {x^2 y}{x+y} = 32.$ \[y = \frac {32 x} {x^2 - 32}.\] $BC = 2x$ is integer, $5.5^2 < 32 \implies x \ge 6.$ $BM < BI \implies x =\{ 6, 6.5, 7, 7.5 \}.$
If $x > 6$ then $y$ is not integer. \[x = 6 \implies y = 48 \implies 2(x+y) =  \boxed{108}.\] vladimir.shelomovskii@gmail.com, vvsss

Answer:  108
Problem: Consider all 1000-element subsets of the set $\{1, 2, 3, ... , 2015\}$ .  From each such subset choose the least element.  The arithmetic mean of all of these least elements is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers.  Find $p + q$

Solution: Let $M$ be the desired mean. Then because $\dbinom{2015}{1000}$ subsets have 1000 elements and $\dbinom{2015 - i}{999}$ have $i$ as their least element, \begin{align*} \binom{2015}{1000} M &= 1 \cdot \binom{2014}{999} + 2 \cdot \binom{2013}{999} + \dots + 1016 \cdot \binom{999}{999} \\      &= \binom{2014}{999} + \binom{2013}{999} + \dots + \binom{999}{999} \\      &                      + \binom{2013}{999} + \binom{2012}{999} + \dots + \binom{999}{999} \\      & \dots \\      & + \binom{999}{999} \\      &= \binom{2015}{1000} + \binom{2014}{1000} + \dots + \binom{1000}{1000} \\      &= \binom{2016}{1001}. \end{align*} Using the definition of binomial coefficient and the identity $n! = n \cdot (n-1)!$ , we deduce that \[M = \frac{2016}{1001} = \frac{288}{143}.\] The answer is $\boxed{431}.$

Answer:  431
Problem: Consider all 1000-element subsets of the set $\{1, 2, 3, ... , 2015\}$ .  From each such subset choose the least element.  The arithmetic mean of all of these least elements is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers.  Find $p + q$

Solution: Each 1000-element subset $\left\{ a_1, a_2,a_3,...,a_{1000}\right\}$ of $\left\{1,2,3,...,2015\right\}$ with $a_1<a_2<a_3<...<a_{1000}$ contributes $a_1$ to the sum of the least element of each subset. Now, consider the set $\left\{a_1+1,a_2+1,a_3+1,...,a_{1000}+1\right\}$ . There are $a_1$ ways to choose a positive integer $k$ such that $k<a_1+1<a_2+1,a_3+1<...<a_{1000}+1$ $k$ can be anything from $1$ to $a_1$ inclusive). Thus, the number of ways to choose the set $\left\{k,a_1+1,a_2+1,a_3+1,...,a_{1000}+1\right\}$ is equal to the sum. But choosing a set $\left\{k,a_1+1,a_2+1,a_3+1,...,a_{1000}+1\right\}$ is the same as choosing a 1001-element subset from $\left\{1,2,3,...,2016\right\}$
Thus, the average is $\frac{\binom{2016}{1001}}{\binom{2015}{1000}}=\frac{2016}{1001}=\frac{288}{143}$ . Our answer is $p+q=288+143=\boxed{431}$

Answer:  431
Problem: Consider all 1000-element subsets of the set $\{1, 2, 3, ... , 2015\}$ .  From each such subset choose the least element.  The arithmetic mean of all of these least elements is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers.  Find $p + q$

Solution: Let $p$ be the size of the large set and $q$ be the size of the subset (i.e. in this problem, $p = 2015$ and $q = 1000$ ). We can easily find the answers for smaller values of $p$ and $q$
For $p = 2$ and $q = 2$ , the answer is $1$
For $p = 3$ and $q = 2$ , the answer is $\frac43$
For $p = 4$ and $q = 2$ , the answer is $\frac53$
For $p = 3$ and $q = 3$ , the answer is $1$
For $p = 4$ and $q = 3$ , the answer is $\frac54$
For $p = 5$ and $q = 3$ , the answer is $\frac32$
At this point, we can see a pattern: our desired answer is always $\frac{p+1}{q+1}$ . Plugging in $p = 2015$ and $q = 1000$ , the answer is $\frac{2016}{1001}=\frac{288}{143}$ , so $288 + 143 = \boxed{431}$

Answer:  431
Problem: With all angles measured in degrees, the product $\prod_{k=1}^{45} \csc^2(2k-1)^\circ=m^n$ , where $m$ and $n$ are integers greater than 1. Find $m+n$

Solution: Let $x = \cos 1^\circ + i \sin 1^\circ$ . Then from the identity \[\sin 1 = \frac{x - \frac{1}{x}}{2i} = \frac{x^2 - 1}{2 i x},\] we deduce that (taking absolute values and noticing $|x| = 1$ \[|2\sin 1| = |x^2 - 1|.\] But because $\csc$ is the reciprocal of $\sin$ and because $\sin z = \sin (180^\circ - z)$ , if we let our product be $M$ then \[\frac{1}{M} = \sin 1^\circ \sin 3^\circ \sin 5^\circ \dots \sin 177^\circ \sin 179^\circ\] \[= \frac{1}{2^{90}} |x^2 - 1| |x^6 - 1| |x^{10} - 1| \dots |x^{354} - 1| |x^{358} - 1|\] because $\sin$ is positive in the first and second quadrants. Now, notice that $x^2, x^6, x^{10}, \dots, x^{358}$ are the roots of $z^{90} + 1 = 0.$ Hence, we can write $(z - x^2)(z - x^6)\dots (z - x^{358}) = z^{90} + 1$ , and so \[\frac{1}{M} = \dfrac{1}{2^{90}}|1 - x^2| |1 - x^6| \dots |1 - x^{358}| = \dfrac{1}{2^{90}} |1^{90} + 1| = \dfrac{1}{2^{89}}.\] It is easy to see that $M = 2^{89}$ and that our answer is $2 + 89 = \boxed{91}$

Answer:  91
Problem: With all angles measured in degrees, the product $\prod_{k=1}^{45} \csc^2(2k-1)^\circ=m^n$ , where $m$ and $n$ are integers greater than 1. Find $m+n$

Solution: Let $p=\sin1\sin3\sin5...\sin89$
\[p=\sqrt{\sin1\sin3\sin5...\sin177\sin179}\]
\[=\sqrt{\frac{\sin1\sin2\sin3\sin4...\sin177\sin178\sin179}{\sin2\sin4\sin6\sin8...\sin176\sin178}}\]
\[=\sqrt{\frac{\sin1\sin2\sin3\sin4...\sin177\sin178\sin179}{(2\sin1\cos1)\cdot(2\sin2\cos2)\cdot(2\sin3\cos3)\cdot....\cdot(2\sin89\cos89)}}\]
\[=\sqrt{\frac{1}{2^{89}}\frac{\sin90\sin91\sin92\sin93...\sin177\sin178\sin179}{\cos1\cos2\cos3\cos4...\cos89}}\]
$=\sqrt{\frac{1}{2^{89}}}$ because of the identity $\sin(90+x)=\cos(x)$
we want $\frac{1}{p^2}=2^{89}$
Thus the answer is $2+89=\boxed{091}$

Answer:  091
Problem: With all angles measured in degrees, the product $\prod_{k=1}^{45} \csc^2(2k-1)^\circ=m^n$ , where $m$ and $n$ are integers greater than 1. Find $m+n$

Solution: Similar to Solution $2$ , so we use $\sin{2\theta}=2\sin\theta\cos\theta$ and we find that: \begin{align*}\sin(4)\sin(8)\sin(12)\sin(16)\cdots\sin(84)\sin(88)&=(2\sin(2)\cos(2))(2\sin(4)\cos(4))(2\sin(6)\cos(6))(2\sin(8)\cos(8))\cdots(2\sin(42)\cos(42))(2\sin(44)\cos(44))\\ &=(2\sin(2)\sin(88))(2\sin(4))\sin(86))(2\sin(6)\sin(84))(2\sin(8)\sin(82))\cdots(2\sin(42)\sin(48))(2\sin(44)\sin(46))\\ &=2^{22}(\sin(2)\sin(88)\sin(4)\sin(86)\sin(6)\sin(84)\sin(8)\sin(82)\cdots\sin(42)\sin(48)\sin(44)\sin(46))\\ &=2^{22}(\sin(2)\sin(4)\sin(6)\sin(8)\cdots\sin(82)\sin(84)\sin(86)\sin(88))\end{align*} Now we can cancel the sines of the multiples of $4$ \[1=2^{22}(\sin(2)\sin(6)\sin(10)\sin(14)\cdots\sin(82)\sin(86))\] So $\sin(2)\sin(6)\sin(10)\sin(14)\cdots\sin(82)\sin(86)=2^{-22}$ and we can apply the double-angle formula again: \begin{align*}2^{-22}&=(\sin(2)\sin(6)\sin(10)\sin(14)\cdots\sin(82)\sin(86)\\ &=(2\sin(1)\cos(1))(2\sin(3)\cos(3))(2\sin(5)\cos(5))(2\sin(7)\cos(7))\cdots(2\sin(41)\cos(41))(2\sin(43)\cos(43))\\ &=(2\sin(1)\sin(89))(2\sin(3)\sin(87))(2\sin(5)\sin(85))(2\sin(7)\sin(87))\cdots(2\sin(41)\sin(49))(2\sin(43)\sin(47))\\ &=2^{22}(\sin(1)\sin(89)\sin(3)\sin(87)\sin(5)\sin(85)\sin(7)\sin(83)\cdots\sin(41)\sin(49)\sin(43)\sin(47))\\ &=2^{22}(\sin(1)\sin(3)\sin(5)\sin(7)\cdots\sin(41)\sin(43))(\sin(47)\sin(49)\cdots\sin(83)\sin(85)\sin(87)\sin(89))\end{align*} Of course, $\sin(45)=2^{-\frac{1}{2}}$ is missing, so we multiply it to both sides: \[2^{-22}\sin(45)=2^{22}(\sin(1)\sin(3)\sin(5)\sin(7)\cdots\sin(41)\sin(43))(\sin(45))(\sin(47)\sin(49)\cdots\sin(83)\sin(85)\sin(87)\sin(89))\] \[\left(2^{-22}\right)\left(2^{-\frac{1}{2}}\right)=2^{22}(\sin(1)\sin(3)\sin(5)\sin(7)\cdots\sin(83)\sin(85)\sin(87)\sin(89))\] \[2^{-\frac{45}{2}}=2^{22}(\sin(1)\sin(3)\sin(5)\sin(7)\cdots\sin(83)\sin(85)\sin(87)\sin(89))\] Now isolate the product of the sines: \[\sin(1)\sin(3)\sin(5)\sin(7)\cdots\sin(83)\sin(85)\sin(87)\sin(89)=2^{-\frac{89}{2}}\] And the product of the squares of the cosecants as asked for by the problem is the square of the inverse of this number: \[\csc^2(1)\csc^2(3)\csc^2(5)\csc^2(7)\cdots\csc^2(83)\csc^2(85)\csc^2(87)\csc^2(89)=\left(\frac{1}{2^{-\frac{89}{2}}}\right)^2=\left(2^{\frac{89}{2}}\right)^2=2^{89}\] The answer is therefore $m+n=(2)+(89)=\boxed{091}$

Answer:  091