Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2019 USAJMO Problems/Problem 1"

(Created page with "==Problem== There are <math>a+b</math> bowls arranged in a row, number <math>1</math> through <math>a+b</math>, where <math>a</math> and <math>b</math> are given positive inte...")
 
m (→‎Problem)
Line 1: Line 1:
 
==Problem==
 
==Problem==
−
There are <math>a+b</math> bowls arranged in a row, number <math>1</math> through <math>a+b</math>, where <math>a</math> and <math>b</math> are given positive integers. Initially, each of the first <math>a</math> bowls contains an apple, and each of the last <math>b</math> bowls contains a pear.
+
There are <math>a+b</math> bowls arranged in a row, numbered <math>1</math> through <math>a+b</math>, where <math>a</math> and <math>b</math> are given positive integers. Initially, each of the first <math>a</math> bowls contains an apple, and each of the last <math>b</math> bowls contains a pear.
  
 
A legal move consists of moving an apple from bowl <math>i</math> to bowl <math>i+1</math> and a pear from bowl <math>j</math> to bowl <math>j-1</math>, provided that the difference <math>i-j</math> is even. We permit multiple fruits in the same bowl at the same time. The goal is to end up with the first <math>b</math> bowls each containing a pear and the last <math>a</math> bowls each containing an apple. Show that this is possible if and only if the product <math>ab</math> is even.
 
A legal move consists of moving an apple from bowl <math>i</math> to bowl <math>i+1</math> and a pear from bowl <math>j</math> to bowl <math>j-1</math>, provided that the difference <math>i-j</math> is even. We permit multiple fruits in the same bowl at the same time. The goal is to end up with the first <math>b</math> bowls each containing a pear and the last <math>a</math> bowls each containing an apple. Show that this is possible if and only if the product <math>ab</math> is even.

Revision as of 22:56, 18 April 2019

Problem

There are $a+b$ bowls arranged in a row, numbered $1$ through $a+b$, where $a$ and $b$ are given positive integers. Initially, each of the first $a$ bowls contains an apple, and each of the last $b$ bowls contains a pear.

A legal move consists of moving an apple from bowl $i$ to bowl $i+1$ and a pear from bowl $j$ to bowl $j-1$, provided that the difference $i-j$ is even. We permit multiple fruits in the same bowl at the same time. The goal is to end up with the first $b$ bowls each containing a pear and the last $a$ bowls each containing an apple. Show that this is possible if and only if the product $ab$ is even.

Solution

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

See also

2019 USAJMO (Problems • Resources)
First Problem Followed by
Problem 2
1 • 2 • 3 • 4 • 5 • 6
All USAJMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2019_USAJMO_Problems/Problem_1&oldid=105349"