Prove that exprssion $A=\frac{25}{2}(n+2-\sqrt{2n+3})$, $(n\in\mathbb{N})$ is a perfect square of an integer if exprssion $A$ is an integer .

Let $p$ be a prime number. Let $\mathbb F_p$ denote the integers modulo $p$, and let $\mathbb F_p[x]$ be the set of polynomials with coefficients in $\mathbb F_p$. Define $\Psi : \mathbb F_p[x] \to \mathbb F_p[x]$ by \[ \Psi\left( \sum_{i=0}^n a_i x^i \right) = \sum_{i=0}^n a_i x^{p^i}. \] Prove that for nonzero polynomials $F,G \in \mathbb F_p[x]$, \[ \Psi(\gcd(F,G)) = \gcd(\Psi(F), \Psi(G)). \] Here, a polynomial $Q$ divides $P$ if there exists $R \in \mathbb F_p[x]$ such that $P(x) - Q(x) R(x)$ is the polynomial with all coefficients $0$ (with all addition and multiplication in the coefficients taken modulo $p$), and the gcd of two polynomials is the highest degree polynomial with leading coefficient $1$ which divides both of them. A non-zero polynomial is a polynomial with not all coefficients $0$. As an example of multiplication, $(x+1)(x+2)(x+3) = x^3+x^2+x+1$ in $\mathbb F_5[x]$. [i]Proposed by Mark Sellke[/i]

We say that a natural number $n$ is [i]charrua[/i] if it satisfy simultaneously the following conditions: - Every digit of $n$ is greater than 1. - Every time that four digits of $n$ are multiplied, it is obtained a divisor of $n$ Show that every natural number $k$ there exists a [i]charrua[/i] number with more than $k$ digits.

Consider the addition $\begin{tabular}{cccc} & O & N & E \\ + & T & W & O \\ \hline F & O & U & R \\ \end{tabular}$ where different letters represent different nonzero digits. What is the smallest possible value of the four-digit number $FOUR$?

In each square of a $100 \times 100$ board there is written an integer. The allowed operation is to choose four squares that form the figure or any of its reflections or rotations, and add $1$ to each of the four numbers. The aim is, through operations allowed, achieving a board with the smallest possible number of different residues modulo $33$. What is the minimum number that can be achieved with certainty?

Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both $$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$ are integers.

Is $\frac{19^{92} - 91^{29}}{90}$ an integer?

Find all positive integers $p,q,r,s>1$ such that $$p!+q!+r!=2^s.$$

Let be a natural number $ n. $ Prove that there exists a number $ k\in\{ 0,1,2,\ldots n \} $ such that the floor of $ 2^{n+k}\sqrt 2 $ is even.

Find the greatest natural number $n$ such there exist natural numbers $x_{1}, x_{2}, \ldots, x_{n}$ and natural $a_{1}< a_{2}< \ldots < a_{n-1}$ satisfying the following equations for $i =1,2,\ldots,n-1$: \[x_{1}x_{2}\ldots x_{n}= 1980 \quad \text{and}\quad x_{i}+\frac{1980}{x_{i}}= a_{i}.\]

Find all nonnegative integer numbers such that $7^x- 2 \cdot 5^y = -1$

Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.

Determine all natural numbers $n$ such that for each natural number $a$ relatively prime with $n$ and $a \le 1 + \left\lfloor \sqrt{n} \right\rfloor$ there exists some integer $x$ with $a \equiv x^2 \mod n$. Remark: "Natural numbers" is the set of positive integers.

For which $n \ge 2$ can one find a sequence of distinct positive integers $a_1, a_2, \ldots , a_n$ so that the sum $$\frac{a_1}{a_2} + \frac{a_2}{a_3} + \ldots +\frac{a_n}{a_1}$$ is an integer? [i](3 points)[/i]

Natural numbers $a, b, c, d$ are given such that $c>b$. Prove that if $a + b + c + d = ab-cd$, then $a + c$ is a composite number.

Let $p$ be a prime number greater than $2$. Patricia wants $7$ not-necessarily different numbers from $\{1, 2, . . . , p\}$ to the black dots in the figure below, on such a way that the product of three numbers on a line or circle always has the same remainder when divided by $p$. [img]https://cdn.artofproblemsolving.com/attachments/3/1/ef0d63b8ff5341ffc340de0cc75b24c7229e23.png[/img] (a) Suppose Patricia uses the number $p$ at least once. How many times does she have the number $p$ then a minimum sum needed? (b) Suppose Patricia does not use the number $p$. In how many ways can she assign numbers? (Two ways are different if there is at least one black one dot different numbers are assigned. The figure is not rotated or mirrored.)

Determine all functions $f$ defined on the set of all positive integers and taking non-negative integer values, satisfying the three conditions: [list] [*] $(i)$ $f(n) \neq 0$ for at least one $n$; [*] $(ii)$ $f(x y)=f(x)+f(y)$ for every positive integers $x$ and $y$; [*] $(iii)$ there are infinitely many positive integers $n$ such that $f(k)=f(n-k)$ for all $k<n$. [/list]

[b]p1.[/b] The expression $3 + 2\sqrt2$ can be represented as a perfect square: $3 +\sqrt2 = (1 + \sqrt2)^2$. (a) Represent $29 - 12\sqrt5$ as a prefect square. (b) Represent $10 - 6\sqrt3$ as a prefect cube. [b]p2.[/b] Find all values of the parameter $c$ for which the following system of equations has no solutions. $$x+cy = 1$$ $$cx+9y = 3$$ [b]p3.[/b] The equation $y = x^2 + 2ax + a$ represents a parabola for all real values of $a$. (a) Prove hat each of these parabolas pass through a common point and determine the coordinates of this point. (b) The vertices of the parabolas lie on a curve. Prove that this curve is a parabola and find its equation. [b]p4.[/b] Miranda is a $10$th grade student who is very good in mathematics. In fact she just completed an advanced algebra class and received a grade of A+. Miranda has five sisters, Cathy, Stella, Eva, Lucinda, and Dorothea. Miranda made up a problem involving the ages of the six girls and dared Cathy to solve it. Miranda said: “The sum of our ages is five times my age. (By ’age’ throughout this problem is meant ’age in years’.) When Stella is three times my present age, the sum of my age and Dorothea’s will be equal to the sum of the present ages of the five of us; Eva’s age will be three times her present age; and Lucinda’s age will be twice Stella’s present age, plus one year. How old are Stella and Miranda?” “Well, Miranda, could you tell me something else?” “Sure”, said Miranda, “my age is an odd number”. [b]p5.[/b] Cities $A,B,C$ and $D$ are located in vertices of a square with the area $10, 000$ square miles. There is a straight-line highway passing through the center of a square. Find the sum of squares of the distances from the cities of to the highway. [img]https://cdn.artofproblemsolving.com/attachments/b/4/1f53d81d3bc2a465387ff64de15f7da0949f69.png[/img] [b]p6.[/b] (a) Among three similar coins there is one counterfeit. It is not known whether the counterfeit coin is lighter or heavier than a genuine one (all genuine coins weight the same). Using two weightings on a pan balance, how can the counterfeit be identified and in process determined to be lighter or heavier than a genuine coin? (b) There is one counterfeit coin among $12$ similar coins. It is not known whether the counterfeit coin is lighter or heavier than a genuine one. Using three weightings on a pan balance, how can the counterfeit be identified and in process determined to be lighter or heavier than a genuine coin? PS. You should use hide for answers.

Prove that there are infinitely many prime numbers that divide at least one integer of the form $2^{n^3+1}-3^{n^2+1}+5^{n+1}$ where $n$ is a positive integer.

A few (at least $5$) integers are put on a circle, such that each of them is divisible by the sum of its neighbors. If the sum of all numbers is positive, what is its minimal value?

Find all $l,m,n \in\mathbb{N}$ that satisfies the equation $5^l43^m+1=n^3$

A palindrome is a word that doesn't matter if you read it from left to right or from right to left. Examples: OMO, lepel and parterretrap. How many palindromes can you make with the five letters $a, b, c, d$ and $e$ under the conditions: - each letter may appear no more than twice in each palindrome, - the length of each palindrome is at least $3$ letters. (Any possible combination of letters is considered a word.)

[u]Set 2[/u] [b]2.1[/b] What is the last digit of $2022 + 2022^{2022} + 2022^{(2022^{2022})}$? [b]2.2[/b] Let $T$ be the answer to the previous problem. CMIMC executive members are trying to arrange desks for CMWMC. If they arrange the desks into rows of $5$ desks, they end up with $1$ left over. If they instead arrange the desks into rows of $7$ desks, they also end up with $1$ left over. If they instead arrange the desks into rows of $11$ desks, they end up with $T$ left over. What is the smallest possible (non-negative) number of desks they could have? [b]2.3[/b] Let $T$ be the answer to the previous problem. Compute the largest value of $k$ such that $11^k$ divides $$T! = T(T - 1)(T - 2)...(2)(1).$$ PS. You should use hide for answers.

This question is both combinatorics and Number Theory : a ) Prove that we can color edges of $K_{p}$ with $p$ colors which is proper, ($p$ is an odd prime) and $K_{p}$ can be partitioned to $\frac{p-1}2$ rainbow Hamiltonian cycles. (A Hamiltonian cycle is a cycle that passes from all of verteces, and a rainbow is a subgraph that all of its edges have different colors.) b) Find all answers of $x^{2}+y^{2}+z^{2}=1$ is $\mathbb Z_{p}$

Given a positive integer $n$, define $\tau(n)$ as the number of positive divisors of $n$ and $\sigma(n)$ as the sum of those divisors. For example, $\tau(12) = 6$ and $\sigma(12) = 28$. Find all positive integers $n$ that satisfy: \[ \sigma(n) = \tau(n) \cdot \lceil \sqrt{n} \rceil \]