Summer is a great time to explore cool problems to keep your skills sharp!  Schedule a class today!

G
Topic
First Poster
Last Poster
k a June Highlights and 2025 AoPS Online Class Information
jlacosta   0
Jun 2, 2025
Congratulations to all the mathletes who competed at National MATHCOUNTS! If you missed the exciting Countdown Round, you can watch the video at this link. Are you interested in training for MATHCOUNTS or AMC 10 contests? How would you like to train for these math competitions in half the time? We have accelerated sections which meet twice per week instead of once starting on July 8th (7:30pm ET). These sections fill quickly so enroll today!

[list][*]MATHCOUNTS/AMC 8 Basics
[*]MATHCOUNTS/AMC 8 Advanced
[*]AMC 10 Problem Series[/list]
For those interested in Olympiad level training in math, computer science, physics, and chemistry, be sure to enroll in our WOOT courses before August 19th to take advantage of early bird pricing!

Summer camps are starting this month at the Virtual Campus in math and language arts that are 2 - to 4 - weeks in duration. Spaces are still available - don’t miss your chance to have a transformative summer experience. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

Be sure to mark your calendars for the following upcoming events:
[list][*]June 5th, Thursday, 7:30pm ET: Open Discussion with Ben Kornell and Andrew Sutherland, Art of Problem Solving's incoming CEO Ben Kornell and CPO Andrew Sutherland host an Ask Me Anything-style chat. Come ask your questions and get to know our incoming CEO & CPO!
[*]June 9th, Monday, 7:30pm ET, Game Jam: Operation Shuffle!, Come join us to play our second round of Operation Shuffle! If you enjoy number sense, logic, and a healthy dose of luck, this is the game for you. No specific math background is required; all are welcome.[/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29
Sunday, Aug 17 - Dec 14
Tuesday, Aug 26 - Dec 16
Friday, Sep 5 - Jan 16
Monday, Sep 8 - Jan 12
Tuesday, Sep 16 - Jan 20 (4:30 - 5:45 pm ET/1:30 - 2:45 pm PT)
Sunday, Sep 21 - Jan 25
Thursday, Sep 25 - Jan 29
Wednesday, Oct 22 - Feb 25
Tuesday, Nov 4 - Mar 10
Friday, Dec 12 - Apr 10

Prealgebra 2 Self-Paced

Prealgebra 2
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21
Sunday, Aug 17 - Dec 14
Tuesday, Sep 9 - Jan 13
Thursday, Sep 25 - Jan 29
Sunday, Oct 19 - Feb 22
Monday, Oct 27 - Mar 2
Wednesday, Nov 12 - Mar 18

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28
Sunday, Aug 17 - Dec 14
Wednesday, Aug 27 - Dec 17
Friday, Sep 5 - Jan 16
Thursday, Sep 11 - Jan 15
Sunday, Sep 28 - Feb 1
Monday, Oct 6 - Feb 9
Tuesday, Oct 21 - Feb 24
Sunday, Nov 9 - Mar 15
Friday, Dec 5 - Apr 3

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 2 - Sep 17
Sunday, Jul 27 - Oct 19
Monday, Aug 11 - Nov 3
Wednesday, Sep 3 - Nov 19
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Friday, Oct 3 - Jan 16
Tuesday, Nov 4 - Feb 10
Sunday, Dec 7 - Mar 8

Introduction to Number Theory
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30
Wednesday, Aug 13 - Oct 29
Friday, Sep 12 - Dec 12
Sunday, Oct 26 - Feb 1
Monday, Dec 1 - Mar 2

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14
Thursday, Aug 7 - Nov 20
Monday, Aug 18 - Dec 15
Sunday, Sep 7 - Jan 11
Thursday, Sep 11 - Jan 15
Wednesday, Sep 24 - Jan 28
Sunday, Oct 26 - Mar 1
Tuesday, Nov 4 - Mar 10
Monday, Dec 1 - Mar 30

Introduction to Geometry
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19
Wednesday, Aug 13 - Feb 11
Tuesday, Aug 26 - Feb 24
Sunday, Sep 7 - Mar 8
Thursday, Sep 11 - Mar 12
Wednesday, Sep 24 - Mar 25
Sunday, Oct 26 - Apr 26
Monday, Nov 3 - May 4
Friday, Dec 5 - May 29

Paradoxes and Infinity
Mon, Tue, Wed, & Thurs, Jul 14 - Jul 16 (meets every day of the week!)

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22
Friday, Aug 8 - Feb 20
Tuesday, Aug 26 - Feb 24
Sunday, Sep 28 - Mar 29
Wednesday, Oct 8 - Mar 8
Sunday, Nov 16 - May 17
Thursday, Dec 11 - Jun 4

Intermediate Counting & Probability
Sunday, Jun 22 - Nov 2
Sunday, Sep 28 - Feb 15
Tuesday, Nov 4 - Mar 24

Intermediate Number Theory
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3
Wednesday, Sep 24 - Dec 17

Precalculus
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8
Wednesday, Aug 6 - Jan 21
Tuesday, Sep 9 - Feb 24
Sunday, Sep 21 - Mar 8
Monday, Oct 20 - Apr 6
Sunday, Dec 14 - May 31

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Wednesday, Jun 25 - Dec 17
Sunday, Sep 7 - Mar 15
Wednesday, Sep 24 - Apr 1
Friday, Nov 14 - May 22

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Wednesday, Sep 3 - Nov 19
Tuesday, Sep 16 - Dec 9
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Oct 6 - Jan 12
Thursday, Oct 16 - Jan 22
Tues, Thurs & Sun, Dec 9 - Jan 18 (meets three times a week!)

MATHCOUNTS/AMC 8 Advanced
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Tuesday, Aug 26 - Nov 11
Thursday, Sep 4 - Nov 20
Friday, Sep 12 - Dec 12
Monday, Sep 15 - Dec 8
Sunday, Oct 5 - Jan 11
Tues, Thurs & Sun, Dec 2 - Jan 11 (meets three times a week!)
Mon, Wed & Fri, Dec 8 - Jan 16 (meets three times a week!)

AMC 10 Problem Series
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 10 - Nov 2
Thursday, Aug 14 - Oct 30
Tuesday, Aug 19 - Nov 4
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Mon, Wed & Fri, Oct 6 - Nov 3 (meets three times a week!)
Tue, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 10 Final Fives
Monday, Jun 30 - Jul 21
Friday, Aug 15 - Sep 12
Sunday, Sep 7 - Sep 28
Tuesday, Sep 9 - Sep 30
Monday, Sep 22 - Oct 13
Sunday, Sep 28 - Oct 19 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, Oct 8 - Oct 29
Thursday, Oct 9 - Oct 30

AMC 12 Problem Series
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22
Sunday, Aug 10 - Nov 2
Monday, Aug 18 - Nov 10
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Tues, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 12 Final Fives
Thursday, Sep 4 - Sep 25
Sunday, Sep 28 - Oct 19
Tuesday, Oct 7 - Oct 28

AIME Problem Series A
Thursday, Oct 23 - Jan 29

AIME Problem Series B
Sunday, Jun 22 - Sep 21
Tuesday, Sep 2 - Nov 18

F=ma Problem Series
Wednesday, Jun 11 - Aug 27
Tuesday, Sep 16 - Dec 9
Friday, Oct 17 - Jan 30

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Sunday, Jun 15 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Tuesday, Jun 17 - Sep 2
Monday, Jun 30 - Sep 22
Thursday, Aug 14 - Oct 30
Sunday, Sep 7 - Nov 23
Tuesday, Dec 2 - Mar 3

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22
Friday, Oct 3 - Jan 16

USACO Bronze Problem Series
Sunday, Jun 22 - Sep 1
Wednesday, Sep 3 - Dec 3
Thursday, Oct 30 - Feb 5
Tuesday, Dec 2 - Mar 3

Physics

Introduction to Physics
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15
Tuesday, Sep 2 - Nov 18
Sunday, Oct 5 - Jan 11
Wednesday, Dec 10 - Mar 11

Physics 1: Mechanics
Monday, Jun 23 - Dec 15
Sunday, Sep 21 - Mar 22
Sunday, Oct 26 - Apr 26

Relativity
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
1 viewing
jlacosta
Jun 2, 2025
0 replies
k i Adding contests to the Contest Collections
dcouchman   1
N Apr 5, 2023 by v_Enhance
Want to help AoPS remain a valuable Olympiad resource? Help us add contests to AoPS's Contest Collections.

Find instructions and a list of contests to add here: https://artofproblemsolving.com/community/c40244h1064480_contests_to_add
1 reply
dcouchman
Sep 9, 2019
v_Enhance
Apr 5, 2023
k i Zero tolerance
ZetaX   49
N May 4, 2019 by NoDealsHere
Source: Use your common sense! (enough is enough)
Some users don't want to learn, some other simply ignore advises.
But please follow the following guideline:


To make it short: ALWAYS USE YOUR COMMON SENSE IF POSTING!
If you don't have common sense, don't post.


More specifically:

For new threads:


a) Good, meaningful title:
The title has to say what the problem is about in best way possible.
If that title occured already, it's definitely bad. And contest names aren't good either.
That's in fact a requirement for being able to search old problems.

Examples:
Bad titles:
- "Hard"/"Medium"/"Easy" (if you find it so cool how hard/easy it is, tell it in the post and use a title that tells us the problem)
- "Number Theory" (hey guy, guess why this forum's named that way¿ and is it the only such problem on earth¿)
- "Fibonacci" (there are millions of Fibonacci problems out there, all posted and named the same...)
- "Chinese TST 2003" (does this say anything about the problem¿)
Good titles:
- "On divisors of a³+2b³+4c³-6abc"
- "Number of solutions to x²+y²=6z²"
- "Fibonacci numbers are never squares"


b) Use search function:
Before posting a "new" problem spend at least two, better five, minutes to look if this problem was posted before. If it was, don't repost it. If you have anything important to say on topic, post it in one of the older threads.
If the thread is locked cause of this, use search function.

Update (by Amir Hossein). The best way to search for two keywords in AoPS is to input
[code]+"first keyword" +"second keyword"[/code]
so that any post containing both strings "first word" and "second form".


c) Good problem statement:
Some recent really bad post was:
[quote]$lim_{n\to 1}^{+\infty}\frac{1}{n}-lnn$[/quote]
It contains no question and no answer.
If you do this, too, you are on the best way to get your thread deleted. Write everything clearly, define where your variables come from (and define the "natural" numbers if used). Additionally read your post at least twice before submitting. After you sent it, read it again and use the Edit-Button if necessary to correct errors.


For answers to already existing threads:


d) Of any interest and with content:
Don't post things that are more trivial than completely obvious. For example, if the question is to solve $x^{3}+y^{3}=z^{3}$, do not answer with "$x=y=z=0$ is a solution" only. Either you post any kind of proof or at least something unexpected (like "$x=1337, y=481, z=42$ is the smallest solution). Someone that does not see that $x=y=z=0$ is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
Similar, posting "I have solved this problem" but not posting anything else is not welcome; it even looks that you just want to show off what a genius you are.

e) Well written and checked answers:
Like c) for new threads, check your solutions at least twice for mistakes. And after sending, read it again and use the Edit-Button if necessary to correct errors.



To repeat it: ALWAYS USE YOUR COMMON SENSE IF POSTING!


Everything definitely out of range of common sense will be locked or deleted (exept for new users having less than about 42 posts, they are newbies and need/get some time to learn).

The above rules will be applied from next monday (5. march of 2007).
Feel free to discuss on this here.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
A problem of the number of paths in grid
Nikolai220   1
N 31 minutes ago by aaravdodhia
How many distinct paths are there from the bottom-left corner to the top-right corner of a 5×5 grid, where each edge can be traverled at most once?(not all edges must be travelled)

(further problem:how many paths are there if the grid is n*n?)
1 reply
Nikolai220
3 hours ago
aaravdodhia
31 minutes ago
Graph of 100 vertices. Each of degree 3. Is that possible?
Clueid   3
N 39 minutes ago by KSH31415
Does there exist a graph with 100 vertices with each vertex having a degree of 3? If so, show that it exists. Otherwise, prove it's impossible to exist.
3 replies
Clueid
Today at 3:55 AM
KSH31415
39 minutes ago
Rectangle EFGH in incircle, prove that QIM = 90
v_Enhance   65
N an hour ago by zuat.e
Source: Taiwan 2014 TST1, Problem 3
Let $ABC$ be a triangle with incenter $I$, and suppose the incircle is tangent to $CA$ and $AB$ at $E$ and $F$. Denote by $G$ and $H$ the reflections of $E$ and $F$ over $I$. Let $Q$ be the intersection of $BC$ with $GH$, and let $M$ be the midpoint of $BC$. Prove that $IQ$ and $IM$ are perpendicular.
65 replies
v_Enhance
Jul 18, 2014
zuat.e
an hour ago
Tricky Angle Chasing (HHMO 2025 #1)
peace09   4
N an hour ago by peace09
In triangle $\triangle ABC{}$, $AB=AC$ and $\angle B=40^\circ$. Point $D$ lies on $\overline{BC}$ such that $\angle ADC=120^\circ$, and point $E$ is the intersection of the angle bisector of $\angle C$ with side $\overline{AB}$. What is the angle $\angle DEC$ in degrees?
4 replies
peace09
Yesterday at 10:39 PM
peace09
an hour ago
BMT 2022 Fall Discrete P8
peelybonehead   4
N an hour ago by KnowingAnt
Define the two sequences $a_0, a_1, a_2, \cdots$ and $b_0, b_1, b_2, \cdots$ by $a_0 = 3$ and $b_0 = 1$ with the recurrence relations $a_{n+1} = 3a_n + b_n$ and $b_{n+1} = 3b_n - a_n$ for all nonnegative integers $n.$ Let $r$ and $s$ be the remainders when $a_{32}$ and $b_{32}$ are divided by $31,$ respectively. Compute $100r + s.$
4 replies
peelybonehead
May 6, 2023
KnowingAnt
an hour ago
2-var inequality
sqing   7
N an hour ago by sqing
Source: Own
Let $ a,b\geq 0 $ and $\frac{1}{a^2+3} + \frac{1}{b^2+3} -ab\leq  \frac{1}{2}.$ Prove that
$$  a^2+ab+b^2 \geq \frac{3(\sqrt{57}-7)}{4}$$Let $ a,b\geq 0 $ and $\frac{a}{b^2+3} + \frac{b}{a^2+3} +ab\leq  \frac{1}{2}.$ Prove that
$$  a^2+ab+b^2 \leq \frac{9}{4}$$Let $ a,b\geq 0 $ and $ \frac{a}{b^3+3}+\frac{b}{a^3+3}-ab\leq  \frac{1}{2}.$ Prove that
$$  a^2+ab+b^2 \geq \frac{9}{4}$$
7 replies
sqing
Yesterday at 12:55 PM
sqing
an hour ago
Number theory
falantrng   40
N an hour ago by bjump
Source: RMM 2018 D2 P4
Let $a,b,c,d$ be positive integers such that $ad \neq bc$ and $gcd(a,b,c,d)=1$. Let $S$ be the set of values attained by $\gcd(an+b,cn+d)$ as $n$ runs through the positive integers. Show that $S$ is the set of all positive divisors of some positive integer.
40 replies
falantrng
Feb 25, 2018
bjump
an hour ago
Calvin needs to cover all squares
Rijul saini   4
N an hour ago by SimplisticFormulas
Source: India IMOTC 2025 Day 2 Problem 1
Consider a $2025\times 2025$ board where we identify the squares with pairs $(i,j)$ where $i$ and $j$ denote the row and column number of that square, respectively.

Calvin picks two positive integers $a,b<2025$ and places a pawn at the bottom left corner (i.e. on $(1,1)$) and makes the following moves. In his $k$-th move, he moves the pawn from $(i,j)$ to either $(i+a,j)$ or $(i,j+a)$ if $k$ is odd and to either $(i+b,j)$ and $(i,j+b)$ if $k$ is even. Here all the numbers are taken modulo $2025$. Find the number of pairs $(a,b)$ that Calvin could have picked such that he can make moves so that the pawn covers all the squares on the board without being on any square twice.

Proposed by Tejaswi Navilarekallu
4 replies
Rijul saini
Yesterday at 6:35 PM
SimplisticFormulas
an hour ago
Different scores possible in interview
Rijul saini   3
N an hour ago by Adywastaken
Source: India IMOTC Practice Test 2 Problem 1
In a job interview, the candidates are asked questions in a sequence. The initial score is $0$. The candidate's score is calculated as follows:

$\bullet$ after a correct answer, the score is increased by $1$;
$\bullet$ after a wrong answer, the score is divided by $2$.

If the candidate is asked $n$ questions and answers all of them, how many different scores are possible?

Note: Two different response sequences of the same length can result in the same score: the sequences $RRW$ and $WWR$ with the same length, where $R$ denotes the correct answer and $W$ denotes the wrong answer, both result in the same score of 1.

Proposed by S. Muralidharan
3 replies
Rijul saini
Yesterday at 6:54 PM
Adywastaken
an hour ago
Concurrence
LiamChen   0
an hour ago
Source: MOP1998
Problem:
0 replies
LiamChen
an hour ago
0 replies
set of points, there exist two lines containing n points
jasperE3   1
N an hour ago by ririgggg
Source: 2004 Brazil TST Test 2 P1
Find the smallest positive integer $n$ that satisfies the following condition: For every finite set of points on the plane, if for any $n$ points from this set there exist two lines containing all the $n$ points, then there exist two lines containing all points from the set.
1 reply
jasperE3
Apr 5, 2021
ririgggg
an hour ago
XY is tangent to a fixed circle
a_507_bc   2
N an hour ago by math-olympiad-clown
Source: Baltic Way 2022/15
Let $\Omega$ be a circle, and $B, C$ are two fixed points on $\Omega$. Given a third point $A$ on $\Omega$, let $X$ and $Y$ denote the feet of the altitudes from $B$ and $C$, respectively, in the triangle $ABC$. Prove that there exists a fixed circle $\Gamma$ such that $XY$ is tangent to $\Gamma$ regardless of the choice of the point $A$.
2 replies
a_507_bc
Nov 12, 2022
math-olympiad-clown
an hour ago
Super easy problem
M11100111001Y1R   6
N an hour ago by sami1618
Source: Iran TST 2025 Test 2 Problem 1
The numbers from 2 to 99 are written on a board. At each step, one of the following operations is performed:

$a)$ Choose a natural number \( i \) such that \( 2 \leq i \leq 89 \). If both numbers \( i \) and \( i+10 \) are on the board, erase both.

$b)$ Choose a natural number \( i \) such that \( 2 \leq i \leq 98 \). If both numbers \( i \) and \( i+1 \) are on the board, erase both.

By performing these operations, what is the maximum number of numbers that can be erased from the board?
6 replies
M11100111001Y1R
May 27, 2025
sami1618
an hour ago
Beware the degeneracies!
Rijul saini   7
N an hour ago by Adywastaken
Source: India IMOTC 2025 Day 1 Problem 1
Let $a,b,c$ be real numbers satisfying $$\max \{a(b^2+c^2),b(c^2+a^2),c(a^2+b^2) \} \leqslant 2abc+1$$Prove that $$a(b^2+c^2)+b(c^2+a^2)+c(a^2+b^2) \leqslant 6abc+2$$and determine all cases of equality.

Proposed by Shantanu Nene
7 replies
1 viewing
Rijul saini
Yesterday at 6:30 PM
Adywastaken
an hour ago
staircase with height 1, width 1,2,...,2019 (2019 Lomonosov Tournament R1)
parmenides51   1
N Apr 20, 2021 by natmath
The height of each step of the “stairs” (see figure) is $1$, and the width of each step increases from one to $2019$. Is it true that the segment from the lower left point of the stairs to the upper right point of the stairs doesn’t cross the stairs?
IMAGE
1 reply
parmenides51
Apr 20, 2021
natmath
Apr 20, 2021
staircase with height 1, width 1,2,...,2019 (2019 Lomonosov Tournament R1)
G H J
G H BBookmark kLocked kLocked NReply
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
parmenides51
30653 posts
#1 • 1 Y
Y by Mango247
The height of each step of the “stairs” (see figure) is $1$, and the width of each step increases from one to $2019$. Is it true that the segment from the lower left point of the stairs to the upper right point of the stairs doesn’t cross the stairs?
https://2.bp.blogspot.com/-SSX2zt_XeUI/XpyWHnyB6BI/AAAAAAAAL0s/GQF-HTSNUwUfoZafwvW5wn_DQBKCKBWvACK4BGAYYCw/s1600/2019lom.png
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
natmath
8219 posts
#2 • 1 Y
Y by Mango247
solution

I think this question is Trivial by Jensen's
Z K Y
N Quick Reply
G
H
=
a