# Difference between revisions of "2015 USAMO Problems"

(Changed problems from JMO to AMO) |
(→Day 2) |
||

Line 14: | Line 14: | ||

==Day 2== | ==Day 2== | ||

+ | |||

===Problem 4=== | ===Problem 4=== | ||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

Steve is piling <math>m\geq 1</math> indistinguishable stones on the squares of an <math>n\times n</math> grid. Each square can have an arbitrarily high pile of stones. After he finished piling his stones in some manner, he can then perform stone moves, defined as follows. Consider any four grid squares, which are corners of a rectangle, i.e. in positions <math>(i, k), (i, l), (j, k), (j, l)</math> for some <math>1\leq i, j, k, l\leq n</math>, such that <math>i<j</math> and <math>k<l</math>. A stone move consists of either removing one stone from each of <math>(i, k)</math> and <math>(j, l)</math> and moving them to <math>(i, l)</math> and <math>(j, k)</math> respectively,j or removing one stone from each of <math>(i, l)</math> and <math>(j, k)</math> and moving them to <math>(i, k)</math> and <math>(j, l)</math> respectively. | Steve is piling <math>m\geq 1</math> indistinguishable stones on the squares of an <math>n\times n</math> grid. Each square can have an arbitrarily high pile of stones. After he finished piling his stones in some manner, he can then perform stone moves, defined as follows. Consider any four grid squares, which are corners of a rectangle, i.e. in positions <math>(i, k), (i, l), (j, k), (j, l)</math> for some <math>1\leq i, j, k, l\leq n</math>, such that <math>i<j</math> and <math>k<l</math>. A stone move consists of either removing one stone from each of <math>(i, k)</math> and <math>(j, l)</math> and moving them to <math>(i, l)</math> and <math>(j, k)</math> respectively,j or removing one stone from each of <math>(i, l)</math> and <math>(j, k)</math> and moving them to <math>(i, k)</math> and <math>(j, l)</math> respectively. | ||

Line 31: | Line 23: | ||

How many different non-equivalent ways can Steve pile the stones on the grid? | How many different non-equivalent ways can Steve pile the stones on the grid? | ||

− | [[2015 USAMO Problems/Problem | + | [[2015 USAMO Problems/Problem 4|Solution]] |

+ | |||

+ | ===Problem 5=== | ||

+ | |||

+ | ===Problem 6=== |

## Revision as of 12:10, 12 May 2015

## Contents

## Day 1

### Problem 1

Solve in integers the equation

### Problem 2

Quadrilateral is inscribed in circle with and . Let be a variable point on segment . Line meets again at (other than ). Point lies on arc of such that is perpendicular to . Let denote the midpoint of chord . As varies on segment , show that moves along a circle.

### Problem 3

## Day 2

### Problem 4

Steve is piling indistinguishable stones on the squares of an grid. Each square can have an arbitrarily high pile of stones. After he finished piling his stones in some manner, he can then perform stone moves, defined as follows. Consider any four grid squares, which are corners of a rectangle, i.e. in positions for some , such that and . A stone move consists of either removing one stone from each of and and moving them to and respectively,j or removing one stone from each of and and moving them to and respectively.

Two ways of piling the stones are equivalent if they can be obtained from one another by a sequence of stone moves.

How many different non-equivalent ways can Steve pile the stones on the grid?