Let $x_1,\ldots,x_n$ be a sequence with each term equal to $0$ or $1$. Form a triangle as follows: its first row is $x_1,\ldots,x_n$ and if a row if $a_1, a_2, \ldots, a_m$, then the next row is $a_1 + a_2, a_2 + a_3, \ldots, a_{m-1} + a_m$ where the addition is performed modulo $2$ (so $1+1=0$). For example, starting from $1$, $0$, $1$, $0$, the second row is $1$, $1$, $1$, the third one is $0$, $0$ and the fourth one is $0$. A sequence is called good it is the same as the sequence formed by taking the last element of each row, starting from the last row (so in the above example, the sequence is $1010$ and the corresponding sequence from last terms is $0010$ and they are not equal in this case). How many possibilities are there for the sequence formed by taking the first element of each row, starting from the last row, which arise from a good sequence?

Let $\gamma,\gamma_0,\gamma_1,\gamma_2$ be four circles in plane,such that $\gamma_i$ is interiorly tangent to $\gamma$ in point $A_i$,and $\gamma_i$ and $\gamma_{i+1}$ are exteriorly tangent in point $B_{i+2}$,$i=0,1,2$(the indexes are reduced modulo $3$).The tangent in $B_i$,common for circles $\gamma_{i-1}$ and $\gamma_{i+1}$,intersects circle $\gamma$ in point $C_i$,situated in the opposite semiplane of $A_i$ with respect to line $A_{i-1}A_{i+1}$.Prove that the three lines $A_iC_i$ are concurrent.

Let $f$ be a polynomial of degree $n$ with integer coefficients and $p$ a prime for which $f$, considered modulo $p$, is a degree-$k$ irreducible polynomial over $\mathbb{F}_p$. Show that $k$ divides the degree of the splitting field of $f$ over $\mathbb{Q}$.

Suppose that $p$ is an odd prime such that $2p+1$ is also prime. Show that the equation $x^{p}+2y^{p}+5z^{p}=0$ has no solutions in integers other than $(0,0,0)$.

Let $ G$ be a solvable torsion group in which every Abelian subgroup is finitely generated. Prove that $ G$ is finite. [i]J. Pelikan[/i]

Let $ S $ be a nonempty subset of a finite group $ G, $ and $ \left( S^j \right)_{j\ge 1} $ be a sequence of sets defined as $ S^j=\left.\left\{\underbrace{xy\cdots z}_{\text{j terms}} \right| \underbrace{x,y,\cdots ,z}_{\text{j terms}} \in S \right\} . $ Prove that: [b]a)[/b] $ \exists i_0\in\mathbb{N}^*\quad i\ge i_0\implies \left| S^i\right| =\left| S^{1+i}\right| $ [b]b)[/b] $ S^{|G|}\le G $

Let be a natural number $ n\ge 4, $ and a group $ G $ for which the applications $ \iota ,\eta : G\longrightarrow G $ defined by $ \iota (g) =g^n ,\eta (g) =g^{2n} $ are endomorphisms. Prove that $ G $ is commutative if $ \iota $ is injective or surjective. [i]Gh. Andrei[/i]

Show that for each prime $p \geq 7$, there exist a positive integer $n$ and integers $x_{i}$, $y_{i}$ $(i = 1, . . . , n)$, not divisible by $p$, such that $x_{i}^{2}+ y_{i}^{2}\equiv x_{i+1}^{2}\pmod{p}$ where $x_{n+1} = x_{1}$

$R$ is a ring such that $xy=yx$ for every $x,y\in R$ and if $ab=0$ then $a=0$ or $b=0$. if for every Ideal $I\subset R$ there exist $x_1,x_2,..,x_n$ in $R$ ($n$ is not constant) such that $I=(x_1,x_2,...,x_n)$, prove that every element in $R$ that is not $0$ and it's not a unit, is the product of finite irreducible elements.($\frac{100}{6}$ points)

Let $p$ be prime and $ k > 1$ be a divisor of $p-1$. Show that if a polynomial of degree $k$ with integer coefficients attains every possible value modulo $ p$ that is $(0,1,\dots, p-1)$ at integer inputs then its leading coefficient must be divisible by $p$. [hide=Note]Note: the leading coefficient of a polynomial of degree d is the coefficient of the $x_d$ term.[/hide]

Let $R$ be a ring. Let $x,y\in R$ such that $x^2=y^2=0$. Prove that if $x+y-xy$ is nilpotent, so is $xy$. [i]Janez Šter[/i]

Find the Green's function of the operator $d^2/dx^2-1$ and solve the equation \[\int_{-\infty}^{+\infty}e^{-|x-y|}u(y)dy=e^{-x^2}\]

In the 75th Annual Putnam Games, participants compete at mathematical games. Patniss and Keeta play a game in which they take turns choosing an element from the group of invertible $n\times n$ matrices with entries in the field $\mathbb{Z}/p\mathbb{Z}$ of integers modulo $p,$ where $n$ is a fixed positive integer and $p$ is a fixed prime number. The rules of the game are: (1) A player cannot choose an element that has been chosen by either player on any previous turn. (2) A player can only choose an element that commutes with all previously chosen elements. (3) A player who cannot choose an element on his/her turn loses the game. Patniss takes the first turn. Which player has a winning strategy?

Are there any integers $a,b$ and $c$, not all of them $0$, such that $$a^2=2021b^2+2022c^2~~?$$ [i] (Cosmin Gavrilă)[/i]

Determine the number of polynomials of degree $ 3 $ that are irreducible over the field of integers modulo a prime.

Prove that a nontrivial finite ring is not a skew field if and only if the equation $ x^n+y^n=z^n $ has nontrivial solutions in this ring for any natural number $ n. $

Let $ a < c < b$ be three real numbers and let $ f: [a,b]\rightarrow \mathbb{R}$ be a continuos function in $ c$. If $ f$ has primitives on each of the intervals $ [a,c)$ and $ (c,b]$, then prove that it has primitives on the interval $ [a,b]$.

[b]a)[/b] Let $ B,A $ be two subsets of a finite group $ G $ such that $ |A|+|B|>|G| . $ Show that $ G=AB. $ [b]b)[/b] Show that the cyclic group of order $ n+1 $ is the product of the sets $ \{ 0,1,2,\ldots ,m \} $ and $ \{ m,m+1,m+2,\ldots ,n\} , $ where $ 0,1,2,\ldots n $ are residues modulo $ n+1 $ and $ m\le n. $

Prove that there exists an integer polynomial $P(X)$ such that $P(n)+4^n \equiv 0 \pmod {27}$. for all $n \geq 0$.

Let $P(x)$ be polynomial with integer coefficients. Prove, that if for any natural $k$ holds equality: $ \underbrace{P(P(...P(0)...))}_{n -times}=0$ then $P(0)=0$ or $P(P(0))=0$

suppose that $G<S_n$ is a subgroup of permutations of $\{1,...,n\}$ with this property that for every $e\neq g\in G$ there exist exactly one $k\in \{1,...,n\}$ such that $g.k=k$. prove that there exist one $k\in \{1,...,n\}$ such that for every $g\in G$ we have $g.k=k$.(20 points)

[b]10.[/b] An Abelian group $G$ is said to have the property $(A)$ if torsion subgroup of $G$ is a direct summand of $G$. Show that if $G$ is an Abelian group such that $nG$ has the property $(A)$ for some positive integer $n$, then $G$ itself has the property $(A)$. [b](A. 13)[/b]

Let $\{A_{1},\dots,A_{k}\}$ be matrices which make a group under matrix multiplication. Suppose $M=A_{1}+\dots+A_{k}$. Prove that each eigenvalue of $M$ is equal to $0$ or $k$.

Suppose that $p$ is an odd prime. Prove that \[\sum_{j=0}^{p}\binom{p}{j}\binom{p+j}{j}\equiv 2^{p}+1\pmod{p^{2}}.\]

Let $N$ denote the numbers of ordered triples of positive integers $(a, b, c)$ such that $a, b, c \le 3^6$ and $a^3 + b^3 + c^3$ is a multiple of $3^7$. Find the remainder when $N$ is divided by $1000$.