Let $a=2019^{1009}, b=2019!$ and $c=1010^{2019}$, then which of the following is true? (A)$c<b<a$ (B)$a<b<c$ (C)$b<a<c$ (D)$b<c<a$

Every card in a deck has a picture of one shape - circle, square, or triangle, which is painted in one of the three colors - red, blue, or green. Furthermore, each color is applied in one of three shades - light, medium, or dark. The deck has 27 cards, with every shape-color-shade combination represented. A set of three cards from the deck is called complementary if all of the following statements are true: i. Either each of the three cards has a different shape or all three of the card have the same shape. ii. Either each of the three cards has a different color or all three of the cards have the same color. iii. Either each of the three cards has a different shade or all three of the cards have the same shade. How many different complementary three-card sets are there?

Find the largest integer $n$ for which $2^n$ divides \[ \binom 21 \binom 42 \binom 63 \dots \binom {128}{64}. \][i]Proposed by Evan Chen[/i]

Calculate $ \lim_{n\to\infty }\left(\lim_{x\to 0} \left( -\frac{n}{x}+1+\frac{1}{x}\sum_{r=2}^{n+1}\sqrt[r!]{1+\sin rx}\right)\right) . $ [i]Constantin Rusu[/i]

For any natural number $ m, \quad\lim_{n\to\infty } n^{1+m} \int_{0}^1 e^{-nx}\ln \left( 1+x^m \right) dx =m! . $ [i]Gheorghe Iurea[/i]

Prove that there is no positive integer $n$ such that, for $k = 1,2,\ldots,9$, the leftmost digit (in decimal notation) of $(n+k)!$ equals $k$.

For natural numbers $a, b$, define $Z(a,b)=\frac{(3a)!\cdot (4b)!}{a!^4 \cdot b!^3}$. [b](a)[/b] Prove that $Z(a, b)$ is an integer for $a \leq b$. [b](b)[/b] Prove that for each natural number $b$ there are infinitely many natural numbers a such that $Z(a, b)$ is not an integer.[/list]

There are unique integers $ a_2, a_3, a_4, a_5, a_6, a_7$ such that \[ \frac {5}{7} \equal{} \frac {a_2}{2!} \plus{} \frac {a_3}{3!} \plus{} \frac {a_4}{4!} \plus{} \frac {a_5}{5!} \plus{} \frac {a_6}{6!} \plus{} \frac {a_7}{7!},\] where $ 0 \le a_i < i$ for $ i \equal{} 2,3...,7$. Find $ a_2 \plus{} a_3 \plus{} a_4 \plus{} a_5 \plus{} a_6 \plus{} a_7$. $ \textbf{(A)}\ 8 \qquad \textbf{(B)}\ 9 \qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ 11 \qquad \textbf{(E)}\ 12$

Find all triples $(a, b, c)$ of positive integers such that $a \leq b$ and \[a!+b!=c^4+2024\] [i]Proposed by Otgonbayar Uuye.[/i]

Let be a prime number $ p, $ the quotient ring $ R=\mathbb{Z}[X,Y]/(pX,pY), $ and a prime ideal $ I\supset pA $ that is not maximal. Show that the ring $ \left\{ r/i|r\in R, i\in I \right\} $ is factorial.

Prove that \[\frac{1}{3}n^2 + \frac{1}{2}n + \frac{1}{6} \geq (n!)^{\frac{2}{n}},\] and let $n \geq 1$ be an integer. Prove that this inequality is only possible in the case $n = 1.$

[b]a)[/b] $ \lim_{n\to\infty } \frac{1}{n^2}\sum_{i=0}^n\sqrt{\binom{n+i}{2}} $ [b]b)[/b] $ \lim_{n\to\infty } \frac{a^{H_n}}{1+n} ,\quad a>0 $

Find all couples of positive integers $m$ and $n$ such that $$n!+5=m^3$$

Prove that \[\frac{1}{3}n^2 + \frac{1}{2}n + \frac{1}{6} \geq (n!)^{\frac{2}{n}},\] and let $n \geq 1$ be an integer. Prove that this inequality is only possible in the case $n = 1.$

$p$ and $q$ are distinct prime numbers. Prove that the number \[\frac {(pq-1)!} {p^{q-1}q^{p-1}(p-1)!(q-1)!}\] is an integer.

Find the remainder when $712!$ is divided by $719$.