This shows you the differences between two versions of the page.
|
pow:start [2025/12/03 00:52] mazur |
pow:start [2026/03/25 15:53] (current) mazur |
||
|---|---|---|---|
| Line 2: | Line 2: | ||
| ====== Problem of the Week ====== | ====== Problem of the Week ====== | ||
| ~~NOTOC~~ | ~~NOTOC~~ | ||
| - | <box 85% round orange| > | + | <box 85% round orange| Problem 4 (due Monday, March 30 ) > |
| - | + | ||
| - | The problem of the week will return in the Spring 26 semester. We thank everyone who participated this Fall. For the winter break, we suggest reviewing all the problems from the Fall and working on the additional problems posted at the bottom of the provided solutions. | + | |
| + | Let $n>0$ be an odd integer. Prove that there exists a set $S=\{A_1, \ldots, A_{2n}\}$ of $2n$ distinct points in the plane which are not collinear and such that if $i+j\neq 2n+1$ then the line $A_iA_j$ contains a third point from $S$. | ||
| </box> | </box> | ||
| Line 12: | Line 10: | ||
| ===== Overview ===== | ===== Overview ===== | ||
| - | Every other Monday (starting 08/25/25), we will post a problem to engage our mathematical community in the problem solving activity and to enjoy mathematics outside of the classroom. | + | Every other Monday (starting 01/26/26), 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 | 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 | 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 | ||
| Line 21: | Line 19: | ||
| ===== Previous Problems and Solutions===== | ===== Previous Problems and Solutions===== | ||
| + | * [[pow:Problem3s26|Problem 3]] No solutions were submitted. | ||
| - | * [[pow:Problem7f25|Problem 7]] Solved by Levi Axelrod and Matt Wolak. | + | * [[pow:Problem2s26|Problem 2]] Solved by Prof. Emmett Wyman. |
| - | + | ||
| - | * [[pow:Problem6f25|Problem 6]] Solution submitted by Gerald Marchesi, Trinidad Segovia (a freshman student at Purdue University), and Mathew Wolak. | + | |
| - | + | ||
| - | * [[pow:Problem5f25|Problem 5]] Solution submitted by Ashton Keith (Purdue University), Gerald Marchesi, and Alif Miah. | + | |
| - | + | ||
| - | * [[pow:Problem4f25|Problem 4]] Solution submitted by Alif Miah,Takeru Sueyoshi (from Anglo-Chinese Junior College based in Singapore), and Mathew Wolak. | + | |
| - | + | ||
| - | * [[pow:Problem3f25|Problem 3]] No solutions were submitted. | + | |
| - | * [[pow:Problem2f25|Problem 2]] Solved by Gerald Marchesi, Josiah Moltz, and Mathew Wolak. | + | * [[pow:Problem1s26|Problem 1]] No solutions were submitted. |
| - | * [[pow:Problem1f25|Problem 1]] Solution submitted by Raisha Chowdhury, Gerald Marchesi, Josiah Moltz, and Mathew Wolak. | + | * [[pow:Fall 2025]] |
| * [[pow:Spring 2025]] | * [[pow:Spring 2025]] | ||