We have your learning goals covered with Spring and Summer courses available. Enroll today!

G
Topic
First Poster
Last Poster
k a My Retirement & New Leadership at AoPS
rrusczyk   1573
N Yesterday at 11:40 PM by SmartGroot
I write today to announce my retirement as CEO from Art of Problem Solving. When I founded AoPS 22 years ago, I never imagined that we would reach so many students and families, or that we would find so many channels through which we discover, inspire, and train the great problem solvers of the next generation. I am very proud of all we have accomplished and I’m thankful for the many supporters who provided inspiration and encouragement along the way. I'm particularly grateful to all of the wonderful members of the AoPS Community!

I’m delighted to introduce our new leaders - Ben Kornell and Andrew Sutherland. Ben has extensive experience in education and edtech prior to joining AoPS as my successor as CEO, including starting like I did as a classroom teacher. He has a deep understanding of the value of our work because he’s an AoPS parent! Meanwhile, Andrew and I have common roots as founders of education companies; he launched Quizlet at age 15! His journey from founder to MIT to technology and product leader as our Chief Product Officer traces a pathway many of our students will follow in the years to come.

Thank you again for your support for Art of Problem Solving and we look forward to working with millions more wonderful problem solvers in the years to come.

And special thanks to all of the amazing AoPS team members who have helped build AoPS. We’ve come a long way from here:IMAGE
1573 replies
rrusczyk
Mar 24, 2025
SmartGroot
Yesterday at 11:40 PM
k a March Highlights and 2025 AoPS Online Class Information
jlacosta   0
Mar 2, 2025
March is the month for State MATHCOUNTS competitions! Kudos to everyone who participated in their local chapter competitions and best of luck to all going to State! Join us on March 11th for a Math Jam devoted to our favorite Chapter competition problems! Are you interested in training for MATHCOUNTS? Be sure to check out our AMC 8/MATHCOUNTS Basics and Advanced courses.

Are you ready to level up with Olympiad training? Registration is open with early bird pricing available for our WOOT programs: MathWOOT (Levels 1 and 2), CodeWOOT, PhysicsWOOT, and ChemWOOT. What is WOOT? WOOT stands for Worldwide Online Olympiad Training and is a 7-month high school math Olympiad preparation and testing program that brings together many of the best students from around the world to learn Olympiad problem solving skills. Classes begin in September!

Do you have plans this summer? There are so many options to fit your schedule and goals whether attending a summer camp or taking online classes, it can be a great break from the routine of the school year. Check out our summer courses at AoPS Online, or if you want a math or language arts class that doesn’t have homework, but is an enriching summer experience, our AoPS Virtual Campus summer camps may be just the ticket! We are expanding our locations for our AoPS Academies across the country with 15 locations so far and new campuses opening in Saratoga CA, Johns Creek GA, and the Upper West Side NY. Check out this page for summer camp information.

Be sure to mark your calendars for the following events:
[list][*]March 5th (Wednesday), 4:30pm PT/7:30pm ET, HCSSiM Math Jam 2025. Amber Verser, Assistant Director of the Hampshire College Summer Studies in Mathematics, will host an information session about HCSSiM, a summer program for high school students.
[*]March 6th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar on Math Competitions from elementary through high school. Join us for an enlightening session that demystifies the world of math competitions and helps you make informed decisions about your contest journey.
[*]March 11th (Tuesday), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS Chapter Discussion MATH JAM. AoPS instructors will discuss some of their favorite problems from the MATHCOUNTS Chapter Competition. All are welcome!
[*]March 13th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar about Summer Camps at the Virtual Campus. Transform your summer into an unforgettable learning adventure! From elementary through high school, we offer dynamic summer camps featuring topics in mathematics, language arts, and competition preparation - all designed to fit your schedule and ignite your passion for learning.[/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, Mar 2 - Jun 22
Friday, Mar 28 - Jul 18
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
Tuesday, Mar 25 - Jul 8
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
Sunday, Mar 23 - Jul 20
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
Sunday, Mar 16 - Jun 8
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
Monday, Mar 17 - Jun 9
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
Sunday, Mar 2 - Jun 22
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
Tuesday, Mar 4 - Aug 12
Sunday, Mar 23 - Sep 21
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
Sunday, Mar 16 - Sep 14
Tuesday, Mar 25 - Sep 2
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
Sunday, Mar 23 - Aug 3
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
Sunday, Mar 16 - Aug 24
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
Wednesday, Mar 5 - May 21
Tuesday, Jun 10 - Aug 26

Calculus
Sunday, Mar 30 - Oct 5
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
Sunday, Mar 23 - Jun 15
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
Tuesday, Mar 4 - May 20
Monday, Mar 31 - Jun 23
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
Monday, Mar 24 - Jun 16
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
Sunday, Mar 30 - Jun 22
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Tuesday, Mar 25 - Sep 2
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
Mar 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
Geometry Problem in Taiwan TST
chengbilly   2
N 38 minutes ago by Li4
Source: 2025 Taiwan TST Round 2 Independent Study 2-G
Given a triangle $ABC$ with circumcircle $\Gamma$, and two arbitrary points $X, Y$ on $\Gamma$. Let $D$, $E$, $F$ be points on lines $BC$, $CA$, $AB$, respectively, such that $AD$, $BE$, and $CF$ concur at a point $P$. Let $U$ be a point on line $BC$ such that $X$, $Y$, $D$, $U$ are concyclic. Similarly, let $V$ be a point on line $CA$ such that $X$, $Y$, $E$, $V$ are concyclic, and let $W$ be a point on line $AB$ such that $X$, $Y$, $F$, $W$ are concyclic. Prove that $AU$, $BV$, $CW$ concur at a single point.

Proposed by chengbilly
2 replies
chengbilly
2 hours ago
Li4
38 minutes ago
Something nice
KhuongTrang   24
N 43 minutes ago by Nguyenhuyen_AG
Source: own
Problem. Given $a,b,c$ be non-negative real numbers such that $ab+bc+ca=1.$ Prove that

$$\sqrt{a+1}+\sqrt{b+1}+\sqrt{c+1}\le 1+2\sqrt{a+b+c+abc}.$$
24 replies
KhuongTrang
Nov 1, 2023
Nguyenhuyen_AG
43 minutes ago
a+b+c=3 inequality
jokehim   0
an hour ago
Source: my problem
Let $a,b,c\ge 0: a+b+c=3.$ Prove that $$a\sqrt{bc+3}+b\sqrt{ca+3}+c\sqrt{ab+3}\ge \sqrt{12(ab+bc+ca)}.$$
0 replies
jokehim
an hour ago
0 replies
Incenter perpendiculars and angle congruences
math154   83
N an hour ago by Ilikeminecraft
Source: ELMO Shortlist 2012, G3
$ABC$ is a triangle with incenter $I$. The foot of the perpendicular from $I$ to $BC$ is $D$, and the foot of the perpendicular from $I$ to $AD$ is $P$. Prove that $\angle BPD = \angle DPC$.

Alex Zhu.
83 replies
math154
Jul 2, 2012
Ilikeminecraft
an hour ago
An inequality about a^3+b^3+c^3+2abc=5
JK1603JK   1
N an hour ago by JK1603JK
Source: unknown
Prove that
a+b+c\ge 2\left(\frac{a}{a+1}+\frac{b}{b+1}+\frac{c}{c+1}\right)

holds \forall a,b,c\ge 0: a^3+b^3+c^3+2abc=5.
1 reply
JK1603JK
Tuesday at 7:35 AM
JK1603JK
an hour ago
Bisectors, perpendicularity and circles
JuanDelPan   14
N an hour ago by Ilikeminecraft
Source: Pan-American Girls’ Mathematical Olympiad 2022, Problem 3
Let $ABC$ be an acute triangle with $AB< AC$. Denote by $P$ and $Q$ points on the segment $BC$ such that $\angle BAP = \angle CAQ < \frac{\angle BAC}{2}$. $B_1$ is a point on segment $AC$. $BB_1$ intersects $AP$ and $AQ$ at $P_1$ and $Q_1$, respectively. The angle bisectors of $\angle BAC$ and $\angle CBB_1$ intersect at $M$. If $PQ_1\perp AC$ and $QP_1\perp AB$, prove that $AQ_1MPB$ is cyclic.
14 replies
JuanDelPan
Oct 27, 2022
Ilikeminecraft
an hour ago
Prove angles are equal
BigSams   50
N 2 hours ago by Ilikeminecraft
Source: Canadian Mathematical Olympiad - 1994 - Problem 5.
Let $ABC$ be an acute triangle. Let $AD$ be the altitude on $BC$, and let $H$ be any interior point on $AD$. Lines $BH,CH$, when extended, intersect $AC,AB$ at $E,F$ respectively. Prove that $\angle EDH=\angle FDH$.
50 replies
BigSams
May 13, 2011
Ilikeminecraft
2 hours ago
PD _|_ BC
parmenides51   2
N 2 hours ago by Ihatecombin
Source: Hong Kong TST - HKTST 2024 1.3
Given $\Omega ABC$ with $AB<AC$, let $AD$ be the bisector of $\angle BAC$ with $D$ on the side $BC$. Let $\Gamma$ be a circle passing through $A$ and $D$ which is tangent to $BC$ at $D$. Suppose $\Gamma$ cuts the side $AB$ again at $E\ne A$. The tangent to the circumcircle of $\Delta BDE$ at $D$ intersects $\Gamma$ again at $F\ne D$. Let $P$ be the intersection point of the segments $EF$ and $AC$. Prove that $PD$ is perpendicular to $BC$.
2 replies
parmenides51
Jul 20, 2024
Ihatecombin
2 hours ago
IRAN national math olympiad(3rd round)-2010-NT exam-p6
goodar2006   4
N 2 hours ago by john0512
$g$ and $n$ are natural numbers such that $gcd(g^2-g,n)=1$ and $A=\{g^i|i \in \mathbb N\}$ and $B=\{x\equiv (n)|x\in A\}$(by $x\equiv (n)$ we mean a number from the set $\{0,1,...,n-1\}$ which is congruent with $x$ modulo $n$). if for $0\le i\le g-1$
$a_i=|[\frac{ni}{g},\frac{n(i+1)}{g})\cap B|$
prove that $g-1|\sum_{i=0}^{g-1}ia_i$.( the symbol $|$ $|$ means the number of elements of the set)($\frac{100}{6}$ points)

the exam time was 4 hours
4 replies
goodar2006
Aug 9, 2010
john0512
2 hours ago
Number Theory Problem in Taiwan TST
chengbilly   0
2 hours ago
Source: 2025 Taiwan TST Round 2 Independent Study 2-N
Find all prime number pairs $(p, q)$ such that \[p^q+q^p+p+q-5pq\]is a perfect square.

Proposed by chengbilly
0 replies
+1 w
chengbilly
2 hours ago
0 replies
Infimum of decreasing sequence b_n/n^2
a1267ab   33
N 2 hours ago by aliz
Source: USA Winter TST for IMO 2020, Problem 1 and TST for EGMO 2020, Problem 3, by Carl Schildkraut and Milan Haiman
Choose positive integers $b_1, b_2, \dotsc$ satisfying
\[1=\frac{b_1}{1^2} > \frac{b_2}{2^2} > \frac{b_3}{3^2} > \frac{b_4}{4^2} > \dotsb\]and let $r$ denote the largest real number satisfying $\tfrac{b_n}{n^2} \geq r$ for all positive integers $n$. What are the possible values of $r$ across all possible choices of the sequence $(b_n)$?

Carl Schildkraut and Milan Haiman
33 replies
a1267ab
Dec 16, 2019
aliz
2 hours ago
problem.........
Cobedangiu   3
N 2 hours ago by sky.mty
$x,y\in R not 0
x^{2} +y^{2} +\frac{|x^{2}-1|}{y^{2} } + \frac{|y^{2}-1|}{x^{2}} \geq 2
3 replies
Cobedangiu
Yesterday at 4:55 PM
sky.mty
2 hours ago
7^p-1 -1/p
belugacat   3
N 2 hours ago by sky.mty
Source:
Find all prime numbers $p$ such that $\dfrac{7^{p-1}-1}{p}$ is a square of an integer.
3 replies
belugacat
Aug 11, 2024
sky.mty
2 hours ago
hard problem
Cobedangiu   1
N 2 hours ago by lbh_qys
Let a,b,c>0, a^3+b^3+c^3=3. Find min D(and prove)
D= 5(a^2+b^2+c^2)+4(1/a+1/b+1/c)
1 reply
Cobedangiu
3 hours ago
lbh_qys
2 hours ago
Number of Solutions is 2
Miku3D   28
N Mar 24, 2025 by lelouchvigeo
Source: 2021 APMO P1
Prove that for each real number $r>2$, there are exactly two or three positive real numbers $x$ satisfying the equation $x^2=r\lfloor x \rfloor$.
28 replies
Miku3D
Jun 9, 2021
lelouchvigeo
Mar 24, 2025
Number of Solutions is 2
G H J
G H BBookmark kLocked kLocked NReply
Source: 2021 APMO P1
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Miku3D
57 posts
#1 • 5 Y
Y by centslordm, geometrylover123, HWenslawski, TFIRSTMGMEDALIST, megarnie
Prove that for each real number $r>2$, there are exactly two or three positive real numbers $x$ satisfying the equation $x^2=r\lfloor x \rfloor$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Tintarn
9027 posts
#2 • 15 Y
Y by hakN, MarkBcc168, centslordm, IAmTheHazard, agwwtl03, ericxyzhu, Wizard0001, GuvercinciHoca, Iora, Mathlover_1, bhan2025, normalqher, SADAT, green_leaf, MS_asdfgzxcvb
Solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
alexiaslexia
110 posts
#3 • 6 Y
Y by centslordm, mango5, anonman, Mango247, ljwn357, DEKT
Simple NT, $``\text{simple}"$ algebra and (actually) simply formulated Alg-NT for P1, P2 and P5 this year! Although this is as simple as it gets for P1, the Motivation for this (at least in my experience and story in solving it) has interesting points to share; so I'll write this anyway!

$\color{green} \rule{4.5cm}{2pt}$
$\color{green} \clubsuit$ $\boxed{\textbf{RHS manipulation.}}$ $\color{green} \clubsuit$
$\color{green} \rule{4.5cm}{2pt}$
We claim that there cannot exist two solutions $x_1$ and $x_2$ with $\lfloor x_1 \rfloor = \lfloor x_2 \rfloor$.

$\color{green} \rule{25cm}{0.4pt}$
$\color{green} \spadesuit$ $\boxed{\textbf{Proof.}}$ $\color{green} \spadesuit$
Let their common floor-value be the natural $n$; so we can write $x_1 = n+\epsilon_1$ and $x_2 = n +\epsilon_2$. Putting these two back to the original equations, we get
\[ (n+\epsilon_1)^2 = (n+\epsilon_2)^2 \]and we can infer that $n+\epsilon_1 = n+ \epsilon_2$.

(Or alternatively, for a much shorter wording, $\lfloor x_1 \rfloor = \lfloor x_2 \rfloor$ implies $r\lfloor x_1 \rfloor = r\lfloor x_2 \rfloor$ implies $x_1^2 = x_2^2$ implies $x_1 = x_2$; without any need to capture $\epsilon_1 = x_1 - \lfloor x_1 \rfloor = \{x_1\}$.)

$\color{green} \rule{4.4cm}{2pt}$
$\color{green} \clubsuit$ $\boxed{\textbf{LHS force-feeding.}}$ $\color{green} \clubsuit$
$\color{green} \rule{4.4cm}{2pt}$
Call $n \in \mathbb{N}$ a $\textit{hanging solution}$ of the equation $x^2 = r \lfloor x \rfloor$ iff there exists a (unique) solution $x$ so that $\lfloor x \rfloor = n$.

Then, a natural $n$ is a $\textit{hanging solution}$ iff
\[ n \leq r < n+2+\dfrac{1}{n} \]$\color{green} \rule{25cm}{0.4pt}$
$\color{green} \spadesuit$ $\boxed{\textbf{Proof.}}$ $\color{green} \spadesuit$
Let $x$ be a solution and $n$ be its floor/respective $\textit{hanging solution}$. Then, assuming $x^2 = n^2+a$ where $0 \leq a < (n+1)^2-n^2 = 2n+1$. Furthermore, since $x^2 = rn$,
\[ n^2 \leq n^2+a = rn < n^2+2n+1 \]and when divided by $n$, we get that if $n$ is a hanging solution, $r$ must be in that aforementioned range for the bound to be viable.

On the other hand, if the bound is viable, setting $0 \leq a = (r-n) n < 2n+1$ prompts the creation of $x = \sqrt{n^2+a}$. It is easily verified that this $x$ is indeed a solution (by reverse engineering or explicit substitution: when constructed that way, $\lfloor x \rfloor$ must be $n$.) $\blacksquare$

$\color{green} \rule{5.4cm}{2pt}$
$\color{green} \clubsuit$ $\boxed{\textbf{Intervals Analysis FTW.}}$ $\color{green} \clubsuit$
$\color{green} \rule{5.4cm}{2pt}$
There are two or three $\textit{hanging solutions}$ of the equation for each $r > 2$, with there existing three iff
\[ r < \lfloor r \rfloor + \dfrac{1}{\lfloor r \rfloor-2} \]
$\color{green} \rule{25cm}{0.4pt}$
$\color{green} \spadesuit$ $\boxed{\textbf{Proof.}}$ $\color{green} \spadesuit$
Let for a fixed $r$, $\lfloor r \rfloor = K$ for $K$ a natural number which is $2$ or greater. So, both $K$ and $K-1$ are naturals, and we can be certain that
\[ K-1 \leq r < (K-1)+2+\dfrac{1}{K-1} \quad \text{and} \quad K \leq r < K+2 + \dfrac{1}{K} \]as $K \leq r < K+1$. Conclusively, $n = K-1$ and $n = K$ are hanging solutions.

Now we look at the naturals which may/may not be hanging solutions, and the definitely not hanging solutions.
  • If $n = K-2$, $n$ is a hanging solution if and only if $K-2 \leq n \leq (K-2)+2+\dfrac{1}{K-2}$; i.e. since we already know that $K \leq r < K+1$, for $r$ to be admitted, $r$ must be strictly less than $K+\dfrac{1}{K-2}$;
  • if $n \leq K-3$ (if that number indeed is positive), then $r$ cannot be admitted to the interval $\left[n,n+2+\dfrac{1}{n}\right)$, as $r$ is too large :
    i.e. $r \geq K$ implies $r \geq K-3+(2+1) \geq n+2+\dfrac{1}{n}$.
  • same goes for $n \geq K+1$: $r < K+1$ implies that $r < n$.

As there are two to three hanging solutions, there are two to three solutions, too. We are done. $\blacksquare$ $\blacksquare$ $\blacksquare$

Intervals, since the beginning to the end.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MathForesterCycle1
79 posts
#4 • 2 Y
Y by centslordm, aaaa_27
dame dame
This post has been edited 4 times. Last edited by MathForesterCycle1, Oct 17, 2021, 5:06 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Orestis_Lignos
555 posts
#5 • 2 Y
Y by centslordm, SSaad
Firstly, observe that $x^2=r[x] \leq rx$, hence $x \leq r$. In addition, $x^2=r[x]>r(x-1)$, hence $(x-\dfrac{r}{2})^2>\dfrac{r^2}{4}-r$.

We now consider two Cases.

Case 1: $r \geq 4$. Then, we obtain that either $x \geq \dfrac{r+\sqrt{r^2-4r}}{2}$, or $x \leq \dfrac{r-\sqrt{r^2-4r}}{2}$.


If the former happens, then note that $\dfrac{r+\sqrt{r^2-4r}}{2} >\dfrac{r+r-2}{2}=r-1$, hence $r-1 <x \leq r$, implying that $[x] \in \{[r]-1,[r] \}$.

$\bullet$ If $[x]=[r]-1$, then $x=\sqrt{r([r]-1)}$, which indeed satisfies $[r]-1 \leq x <[r]$, hence it is a solution.
$\bullet$ If $[x]=[r]$, then $x=\sqrt{r[r]}$, which indeed satisfies $[r] \leq x <[r]+1$, hence it is a solution.

Now, if the latter relation holds, then note that $x \leq \dfrac{r-\sqrt{r^2-4r}}{2} < \dfrac{r-(r-2)}{2}=1$, hence $x<1$, implying that $[x]=0$, which gives $x=0$, a contradiction.

Case 2: $r < 4$. Then, $2 <r < 4$. We consider two cases.

Subcase 1: $2<r \leq 3$. Then, $x \leq r \leq 3$, hence $[x] \in \{0,1,2,3 \}$.

$\bullet$ If $[x]=0$ then $x=0$, a contradiction.
$\bullet$ If $[x]=1$, then $x=\sqrt{r}$, which indeed satisfies $1 \leq x <2$.
$\bullet$ If $[x]=2$, then $x=\sqrt{2r}$, which indeed satisfies $2 \leq x <3$.
$\bullet$ If $[x]=3$, then $x=\sqrt{3r}$, which indeed satisfies $3 \leq x <4$.

Subcase 2: $3 <r< 4$. Then, $x \leq r <4$, hence $[x] \in \{0,1,2,3\}$.

$\bullet$ If $[x]=0$ then $x=0$, a contradiction.
$\bullet$ If $[x]=1$, then $x=\sqrt{r}$, which indeed satisfies $1 \leq x <2$.
$\bullet$ If $[x]=2$, then $x=\sqrt{2r}$, which indeed satisfies $2 \leq x <3$.
$\bullet$ If $[x]=3$, then $x=\sqrt{3r}$, which indeed satisfies $3 \leq x <4$.

In each case, we notice that the equation has either $2$ or $3$ solutions, hence we are done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Nadid
2 posts
#6 • 1 Y
Y by centslordm
It is my contest time solution.After giving the contest I wrote up the solution.But I got 5 out of 7. But I am not able to find out where my mistake is.Can anyone please help me find out?
Problem: For every real number $r>2$ there exists exactly two or three positive real number $x$ such that $x^2=r\lfloor x \rfloor$
Let $a=$ $\lfloor x \rfloor$
$a\le x< a+1$
$a^2\le x^2< (a+1)^{2}$
$a$ can't be $0$
Because then $L.H.S>0$
But $R.H.S=0$
which is a contradiction
So, $a\ge 1$
$\implies a^2+3a\ge a^2+2a+1$
$\implies a^2+3a  \ge (a+1)^{2}$
So, $a^2\le x^2< a^2+3a$
$ \implies a^2 \le ar<a^2+3a$
$ \implies a \le r <a+3 $
As $a$ is an positive integer the three possible values of $a$ are $\lfloor r \rfloor,\lfloor r \rfloor-1,\lfloor r \rfloor-2$

As we have increased the bound from $a^2+2a+1$ to $a^2+3a \lfloor r \rfloor$ -2 will not always work. We will show the proof later.
Now we will show that $\lfloor r \rfloor , \lfloor r\rfloor -1$ always works.
In the beginning we got,$a^2\le ar< (a+1)^{2}$


$1$st case: $a= \lfloor r \rfloor$
We have to show that $\lfloor r \rfloor^2\le r\lfloor r \rfloor< \lfloor r+1 \rfloor^2$
which is clearly true as,
$\lfloor r \rfloor\le r$
$\implies \lfloor r \rfloor^2\le r\lfloor r \rfloor$
Again,
$r\le \lfloor r \rfloor+1$ and $ \lfloor r \rfloor \le \lfloor r \rfloor+1$
So,$r\lfloor r \rfloor \le (\lfloor r \rfloor +1)^2$
So,$\lfloor r \rfloor^2 \le r \lfloor r \rfloor<\lfloor r \rfloor+1$ is always true.
So,$a=\lfloor r \rfloor$ is always a valid solution.


$2$nd Case:
Now, for case 2 where $a=\lfloor r \rfloor-1$ we have to show that,
$(\lfloor r \rfloor-1)^2 \le r (\lfloor r \rfloor-1)< \lfloor r \rfloor^2$

$\lfloor r \rfloor-1 \le r$
So,$(\lfloor r \rfloor-1)^2\le r(\lfloor r \rfloor-1)$
We know that,
$r<\lfloor r \rfloor+1$ and $\lfloor r \rfloor-1<r$
$\implies(\lfloor r+1 \rfloor)(\lfloor r \rfloor-1)>r(\lfloor r \rfloor-1)$
So,$(\lfloor r \rfloor+1)(\lfloor r \rfloor-1)=\lfloor r \rfloor^2-1<\lfloor r\rfloor^2$
$\implies(\lfloor r \rfloor-1)^2 \le r (\lfloor r \rfloor-1)< \lfloor r \rfloor^2$
So,$a=\lfloor r \rfloor$ will also always work.

So,There is always two valid values for $a$.
Now,we will show that there are some cases where there is exactly 3 solutions for $a$ and there are some cases where there is exactly 2 solutions for $a$.
$*$Proof that a=$\lfloor r \rfloor-2$ does not always work.
If $b$ is an positive integer and $r=b+0.5$ that means $r-\lfloor r \rfloor=0.5$
So, $a=\lfloor r \rfloor-2=b-2$
So,$r\lfloor x \rfloor=ra=(b+0.5)(b-2)=b^2-1.5b-1$
$(a+1)^2=(b-1)^2=b^2-2b+1$
Now if we want $a$ not to be a solution,
$b^2-1.5b-1>b^2-2b+1$ must be true
$\implies 0.5b>2$
$\implies b>4$
So, if $r>4$ and $r-\lfloor r \rfloor=0.5$ we will get only two solutions for $a$
Now we can see if $r-\lfloor r \rfloor>0.5$ it will also work because then R.H.S will increase but L.H.S will not.
We can find ranges for any $r$ by solving the inequality for any $r-\lfloor r \rfloor$

$*$Now we will show that there are cases where there exists three solutions.
If $r$ is an positive integer that means $r-\lfloor r \rfloor=0$
Then $\lfloor r \rfloor-2=r-2$
We will show that then $a=\lfloor r \rfloor-2$ will always be a solution.
Then, $ar=(r-2)r=r^2-r$ and $(a+1)^2=(r-2+1)^2=r^2-2r+1$
We can see that $ar<(a+1)^2$ when $r$ is positive integer.
So,then $a=\lfloor r \rfloor-2$ will be a solution.
We can find ranges for any $r$ by solving the inequality for any $r-\lfloor r \rfloor$

Now,for each valid $a$ we can have one solution because $x^2=ra$ and $x$ has to be positive.
So,we can have at least two solutions and at most three solutions.
Now,$r<2$ doesn't work because $\lfloor r \rfloor-1\le 0 $ and $\lfloor r \rfloor<0$ which is not possible as shown earlier.

So, For every real number $r>2$ there exists exactly two or three positive real number $x$ such that $x^2=r\lfloor x \rfloor$ [Proved]
This post has been edited 2 times. Last edited by Nadid, Jun 9, 2021, 12:27 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
SerdarBozdag
892 posts
#7 • 1 Y
Y by centslordm
I hope this works.

For $k \le x <k+1$, where $k$ is a positive integer, $f(x)=\frac{x^2}{[x]}$ is bijective and take all the values in the interval $ [k , k+2+\frac{1}{k} )$. Let $a\le r <a+1$ where $a$ is a positive integer. If $x_1$ is a root of the equation then $r \in [[x_1],[x_1]+2+\frac{1}{[x_1]})$. From the last sentence we deduce that $[x_1] \in \{a-2,a-1,a\}$. Thus there are at most $3$ roots. Observe that we definitely have $r \in [[x_1],[x_1]+2+\frac{1}{[x_1]})$ for $[x_1] \in \{a-1,a\}$. Thus there are at least $2$ roots.
This post has been edited 1 time. Last edited by SerdarBozdag, Jun 9, 2021, 3:05 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
DakuMangalSingh
72 posts
#8 • 3 Y
Y by Mango247, Mango247, axsolers_24
My solution is quite similar to Tintarn.
Tintarn wrote:
Clearly choosing $n$ determines $q$ uniquely, so the number of solutions is equal to the number of solutions to $n^2 \le rn<(n+1)^2$
Btw, this technique is called "Chipa Trick" in our country's mo training camp :P
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bora_olmez
277 posts
#9
Y by
Similar to the solutions above - posting for storage.
Upper Bound
Lower Bound
This post has been edited 2 times. Last edited by bora_olmez, Jun 9, 2021, 9:11 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
SnowPanda
186 posts
#10
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.
Supercali
1260 posts
#12 • 3 Y
Y by Pluto1708, Tafi_ak, PRMOisTheHardestExam
Pretty easy, but nice enough for a P1. Harder than P3 at least.

Let $x=n+f$ where $n \geq 0$ is an integer and $f \in [0,1)$. Substituting, we get a quadratic in $f$, and solving it we get $f=-n \pm \sqrt{rn}$. Since $-n-\sqrt{rn}<0$, we must have $f=-n+\sqrt{rn} \in [0,1)$ (now note that $n=0$ $\implies$ $f=0$ $\implies$ $x=0$, which is impossible, so $n$ is a positive integer). Conversely, if this holds for some $n$, we get exactly one solution for $x$. Therefore we have to prove that $0 \leq -n +\sqrt{rn} <1$ has exactly two or three solutions. Solving the inequalities, we get $$n \leq r <n+2+\frac{1}{n}$$Let $m=\lfloor r \rfloor$. Note that if $n$ is a solution, then $n \leq m$. Also, $$m-1 < m \leq r <(m-1)+2<m+2$$so both $m$ and $m-1$ are solutions (note that $r>2$ $\implies$ $m \geq 2$ $\implies$ $m-1>0$, so all is fine). Now assume some $m-k$ for $k \geq 3$ is a solution. Then $$r<m-k+2+\frac{1}{m-k} \leq m-3+2+1=m \leq r$$Contradiction! Therefore the only solutions are $m,m-1$ and possibly $m-2$ $\implies$ exactly two or three solutions.

$\blacksquare$

Bonus

Remark
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Wildabandon
507 posts
#13
Y by
wrong solution :|
This post has been edited 3 times. Last edited by Wildabandon, Jun 10, 2021, 5:44 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Tintarn
9027 posts
#14
Y by
Wildabandon wrote:
We have
\[x = \sqrt{r \left ( \lfloor r \rfloor - 2 \right )}, \sqrt{r\left (\lfloor r \rfloor -1 \right )}, \sqrt{r\lfloor r \rfloor }\]have 3 solution of $r\ge 3$...
Nope. If $r=41.99999$ then the first one would be $\sqrt{39r} \approx 40.4722$ which does not work since it does not have integer part $\lfloor r\rfloor-2=39$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
GeronimoStilton
1521 posts
#15
Y by
For a fixed positive integer, there is a solution $t\le x<t+1$ iff $t\le r<(t+1)^2/t=t+2+1/t$. Moreover, we can ignore the case $\lfloor x\rfloor = t = 0$ because then $x=0$ contradiction. Then for any $r$, there are solutions for $t=\lfloor r\rfloor$ and $t=\lfloor r\rfloor - 1$, possibly a solution for $\lfloor r\rfloor - 2$, and certainly not a solution for $\lfloor r \rfloor + k$ with $k\le -3$ or $k\ge 1$. Done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
rafaello
1079 posts
#17
Y by
Define $f(x)=\frac{x^2}{\lfloor x\rfloor}=\lfloor x\rfloor+2\{x\}+\frac{\{x\}^2}{\lfloor x\rfloor}$. Now we fix $c=\lfloor x\rfloor$.
And we define $g(y)=c+2y+\frac{y^2}{c}$ for $0\leq y<1$.
Obviously $g$ is increasing and $\lim_{y\rightarrow 1}c+2y+\frac{y^2}{c} = c+2+\frac{1}{c}$. Thus, after fixing $c=\lfloor x\rfloor$, we get interval $[c,c+2+\frac{1}{c} )$ covered, thus for every $r>2$, we have exactly two or three positive real numbers $x$ satisfying the equation $x^2=r\lfloor x \rfloor$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
animath_314159
27 posts
#18 • 2 Y
Y by Mango247, Mango247
Miku3D wrote:
Prove that for each real number $r>2$, there are exactly two or three positive real numbers $x$ satisfying the equation $x^2=r\lfloor x \rfloor$.
Solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
isaacmeng
113 posts
#19
Y by
APMO 2021.1. Prove that $\forall 2<r\in\mathbb{R}$, there exists exactly two or three $x\in\mathbb{R}_+$ satisfying the equation $x^2=r\lfloor x\rfloor$.

Solution. Let $\lfloor x\rfloor=a, x=a+b$. Then the equation is equivalent to $b^2+2ab+a^2-ra=0$, so $b=-a\pm\sqrt{ra}$. Note that $0\le b<1$, so $b=\sqrt{ra}-a$. Also, $x^2\ge 0$, $r>2\implies a>0$. We obtain $0\le \sqrt{ra}-a<1\implies a^2\le ra<1+2a+a^2\le a^2+3a\implies a\le r<3+a\implies a\in\{\lfloor r\rfloor,\lfloor r\rfloor-1,\lfloor r\rfloor-2\}$. From here we can already conclude that the equation has at most three positive roots, since each one in the set gives at most one positive root.

To show that there are at least two positive roots, we show that $a=\lfloor r\rfloor,a=\lfloor r\rfloor-1$ must each gives a positive root. For $a=\lfloor r\rfloor$, we shall show that $\lfloor r\rfloor^2\le r\lfloor r\rfloor<\lfloor r\rfloor^2+2\lfloor r\rfloor+1$. Indeed, the left inequality is trivial and $r\lfloor r\rfloor<\lfloor r\rfloor^2+\lfloor r\rfloor<\lfloor r\rfloor^2+2\lfloor r\rfloor+1$. For $a=\lfloor r\rfloor-1$, we shall show that $\lfloor r\rfloor^2-2\lfloor r\rfloor+1\le r\lfloor r\rfloor-r<\lfloor r\rfloor^2$. For the right inequality, note that $\lfloor r\rfloor^2-r\lfloor r\rfloor=\lfloor r\rfloor(\lfloor r\rfloor-r)>-\lfloor r\rfloor\ge -r\implies \lfloor r\rfloor^2-r\lfloor r\rfloor+r>-r+r=0$. The left one is equivalent to $r\ge \lfloor r\rfloor-1$, which is trivial. Hence we conclude that the equation has at least two positive roots, which is exactly what we wanted.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Afo
1002 posts
#20
Y by
It's suffice to show that the graph $y=\frac{x^2}{\lfloor x \rfloor }$ and $y=r$ intersect at three points.
Solution.
Let $x = a + b, 0\leq b < 1$ where $a$ is an integer. If we fix $a$, then letting $b$ varies in $[0,1)$, then $y = \frac{(a+b)^2}{a}\in [a,a+2+\frac{1}{a})$ (A parabola obviously). There are two intuitive main claims which immediately imply the conclusions:

Claim 1. They can't intersect at more than three points.
Proof.
Assume they can. Let $a$ be the minimum value such that $r \in [a,a+2+\frac{1}{a})$. Then we must have
$$r \in [a+3,a+5+\frac{1}{a+3})$$$$\implies a+3 < a+2+\frac{1}{a} \implies 1 < \frac{1}{a} \implies a < 1,$$a contradiction.

Claim 2. They intersect in at least two points.
Proof.
Let $a$ be the minimum value such that $r \in [a,a+2+\frac{1}{a})$. It's enough to show that $r \ge a+1$. This is true since by minimality of $a$, we have
$$r> a+1+\frac{1}{a-1} \ge a+1.$$
Motivation: The motivation here is to these type of "find the number of solutions" a lot of times can be solved by looking in terms of graphs. I chose $\frac{x^2}{\lfloor x \rfloor}$ since we gain important extra information: if we fix the integer part and let the fractional part varies, it gives "an increasing portion of a parabola".
This post has been edited 2 times. Last edited by Afo, Sep 15, 2021, 3:25 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
VulcanForge
626 posts
#21
Y by
Write $x=n+\varepsilon$ for a positive integer $n$ and $0 \le \varepsilon <1$ (clearly we can't have $n=0$). The equation is $$n+ \varepsilon = \sqrt{rn}.$$It suffices to solve the inequality $0 \le \sqrt{rn}-n < 1$: each such value of $n$ will give exactly one value of $x$. This inequality is equivalent to
\begin{align*}
n &\le r\\
n^2-(r-&2)n+1 > 0.
\end{align*}If $r < 4$ then we win automatically: the quadratic $n^2-(r-2)n+1$ has negative discriminant, and hence the solutions are $1 \le n \le \lfloor r \rfloor$. We can also manually check that the solutions when $r=4$ are $n=1,2,3$, so from now on assume $r > 4$.

The quadratic $n^2-(r-2)n+1$ has roots $r_1=\tfrac{r-2-\sqrt{r^2-4r}}{2}, r_2=\tfrac{r-2+\sqrt{r^2-4r}}{2}$. Due to $r>4$ we have $r_1<1$: $$(r-4)^2<r^2-4r \iff \frac{r-2-\sqrt{r^2-4r}}{2} <1.$$Hence the inequality $n^2-(r-2)n+1>0$ is equivalent to $n>r_2$. It suffices to demonstrate $r-2>r_2>r-3$, and then our solutions will be $n=\lfloor r \rfloor, \lfloor r \rfloor - 1,$ and possibly $\lfloor r \rfloor - 2$. Since $\sqrt{r^2-4r}<r-2$ it's clear that $r_2<r-2$, and $r-3<r_2$ follows from $$(r-4)^2<r^2-4r \iff r-3<\frac{r-2+\sqrt{r^2-4r}}{2}.$$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AwesomeYRY
579 posts
#23
Y by
Yay! APMO 2022 is on the 14th

Note that solutions $x$ must satisfy $\lfloor x \rfloor = 1,2,3,\ldots$.

The interval $\lfloor x\rfloor = k$ has a solution if
\[k^2\leq x^2 = r\lfloor x\rfloor = x^2 < (k+1)^2\]Or,
\[k\leq r < k+2+\frac{1}{k}\]Since $r>2$, then $\lfloor r \rfloor \geq 2$. Thus, we may easily see that $k=\lfloor r \rfloor, \lfloor r \rfloor -1$ are always solutions. $\lfloor r \rfloor -2$ is a solution if $\lfloor r \rfloor-2 \geq 1 \Longrightarrow r\geq 3$, and values of $k$ that are $\geq \lfloor r \rfloor$ or $\leq \lfloor r \rfloor -3$ fail. Thus, all equations have either two or three postive real numbers, depending on if $r$ is larger or smaller than 3.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
jasperE3
11115 posts
#24
Y by
If $\lfloor x\rfloor=0$, then $x=0$ which is a solution for any $r$. Otherwise, let $x=n+s$ with $n\in\mathbb N$ and $s\in[0,1)$, suppose that $(n+s)^2=rn$. Then:
$$n^2\le n^2+2ns+s^2<n^2+2n+1,$$so since $n^2+2ns+s^2=(n+s)^2=rn$ we have $n\le r<n+2+\frac1n$.

If $n\ge\lfloor r\rfloor+1$ then, since $n\le r$, there are no solutions.

Suppose now that $n\le\lfloor r\rfloor-3$. Note that $n\ge1$ implies $\lfloor r\rfloor\ge4$. Since $x+\frac1x$ is increasing of $x$, we have:
$$r<n+\frac1n+2\le\lfloor r\rfloor-1+\frac1{\lfloor r\rfloor-3}.$$But since $r\ge\lfloor r\rfloor$ and:
$$\lfloor r\rfloor-1+\frac1{\lfloor r\rfloor-3}-\lfloor r\rfloor\le0,$$this is impossible.

Note that $n=\lfloor r\rfloor$ and $n=\lfloor r\rfloor-1$ always produce solutions, and $n=\lfloor r\rfloor-2$ sometimes does, so the conclusion follows.
This post has been edited 1 time. Last edited by jasperE3, Mar 30, 2022, 3:19 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
megarnie
5541 posts
#25 • 1 Y
Y by brickybrook_25
Solved with brickybrook_25

Let $x=n+c$, where $n=\lfloor x\rfloor$.

We have \[(n+c)^2=rn\implies n^2+2nc+c^2=rn\implies c^2+2nc+n^2-rn=0\]
The solutions for $c$ are $c=\frac{-2n\pm \sqrt{4rn}}{2}$.

Clearly $\frac{-2n-\sqrt{4rn}}{2}<0$, so $c=\frac{\sqrt{4rn}-2n}{2}=\sqrt{rn}-n$.

We need $0\le \sqrt{rn}-n<1$, so $\sqrt{rn}\ge n$, which implies $rn\ge n^2\implies r\ge n$.

Now also $\sqrt{rn}<n+1\implies rn<n^2+2n+1\le n^2+3n$, so $r<n+3$.

This give us $r-3<n\le r$. There are at most $3$ integers in this interval, so at most three values of $x$.

Now, to finish, we have to find two values of $x$ that satisfy the equation.

We claim that $x=\sqrt{r\lfloor r\rfloor}$ and $x=\sqrt{r\lfloor r-1\rfloor}$ work
Proof: First, we'll show $x=\sqrt{r\lfloor r\rfloor }$ works. We want to show $r\lfloor r\rfloor=r\lfloor x\rfloor$, so $\lfloor r\rfloor = \lfloor x \rfloor$.

Note that $\lfloor r\rfloor ^2\le r\lfloor r\rfloor \le r^2<\lceil r \rceil^2 $, so $\lfloor r\rfloor \le x<\lfloor r\rfloor+1$, thus $\lfloor r\rfloor = \lfloor x \rfloor$ is true.

Now, we'll show $x=\sqrt{r\lfloor r-1\rfloor}$ works. We want to show $\lfloor r-1\rfloor =\lfloor x \rfloor$.

Note that $\lfloor r-1 \rfloor^2 < r\lfloor r-1\rfloor< \lfloor r\rfloor ^2$, so $\lfloor x\rfloor = \lfloor r-1\rfloor$ is true. $\blacksquare$
This post has been edited 1 time. Last edited by megarnie, Apr 17, 2022, 10:20 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Inconsistent
1455 posts
#26
Y by
Basic. Notice $x^2 \leq rx$ so $r \geq x$. If $r \geq x+3$ then $x^2 > (x+3)(x-1) = x^2+2x-3$ so $x < \frac{3}{2}$. If $x \geq 1$ then $r = x^2 < \frac{9}{4} < 3$ and if $x < 1$ then $r = 0$ contradiction. Thus $r < x+3$. So at most three values work. Checking shows $x = \lfloor r \rfloor, \lfloor r \rfloor - 1$ both work, so we are done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
SatisfiedMagma
453 posts
#28
Y by
Here's a low IQ solution which literally gives all the solutions.

Solution: We will show that if $r \in [2,3)$, then
  • $x = \sqrt{r\lfloor r \rfloor}$
  • $x = \sqrt{r(\lfloor r \rfloor-1)}$.
For $r \ge 3$, we have
  • $x = \sqrt{r\lfloor r \rfloor}$
  • $x = \sqrt{r(\lfloor r \rfloor-1)}$.
  • $x = \sqrt{r(\lfloor r \rfloor - 2)}$.
They clearly work and now we will show that these are the only possible solutions of $\mathbb{R}^+$. It is easy to see that $\lfloor x \rfloor \ne 0$ for any $r > 2$. So $\lfloor x \rfloor\ge 1$. Call the original equation $(1)$

Claim: $r \ge \lfloor x \rfloor$ for any $r$ and $\lfloor x \rfloor > r- 3$ for $r \ge 4$. To be precise,
\[\lfloor x \rfloor \in X = \{\lfloor r \rfloor, \lfloor r \rfloor -1, \lfloor r \rfloor -2.\}\]
Proof: Substitute $x = I + f$ for $I \in \mathbb{Z}^+$ and $f \in [0,1)$ in $(1)$. Solving for $f$ by the Quadratic Formula we get
\[0 \le f = \sqrt{rI} - I < 1\]Solving $0 \le f$ would give us $\lfloor x \rfloor \le r$. Solving the other side for $I$, we would get
\[I > \frac{r-2+\sqrt{r^2-4r}}{2} \ge r-3\]where $ \ge r - 3$ could be easily shown by working backwards. Also do note that we skipped the negative version of square root since it will give $I < 1$ which is absurd.

Here's some magic! For $r <4$, we get $1 \le \lfloor x \rfloor \le \lfloor r \rfloor \le 3$. This proves the very last statement of the claim. $\square$
For $r \ge 3$, $\lfloor x \rfloor$ can take any value from $X$. This would give the claimed solutions. But for $r \in [2,3)$, $\lfloor x \rfloor \ne \lfloor r \rfloor - 2$ otherwise $\lfloor x \rfloor = 0$ which is a contradiction. We are done. $\blacksquare$
This post has been edited 2 times. Last edited by SatisfiedMagma, Apr 30, 2023, 6:21 PM
Reason: I miss \floor
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
snorlac
1 post
#29
Y by
For any $x$ that is a real number satisfying $x^2=r \lfloor x \rfloor$, it holds equivalently that ${\lfloor x \rfloor}^2 \leq r \lfloor x \rfloor$ and $(\lfloor x \rfloor + 1)^2 \geq r \lfloor x \rfloor$, as $y = x^2$ is strictly increasing for $x > 0$ and $r \lfloor x \rfloor$ is a horizontal line.

Note that ${\lfloor x \rfloor}^2 \leq r \lfloor x \rfloor$ or $\lfloor x \rfloor \leq r$ and $$(\lfloor x \rfloor + 1)^2 \geq r \lfloor x \rfloor$$$$(\lfloor x \rfloor + 1)^2 \geq r (\lfloor x \rfloor + 1 - 1) $$Substituting $x' = \lfloor x \rfloor + 1$, $$ (x')^2 \geq r (x'-1) \Longleftrightarrow (x' - \frac{r}{2})^2 - \frac{r^2-4r}{4} \geq 0$$
Thus, this inequality holds when $0 \leq r \leq 4$ and for $r > 4$ if $\lfloor x \rfloor + 1 \geq \frac{r + \sqrt{r^2 - 4r}}{2}$ or $\lfloor x \rfloor + 1 \leq \frac{r - \sqrt{r^2 - 4r}}{2}$.

Case 1 $(r \leq 4)$

In this case, the second inequality is satisfied by $r \leq 4$. From the first inequality $\lfloor x \rfloor \leq r$, and since $2 < r \leq 4$, $\lfloor x \rfloor$ satisfies the inequality if it is $\lfloor r \rfloor, \lfloor r \rfloor -1, \lfloor r \rfloor - 2$. $\lfloor x \rfloor$ cannot be $\lfloor r \rfloor -3$ as it cannot be less than $0$ and $r > 2$. Note that as formulated, $x^2$ intersects (and only once) with the horizontal line $r \lfloor x \rfloor$ for some $x \in [\lfloor x \rfloor, \lfloor x \rfloor + 1)$ iff the two inequalities hold for $x$. There are exactly three solutions.

Case 2 $(r > 4)$
For the first case of the second inequalities, the two inequalities are $$ \frac{r + \sqrt{r^2 - 4r}}{2} - 1 \leq \lfloor x \rfloor \leq r$$
Note that as $r - 4 < \sqrt{r^2 - 4r}$ for $r > 4$,
$$\frac{r + \sqrt{r^2 - 4r}}{2} - 1 > r - 3$$Furthermore, since $\sqrt{r^2 - 4r} < r - 2$
$$\frac{r + \sqrt{r^2 - 4r}}{2} - 1 < r - 2$$$$ r - 3 < \frac{r + \sqrt{r^2 - 4r}}{2} - 1 < r - 2$$
Thus, $\lfloor x \rfloor$ is guaranteed to have an intersection for $\lfloor r \rfloor, \lfloor r \rfloor - 1$ from the inequalities and potentially $\lfloor r \rfloor -2$ however it cannot be lower than this as the bound is strictly greater than $r - 3$. Therefore there are either two or three solutions.

For the second case of the second inequality, the two inequalities are
$$ \lfloor x \rfloor \leq \frac{r - \sqrt{r^2 - 4r}}{2} - 1 \leq r $$
Since $\sqrt{r^2 - 4r} > r - 4 $ when $r > 4$ and $\sqrt{r^2 - 4r} < r- 2$

$$1 < \frac{r - \sqrt{r^2 - 4r}}{2} < 2 \implies \lfloor x \rfloor < 1$$
$\lfloor x \rfloor$ cannot be $0$ as $x$ becomes $0$, therefore there are no intersections from this second version of the inequality.

Thus when $r > 4$, there are in total two or three intersections.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
SilverBlaze_SY
66 posts
#30
Y by
Let $x= I+F$, where $F\in [0,1)$, $I\in \mathbb{Z}$
$x^2=r \lfloor x \rfloor \Rightarrow (I+F)^2=rI$
$0\leq F<1 \Rightarrow I^2\leq (I+F)^2 < (I+1)^2$
$\Rightarrow I^2\leq rI < (I+1)^2$
Clearly, $I\nleq (r-3)$, as then the inequality is contradicted. $\Rightarrow r\geq I>(r-3)$
Thus we can at most have $3$ solutions for $x$. (For each $I$ we get a corresponding $F$.)

Also, $I=r$ and $I=(r-1)$ can always be a solution to the inequality, regardless of the value of $r$, giving the corresponding value of $F$, and thus fixing $x$. $\Rightarrow x$ has at least $2$ solutions and at most $3$. $\framebox{Q.E.D}$!
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ATGY
2502 posts
#31 • 1 Y
Y by lelouchvigeo
We claim that there are at most 3 solutions. Firstly, notice that $\lfloor x \rfloor \leq x < x + 1$. This implies that:
$${\lfloor x \rfloor}^2 \leq x^2 < {\lfloor x \rfloor}^2 + 2\lfloor x \rfloor + 1 \leq (\lfloor x \rfloor)^2 + 3\lfloor x \rfloor$$$$\implies {\lfloor x \rfloor}^2 \leq r\lfloor x \rfloor < {\lfloor x \rfloor}^2 + 3\lfloor x \rfloor \implies \lfloor x \rfloor \leq r \leq \lfloor x \rfloor + 3$$This means that $r - 3 < \lfloor x \rfloor \leq r$, and since $\lfloor x \rfloor$ is a positive integer, $\lfloor x \rfloor$ and $x$ have at most 3 solutions ($\lfloor x \rfloor$ can take the values $r, r - 1, r - 2$). Plugging in $\lfloor x \rfloor$ as $r, r - 1$, they clearly work so there at least two solutions and at most 3, hence we are done.
This post has been edited 1 time. Last edited by ATGY, Jan 23, 2024, 5:12 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
shockproof
3 posts
#32
Y by
rafaello wrote:
Define $f(x)=\frac{x^2}{\lfloor x\rfloor}=\lfloor x\rfloor+2\{x\}+\frac{\{x\}^2}{\lfloor x\rfloor}$. Now we fix $c=\lfloor x\rfloor$.
And we define $g(y)=c+2y+\frac{y^2}{c}$ for $0\leq y<1$.
Obviously $g$ is increasing and $\lim_{y\rightarrow 1}c+2y+\frac{y^2}{c} = c+2+\frac{1}{c}$. Thus, after fixing $c=\lfloor x\rfloor$, we get interval $[c,c+2+\frac{1}{c} )$ covered, thus for every $r>2$, we have exactly two or three positive real numbers $x$ satisfying the equation $x^2=r\lfloor x \rfloor$.

Basically finished @alexiaslexia 's solution in a few lines.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
lelouchvigeo
174 posts
#33
Y by
Solution
Z K Y
N Quick Reply
G
H
=
a