MPMS Problem Solving Marathon
 Phlembac Adib Hasan
 Posts: 1016
 Joined: Tue Nov 22, 2011 7:49 pm
 Location: 127.0.0.1
 Contact:
MPMS Problem Solving Marathon
This is a general problem solving marathon for members of Mymensingh Parallel Math School (MPMS). However, feel free to participate, even if you are not a member.
PROBLEM 1:
$p$ is a prime number of the form $4k+1$. Prove that there exists an integer $a$ so that $a^2+1$ is divisible by $p$.
PROBLEM 2:
For every pair of positive integers $(m, n)$, prove that there exists integers $x$, and $y$ such that not both of them are zero, $\sqrt{n} \leq x \leq \sqrt{n}$, $\sqrt{n} \leq y \leq \sqrt{n}$, and $xmy$ is divisible by $n$.
BONUS PROBLEM:
Prove that every prime $p$ of the form $4k+1$ can be written as a sum of two squares.
(This result is known as Fermat's Two Square Theorem)
PROBLEM 1:
$p$ is a prime number of the form $4k+1$. Prove that there exists an integer $a$ so that $a^2+1$ is divisible by $p$.
PROBLEM 2:
For every pair of positive integers $(m, n)$, prove that there exists integers $x$, and $y$ such that not both of them are zero, $\sqrt{n} \leq x \leq \sqrt{n}$, $\sqrt{n} \leq y \leq \sqrt{n}$, and $xmy$ is divisible by $n$.
BONUS PROBLEM:
Prove that every prime $p$ of the form $4k+1$ can be written as a sum of two squares.
(This result is known as Fermat's Two Square Theorem)
Welcome to BdMO Online Forum. Check out Forum Guides & Rules

 Posts: 57
 Joined: Sun Dec 11, 2016 2:01 pm
Re: MPMS Problem Solving Marathon
For problem 1,if we substitute $a^2$=$4k$ where $k$ is an integer,we can easily find that $p$ $a^2$+$1$.
Re: MPMS Problem Solving Marathon
For this you need to have $4k$ a perfect square, which isn't true for all $k$.aritra barua wrote:For problem 1,if we substitute $a^2$=$4k$ where $k$ is an integer,we can easily find that $p$ $a^2$+$1$.
 Phlembac Adib Hasan
 Posts: 1016
 Joined: Tue Nov 22, 2011 7:49 pm
 Location: 127.0.0.1
 Contact:
Re: MPMS Problem Solving Marathon
PROBLEM 3:
Find all *odd* integers $n$ for which $4n^26n+45$ is a perfect square.
PROBLEM 4:
Find all positive integers $m$ and $n$ such that $7^m+11^n$ is a perfect square.
Find all *odd* integers $n$ for which $4n^26n+45$ is a perfect square.
PROBLEM 4:
Find all positive integers $m$ and $n$ such that $7^m+11^n$ is a perfect square.
Welcome to BdMO Online Forum. Check out Forum Guides & Rules
Re: MPMS Problem Solving Marathon
$\text{Problem 1}$
The study of mathematics, like the Nile, begins in minuteness but ends in magnificence.
 Charles Caleb Colton
 Charles Caleb Colton
Re: MPMS Problem Solving Marathon
$\text{Problem 3}$
The study of mathematics, like the Nile, begins in minuteness but ends in magnificence.
 Charles Caleb Colton
 Charles Caleb Colton

 Posts: 57
 Joined: Sun Dec 11, 2016 2:01 pm
Re: MPMS Problem Solving Marathon
$Alternative Solution to 3$:It is obvious that if $4n^2$$6n$+$45$ is a perfect square,then $4n^2$$6n$+$45$ $\equiv$ $1$ (mod $2$) $\Rightarrow$ $4n^2$$6n$+$45$ $\equiv$ $1$ (mod $4$) $\Rightarrow$ $1$$6n$ $\equiv$ $1$ (mod $4$) $\Rightarrow$ $n$ $\equiv$ $0$ (mod $2$);so $n$ cannot be odd.

 Posts: 57
 Joined: Sun Dec 11, 2016 2:01 pm
Re: MPMS Problem Solving Marathon
$Problem 4$: If $7^m$+$11^n$ is a perfect square,then $m$ must be even and $n$ must be odd. (By using mod $3$ and mod $4$);let $m$=$2q$ and $n$=$2k$+$1$ and $49^q$+$121^k.11$=$a^2$ $\Rightarrow$ ($x$+$7^q$)($x$$7^q$)=$121^k$.$11$.Now make a total of $2$ cases along with $6$ subcases each.$1$ case would be assuming $q$ to be odd and another even and use mod $6$ to check the subcases.In each case,we get a contradiction.So,there is no such $m$ and $n$ which satisfies the aforementioned condition.
Last edited by aritra barua on Mon Jun 05, 2017 2:13 pm, edited 1 time in total.

 Posts: 57
 Joined: Sun Dec 11, 2016 2:01 pm
Re: MPMS Problem Solving Marathon
Simplier solution to problem $1$,I used this after getting to know what Wilson's Theorem is from dshasan's post.Let, $a$=$1$ . $2$...... $2k$.Telescope $a^2$ as $1$ . $2$.... $2k$.($2k$)....($2$)($1$).From the telescoping,it follows $a^2$ $\equiv$ $1$.$2$....$2k$($p2k$)....($p2$)($p1$) (mod $p$) $\Rightarrow$ $a^2$ $\equiv$ ($p1$)! $\equiv$ $1$ (mod $p$).So,$a^2+1$ $\equiv$ $0$ (mod $p$).
 Phlembac Adib Hasan
 Posts: 1016
 Joined: Tue Nov 22, 2011 7:49 pm
 Location: 127.0.0.1
 Contact:
Re: MPMS Problem Solving Marathon
Problem 5
A Hydra has $2019$ heads and is immune to damage from conventional weapons. However, with one blow of a magical sword, Hercules can cut off its $9, 10, 11$ or $12$ heads. In each of these cases, $5, 18, 7$ and $0$ heads grow on its shoulder. The Hydra will die only if all the heads are cut off. Can Hercules kill the Hydra with his sword?
A Hydra has $2019$ heads and is immune to damage from conventional weapons. However, with one blow of a magical sword, Hercules can cut off its $9, 10, 11$ or $12$ heads. In each of these cases, $5, 18, 7$ and $0$ heads grow on its shoulder. The Hydra will die only if all the heads are cut off. Can Hercules kill the Hydra with his sword?
Welcome to BdMO Online Forum. Check out Forum Guides & Rules