Stay ahead of learning milestones! Enroll in a class over the summer!

G
Topic
First Poster
Last Poster
k a April Highlights and 2025 AoPS Online Class Information
jlacosta   0
Apr 2, 2025
Spring is in full swing and summer is right around the corner, what are your plans? At AoPS Online our schedule has new classes starting now through July, so be sure to keep your skills sharp and be prepared for the Fall school year! Check out the schedule of upcoming classes below.

WOOT early bird pricing is in effect, don’t miss out! If you took MathWOOT Level 2 last year, no worries, it is all new problems this year! Our Worldwide Online Olympiad Training program is for high school level competitors. AoPS designed these courses to help our top students get the deep focus they need to succeed in their specific competition goals. Check out the details at this link for all our WOOT programs in math, computer science, chemistry, and physics.

Looking for summer camps in math and language arts? Be sure to check out the video-based summer camps offered at the Virtual Campus that are 2- to 4-weeks in duration. 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 events:
[list][*]April 3rd (Webinar), 4pm PT/7:00pm ET, Learning with AoPS: Perspectives from a Parent, Math Camp Instructor, and University Professor
[*]April 8th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS State Discussion
April 9th (Webinar), 4:00pm PT/7:00pm ET, Learn about Video-based Summer Camps at the Virtual Campus
[*]April 10th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MathILy and MathILy-Er Math Jam: Multibackwards Numbers
[*]April 22nd (Webinar), 4:00pm PT/7:00pm ET, Competitive Programming at AoPS (USACO).[/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, Apr 13 - Aug 10
Tuesday, May 13 - Aug 26
Thursday, May 29 - Sep 11
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29

Prealgebra 2 Self-Paced

Prealgebra 2
Sunday, Apr 13 - Aug 10
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Monday, Apr 7 - Jul 28
Sunday, May 11 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, May 14 - Aug 27
Friday, May 30 - Sep 26
Monday, Jun 2 - Sep 22
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Wednesday, Apr 16 - Jul 2
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Thursday, Apr 17 - Jul 3
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Wednesday, Apr 16 - Jul 30
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Wednesday, Apr 23 - Oct 1
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

Intermediate: Grades 8-12

Intermediate Algebra
Monday, Apr 21 - Oct 13
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

Intermediate Counting & Probability
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Friday, Apr 11 - Jun 27
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Wednesday, Apr 9 - Sep 3
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Wednesday, Apr 16 - Jul 2
Friday, May 23 - Aug 15
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!)

MATHCOUNTS/AMC 8 Advanced
Friday, Apr 11 - Jun 27
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Friday, May 9 - Aug 1
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!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

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, May 22 - Aug 7
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

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22

USACO Bronze Problem Series
Tuesday, May 13 - Jul 29
Sunday, Jun 22 - Sep 1

Physics

Introduction to Physics
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Sat & Sun, Apr 26 - Apr 27 (4:00 - 7:00 pm ET/1:00 - 4:00pm PT)
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Apr 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
pqr/uvw convert
Nguyenhuyen_AG   8
N a few seconds ago by Victoria_Discalceata1
Source: https://github.com/nguyenhuyenag/pqr_convert
Hi everyone,
As we know, the pqr/uvw method is a powerful and useful tool for proving inequalities. However, transforming an expression $f(a,b,c)$ into $f(p,q,r)$ or $f(u,v,w)$ can sometimes be quite complex. That's why I’ve written a program to assist with this process.
I hope you’ll find it helpful!

Download: pqr_convert

Screenshot:
IMAGE
IMAGE
8 replies
+1 w
Nguyenhuyen_AG
Apr 19, 2025
Victoria_Discalceata1
a few seconds ago
Inspired by hlminh
sqing   2
N 3 minutes ago by SPQ
Source: Own
Let $ a,b,c $ be real numbers such that $ a^2+b^2+c^2=1. $ Prove that $$ |a-kb|+|b-kc|+|c-ka|\leq \sqrt{3k^2+2k+3}$$Where $ k\geq 0 . $
2 replies
1 viewing
sqing
Yesterday at 4:43 AM
SPQ
3 minutes ago
A cyclic inequality
KhuongTrang   3
N 8 minutes ago by KhuongTrang
Source: own-CRUX
IMAGE
https://cms.math.ca/.../uploads/2025/04/Wholeissue_51_4.pdf
3 replies
1 viewing
KhuongTrang
Monday at 4:18 PM
KhuongTrang
8 minutes ago
Tiling rectangle with smaller rectangles.
MarkBcc168   60
N 14 minutes ago by cursed_tangent1434
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
60 replies
+1 w
MarkBcc168
Jul 10, 2018
cursed_tangent1434
14 minutes ago
ALGEBRA INEQUALITY
Tony_stark0094   2
N 35 minutes ago by Sedro
$a,b,c > 0$ Prove that $$\frac{a^2+bc}{b+c} + \frac{b^2+ac}{a+c} + \frac {c^2 + ab}{a+b} \geq a+b+c$$
2 replies
Tony_stark0094
an hour ago
Sedro
35 minutes ago
Checking a summand property for integers sufficiently large.
DinDean   2
N an hour ago by DinDean
For any fixed integer $m\geqslant 2$, prove that there exists a positive integer $f(m)$, such that for any integer $n\geqslant f(m)$, $n$ can be expressed by a sum of positive integers $a_i$'s as
\[n=a_1+a_2+\dots+a_m,\]where $a_1\mid a_2$, $a_2\mid a_3$, $\dots$, $a_{m-1}\mid a_m$ and $1\leqslant a_1<a_2<\dots<a_m$.
2 replies
DinDean
Yesterday at 5:21 PM
DinDean
an hour ago
Bunnies hopping around in circles
popcorn1   22
N an hour ago by awesomeming327.
Source: USA December TST for IMO 2023, Problem 1 and USA TST for EGMO 2023, Problem 1
There are $2022$ equally spaced points on a circular track $\gamma$ of circumference $2022$. The points are labeled $A_1, A_2, \ldots, A_{2022}$ in some order, each label used once. Initially, Bunbun the Bunny begins at $A_1$. She hops along $\gamma$ from $A_1$ to $A_2$, then from $A_2$ to $A_3$, until she reaches $A_{2022}$, after which she hops back to $A_1$. When hopping from $P$ to $Q$, she always hops along the shorter of the two arcs $\widehat{PQ}$ of $\gamma$; if $\overline{PQ}$ is a diameter of $\gamma$, she moves along either semicircle.

Determine the maximal possible sum of the lengths of the $2022$ arcs which Bunbun traveled, over all possible labellings of the $2022$ points.

Kevin Cong
22 replies
popcorn1
Dec 12, 2022
awesomeming327.
an hour ago
Iran second round 2025-q1
mohsen   4
N an hour ago by MathLuis
Find all positive integers n>2 such that sum of n and any of its prime divisors is a perfect square.
4 replies
mohsen
Apr 19, 2025
MathLuis
an hour ago
Dear Sqing: So Many Inequalities...
hashtagmath   37
N an hour ago by hashtagmath
I have noticed thousands upon thousands of inequalities that you have posted to HSO and was wondering where you get the inspiration, imagination, and even the validation that such inequalities are true? Also, what do you find particularly appealing and important about specifically inequalities rather than other branches of mathematics? Thank you :)
37 replies
hashtagmath
Oct 30, 2024
hashtagmath
an hour ago
integer functional equation
ABCDE   148
N 2 hours ago by Jakjjdm
Source: 2015 IMO Shortlist A2
Determine all functions $f:\mathbb{Z}\rightarrow\mathbb{Z}$ with the property that \[f(x-f(y))=f(f(x))-f(y)-1\]holds for all $x,y\in\mathbb{Z}$.
148 replies
ABCDE
Jul 7, 2016
Jakjjdm
2 hours ago
IMO Shortlist 2013, Number Theory #1
lyukhson   152
N 2 hours ago by Jakjjdm
Source: IMO Shortlist 2013, Number Theory #1
Let $\mathbb{Z} _{>0}$ be the set of positive integers. Find all functions $f: \mathbb{Z} _{>0}\rightarrow \mathbb{Z} _{>0}$ such that
\[ m^2 + f(n) \mid mf(m) +n \]
for all positive integers $m$ and $n$.
152 replies
lyukhson
Jul 10, 2014
Jakjjdm
2 hours ago
9x9 Board
mathlover314   8
N 2 hours ago by sweetbird108
There is a $9x9$ board with a number written in each cell. Every two neighbour rows sum up to at least $20$, and every two neighbour columns sum up to at most $16$. Find the sum of all numbers on the board.
8 replies
mathlover314
May 6, 2023
sweetbird108
2 hours ago
Estonian Math Competitions 2005/2006
STARS   3
N 3 hours ago by Darghy
Source: Juniors Problem 4
A $ 9 \times 9$ square is divided into unit squares. Is it possible to fill each unit square with a number $ 1, 2,..., 9$ in such a way that, whenever one places the tile so that it fully covers nine unit squares, the tile will cover nine different numbers?
3 replies
STARS
Jul 30, 2008
Darghy
3 hours ago
Woaah a lot of external tangents
egxa   1
N 3 hours ago by HormigaCebolla
Source: All Russian 2025 11.7
A quadrilateral \( ABCD \) with no parallel sides is inscribed in a circle \( \Omega \). Circles \( \omega_a, \omega_b, \omega_c, \omega_d \) are inscribed in triangles \( DAB, ABC, BCD, CDA \), respectively. Common external tangents are drawn between \( \omega_a \) and \( \omega_b \), \( \omega_b \) and \( \omega_c \), \( \omega_c \) and \( \omega_d \), and \( \omega_d \) and \( \omega_a \), not containing any sides of quadrilateral \( ABCD \). A quadrilateral whose consecutive sides lie on these four lines is inscribed in a circle \( \Gamma \). Prove that the lines joining the centers of \( \omega_a \) and \( \omega_c \), \( \omega_b \) and \( \omega_d \), and the centers of \( \Omega \) and \( \Gamma \) all intersect at one point.
1 reply
egxa
Apr 18, 2025
HormigaCebolla
3 hours ago
Problem 2
Functional_equation   15
N Mar 30, 2025 by basilis
Source: Azerbaijan third round 2020
$a,b,c$ are positive integer.
Solve the equation:
$ 2^{a!}+2^{b!}=c^3 $
15 replies
Functional_equation
Jun 6, 2020
basilis
Mar 30, 2025
Problem 2
G H J
G H BBookmark kLocked kLocked NReply
Source: Azerbaijan third round 2020
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Functional_equation
530 posts
#1 • 1 Y
Y by Mango247
$a,b,c$ are positive integer.
Solve the equation:
$ 2^{a!}+2^{b!}=c^3 $
This post has been edited 1 time. Last edited by Functional_equation, Jun 9, 2020, 6:15 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
leibnitz
1430 posts
#2 • 5 Y
Y by A-Thought-Of-God, ehuseyinyigit, Mango247, Mango247, Mango247
If $a,b\ge 3, 6|a!,b!\Rightarrow 2^{a!}\equiv 2^{b!}\equiv1\pmod 9$ so $2^{a!}+2^{b!}\equiv 2\pmod 9$ which is absurd.WLOG $a=2,1$ ,$\pmod9$ again implies $b<3$ looking at all the cases we get the only solution as $a=b=2$.
This post has been edited 3 times. Last edited by leibnitz, Jun 6, 2020, 9:50 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Functional_equation
530 posts
#3
Y by
My Solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
CahitArf
80 posts
#6 • 1 Y
Y by guywholovesmathandphysics
Case 1 = If a=b then 2^b!+1=c^3 and c must be in form of 2^a. From here we get 3a=b! +1 . So b<3 . By trying 1 and 2. For case 1 a=b=2 is the only solution.
Case 2. Becuse a and b symetric in this equation , we can take a>b .
Now we get 2^b!(2^(a!-b!) +1)=c^3 Because the part in the paranthesis doesn't divide 2, b! is divisible by 3.That makes b=3 or b>3. So a>3. Now outside of the paranthesis is cubic. So let's say 2^(a!-b!)+1= k^3 where k is positive int.
In modulo 7 x^3 can't be 2. But because a>3 and b is bigger or equal to 3. And a>b. a!-b! divides 3.
In modulo seven 2^(a!-b!) +1 is 2. We get a contradiction in this case.
So a and be must be equal and the only solution is (2,2,2) .

Azerbaycana Selamlar.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
lian_the_noob12
173 posts
#7
Y by
Mod 7 works too!!
This post has been edited 2 times. Last edited by lian_the_noob12, Mar 25, 2023, 6:55 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mathmax12
6012 posts
#9
Y by
We have that $2^{a!} \equiv 2^{b!} \equiv 1\pmod{9}$, if $a,b \ge 3$, but this can't work because the sum is 2 mod 9 which is impossible. Now looking at the possible values, the only solution is $\boxed{a=b=c=2}.$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
F10tothepowerof34
195 posts
#10
Y by
Clearly $2\mid c$, thus $c^3\equiv -1\text{ or }1\pmod 7$. Moreover notice that $2^{n!}\equiv 1\pmod 7, \forall n\ge3$
Therefore $2^{a!}+2^{b!}\equiv2\pmod 7, \forall a,b\ge3$ however this clearly contradicts the fact that $c^3\equiv-1\text{ or }1\pmod 7$. Thus $a,b\le2$
Manually checking the cases yields $(a,b,c)=(2,2,2)$ to be the only viable solution $\blacksquare$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
zaidova
86 posts
#11 • 2 Y
Y by monoditetra, Leparolelontane
Also there is a question like that (it's from senior 2020);
pow(2,a!)+pow(2,b!)+pow(2,c!)=x³
First i investigated the possibilities;
i) a=b=c
3* pow(2,a!)=x³
x is consist of 2 and 3 divisors
We must to make pow(3,3k) but we can not do this. Because another divisor is pow(2,p). So there is no solution.
ii) The answer is asymmetric. So we will look one of them, and after finding all of the solutions we will write permutations of them. Assume that a=b<c
2*pow(2,a!)+pow(2,c!)=x³
pow(2,a!+1)+pow(2,c!)=x³ accept that :
c=a+1
pow(2,a!+1)*(1+2⁰)=pow(2,a!+2) And in the problem that's given that a€Z+ . It pays for a=1. And it has solution .
Click to reveal hidden text
$Permutations of (1,1,2)$
Let's look the equality like that;
a+1!=c and the equality will be:
1+ pow(2,c!-a!-1) it can not be pow(2,k) and also can not be a cube.
Let's look another case;
iii) a<b<c
pow(2,a!)*(1+pow(2,b!-a!)+pow(2,c!-a!)=x³
And also there are two cases. If it must be equal to a cube of the number, second factor must be pow(2,n). But it gives 1 to mod 2, so it can't.
Or a must be 3k and the second multiply must be cube.
Let's accept b!-a!=m and c!-a!=n
1+pow(2,m)+ pow(2,n)=y³
pow(2,m)+pow(2,n)=y³-1=(y-1)(y²+y+1)
y must be odd number. So y-1==>even number
And y²+y+1==>odd number. pow(2,m)+pow(2,n) there are only 2 factors. So it can not pay. It doesn't have solution.

Click to reveal hidden text
$Our answer: (1,1,2),(1,2,1),(2,1,1)$
This post has been edited 2 times. Last edited by zaidova, Feb 18, 2024, 7:59 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
zaidova
86 posts
#12 • 2 Y
Y by monoditetra, Leparolelontane
$a=b=c /is /the /only /solution /that/ we/ have.$
zaidova wrote:
Also there is a question like that (it's from senior 2020);
pow(2,a!)+pow(2,b!)+pow(2,c!)=x³
First i investigated the possibilities;
i) a=b=c
3* pow(2,a!)=x³
x is consist of 2 and 3 divisors
We must to make pow(3,3k) but we can not do this. Because another divisor is pow(2,p). So there is no solution.
ii) The answer is asymmetric. So we will look one of them, and after finding all of the solutions we will write permutations of them. Assume that a=b<c
2*pow(2,a!)+pow(2,c!)=x³
pow(2,a!+1)+pow(2,c!)=x³ accept that :
c=a+1
pow(2,a!+1)*(1+2⁰)=pow(2,a!+2) And in the problem that's given that a€Z+ . It pays for a=1. And it has solution .
Click to reveal hidden text
$Permutations of (1,1,2)$
Let's look the equality like that;
a+1!=c and the equality will be:
1+ pow(2,c!-a!-1) it can not be pow(2,k) and also can not be a cube.
Let's look another case;
iii) a<b<c
pow(2,a!)*(1+pow(2,b!-a!)+pow(2,c!-a!)=x³
And also there are two cases. If it must be equal to a cube of the number, second factor must be pow(2,n). But it gives 1 to mod 2, so it can't.
Or a must be 3k and the second multiply must be cube.
Let's accept b!-a!=m and c!-a!=n
1+pow(2,m)+ pow(2,n)=y³
pow(2,m)+pow(2,n)=y³-1=(y-1)(y²+y+1)
y must be odd number. So y-1==>even number
And y²+y+1==>odd number. pow(2,m)+pow(2,n) there are only 2 factors. So it can not pay. It doesn't have solution.


$Our answer: (1,1,2),(1,2,1),(2,1,1)$

Same idea if we search the cases like that, we will get a=b=c

$2^{a!}+2^{b!}=c^3$
> $2^{a!}+2^{a!}=a^3$
And that is equal to;

$2^{a!+1}=a^3$ $a=2=b=c$
This post has been edited 4 times. Last edited by zaidova, Nov 21, 2024, 2:00 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Sadigly
147 posts
#13 • 1 Y
Y by Atilla
WLOG $a\geq b$

1)If $b\geq 3$, then $(2^{a!/3})^3+(2^{b!/3})^3=c^3$, which is not true because of Fermat's Last Theorem
2)If $b=2$, then:
a)$a\geq3\Rightarrow c^3-(2^{a!/3})^3=4 $ No solution.
b)$a=2\Rightarrow 4+4=c^3$ (2,2,2)

3)If $b=1$, then:
a)$a\geq3\Rightarrow c^3-(2^{a!/3})^3=2 $ No solution.
b)$a=2\Rightarrow 4+2=c^3$ No solution.
c)$a=1\Rightarrow 2+2=c^3$ No solution.
This post has been edited 1 time. Last edited by Sadigly, Dec 18, 2024, 8:20 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Atilla
59 posts
#15
Y by
Sadigly wrote:
WLOG $a\geq b$

1)If $b\geq 3$, then $(2^{a!/3})^3+(2^{b!/3})^3=c^3$, which is not true because of Fermat's Last Theorem
2)If $b=2$, then:
a)$a\geq3\Rightarrow c^3-(2^{a!/3})^3=4 $ No solution.
b)$a=2\Rightarrow 4+4=c^3$ (2,2,2)

3)If $b=1$, then:
a)$a\geq3\Rightarrow c^3-(2^{a!/3})^3=1 $ No solution.
b)$a=2\Rightarrow 4+2=c^3$ No solution.
c)$a=1\Rightarrow 2+2=c^3$ No solution.

Bro you made a mistake in b=1 a)
Here it's equals 2 not 1 but its still no solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
megarnie
5589 posts
#16
Y by
The only solution is $\boxed{(2,2,2)}$, which works. Now we show it's the only one.

Claim: If the sum of two powers of $2$ is a cube, then neither of the two powers of $2$ are $1 \pmod 7$.
Proof: Suppose otherwise $2^x + 2^y = z^3$ for some nonnegative integers $x,y,z$ and that one of $2^x, 2^y$ are $1 \pmod 7$. WLOG that $2^y \equiv 1 \pmod 7$. Note that powers of $2$ are $1,2,$ or $4$ modulo $7$, so $z^3$ is $2,3,$ or $5$ modulo $7$, however cubes are either $-1,0,1$ modulo $7$, absurd. $\square$

Thus, $6$ can't divide $a!$ or $b!$, meaning $a,b$ are both less than $3$. Checking cases ($a=1,2$ and $b=1,2$) gives the desired result.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Sadigly
147 posts
#17
Y by
Atilla wrote:

Bro you made a mistake in b=1 a)
Here it's equals 2 not 1 but its still no solution

Thanks,corrected
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AshAuktober
993 posts
#18
Y by
This seems new...
Claim: $a = b$.
Proof: Assume otherwise WLOG $a < b$, and let $\frac{b!}{a!} = k$.
Note that we then have
$$2^{a!}(2^k+1) = c^3.$$In particular, $2^k+1$ is coprime to $2^{a!}$, so it must itself be a perfect cube, say $m^3$.
Then we have $2^k+1 = m^3 \implies m^2 + m + 1 \mid 2^k$, but this isn't possible as $m^2 + m + 1$ is odd and not equal to $\pm 1$. $\square$

Now we have $2^{a!+1} = c^3$, which has a solution iff $a! \equiv 2 \pmod{3} \iff a = b = 2$. This gives us the value $c = 2$.
Thus the nly working solution is $\boxed{(a, b, c0 = (2, 2, 2)}$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Aopsn
2 posts
#19
Y by
Fermat's little theorem kills this problem
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
basilis
3 posts
#20
Y by
my solution:
i solved tis problem using modulo 3:
So if a,b<=2 we have that a=b=1:
so c^3=2+2=1 mod 3 <=> c=1 (fermat's litle theorem (a^p=a mod p))
Therefore a,b >=2. So a,b are even numbers.
It also means that 2^2k =1 mod 3
therefore a!=2s and b!=2t.
So 2^a!=1 mod 3 and 2^b! = 1 mod 3 <=> c^3 = 2 mod 3 <=> c=2 (fermat's litle theorem again)
Therefore we have that 2^a! 2^b!= 8 <=> a=b=2
So the solution is (a,b,c)=(2,2,2).
I Hope It Is Correct.
Z K Y
N Quick Reply
G
H
=
a