For matrices $A=[a_{ij}]_{m \times m}$ and $B=[b_{ij}]_{m \times m}$ where $A,B \in \mathbb{Z} ^{m \times m}$ let $A \equiv B \pmod{n}$ only if $a_{ij} \equiv b_{ij} \pmod{n}$ for every $i,j \in \{ 1,2,...,m \}$, that's $A-B=nZ$ for some $Z \in \mathbb{Z}^{m \times m}$. (The symbol $A \in \mathbb{Z} ^{m \times m}$ means that every element in $A$ is an integer.) Prove that for $A \in \mathbb{Z} ^{m \times m}$ there is $B \in \mathbb{Z} ^{m \times m}$ , where $AB \equiv I \pmod{n }$ only if $(\det (A),n)=1$ and find the value of $B$ in the form of $A$ where $I$ represents the dimensional identity matrix $m \times m$. (PP-nine)
2012 Mathcenter Contest + Longlist
Round 1 (one and only)
sl = longlist
Let $a,b,c \in \mathbb{R}^+$ where $a^2+b^2+c^2=1$. Find the minimum value of . $$a+b+c+\frac{3}{ab+bc+ca}$$(PP-nine)
Define the sequence of positive prime numbers. $p_1,p_2,p_3,...$. Let set $A$ be the infinite set of positive integers whose prime divisor does not exceed $p_n$. How many at least members must be selected from the set $A$ , such that we ensures that there are $2$ numbers whose products are perfect squares? (PP-nine)
Given a natural $n>2$, let $\{ a_1,a_2,...,a_{\phi (n)} \} \subset \mathbb{Z}$ is the Reduced Residue System (RRS) set of modulo $n$ (also known as the set of integers $k$ where $(k,n)=1$ and no pairs are congruent in modulo $n$ ). if write $$\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_{\phi (n)}}=\frac{a}{b}$$where $a,b \in \mathbb{N}$ and $(a,b)=1$ , then prove that $n|a$. (PP-nine)
Define $f : \mathbb{R}^+ \rightarrow \mathbb{R}$ as the strictly increasing function such that $$f(\sqrt{xy})=\frac{f(x)+f(y)}{2}$$for all positive real numbers $x,y$. Prove that there are some positive real numbers $a$ where $f(a)<0$. (PP-nine)
For a real number $a,b,c>0$ where $bc-ca-ab=1$ find the maximum value of $$P=\frac{4024}{1+a^2}-\frac{4024}{1+b^2}-\frac{2555}{1+c^2}$$and find out when that holds . (PP-nine)
Longlist (the rest)
Prove without using modulo that there are no integers $a,b,c$ such that $$a^2+b^2-8c = 6$$ (Metamorphosis)
Let $p=2^n+1$ and $3^{(p-1)/2}+1\equiv 0 \pmod p$. Show that $p$ is a prime. (Zhuge Liang)
If $p,p^2+2$ are both primes, how many divisors does $p^5+2p^2$ have? (Zhuge Liang)
Let $a,b,c$ be the side lengths of any triangle. Prove that $$\frac{a}{\sqrt{2b^2+2c^2-a^2}}+\frac{b}{\sqrt{2c^2+2a^2-b^2 }}+\frac{c}{\sqrt{2a^2+2b^2-c^2}}\ge \sqrt{3}.$$(Zhuge Liang)
Let $a,b,c>0$ and $a+b+c+abc=4$. Prove that $$\frac{a}{\sqrt{b+c}}+\frac{b}{\sqrt{c+a}}+\frac{c}{\sqrt{a+b} }\ge \frac{1}{\sqrt{2}}(a+b+c).$$ (Zhuge Liang)
Let $a,b,c>0$ and $abc=1$. Prove that $$\frac{a}{b^2(c+a)(a+b)}+\frac{b}{c^2(a+b)(b+c)}+\frac{c}{a^2(c+a)(a+b)}\ge \frac{3}{4}.$$(Zhuge Liang)
The arithmetic function $\nu$ is defined by $$\nu (n) = \begin{cases}0, \,\,\,\,\, n=1 \\ k, \,\,\,\,\, n=p_1^{a_1} p_2^{a_2} ... p_k^{a_k}\end{cases}$$, where $n=p_1^{a_1} p_2^{a_2} ... p_k^{a_k}$ represents the prime factorization of the number. Prove that for any naturals $m,n$, $$\tau (n^m) = \sum_{d | n} m^{\nu (d)}.$$(PP-nine)
The table size $8 \times 8$ contains the numbers $1,2,...,8$ in each amount as much as you want provided that two numbers that are adjacent vertically, horizontally, diagonally are relative primes. Prove that some number appears in the table at least $12$ times. (PP-nine)