Summer and Fall classes are open for enrollment. Schedule 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
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
Cauchy's Functional Equation
kisah_sangjuara   1
N 3 minutes ago by dimi07
Source: Pang Cheng Wu Functional Equation
I'm reading Pang Cheng Wu Functional Equation handout. I stopped at one problem, which is:
Find all functions $f\colon \mathbb{R} \to \mathbb{R}$ such that for all reals $x,y$, we have
\[f(x)^2+f(y)^2+f((x+y)^2)=2x^2+2y^2+f(xf(y)+y(f(x))\]Shortly, if we define $g(x)=f(x^2)$, the statement becomes:
\[g(x+y)+g(x-y)=2g(x)+2g(y)\]Where $g(x)\le x^2$ (which makes $g$ bounded on some interval). I have proved that $g(zx)=z^2g(x)\forall x\in \mathbb{R}, z\in \mathbb{Q}$. From here I have to prove that $g(x)=g(1)x^2\forall x\in \mathbb{R}$, and I want to use the fact that $g$ is bounded on some interval, but the form of $g(x+y)+g(x-y)=2g(x)+2g(y)$ is not the form of regular Cauchy Equation. Does anyone know how to transform the form become Cauchy? So we can use the information of $g$ is bounded?

1 reply
1 viewing
kisah_sangjuara
Feb 27, 2025
dimi07
3 minutes ago
Inspired by old results
sqing   8
N 8 minutes ago by ali3985
Source: Own
Let $ a,b,c>0, ab+bc+ca=3. $ Show that $$abc(4(a+b+c)-3)\leq 9$$
8 replies
sqing
Jun 14, 2025
ali3985
8 minutes ago
P4 - 2nd Women's Mathematical Olympiad (Metropolitan Competition, Mexico City)
RD_0.1   0
12 minutes ago
Source: 2nd Women's Mathematical Olympiad (Metropolitan Competition, Mexico City)
On a 5 × 5 board, a king may move according to the following rules:
It may move one square at a time horizontally, vertically, or diagonally. It may move in each of the eight permitted directions at most three times during its journey.
If the king can start on any square on the board, determine:
a) whether the king may visit all squares,
b) whether the king may visit all squares except the center square.
0 replies
RD_0.1
12 minutes ago
0 replies
Easy Planimetry 1
prof.   2
N 16 minutes ago by prof.
Point $D$ lies on side $\overline{BC}$ of triangle $ABC.$ From points $B$ and $C$, perpendiculars $BE$ and $BF$ are dropped to the line $AD$. Let $R$ be the midpoint of segment $\overline{BC}$. Prove that $RE=RF.$
2 replies
prof.
3 hours ago
prof.
16 minutes ago
AK BC and DF intersect
Marius_Avion_De_Vanatoare   2
N 2 hours ago by Funcshun840
Source: The Golden Digits 9th Edition P2
Let $\triangle ABC$ be an acute triangle. Let $I$ be its incenter, $D = AI \cap (ABC)$ and $E, F \in (BIC)$ such that $A$, $E$, $F$ are collinear. Let $E_b \in AB$ such that $EE_b = E_bB$. $E_c$ is defined similarly. Let $K \in E_bE_c$ such that $DK \parallel EF$. Prove that $AK \cap BC \cap DF \ne \emptyset$.

Proposed by Pavel Ciurea
2 replies
Marius_Avion_De_Vanatoare
Jun 14, 2025
Funcshun840
2 hours ago
Need help in solving an IMO Number Theory Problem
combinatorics_mrityunjay   0
2 hours ago
Source: IMO 2022 Problem 5
IMO 2022/P5: Find all triplet $(a,b,p)\in \mathbb{N}^3$ such that it satisfies $a^p=b!+p$ where $p$ is a prime number.

My Work:

We divide the proof into different cases.

Case 1 $b\ge 2p$: If $b\ge 2p$ then $b!+p=p^2l+p$ where $l\in \mathbb{N}$. This implies that $a=pk$ where $k\in \mathbb{N}$. The equation becomes $p^{p-1}k^p=pl+1$. If $p>1$ then $p^{p-1}k^p=pl+1$ has no solution because $p$ divides LHS but it does not divide RHS.

Case 2 $b<p$: Then $b^p+p>b^b+p>b!+p$. This implies that $b^p+p>a^p$ which implies $(b+1)^p>b^p+p>a^p$. Hence $a<b<p$. Now the equation $a^p-b!=p$ can be written as $a(a^{p-1}-(a-1)!(a+1)\cdots (b-1)b)=p$. Since $p$ is prime and $a<p$, this implies that $a=1$. Hence the equation has no solution in this case.

Case 3 $p \le b< 2p$: The equation $a^p=b!+p$ becomes \[\frac{a^p}{p}=(p-1)!(p+1)(p+2)\cdots (2p-x)+1\]where $1\le x\le p-1$. From LHS we conclude that $p|a$. Let $t\ge 1$ be the highest power of $p$ that divides $a$. Now the equation becomes \[p^{tp-1}k^p=(p-1)!(p+1)(p+2)\cdots (2p-x)+1\]where $k\in \mathbb{N}$ and not divisible by $p$. From the above equation we conclude that $gcd(k,y)=1$ for all $y\in \{2,3,\cdots, p-1,p+1,\cdots 2p-x\}$. If it is not so, then the value of the expression $p^{tp-1}k^p-(p-1)!(p+1)(p+2)\cdots (2p-x)>1$, because $gcd(k,y)>1$ will become a common factor. Therefore either $k=1$, or $k>2p-x$ and $gcd(k,y)=1$ for all $y\in \{2,3,\cdots, p-1,p+1,\cdots 2p-x\}$.

If $k>2p-x$ then $p^{tp-1}k^p>p^{p-1}(2p-x)^p>(p-1)!(p+1)\cdots (2p-x)$. Hence, this case is not possible. Hence $k$ must be $1$.

If $t\ge 2$ then $p^{2p}-1\le p^{tp-1}-1=(p-1)!(p+1)\cdots (2p-x)\le (p^2-1^2)(p^2-2^2)\cdots (p^2-(p-1)^2)< p^{2p-2}$. This case is also not possible.

The remaining case is $t=1$. In this case the equation becomes \[p^{p-1}-1=(p-1)!(p+1)\cdots (2p-x)\]where $1\le x\le p-1$.

After that, I am not getting any progress.
0 replies
combinatorics_mrityunjay
2 hours ago
0 replies
IMO 2017 Problem 4
Amir Hossein   118
N 2 hours ago by Sakura-junlin
Source: IMO 2017, Day 2, P4
Let $R$ and $S$ be different points on a circle $\Omega$ such that $RS$ is not a diameter. Let $\ell$ be the tangent line to $\Omega$ at $R$. Point $T$ is such that $S$ is the midpoint of the line segment $RT$. Point $J$ is chosen on the shorter arc $RS$ of $\Omega$ so that the circumcircle $\Gamma$ of triangle $JST$ intersects $\ell$ at two distinct points. Let $A$ be the common point of $\Gamma$ and $\ell$ that is closer to $R$. Line $AJ$ meets $\Omega$ again at $K$. Prove that the line $KT$ is tangent to $\Gamma$.

Proposed by Charles Leytem, Luxembourg
118 replies
Amir Hossein
Jul 19, 2017
Sakura-junlin
2 hours ago
Another asymmetric ineq in KTOM
Akeyla   5
N 2 hours ago by Quantum-Phantom
Source: Own, KTOM June 2025 (Mock Indonesian Pre-Regional MO)
Let $a, b, c$ be positive real numbers such that $a + \frac{b}{2} = \frac{c}{5}$. If $M$ is the maximal value \[3\sqrt[3]{a} + 6\sqrt[3]{b} - \dfrac{c^2}{250}\]then find the value of $\lfloor M^2 \rfloor$
5 replies
Akeyla
Today at 4:41 AM
Quantum-Phantom
2 hours ago
A Game where Construction of an odd cycle loses
EpicParadox   20
N 3 hours ago by cursed_tangent1434
Source: 2019 Canadian Mathematical Olympiad Problem 5
A 2-player game is played on $n\geq 3$ points, where no 3 points are collinear. Each move consists of selecting 2 of the points and drawing a new line segment connecting them. The first player to draw a line segment that creates an odd cycle loses. (An odd cycle must have all its vertices among the $n$ points from the start, so the vertices of the cycle cannot be the intersections of the lines drawn.) Find all $n$ such that the player to move first wins.
20 replies
EpicParadox
Mar 30, 2019
cursed_tangent1434
3 hours ago
Easy one from Recreații Matematice
mihaig   0
4 hours ago
Source: Own
Let $a,b,c,d\geq0$ satisfying
$$\frac1{a+1}+\frac1{b+1}+\frac1{c+1}+\frac1{d+1}=2.$$Prove
$$\left(a+b+c+d-3\right)^2+8abcd\geq9.$$
0 replies
mihaig
4 hours ago
0 replies
a+b+c=1 inequality
TNKT   0
4 hours ago
Source: Tran Ngoc Khuong Trang
Let $a,b,c$ be three pairwise distinct real numbers with $a+b+c=1.$
Find the minimum $$P=\left(\frac{a^{2}+2bc}{b-c}+\frac{b^{2}+2ca}{c-a}+\frac{c^{2}+2ab}{a-b}\right)^{2}.$$
0 replies
TNKT
4 hours ago
0 replies
Foot from vertex to Euler line
cjquines0   35
N 4 hours ago by Aiden-1089
Source: 2016 IMO Shortlist G5
Let $D$ be the foot of perpendicular from $A$ to the Euler line (the line passing through the circumcentre and the orthocentre) of an acute scalene triangle $ABC$. A circle $\omega$ with centre $S$ passes through $A$ and $D$, and it intersects sides $AB$ and $AC$ at $X$ and $Y$ respectively. Let $P$ be the foot of altitude from $A$ to $BC$, and let $M$ be the midpoint of $BC$. Prove that the circumcentre of triangle $XSY$ is equidistant from $P$ and $M$.
35 replies
cjquines0
Jul 19, 2017
Aiden-1089
4 hours ago
4 variables
perfect_square   8
N 4 hours ago by arqady
Source: can someone give me the link
$ a,b,c,d >0$. Prove that:
$ \frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a} \ge 4+ \frac{ 8(a-c)^2}{\Big( a+b+c+d\Big)^2}$
8 replies
perfect_square
Yesterday at 3:36 AM
arqady
4 hours ago
The hidden 9-point circle
Noob_at_math_69_level   7
N 4 hours ago by X.Luser
Source: DGO 2022 P4 Team
Let $\triangle{ABC}$ be a scalene triangle with incircle $(I)$ tangent to segment $BC$ at $D$.Line $AI$ intersects segment $BC$ at $Q$.$W$ lie on segment $BC$ such that $BD=WC$.Denote $M$ as the midpoint of arc $BAC$ of $(ABC)$.Suppose $(AIM)$ intersects $(BIC)$ again at $X$. $R$ is the reflection of $X$ over line $AM$.$S$ is the midpoint of segment $RQ$.$(ASW)$ intersects $BC$ again at $T$.Prove that: $AT$ is tangent to $(ABC)$.
7 replies
Noob_at_math_69_level
Dec 25, 2022
X.Luser
4 hours ago
Jbmo 2015 problem 1
neverlose   11
N Apr 10, 2025 by MATHS_ENTUSIAST
Find all prime numbers $a,b,c$ and positive integers $k$ satisfying the equation \[a^2+b^2+16c^2 = 9k^2 + 1.\]

Proposed by Moldova
11 replies
neverlose
Jun 26, 2015
MATHS_ENTUSIAST
Apr 10, 2025
Jbmo 2015 problem 1
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.
neverlose
117 posts
#1 • 3 Y
Y by Mai-san, Adventure10, ItsBesi
Find all prime numbers $a,b,c$ and positive integers $k$ satisfying the equation \[a^2+b^2+16c^2 = 9k^2 + 1.\]

Proposed by Moldova
This post has been edited 2 times. Last edited by Kunihiko_Chikaya, Aug 1, 2015, 2:09 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
djmathman
7940 posts
#3 • 14 Y
Y by Tan, DSrk, CaptainCuong, XbenX, Paragdey12, iDra36, Vietjung, opptoinfinity, TinSn, Mathlover_1, Adventure10, Mango247, ItsBesi, megarnie
Solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
individ
494 posts
#4 • 2 Y
Y by Adventure10, Mango247
Under this condition, we should think that there would be a brute-force options.
The task is more interesting if you want to solve this equation.
Interesting formula better in what form to write it down?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
IstekOlympiadTeam
542 posts
#5 • 3 Y
Y by DSrk, Iora, Adventure10
djmathman wrote:
Solution

My solution at exam
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Arslan
269 posts
#7 • 1 Y
Y by Adventure10
Where is going to be held JBMO 2016?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
IstekOlympiadTeam
542 posts
#8 • 2 Y
Y by Adventure10, Mango247
Arslan wrote:
Where is going to be held JBMO 2016?

I think it will be in Bulgaria or Cyprus
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
tenplusten
1000 posts
#9 • 2 Y
Y by Adventure10, Mango247
Arslan wrote:
Where is going to be held JBMO 2016?

Romania See here:http://www.massee-org.eu/index.php/mathematical/jbmo/item/55-jbmo2016
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
perenyilmaz
2 posts
#11 • 1 Y
Y by Adventure10
IstekOlympiadTeam wrote:
djmathman wrote:
Solution

My solution at exam
Well done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Rodymaths
4 posts
#12
Y by
from (mod 3) we get RHS is 1(mod 3) and LHS is a^2+b^2+c^2(mod 3)
But x^2 is 1 or 0 (mod 3), so the only configuration is two of a^2,b^2,c^2 to be 0(mod 3) and one of them to be 1(mod 3)
Now we have two cases
1)a^2 and b^2 are 0(mod 3) => a=b=3 (because they are prime)
we have 18+16c^2=9k^2+1
17=(3k-4c)(3k+4c) so 3k-4c=1 and 3k+4c=17 so k=3, c=2 and we have the solution (a,b,c,k)=(3,3,2,3)
2)a^2 and c^2 are 0(mod 3) => a=c=3 (because they are prime)
we have 153+b^2=9k^2+1
152=(3k-b)(3k+b) and we have the cases
3k-b=1,2,4,8
if 3k-b=1 then 3k+b=152 then 6k-1=152 no solution in positive integers
if 3k-b=2 then 3k+b=76 then 6k-2=76, k=13, b=37 and we get the solution (a,b,c,k)=(3,37,3,13)
if 3k-b=4 then 3k+b=38 then 6k-4=38, k=7, b=17 and we get the solution (a,b,c,k)=(3,17,3,7)
if 3k-b=8 then 3k+b=19 then 6k-8=19 no solution in positive integers

All the solutions are
(a,b,c,k)=(3,3,2,3),(3,37,3,13),(3,17,3,7)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
EVKV
72 posts
#13 • 1 Y
Y by Adventure1000
Take mod 3
Making 2 primes 3
Then cases and we are done
This post has been edited 1 time. Last edited by EVKV, Nov 27, 2024, 1:42 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MATHS_ENTUSIAST
30 posts
#14
Y by
if all of the a,b,c >3
a²,b²,c²≡1(mod3)
a²+b²+16c²≡0(mod3)
9k²+1≡0(mod3)
Not possible
Hence any of them should be a multiple of 3
We see there is symmetry in a and b
CASE 1:a=3
9+b²+16c²=9k²+1
b²+16c²=9k²-8
if both are not multiple of 3,
2≡1(mod3),not possible
a]b=3
9+9+16c²=9k²+1
17=9k²-16c²
17=(3k+4c)(3k-4c)
Since k,c>0
3k+4c=17
3k-4c=1
6k=18
k=3
8c=16
c=2
(a,b,c,k)=(3,3,2,3)
b]c=3
9+b²+144=9k²+1
152=9k²-b²
152=(3k+b)(3k-b)
3k+b=76
3k-b=2
6k=78
k=13
2b=74
b=37
(a,b,c,k)=(3,37,3,13)
3k+b=38
3k-b=4
6k=42
k=7
2b=34
b=17
(a,b,c,k)=(3,17,3,7)
Now since there is symmetry betn a&b we will not solve case of b=3
CASE 2: c=3
a²+b²+144=9k²+1
if a&b both are not multiple of 3,then,
2≡1(mod3)
Not possible
Hence any one should be a multiple of 3
we have solved for a=3 in subcase b] of CASE 1
And since there is symmetry,we just have to flip the values of a&b Which we got from subcase b] of CASE 1. If you don't believe then you can check by solving b=3

ANS:(a,b,c,k)=(3,3,2,3),(3,37,3,13),(3,17,3,7)
(37,3,3,13),(17,3,3,7)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MATHS_ENTUSIAST
30 posts
#15
Y by
Rodymaths wrote:
from (mod 3) we get RHS is 1(mod 3) and LHS is a^2+b^2+c^2(mod 3)
But x^2 is 1 or 0 (mod 3), so the only configuration is two of a^2,b^2,c^2 to be 0(mod 3) and one of them to be 1(mod 3)
Now we have two cases
1)a^2 and b^2 are 0(mod 3) => a=b=3 (because they are prime)
we have 18+16c^2=9k^2+1
17=(3k-4c)(3k+4c) so 3k-4c=1 and 3k+4c=17 so k=3, c=2 and we have the solution (a,b,c,k)=(3,3,2,3)
2)a^2 and c^2 are 0(mod 3) => a=c=3 (because they are prime)
we have 153+b^2=9k^2+1
152=(3k-b)(3k+b) and we have the cases
3k-b=1,2,4,8
if 3k-b=1 then 3k+b=152 then 6k-1=152 no solution in positive integers
if 3k-b=2 then 3k+b=76 then 6k-2=76, k=13, b=37 and we get the solution (a,b,c,k)=(3,37,3,13)
if 3k-b=4 then 3k+b=38 then 6k-4=38, k=7, b=17 and we get the solution (a,b,c,k)=(3,17,3,7)
if 3k-b=8 then 3k+b=19 then 6k-8=19 no solution in positive integers

All the solutions are
(a,b,c,k)=(3,3,2,3),(3,37,3,13),(3,17,3,7)

There are more solutions sir
Z K Y
N Quick Reply
G
H
=
a