Plan ahead for the next school year. Schedule your class today!

G
Topic
First Poster
Last Poster
k a July Highlights and 2025 AoPS Online Class Information
jwelsh   0
Jul 1, 2025
We are halfway through summer, so be sure to carve out some time to keep your skills sharp and explore challenging topics at AoPS Online and our AoPS Academies (including the Virtual Campus)!

[list][*]Over 60 summer classes are starting at the Virtual Campus on July 7th - check out the math and language arts options for middle through high school levels.
[*]At AoPS Online, we have accelerated sections where you can complete a course in half the time by meeting twice/week instead of once/week, starting on July 8th:
[list][*]MATHCOUNTS/AMC 8 Basics
[*]MATHCOUNTS/AMC 8 Advanced
[*]AMC Problem Series[/list]
[*]Plus, AoPS Online has a special seminar July 14 - 17 that is outside the standard fare: Paradoxes and Infinity
[*]We are expanding our in-person AoPS Academy locations - are you looking for a strong community of problem solvers, exemplary instruction, and math and language arts options? Look to see if we have a location near you and enroll in summer camps or academic year classes today! New locations include campuses in California, Georgia, New York, Illinois, and Oregon and more coming soon![/list]

MOP (Math Olympiad Summer Program) just ended and the IMO (International Mathematical Olympiad) is right around the corner! This year’s IMO will be held in Australia, July 10th - 20th. Congratulations to all the MOP students for reaching this incredible level and best of luck to all selected to represent their countries at this year’s IMO! Did you know that, in the last 10 years, 59 USA International Math Olympiad team members have medaled and have taken over 360 AoPS Online courses. Take advantage of our Worldwide Online Olympiad Training (WOOT) courses
and train with the best! Please note that early bird pricing ends August 19th!
Are you tired of the heat and thinking about Fall? You can plan your Fall schedule now with classes at either AoPS Online, AoPS Academy Virtual Campus, or one of our AoPS Academies around the US.

Our full course list for upcoming classes is below:
All classes start 7:30pm ET/4:30pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
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
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
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
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
Sunday, Oct 19 - Jan 25
Tuesday, Nov 4 - Feb 10
Sunday, Dec 7 - Mar 8

Introduction to Number Theory
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
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, 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!)
Sat & Sun, Sep 13 - Sep 14 (1:00 - 4:00 PM PT/4:00 - 7:00 PM ET)

Intermediate: Grades 8-12

Intermediate Algebra
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, Sep 28 - Feb 15
Tuesday, Nov 4 - Mar 24

Intermediate Number Theory
Wednesday, Sep 24 - Dec 17

Precalculus
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

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

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
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
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
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
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
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
Tuesday, Sep 2 - Nov 18

F=ma Problem Series
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
Thursday, Aug 14 - Oct 30
Sunday, Sep 7 - Nov 23
Tuesday, Dec 2 - Mar 3

Intermediate Programming with Python
Friday, Oct 3 - Jan 16

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

Physics

Introduction to Physics
Tuesday, Sep 2 - Nov 18
Sunday, Oct 5 - Jan 11
Wednesday, Dec 10 - Mar 11

Physics 1: Mechanics
Sunday, Sep 21 - Mar 22
Sunday, Oct 26 - Apr 26
0 replies
jwelsh
Jul 1, 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
Final problem
Cats_on_a_computer   64
N a minute ago by vmene
Source: Own
This is likely the last post I will make in my life.

Consider an 18 year old who has no purpose, talents, or friends; a living waste of space, an unsightly chthonic maggot with less of a right to live than a grasshopper. Note that this person is so desperate, he writes his suicide note on a math forum of all places, because nobody around him would bother reading one. We define a *solution* to this individual’s woes as a termination. What is the optimal play by this individual to reach a solution with the least amount of pain?

Solution (sketch): we construct a 1 dimensional CW-complex consisting of a single circle $S_1$, and an interval glued with one of its endpoints to the circle.

See you later, space cowboy…
64 replies
+7 w
Cats_on_a_computer
5 hours ago
vmene
a minute ago
JBMO 2024 SL G4
MuradSafarli   6
N 3 minutes ago by Assassino9931
Source: JBMO 2024 Shortlist
Let $ABCD$ be a circumscribed quadrilateral with circumcircle $\omega$ such that $AE = EC$, where $E$ is the intersection point of the diagonals $AC$ and $BD$. Point $F$ is taken on $\omega$ such that $BF\parallel AC$. If $G$ is the reflection of $F$ with respect to $A$, prove that the circumcircle of $\triangle ADG$ is tangent to the line $AC$
6 replies
MuradSafarli
Jun 26, 2025
Assassino9931
3 minutes ago
An interesting combination problem
Math291   5
N 13 minutes ago by bluedino24
Given a unit square grid of size 4×6 as shown in the figure below, an ant crawls from point A. Each time it moves, it crawls along the side of a unit square to an adjacent grid point.
IMAGE
How many number of ways to complete a path so that after exactly 12 moves, it stops at position B?
5 replies
Math291
5 hours ago
bluedino24
13 minutes ago
Tiling rectangle with smaller rectangles.
MarkBcc168   63
N 22 minutes ago by eg4334
Source: IMO Shortlist 2017 C1
A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even.

Proposed by Jeck Lim, Singapore
63 replies
MarkBcc168
Jul 10, 2018
eg4334
22 minutes ago
|4^m-7^n| a prime number
dangerousliri   10
N 28 minutes ago by Maths_VC
Source: JBMO Shortlist 2024, N1
Find all pairs of positive integers $(m,n)$ such that $|4^m-7^n|$ is a prime number.

Proposed by Dorlir Ahmeti, Albania
10 replies
dangerousliri
Jun 26, 2025
Maths_VC
28 minutes ago
Simple (EZ?) NT
obihs   0
29 minutes ago
Source: own
Prove that there exists an integer $x$ such that for any prime $p$ and any positive integers $a,b,c,$ both $\dfrac{x-a}{p}$ and $\dfrac{x^p-x-p^bc}{p^{b+1}}$ are integers.
0 replies
obihs
29 minutes ago
0 replies
Game theory in 2025???
Iveela   2
N 32 minutes ago by luci1337
Source: IMSC 2025 P3
Alice and Bob play a game on a $K_{2026}$. They take turns with Alice playing first. Initially all edges are uncolored. On Alice's turn she chooses any uncolored edge and colors it red. On Bob's turn, he chooses 1, 2, or 3 uncolored edges and colors them blue. The game ends once all edges have been colored. Let $r$ and $b$ be the number of vertices of the largest red and blue clique, respectively. Bob wins if at the end of the game $b > r$. Show that Bob has a winning strategy.

Note: $K_n$ denotes the complete graph with $n$ vertices and where there is an edge between any pair of vertices. A red (or blue, respectively) clique refers to a complete subgraph of which all the edges are red (or blue, respectively).
2 replies
Iveela
Jul 5, 2025
luci1337
32 minutes ago
beam of light passes through every cell without a barrier
Scilyse   1
N 41 minutes ago by YaoAOPS
Source: 2025 Apr 谜之竞赛-5
Fix an integer $n \geq 3$. An $n \times n$ chessboard is comprised of $n^2$ cells. A laser is placed at the midpoint of a side of a cell. This laser emits a beam of light that initially forms a $45^\circ$ angle with this side. When the beam hits a side of the table or a side of a cell containing a barrier, it reflects back according to the law of reflection. We say that the beam passes through a cell if it passes through the strict interior of the cell.

Let $M$ be a positive integer. Suppose that we can position the laser and place barriers in $M$ of the cells so that the beam passes through every cell not containing a barrier. Find the minimum possible value of $M$.
1 reply
Scilyse
Today at 10:09 AM
YaoAOPS
41 minutes ago
USAMO 2003 Problem 4
MithsApprentice   74
N 44 minutes ago by Kempu33334
Let $ABC$ be a triangle. A circle passing through $A$ and $B$ intersects segments $AC$ and $BC$ at $D$ and $E$, respectively. Lines $AB$ and $DE$ intersect at $F$, while lines $BD$ and $CF$ intersect at $M$. Prove that $MF = MC$ if and only if $MB\cdot MD = MC^2$.
74 replies
MithsApprentice
Sep 27, 2005
Kempu33334
44 minutes ago
Ornaments and Christmas trees
Morskow   34
N an hour ago by Turtwig113
Source: Slovenia IMO TST 2018, Day 1, Problem 1
Let $n$ be a positive integer. On the table, we have $n^2$ ornaments in $n$ different colours, not necessarily $n$ of each colour. Prove that we can hang the ornaments on $n$ Christmas trees in such a way that there are exactly $n$ ornaments on each tree and the ornaments on every tree are of at most $2$ different colours.
34 replies
Morskow
Dec 17, 2017
Turtwig113
an hour ago
Existence of Proper Coloring for Triangle-Free Graphs
steven_zhang123   1
N 2 hours ago by Seungjun_Lee
Source: 2024 Dec 谜之竞赛-3
There exists a positive number \(N\) such that the following holds:
Let positive integers \(m\) and \(n\) satisfy \(n > N\) and \(m \geq \frac{3n}{\sqrt{\ln n}}\). If a simple undirected graph \(G\) contains no triangles and every vertex of \(G\) has degree at most \(n\), then there exists a proper coloring of the vertices of \(G\) using \(m\) colors.

Note: A proper coloring of \(G\) is an assignment of colors to all vertices such that no two adjacent vertices share the same color.

Proposed by Deng Leyan
1 reply
steven_zhang123
Jul 12, 2025
Seungjun_Lee
2 hours ago
Max value of function with f(f(n)) < n+50
Rijul saini   6
N 2 hours ago by guptaamitu1
Source: India IMOTC Day 3 Problem 2
Let $S$ be the set of all non-decreasing functions $f: \mathbb{N} \rightarrow \mathbb{N}$ satisfying $f(f(n))<n+50$ for all positive integers $n$. Find the maximum value of
$$f(1)+f(2)+f(3)+\cdots+f(2024)+f(2025)$$over all $f \in S$.

Proposed by Shantanu Nene
6 replies
Rijul saini
Jun 4, 2025
guptaamitu1
2 hours ago
Symmetric Tangents Concur on CD
ike.chen   44
N 2 hours ago by Maths_VC
Source: ISL 2022/G3
Let $ABCD$ be a cyclic quadrilateral. Assume that the points $Q, A, B, P$ are collinear in this order, in such a way that the line $AC$ is tangent to the circle $ADQ$, and the line $BD$ is tangent to the circle $BCP$. Let $M$ and $N$ be the midpoints of segments $BC$ and $AD$, respectively. Prove that the following three lines are concurrent: line $CD$, the tangent of circle $ANQ$ at point $A$, and the tangent to circle $BMP$ at point $B$.
44 replies
ike.chen
Jul 9, 2023
Maths_VC
2 hours ago
Product of cosine
Oksutok   0
2 hours ago
Source: 7th Liu Hui Cup P3
Let
$$S=\prod_{1\le k \le 35}4\left(\cos^2\frac{2k\pi}{5}+\cos^2\frac{2k\pi}{7}\right)$$Show that $S$ is a positive integer, and compute the sum of all positive prime factors of $S$.
0 replies
Oksutok
2 hours ago
0 replies
Difficult combinatorics problem
shactal   7
N May 19, 2025 by shactal
Can someone help me with this problem? Let $n\in \mathbb N^*$. We call a distribution the act of distributing the integers from $1$
to $n^2$ represented by tokens to players $A_1$ to $A_n$ so that they all have the same number of tokens in their urns.
We say that $A_i$ beats $A_j$ when, when $A_i$ and $A_j$ each draw a token from their urn, $A_i$ has a strictly greater chance of drawing a larger number than $A_j$. We then denote $A_i>A_j$. A distribution is said to be chicken-fox-viper when $A_1>A_2>\ldots>A_n>A_1$ What is $R(n)$
, the number of chicken-fox-viper distributions?
7 replies
shactal
May 18, 2025
shactal
May 19, 2025
Difficult combinatorics problem
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.
shactal
9 posts
#1
Y by
Can someone help me with this problem? Let $n\in \mathbb N^*$. We call a distribution the act of distributing the integers from $1$
to $n^2$ represented by tokens to players $A_1$ to $A_n$ so that they all have the same number of tokens in their urns.
We say that $A_i$ beats $A_j$ when, when $A_i$ and $A_j$ each draw a token from their urn, $A_i$ has a strictly greater chance of drawing a larger number than $A_j$. We then denote $A_i>A_j$. A distribution is said to be chicken-fox-viper when $A_1>A_2>\ldots>A_n>A_1$ What is $R(n)$
, the number of chicken-fox-viper distributions?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
shactal
9 posts
#2
Y by
Someone?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
aaravdodhia
2667 posts
#3
Y by
Isn't it $0$?

Note that $A_i$ beats $A_j$ when $E(d_i-d_j)>0$, where $E$ represents expected value and $d_i, d_j$ are the draws of players $i$ and $j$. That happens when $E(d_i) - E(d_j)>0$, or the sum of $A_i$'s collection is greater than the sum of $A_j$'s collection. In the problem, the sum of $A_1$'s collection must be greater than the sum of everybody else's, contradicting $A_n > A_1$.

This logic is due to the distribution being given prior to the players drawing and comparing their numbers. But if all distributions were considered at once, any pair $(i,j)$ would satisfy $A_i > A_j$ with equal probability $\tfrac12\left(\text{probability }E(d_i-d_j)\ne0\right)$, so the player's expected draws would all be the same. Hence there cannot be an order to $A_1\dots A_n$.

If this problem is from another source, I'd suggest reading their explanation. :)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
shactal
9 posts
#4
Y by
Well, the thing is I don't have the solution and I would like to know the method to solve this type of problems
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Ash_the_Bash07
1332 posts
#5
Y by
ok$~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
shactal
9 posts
#6
Y by
But I don't think the answer is $0$, because I already found some examples where the condition is satisfied
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
shactal
9 posts
#7
Y by
Here is an example that satisfies the condition: Player $A$ has numbers $\{2,4,9\}$, player B has $\{1,6,8\}$ and player $C$ has $\{3,5,7\}$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
shactal
9 posts
#8
Y by
If I can show that the events "$A$ wins against $B$" and "$B$ wins against $C$" are independent, then the problem is trivial. But how to prove this?
Z K Y
N Quick Reply
G
H
=
a