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

G
Topic
First Poster
Last Poster
k a May Highlights and 2025 AoPS Online Class Information
jlacosta   0
May 1, 2025
May is an exciting month! National MATHCOUNTS is the second week of May in Washington D.C. and our Founder, Richard Rusczyk will be presenting a seminar, Preparing Strong Math Students for College and Careers, on May 11th.

Are you interested in working towards MATHCOUNTS and don’t know where to start? We have you covered! If you have taken Prealgebra, then you are ready for MATHCOUNTS/AMC 8 Basics. Already aiming for State or National MATHCOUNTS and harder AMC 8 problems? Then our MATHCOUNTS/AMC 8 Advanced course is for you.

Summer camps are starting next 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 an enriching 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][*]May 9th, 4:30pm PT/7:30pm ET, Casework 2: Overwhelming Evidence — A Text Adventure, a game where participants will work together to navigate the map, solve puzzles, and win! All are welcome.
[*]May 19th, 4:30pm PT/7:30pm ET, What's Next After Beast Academy?, designed for students finishing Beast Academy and ready for Prealgebra 1.
[*]May 20th, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 1 Math Jam, Problems 1 to 4, join the Canada/USA Mathcamp staff for this exciting Math Jam, where they discuss solutions to Problems 1 to 4 of the 2025 Mathcamp Qualifying Quiz!
[*]May 21st, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 2 Math Jam, Problems 5 and 6, Canada/USA Mathcamp staff will discuss solutions to Problems 5 and 6 of the 2025 Mathcamp Qualifying Quiz![/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
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
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
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
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
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
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
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

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

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

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

Precalculus
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
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
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

AIME Problem Series A
Thursday, May 22 - Jul 31

AIME Problem Series B
Sunday, Jun 22 - Sep 21

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
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
May 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
Disjoint Pairs
MithsApprentice   42
N a minute ago by endless_abyss
Source: USAMO 1998
Suppose that the set $\{1,2,\cdots, 1998\}$ has been partitioned into disjoint pairs $\{a_i,b_i\}$ ($1\leq i\leq 999$) so that for all $i$, $|a_i-b_i|$ equals $1$ or $6$. Prove that the sum \[ |a_1-b_1|+|a_2-b_2|+\cdots +|a_{999}-b_{999}|  \] ends in the digit $9$.
42 replies
MithsApprentice
Oct 9, 2005
endless_abyss
a minute ago
FE with gcd
a_507_bc   8
N 3 minutes ago by Tkn
Source: Nordic MC 2023 P2
Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that $$\gcd(f(x),y)f(xy)=f(x)f(y)$$for all positive integers $x, y$.
8 replies
a_507_bc
Apr 21, 2023
Tkn
3 minutes ago
2014 JBMO Shortlist G1
parmenides51   19
N 13 minutes ago by tilya_TASh
Source: 2014 JBMO Shortlist G1
Let ${ABC}$ be a triangle with $m\left( \angle B \right)=m\left( \angle C \right)={{40}^{{}^\circ }}$ Line bisector of ${\angle{B}}$ intersects ${AC}$ at point ${D}$. Prove that $BD+DA=BC$.
19 replies
parmenides51
Oct 8, 2017
tilya_TASh
13 minutes ago
Stars and bars i think
RenheMiResembleRice   1
N 36 minutes ago by NicoN9
Source: Diao Luo
Solve the following attached with steps
1 reply
RenheMiResembleRice
44 minutes ago
NicoN9
36 minutes ago
Sequence
Titibuuu   1
N 40 minutes ago by Titibuuu
Let \( a_1 = a \), and for all \( n \geq 1 \), define the sequence \( \{a_n\} \) by the recurrence
\[
a_{n+1} = a_n^2 + 1
\]Prove that there is no natural number \( n \) such that
\[
\prod_{k=1}^{n} \left( a_k^2 + a_k + 1 \right)
\]is a perfect square.
1 reply
Titibuuu
6 hours ago
Titibuuu
40 minutes ago
Show that three lines concur
benjaminchew13   2
N an hour ago by benjaminchew13
Source: Revenge JOM 2025 P2
t $A B C$ be a triangle. $M$ is the midpoint of segment $B C$, and points $E$, $F$ are selected on sides $A B$, $A C$ respectively such that $E$, $F$, $M$ are collinear. The circumcircles $(A B C)$ and $(A E F)$ intersect at a point $P != A$. The circumcircle $(A P M)$ intersects line $B C$ again at a point $D != M$. Show that the lines $A D$, $E F$ and the tangent to $(A E F)$ at point $P$ concur.
2 replies
benjaminchew13
an hour ago
benjaminchew13
an hour ago
slightly easy NT fe
benjaminchew13   2
N an hour ago by benjaminchew13
Source: Revenge JOM 2025 P1
Find all functions $f:\mathbb{N}\rightarrow\mathbb{N}$ such that $$f(a) + f(b) + f(c) | a^2 + af(b) + cf(a)$$for all $a, b, c\in\mathbb{N}$
2 replies
benjaminchew13
an hour ago
benjaminchew13
an hour ago
Cheesy's math casino
benjaminchew13   1
N an hour ago by benjaminchew13
Source: Revenge JOM 2025 P4
There are $p$ people playing a game at Cheesy's math casino, where $p$ is an odd prime number. Let $n$ be a positive integer. A subset of length $s$ from the set of integers from $1$ to $n$ inclusive is randomly chosen, with an equal probability ($s <= n$ and is fixed). The winner of Cheesy's game is person $i$, if the sum of the chosen numbers are congruent to $i mod p$ for $0 <= i <= p - 1$.

For each $n$, find all values of $s$ such that no one will sue Cheesy for creating unfair games (i.e. all the winning outcomes are equally likely).
1 reply
benjaminchew13
an hour ago
benjaminchew13
an hour ago
2013 Japan MO Finals
parkjungmin   0
an hour ago
help me

we cad do it
0 replies
parkjungmin
an hour ago
0 replies
inequality
benjaminchew13   1
N an hour ago by benjaminchew13
Source: Revenge JOM 2025 P3
Let $n \ge 2$ be a positive integer and let $a_1$, $a_2$, ..., $a_n$ be a sequence of non-negative real numbers. Find the maximum value of $$3(a_1  + a_2 + \cdots + a_n) - (a_1^2 + a_2^2 + \cdots + a_n^2) - (a_1a_2\cdots a_n)$$in terms of $n$.
1 reply
benjaminchew13
an hour ago
benjaminchew13
an hour ago
IMO ShortList 1999, algebra problem 2
orl   11
N an hour ago by ezpotd
Source: IMO ShortList 1999, algebra problem 2
The numbers from 1 to $n^2$ are randomly arranged in the cells of a $n \times n$ square ($n \geq 2$). For any pair of numbers situated on the same row or on the same column the ratio of the greater number to the smaller number is calculated. Let us call the characteristic of the arrangement the smallest of these $n^2\left(n-1\right)$ fractions. What is the highest possible value of the characteristic ?
11 replies
orl
Nov 14, 2004
ezpotd
an hour ago
Coolabra
Titibuuu   2
N an hour ago by no_room_for_error
Let \( a, b, c \) be distinct real numbers such that
\[
a + b + c + \frac{1}{abc} = \frac{19}{2}
\]Find the maximum possible value of \( a \).
2 replies
Titibuuu
6 hours ago
no_room_for_error
an hour ago
Hard centroid geo
lucas3617   0
an hour ago
Source: Revenge JOM 2025 P5
A triangle $A B C$ has centroid $G$. A line parallel to $B C$ passing through $G$ intersects the circumcircle of $A B C$ at $D$. Let lines $A D$ and $B C$ intersect at $E$. Suppose a point $P$ is chosen on $B C$ such that the tangent of the circumcircle of $D E P$ at $D$, the tangent of the circumcircle of $A B C$ at $A$ and $B C$ concur. Prove that $G P = P D$.
0 replies
lucas3617
an hour ago
0 replies
Cute construction problem
Eeightqx   5
N an hour ago by HHGB
Source: 2024 GPO P1
Given a triangle's intouch triangle, incenter, incircle. Try to figure out the circumcenter of the triangle with a ruler only.
5 replies
Eeightqx
Feb 14, 2024
HHGB
an hour ago
Euclid NT
Taco12   12
N Apr 25, 2025 by Ilikeminecraft
Source: 2023 Fall TJ Proof TST, Problem 4
Find all pairs of positive integers $(a,b)$ such that \[ a^2b-1 \mid ab^3-1. \]
Calvin Wang
12 replies
Taco12
Oct 6, 2023
Ilikeminecraft
Apr 25, 2025
Euclid NT
G H J
G H BBookmark kLocked kLocked NReply
Source: 2023 Fall TJ Proof TST, Problem 4
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Taco12
1757 posts
#1 • 2 Y
Y by megarnie, ItsBesi
Find all pairs of positive integers $(a,b)$ such that \[ a^2b-1 \mid ab^3-1. \]
Calvin Wang
This post has been edited 1 time. Last edited by Taco12, Oct 6, 2023, 12:50 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
cj13609517288
1915 posts
#2
Y by
The original problem had way more conditions but apparently without the conditions was still solvable and rather interesting lol.

Doing sufficient Euclid yields
\[a^2b-1\mid a^5-1,\]\[a^2b-1\mid a^3-b,\]\[a^2b-1\mid a-b^2.\]
Caseworking on size for the second and third divisibilities yields $\boxed{(1,b)}$, $\boxed{(b^2,b)}$, and $\boxed{(a,a^3)}$, which all work.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
grupyorum
1418 posts
#3
Y by
I claim all answers are $(a,b)=(1,b), (b^2,b), (b,b^3)$, where $b$ is arbitrary.

First, see that for $a=1$, any $b$ works; so let $a>1$. Next, $a^2b-1\le ab^3-1$, so $b^2\ge a$. We have $a^2b-1\mid ab^3-a^2b=ab(b^2-a)$, so $a^2b-1\mid b^2-a$. If $b^2=a$, then any $b$ works, so let $b^2>a$. Now, using $a^2b-1\mid a^3b-a$, we find $a^2b-1 \mid b(a^3-b)$, that is $a^2b-1\mid a^3-b$.
Case 1. $b=a^3$. In this case, clearly any $b$ works.
Case 2. $b>a^3$. Then, $a^2b-1\mid b-a^3$, so $b\ge a^3-1+a^2b\ge 4b$ as $a\ge 2$, a contradiction.
Case 3. $b<a^3$. Then, $a^2b-1\mid a^3-b$, so $a^3\ge a^2b+b-1\ge a^2b$, so $a\ge b$. But then, using $a^2b-1\mid b^2-a$ we have $b^2\ge a+a^2b-1\ge a^2b\ge b^3$, forcingn $b=1$. For $b=1$, $a^2-1\mid a-1$, yielding $a=1$.
This post has been edited 1 time. Last edited by grupyorum, Oct 6, 2023, 1:50 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MathLuis
1524 posts
#4 • 2 Y
Y by vrondoS, MS_asdfgzxcvb
Note that $a^2b-1 \mid ab^3-1 \implies a^2b-1 \mid a^2b^3-a-(a^2b^3-b^2) \implies a^2b-1 \mid b^2-a \implies |b^2-a| \ge a^2b-1$
Also $a^2b-1 \mid ab^3-1 \implies a^2b-1 \mid a^4b^3-a^3 \implies a^2b-1 \mid a^3-b \implies |a^3-b| \ge a^2b-1$.
Now if $a=1$ then all $b$ work so $(1,n)$ is a solution, also note if $b=1$ then $a=1$ (which is $(1,1)$ which we already have), now if $a,b \ge 2$, then we have the following cases.
Case 1: $b \ge a^3$
Then here $b-a^3 \ge a^2b-1$ or $b=a^3$, if the first one holds then $b-8 \ge b-a^3 \ge a^2b-1 \ge 4b-1$ contradiction!, hence another solution pair from this case is $(n,n^3)$
Case 2: $b<a^3$
Case 2.1: $a \ge b^2$
Then $a=b^2$ or $a-b^2 \ge a^2b-1$ hence $a-4 \ge a-b^2 \ge ba^2-1 \ge 2a^2-1$ contradiction! hence $a=b^2$ so $(n^2,n)$ is another solution.
Case 2.2: $b^2>a$
$a^3 \ge a^2b+b-1>a^2b$ hence $a \ge b+1$ hence $b^2-b-1 \ge b^2-a \ge a^2b-1 \ge b^3-2b^2+b-1>b^3-2b^2-b-1$ so $3b^2>b^3$ hence $b=2$ but then $4-a \ge 4a^2-1$ for all $a \ge 3$ which cant happen, so contradiction!.
Hence all the pairs are $(1,n), (n^2, n), (n, n^3)$ thus we are done :D.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
DottedCaculator
7352 posts
#5
Y by
Subtracting gives $a^2b-1\mid ab(b^2-a)$ so $a^2b-1\mid b^2-a$. Therefore, either $a=b^2$, which works, or $a^2b-1\leq b^2-a$. We also have $a^2b-1\mid ab^3-1-(a^4b^2-1)=ab^2(b-a^3)$, so either $b=a^3$, which works, or $a^2b-1\leq a^3-b$. This implies $b<a$, contradicting the first inequality.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
john0512
4187 posts
#7
Y by
The answer is $a=1$ and $a=b^2$ and $b=a^3.$ When $a=1$, the statement is $b-1\mid b^3-1$, which is true by difference of cubes factorization, and when $a=b^2$ the two sides are equal. When $b=a^3$, the statement is $a^5-1\mid a^{10}-1$ which is true by difference of squares.

From now on, assume $a\geq 2$ since we already know that $a=1$ always works.

Rewrite the condition as $$ab^3-1\equiv 0\pmod{a^2b-1}.$$Since $a^2b-1$ is relatively prime to $a$, we will multiply this by $a$ to get $$a^2b^3-a\equiv 0\pmod{a^2b-1}.$$We subtract $a^2b^3-b^2$ from the left side (since that is $b^2$ times the modulus), to get $$b^2\equiv a\pmod{a^2b-1}.$$Now, let $$b^2=a+k(a^2b-1)$$for some integer $k$. If $k=0$, then we have $a=b^2$ which we know works, so from now on assume $k\neq 0.$ Clearly, $k$ cannot be negative either, as $a^2b-1\geq a^2-1>a$ since we are assuming $a\geq 2.$ Thus, $k$ is a positive integer.

Now, rearrange this as a quadratic in $b$ to get $$b^2+(-a^2k)b+k-a=0.$$Since $b$ must be an integer, we have that the discriminant must be a perfect square. Thus, $$a^4k^2+4(a-k)$$must be a square.

Claim 1: $$(a^2k-1)^2<a^4k^2+4(a-k).$$Expanding this out gives $$-2a^2k+1<4a-4k$$$$4k+1<4a+2a^2k.$$This is clearly true, since we are assuming $a\geq 2$ so $$2a^2k+4a\geq 8k+8>4k+1.$$
Claim 2: $$(a^2k+1)^2>a^4k^2+4(a-k).$$Expanding this out gives $$2a^2k+1>4a-4k$$$$2a^2k+4k+1>4a.$$Again, this is clearly true since we are assuming $a\geq 2$ so $$2a^2k+4k+1>2a^2k\geq 2a^2\geq 4a.$$
Thus, the only way for it to be a perfect square is if $$a^4k^2+4(a-k)=(a^2k)^2$$$$a=k.$$
However, if we plug it back into $$b^2+(-a^2k)b+k-a=0,$$this just becomes $$b^2-a^3b=0,$$which has the solution $b=a^3,$ hence done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
shendrew7
795 posts
#8
Y by
Does $0 \mid 0$? Probably doesn't, so we exclude $(1,1)$ in the solution set.

Note the LHS must be less than or equal to the RHS, so $a \leq b^2$. Euclid also tells us
\[a^2b-1 \mid (ab^3-1)-(a^2b-1) = ab(b^2-a).\]
  • $\min(a,b)=1$: Our solutions are $\boxed{(1,k)}$.
  • Otherwise, $a^2b-1 \mid b^2-a$. If $b \leq a^2$, the RHS must be 0, we get the solution $\boxed{(k^2,k)}$.
  • Otherwise, $a^2b-1 \mid a(a^2b-1) - (b^2-a) = b(b-a^3)$, and as $|b-a^3| < |a^2b-1|$, we require $\boxed{(k,k^2)}$. $\blacksquare$
This post has been edited 1 time. Last edited by shendrew7, Mar 11, 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.
vsamc
3789 posts
#9
Y by
Solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
RedFireTruck
4223 posts
#10
Y by
Clearly, $a=1$ and $a=b^2$ are both solutions. When $a>b^2$, the LHS is greater than the RHS, so let $1<a<b^2$. Note that $\gcd(a^2b-1, ab^3-1)=\gcd(a^2b-1, b^2-a)$. Clearly, when $a\ge \sqrt{b}$, $b^2-a<a^2b-1$. Therefore, $1<a<\sqrt{b}$ so $1<a^2<b$.

Let $b=a^2+k_2$ for $k_2>0$. Then, $$\gcd(a^2b-1, b^2-a)=\gcd(a^4+k_2a^2-1, a^4+2k_2a^2+k_2^2-a)=\gcd(a^4+k_2a^2-1, k_2a^2+k_2^2-a+1).$$
Clearly, $k_2a^2+k_2^2-a+1>0$, so $k_2a^2+k_2^2-a+1\ge a^4+k_2a^2-1$ so $k_2^2+2\ge a^4+a$. When $k_2=a^2$, $a=2$ so $(2, 8)$ is a solution. Otherwise, $k_2>a^2$. Let $k_2=a^2+k_3$ for $k_3>0$. Then, $$\gcd(a^4+k_2a^2-1, k_2^2+2-a^4-a)=\gcd(2a^4+k_3a^2-1,2a^2k_3+k_3^2-a+2).$$
Clearly, $2a^2k_3+k_3^2-a+2>0$, so $2a^2k_3+k_3^2-a+2\ge 2a^4+k_3a^2-1$, so $a^2k_3+k_3^2+3\ge 2a^4+a$. When $k_3=a^2$, we get $a=3$, so $(3, 27)$ is a solution. Otherwise, $k_3>a^2$. Let $k_3=a^2+k_4$ for $k_4>0$. Then, $$\gcd(2a^4+k_3a^2-1,a^2k_3+k_3^2+3-2a^4-a)=\gcd(3a^4+k_4a^2-1, 3k_4a^2+k_4^2-a+3).$$
Clearly, $3k_4a^2+k_4^2-a+3>0$ so $3k_4a^2+k_4^2-a+3\ge 3a^4+k_4a^2-1$ so we get $2k_4a^2+k_4^2+4\ge 3a^4+a$. When $k_4=a^2$, we get $a=4$ so $(4, 64)$ is a solution. Otherwise, $k_4>a^2$.

It is easy to see that by induction, $k_n=a^2+k_{n+1}$ implies that $((n+1), (n+1)^3)$ is a solution and otherwise $k_{n+1}=a^2+k_{n+2}$. As $b$ must be finite, there are no solutions other than $b=a^3$ in this case.

Therefore, the solutions are $a=1$, $a=b^2$, and $b=a^3$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
math004
23 posts
#11 • 1 Y
Y by MS_asdfgzxcvb
Let $n=a^2b-1,$ for simplicity, and note that $(a,n)=(b,n)=1.$

\[1\equiv ab^3 \equiv a\times (a^{-2})^3 \equiv a^5 \pmod n  \]So $b$ is just the inverse of $a^2$ modulo $n$ which is $a^3.$
Hence, $b\equiv a^3 \pmod n $ and $b^2\equiv a \pmod n.$

\begin{align*}
     n &\mid b-a^3 \\
     n &\mid b^2-a \\ 
     n &\mid a^5-1   
\end{align*}Now, it is just a size argument and the answer is $(1,n),(n^2,n)$ and $(n,n^3).$
This post has been edited 2 times. Last edited by math004, Jan 26, 2025, 6:56 AM
Reason: .
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
pie854
243 posts
#12
Y by
Notice that $(1,x)$ works. Assume $a, b>1$. Then $a^2b-1 \leq ab^3-1$ i.e. $b^2\geq a$. The pair $(x^2.x)$ works so let's assume $b^2>a$. Note that $$a^2b-1 \mid a(ab^3-1)-b^2(a^2b-1)=b^2-a.$$This implies $b^2+1>a^2b+a$ which implies $b>a^2$. Now $$a^2b-1 \mid b(a^2b-1) - a^2(b^2-a)=a^3-b.$$If $a^3-b>0$ then, $a^3-b\geq a^2b-1$ i.e. $a^3+1 \geq b(a^2+1)>a^2(a^2+1)$, a contradiction. If $a^3-b<0$ then $b-a^3 \geq ab^2-1$ which is clearly absurd. Hence $a^3=b$ and we can check that $(x,x^3)$ works.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
OronSH
1745 posts
#13
Y by
First $a^2b-1\mid -a(ab^3-1)+b^2(a^2b-1)=a-b^2\implies a^2b-1\mid a^2(a-b^2)+b(a^2b-1)=a^3-b$. Now $a\ne 1\implies a^2b-1>b-a^3$ so either $b=a^3$ or $a^3-b\ge a^2b-1\implies a^3-a^2b-b+a\ge 0\implies (a^2+1)(a-b)\ge 0\implies a\ge b$. Now from $a^2b-1\mid a-b^2$ either $a=b^2$ or $a^2b-1\ge b^2-1>b^2-a\ge a^2b-1$ or $a^2b-1>a-1\ge a-b^2\ge a^2b-1$, contradiction. This gives our solutions $(1,t),(t,t^3),(t^2,t)$ which clearly work.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Ilikeminecraft
626 posts
#14
Y by
Note that the LHS is relatively prime to $a,$ so we multiply the RHS by $a$. This tells us that $a^2b - 1 \mid a^2b^3 - a \implies a^2b - 1 \mid b^2 - a.$ Multiplying by $a^2,$ it gives $a^2b - 1 \mid b - a^3.$ Now we casework on $b^2$ and $a.$

If $a = b^2,$ this clearly works.

If $a > b^2,$ we have that $a - b^2 < a^2b - 1,$ however, $a - b^2  > 0,$ which gives no solutions.

If $a < b^2,$ we do casework on $a^3 < b$ or $a^3 = b$. Continue by multiplying by $a^2$, and subtracting by the LHS. Clearly, the RHS must be non-negative. Thus, $1 - a^5 = 0 \implies a = 1.$

Thus, the solution set is $(1, k), (k, k^3), (k^2, k)$ where $k > 1.$
Z K Y
N Quick Reply
G
H
=
a