pow:start
Differences
This shows you the differences between two versions of the page.
|
pow:start [2022/02/28 22:31] mazur |
pow:start [2024/09/24 00:18] (current) mazur |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | |||
| + | ====== Problem of the Week ====== | ||
| + | ~~NOTOC~~ | ||
| + | <box 85% round orange|Problem 3 (suggested by Prof. Alexander Borisov), due on Monday, October 7. > | ||
| + | |||
| + | Three players are playing a game. They are | ||
| + | taking turns placing kings on a 1000x1000 chessboard, so that the | ||
| + | newly-placed king is not adjacent (directly or diagonally) to any of the | ||
| + | previously placed kings (i.e. the kings are in non-attacking positions). Whoever cannot place a king, loses. Prove that if any two of the players cooperate, they can make the third player lose. | ||
| + | |||
| + | |||
| + | |||
| + | </box> | ||
| + | |||
| + | |||
| + | ===== Overview ===== | ||
| + | |||
| + | Every other Monday (starting 08/27/24), we will post a problem to engage our mathematical community in the problem solving activity and to enjoy mathematics outside of the classroom. | ||
| + | Students (both undergraduate and graduate) are particularly encouraged to participate as there is no better | ||
| + | way to practice math than working on challenging problems. If you have a solution and want to be a part of it, e-mail your solution to Marcin | ||
| + | Mazur ([[mailto:mazur@math.binghamton.edu|mazur@math.binghamton.edu]]) by the due date. We will post our solutions as well as novel solutions from the participants and record the names of those who've got the most number of solutions throughout each semester. | ||
| + | |||
| + | When you submit your solutions, please provide a detailed reasoning rather than just an answer. Also, please include some short info about yourself for our records. | ||
| + | |||
| + | ===== Previous Problems and Solutions===== | ||
| + | |||
| + | * [[pow:Problem2f24|Problem 2]] Solution submitted by Levi Axelrod and Surajit Rajagopal. | ||
| + | |||
| + | * [[pow:Problem1f24|Problem 1]] Solved by Sasha Aksenchuk, Prof. Vladislav Kargin, Josiah Moltz, and Mithun Padinhare Veettil. | ||
| + | |||
| + | * [[pow:Spring 2024]] | ||
| + | |||
| + | * [[pow:Fall 2023]] | ||
| + | |||
| + | * [[pow:Spring 2023]] | ||
| + | |||
| + | * [[pow:Fall 2022]] | ||
| + | |||
| + | * [[pow:Spring 2022]] | ||
| + | | ||
| + | * [[pow:Fall 2021]] | ||
| + | |||
| + | * [[pow:Spring 2021]] | ||
| + | |||
| + | * [[pow:Fall 2020]] | ||
| + | |||
| + | * [[pow:Summer Challenge]] | ||
| + | | ||
| + | * [[pow:Spring 2020]] | ||