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
Problem 6
termas   68
N 22 minutes ago by HamstPan38825
Source: IMO 2016
There are $n\ge 2$ line segments in the plane such that every two segments cross and no three segments meet at a point. Geoff has to choose an endpoint of each segment and place a frog on it facing the other endpoint. Then he will clap his hands $n-1$ times. Every time he claps,each frog will immediately jump forward to the next intersection point on its segment. Frogs never change the direction of their jumps. Geoff wishes to place the frogs in such a way that no two of them will ever occupy the same intersection point at the same time.

(a) Prove that Geoff can always fulfill his wish if $n$ is odd.

(b) Prove that Geoff can never fulfill his wish if $n$ is even.
68 replies
termas
Jul 12, 2016
HamstPan38825
22 minutes ago
2n^2+4n-1 and 3n+4 have common powers
bin_sherlo   2
N 26 minutes ago by Assassino9931
Source: Türkiye 2025 JBMO TST P5
Find all positive integers $n$ such that a positive integer power of $2n^2+4n-1$ equals to a positive integer power of $3n+4$.
2 replies
bin_sherlo
5 hours ago
Assassino9931
26 minutes ago
combi/nt
blug   2
N 32 minutes ago by aaravdodhia
Prove that every positive integer $n$ can be written in the form
$$n=a_1+a_2+...+a_k,$$where $a_m=2^i3^j$ for some non-negative $i, j$ such that
$$a_x\nmid a_y$$for every $x, y\leq k$.
2 replies
blug
May 9, 2025
aaravdodhia
32 minutes ago
System of equations in juniors' exam
AlperenINAN   2
N 35 minutes ago by Assassino9931
Source: Turkey JBMO TST 2025 P3
Find all positive real solutions $(a, b, c)$ to the following system:
$$
\begin{aligned}
a^2 + \frac{b}{a} &= 8, \\
ab + c^2 &= 18, \\
3a + b + c &= 9\sqrt{3}.
\end{aligned}
$$
2 replies
AlperenINAN
4 hours ago
Assassino9931
35 minutes ago
Trigo relation in a right angled. ISIBS2011P10
Sayan   10
N 40 minutes ago by mqoi_KOLA
Show that the triangle whose angles satisfy the equality
\[\frac{\sin^2A+\sin^2B+\sin^2C}{\cos^2A+\cos^2B+\cos^2C} = 2\]
is right angled.
10 replies
Sayan
Mar 31, 2013
mqoi_KOLA
40 minutes ago
Triangle is similar to two others
gghx   3
N an hour ago by LeYohan
Source: SMO junior 2024 Q2
Let $ABCD$ be a parallelogram and points $E,F$ be on its exterior. If triangles $BCF$ and $DEC$ are similar, i.e. $\triangle BCF \sim \triangle DEC$, prove that triangle $AEF$ is similar to these two triangles.
3 replies
gghx
Oct 12, 2024
LeYohan
an hour ago
Parallel lines lead to similar triangles
a1267ab   30
N an hour ago by Ilikeminecraft
Source: USA TST for EGMO 2020, Problem 2, by Andrew Gu
Let $ABC$ be a triangle and let $P$ be a point not lying on any of the three lines $AB$, $BC$, or $CA$. Distinct points $D$, $E$, and $F$ lie on lines $BC$, $AC$, and $AB$, respectively, such that $\overline{DE}\parallel \overline{CP}$ and $\overline{DF}\parallel \overline{BP}$. Show that there exists a point $Q$ on the circumcircle of $\triangle AEF$ such that $\triangle BAQ$ is similar to $\triangle PAC$.

Andrew Gu
30 replies
a1267ab
Dec 16, 2019
Ilikeminecraft
an hour ago
Minimum value of a 3 variable expression
bin_sherlo   4
N an hour ago by Assassino9931
Source: Türkiye 2025 JBMO TST P6
Find the minimum value of
\[\frac{x^3+1}{(y-1)(z+1)}+\frac{y^3+1}{(z-1)(x+1)}+\frac{z^3+1}{(x-1)(y+1)}\]where $x,y,z>1$ are reals.
4 replies
bin_sherlo
5 hours ago
Assassino9931
an hour ago
Circumcircle of ADM
v_Enhance   68
N an hour ago by Giant_PT
Source: USA TSTST 2012, Problem 7
Triangle $ABC$ is inscribed in circle $\Omega$. The interior angle bisector of angle $A$ intersects side $BC$ and $\Omega$ at $D$ and $L$ (other than $A$), respectively. Let $M$ be the midpoint of side $BC$. The circumcircle of triangle $ADM$ intersects sides $AB$ and $AC$ again at $Q$ and $P$ (other than $A$), respectively. Let $N$ be the midpoint of segment $PQ$, and let $H$ be the foot of the perpendicular from $L$ to line $ND$. Prove that line $ML$ is tangent to the circumcircle of triangle $HMN$.
68 replies
v_Enhance
Jul 19, 2012
Giant_PT
an hour ago
Two circles tangents
Eeightqx   11
N 2 hours ago by awesomeming327.
Source: 2024 GPO P2
Let $\triangle ABC$ be a acute triangle with altitudes $AD,BE,CF$. $H$ is the orthocenter of $\triangle ABC$. The angle bisectors of $\angle BEC,\angle BFC$ intersect $BC$ at $X,Y$, respectively. The circle $\odot(BC)$ with diameter $BC$ intersects segment $AD$ at $Z$. Show that $\odot(BC)$ is tangent to $\odot(XYZ)$.
11 replies
Eeightqx
Feb 14, 2024
awesomeming327.
2 hours ago
Polynomial...
Sadigly   0
2 hours ago
Source: Azerbaijan Senior NMO 2020
Find all nonzero polynomials $P(x)$ with real coefficents, that satisfies $$P(x)^3+3P(x)^2=P(x^3)-3P(-x)$$for all real numbers $x$
0 replies
Sadigly
2 hours ago
0 replies
Regular 2021-gon
Sadigly   0
2 hours ago
Source: Azerbaijan Senior NMO 2020
A regular 2021-gon is divided into 2019 triangles,such that no diagonals intersect. Prove that at least 3 of the 2019 triangles are isoscoles
0 replies
Sadigly
2 hours ago
0 replies
Nice geometry...
Sadigly   0
2 hours ago
Source: Azerbaijan Senior NMO 2020
Let $ABC$ be a scalene triangle, and let $I$ be its incenter. A point $D$ is chosen on line $BC$, such that the circumcircle of triangle $BID$ intersects $AB$ at $E\neq B$, and the circumcircle of triangle $CID$ intersects $AC$ at $F\neq C$. Circumcircle of triangle $EDF$ intersects $AB$ and $AC$ at $M$ and $N$, respectively. Lines $FD$ and $IC$ intersect at $Q$, and lines $ED$ and $BI$ intersect at $P$. Prove that $EN\parallel MF\parallel PQ$.
0 replies
Sadigly
2 hours ago
0 replies
Diophantine involving cube
Sadigly   0
2 hours ago
Source: Azerbaijan Senior NMO 2020
$a;b;c;d\in\mathbb{Z^+}$. Solve the equation: $$2^{a!}+2^{b!}+2^{c!}=d^3$$
0 replies
Sadigly
2 hours ago
0 replies
Fractions and reciprocals
adihaya   35
N Apr 25, 2025 by Ilikeminecraft
Source: 2013 BAMO-8 #4
For a positive integer $n>2$, consider the $n-1$ fractions $$\dfrac21, \dfrac32, \cdots, \dfrac{n}{n-1}$$The product of these fractions equals $n$, but if you reciprocate (i.e. turn upside down) some of the fractions, the product will change. Can you make the product equal 1? Find all values of $n$ for which this is possible and prove that you have found them all.
35 replies
adihaya
Feb 27, 2016
Ilikeminecraft
Apr 25, 2025
Fractions and reciprocals
G H J
G H BBookmark kLocked kLocked NReply
Source: 2013 BAMO-8 #4
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
adihaya
1632 posts
#1 • 5 Y
Y by GoJensenOrGoHome, itslumi, Adventure10, cubres, NicoN9
For a positive integer $n>2$, consider the $n-1$ fractions $$\dfrac21, \dfrac32, \cdots, \dfrac{n}{n-1}$$The product of these fractions equals $n$, but if you reciprocate (i.e. turn upside down) some of the fractions, the product will change. Can you make the product equal 1? Find all values of $n$ for which this is possible and prove that you have found them all.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
math90
1476 posts
#2 • 7 Y
Y by MSTang, mathcrazymj, Adventure10, Mango247, ItsBesi, cubres, kiyoras_2001
The answer is all perfect squares greater than $1$.
To make the product $1$, the product of the numerators should be equal to the product of the denominators. I.E, $\prod_{k=2}^{n}k(k-1)=(n-1)!^2n$ should be a perfect square. Thus $n$ should be a perfect square.
For perfect squares construct the following example:
$\prod_{i=2}^{\sqrt{n}}\frac{i-1}{i}\cdot\prod_{i=\sqrt{n}+1}^{n}\frac{i}{i-1}=\frac{1}{\sqrt{n}}\cdot\sqrt{n}=1$.
This post has been edited 1 time. Last edited by math90, May 5, 2023, 6:46 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
IndoMathXdZ
694 posts
#3 • 2 Y
Y by Adventure10, cubres
Maybe just my opinion, but this is a nice ez problem, with a nice idea.
I claim that all square numbers greater than $1$ satisfy.
To see that this is necessary, notice that to have that the multiply of all the fractions equal to 1, then we must have the multiply of all the fraction we have having the same denominator and numerator, which means that the product of all numerators and denominators must be a perfect square. But we know that the product is $(n-1)!^2 n$. So, $n$ must be a perfect square.

To see that this is sufficient. Notice that we have
\[ \prod_{i = 2}^{n} \frac{i}{i - 1} = n \]initially, which is a perfect square. We wanted to reverse several fractions such that the final product is $1$.
This means that we need to find several fractions which product to $\sqrt{n}$.
But this is obvious, as
\[ \prod_{i = 2}^{\sqrt{n}} \frac{i}{i - 1} = \sqrt{n} \]
This post has been edited 1 time. Last edited by IndoMathXdZ, Aug 1, 2019, 3:20 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
pad
1671 posts
#4 • 3 Y
Y by Adventure10, Mango247, cubres
We claim that $n$ must be a square. A construction for $n=k^2$ is
\[ \left(\frac12\cdot \frac23\cdot \frac34\cdots \cdot \frac{k-1}{k} \right) \left( \frac{k+1}{k}\cdot \frac{k+2}{k+1}\cdots \cdot \frac{n}{n-1} \right) = \frac{n}{k^2}=1. \]Suppose that $n$ works. In the final list of fractions which have product 1, the product of all the numerators must equal the product of all the denominators. This means that the product of all the numbers overall must be a square. The product of all the numbers is
\[ (2\cdot 1)(3\cdot 2)\cdots (n(n-1)) = (n-1)!^2n,\]which means $n$ must be a square.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Eyed
1065 posts
#5 • 2 Y
Y by pad, cubres
Define a fraction as "good" if it's square root is rational, and "bad" otherwise. Observe that two good fractions multiplied together results in a good fraction and a bad and a good fraction multiplied together results in a bad fraction.

If $n = k^{2}$, we can flip the first $k-1$ fractions. If $n \neq k^{2}$, then $\frac{2}{1} \cdot\frac{3}{2}\cdot\ldots \frac{n}{n-1}$ is bad. Whenever we flip a fraction $\frac{p}{p-1} \Rightarrow \frac{p-1}{p}$, we multiply the original product by $\frac{(p-1)^{2}}{p^{2}}$, a good fraction. Then, since $1$ is a good fraction, and we start with a bad fraction, it can not be made into $1$. The only possible values of $n$ is $n = k^{2}$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mathlogician
1051 posts
#6 • 1 Y
Y by cubres
I claim that the problem is true iff $n$ is a perfect square.

Suppose that $n = a^2$ for some positive integer $a \geq 2$. Now we can turn this expression into $1$ by simply flipping the first $a-1$ fractions.

Now, let a fraction be called a ssquare if, when written in simplest terms, the numerator and denominator are perfect squares. Note that if the $n$ is by definition, not a ssquare. Furthermore, note that with each operation it is impossible to turn a non-ssquare into a ssquare, so we are done.
This post has been edited 1 time. Last edited by mathlogician, Jul 22, 2020, 11:43 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Vitriol
113 posts
#7 • 1 Y
Y by cubres
Rephrase reciprocation as multiplying a value of the form $\left( \tfrac{k}{k+1} \right)^2$ for distinct values of $1 \le k < n$.

Now it is clear that $n$ must be a square, for the product will always be $n$ times the square of a rational by telescoping. To show that this always works, simply multiply the values
\[ \left( \frac{1}{2} \right)^2 \cdot \left( \frac{2}{3} \right)^2 \cdot \dots \cdot \left( \frac{\sqrt{n}-1}{\sqrt{n}} \right)^2 = \frac1{n}\]to $n$ to obtain $1$. $\blacksquare$
This post has been edited 1 time. Last edited by Vitriol, Aug 12, 2020, 5:54 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Grizzy
920 posts
#8 • 1 Y
Y by cubres
Solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
brianzjk
1201 posts
#9 • 1 Y
Y by cubres
We claim the only numbers that work are perfect squares.

If $n$ is a perfect square, then we can use the construction
\[\frac{1}{2}\cdot\frac{2}{3}\dots\frac{\sqrt{n}-1}{\sqrt{n}}\cdot\frac{\sqrt{n}+1}{\sqrt{n}}\cdot\frac{\sqrt{n}+2}{\sqrt{n}+1}\dots\frac{n}{n-1}\]And it is easy to see that this works.

We now want to show that $n$ has to be a perfect square for all possible values of $n$. Assume that it is possible to reciprocate some of the fractions such that the product is equal to $n$. We divide
\[\frac{2}{1}\cdot\frac{3}{2}\dots\frac{n}{n-1}=n\]by the construction that works to get
\[\left(\frac{2}{1}\right)^{1+\epsilon_1}\cdot\left(\frac{3}{2}\right)^{1+\epsilon_2}\dots\left(\frac{n}{n-2}\right)^{1+\epsilon_n}\]Where $\epsilon_i$ is either $1$ or $-1$. Then, the value of $\epsilon_i+1$ must be an even number, so $n$ must be a perfect square, as desired.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
HrishiP
1346 posts
#10 • 1 Y
Y by cubres
The answer is all $n$ such that $n$ is a perfect square greater than $1$.To see this works, we can take
$$\left[\frac{1}{2} \cdot \frac{2}{3} \dotsm\frac{\sqrt{n}-1}{\sqrt{n}}\right] \times \left[\frac{\sqrt{n}+1}{\sqrt{n}} \dotsm \frac{n}{n-1}\right].$$All of the first bracket simplifies to $\tfrac{1}{n}$ an the second to $n,$ and $\tfrac{1}{n} \times n = 1.$

To show this is the only solution, note the numerator $p$ has product $n!$ and the denominator $q$ has product $(n-1)!,$ so $pq = (n-1)!^2 \cdot n.$ Also note that for the value to be $1$, we must have $p=q$. Thus, because $pq= (n-1)!^2 \cdot n, $ $n$ must be a perfect square. $\blacksquare$
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
#11 • 2 Y
Y by Mango247, cubres
Posting for storage.
The problem falls after noticing the construction.

If $n$ is perfect square, then following construction works:
$$\dfrac21, \dfrac32, \cdots, \dfrac{\sqrt{n}}{\sqrt{n}-1}, \dfrac{\sqrt{n}}{\sqrt{n}+1}, \cdots, \dfrac{n-1}{n}.$$
Now we claim that $n$ must be a perfect square.
Notice that for all $p\in\mathbb{P}$, we must have $$2\mid \nu_p(n!)+\nu_p((n-1)!),$$since otherwise for some prime, we have a number of those primes odd and thus we cannot group them into two groups having the same cardinality.
Rewriting we obtain, $$2\mid \nu_p(n)+2\nu_p((n-1)!)\implies \nu_p(n)=2k,$$hence $n$ must be a perfect square in order to form such product.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
IAmTheHazard
5001 posts
#12 • 2 Y
Y by centslordm, cubres
Let $a$ be the product of the fractions not flipped and $b$ the product of the fractions which are flipped. Then we have $ab=n$ and $\tfrac{a}{b}=1$, implying $a^2=n$. Since $a$ is rational it follows that $n$ must be a perfect square. On the other hand, if $n=m^2$, we can flip $\tfrac{2}{1},\tfrac{3}{2},\ldots,\tfrac{m}{m-1}$.
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
#13 • 1 Y
Y by cubres
Solution. The answer is all perfect squares $> 2$. Note that the product of all the numerators and the denominators must have even powers so $n!(n-1)! = (n-1)!^2 \times n$ is a perfect square and so is $n$. The construction is to divide into $\sqrt{n}+1$ groups of $\sqrt{n}-1$ fractions and reciprocate every group except the first. Here's an example for $n = 9$.
$$\left( \frac{2}{1} \cdot \frac{3}{2} \right)\cdot \left( \frac{4}{3} \cdot \frac{5}{4} \right)^{-1}\cdot \left( \frac{6}{5} \cdot \frac{7}{6} \right)^{-1}\cdot \left( \frac{8}{7} \cdot \frac{9}{8} \right)^{-1} = 1$$
This post has been edited 1 time. Last edited by Afo, Sep 6, 2021, 9:54 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
HamstPan38825
8864 posts
#14 • 1 Y
Y by cubres
The answer is $n=k^2$ for some positive integer $k>1$. Upon reciprocating any fraction, the product is multiplied by the perfect square of a rational number. As a result, the original product must also have been a perfect square by invariance.

Furthermore, for $n = k^2$, simply reciprocate the first $k-1$ fractions (which multiply to $k$). Then the product is multiplied by $\frac 1{n^2}$, and thus it will equal 1.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Mogmog8
1080 posts
#15 • 2 Y
Y by centslordm, cubres
If $n=a^2$, we flip $\frac{2}{1}$, $\frac{3}{2}$, $\dots$, $\frac{a}{a-1}$ over and our product becomes \[\underbrace{\frac{1}{a-1}}_{\text{first } a-2\text{ terms}}\cdot\underbrace{\frac{1}{a+1}}_{\text{terms }a+1\text{ to }a^2-1}\cdot\frac{a-1}{a}\cdot\frac{a+1}{a}\cdot\frac{a^2}{a^2-1}=1\]$\square$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
peppapig_
281 posts
#16 • 6 Y
Y by Taco12, Jndd, Significant, player01, mulberrykid, cubres
We claim that only positive perfect squares work. Notice that if $n$ is not a perfect square, then we have that the total product of all integers on the top and on the bottom is not a perfect square, meaning that we can never have the top and bottom divide each other out to equal $1$. Now let $n=k^2$. We now have
\[\frac{1}{2}*\frac{2}{3}*\cdots{}*\frac{k-1}{k}=\frac{1}{k}\]and
\[\frac{k+1}{k}*\frac{k+2}{k+1}*\cdots{}*\frac{k^2}{k^2-1}=k\]
Multiplying these together gives us our final product of $1$, as desired, and 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.
trk08
614 posts
#17 • 1 Y
Y by cubres
When multiplying these all out in regular order, we get $n$ as given in the problem. If we take the reciprocal of some of them, let us say that there product is $x$. This means that the total sum would turn out to be $n\cdot x^2$ which we claim to be $1$. Simplifying this, we get:
\[x=\frac{1}{\sqrt{n}}.\]We also know that $x$ has to be rational meaning that $n$ has to be a perfect square which we can say is $a^2$. If we substitute this back in, we are basically saying that the original sequence is:
\[\frac21, \frac32, \cdots, \frac{a^2}{a^2-1},\]and we want a product of the reciprocal of some of these to be $\frac{1}{a}$. We know that $a<a^2$, so we can say that a possible value of $x$ could be:
\[\frac{1}{2}\cdot \frac{2}{3}\cdot \dots \frac{a-1}{a}\]\[\frac{1}{a},\]which means that $x^2\cdot n=1$.

Thus, if $n$ is a perfect square, this condition works.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
S.Das93
709 posts
#18 • 1 Y
Y by cubres
It is quite intuitive that to get a product of $1$, we need to have a product that cancels in the numerator and denominator. For these to equal the same product, $n$ would have to be the product of these - or $n=k^2$ for the product $k$, thus $n$ must be a perfect square.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
gracemoon124
872 posts
#19 • 1 Y
Y by cubres
$\textbf{Claim:}$ $n$ must be a perfect square.

$\emph{Proof:}$ Let $\{t_1, t_2, \dots, t_k\}$ be a subset of $\{2, 3, \dots, n\}$ such that all the numbers of the form $\tfrac{t_i}{t_i-1}$ are reciprocated.

Notice that reciprocating a factor $a$ of $n$ gives the resulting number as $\tfrac{n}{a^2}$. Therefore, reciprocating all the numbers of the form $\tfrac{t_i}{t_i-1}$ gives our end result as
\[\frac{n}{\left(\frac{t_1}{t_1-1}\cdot\frac{t_2}{t_2-1}\cdot\dots\cdot\frac{t_k}{t_k-1}\right)^2}=1\]implying that we require
\[\frac{t_1}{t_1-1}\cdot\frac{t_2}{t_2-1}\cdot\dots\cdot\frac{t_k}{t_k-1} =\sqrt{n}.\]Since the LHS product is rational, we require the RHS to be rational as well. But $n$ is an integer, it isn't a fraction. Hence, $n$ must be a perfect square. $\square$
$\textbf{Construction:}$ Let $n=k^2$, notice that
\[\frac{k^2}{k^2-1}\cdot\frac{k+1}{k}\cdot\frac{k-1}{k-2}\cdot\frac{k-2}{k-3}\dots\frac{3}{2}\cdot\frac{2}{1}=k.\]So the answer is $\boxed{\text{all perfect squares greater than 1}}$.
$\blacksquare$

motivation
This post has been edited 1 time. Last edited by gracemoon124, May 5, 2023, 6:31 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Alcumusgrinder07
95 posts
#21 • 1 Y
Y by cubres
Click to reveal hidden text
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ryanbear
1056 posts
#22 • 1 Y
Y by cubres
The product is equal to $n$. To flip a fraction $\frac{m}{m+1}$, multiply by $\frac{(m+1)^2}{m^2}$. Define "perfect square" as the square of a rational number. If $n$ is not a perfect square, then multiplying by a perfect square keeps the product not a perfect square. So the product can never reach $1$, which is a perfect square. So $n$ has to be a perfect square. If $n$ is a perfect square, flipping the first $\sqrt{n}-1$ fractions results in the product being $1$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ex-center
27 posts
#23 • 1 Y
Y by cubres
The answer is $n$ such that $n$ is a perfect square. This can be achieved by
$$\left( \frac{2}{1}\cdot \frac{3}{2} \cdot \dots \cdot\frac{\sqrt{n}}{\sqrt{n}-1} \right) \cdot \left( \frac{\sqrt{n}}{\sqrt{n}+1} \cdot \frac{\sqrt{n}+1}{\sqrt{n}+2} \cdot \dots \cdot \frac{n-2}{n-1}\right) \cdot \frac{n-1}{n} = 1$$Notice the product of the reciprocated fractions is $n$ if we flip a fraction $\frac{a}{b}$ we multiply by $\frac{b^{2}}{a^{2}}$ so each prime factor gets changed by a multiple of $2$ hence $n$ must be a square since $1$ is a square.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
joshualiu315
2534 posts
#24 • 1 Y
Y by cubres
We claim the answer is all perfect squares. A construction for $n=k^2$ is

\[ \left(\frac{1}{2}\cdot \frac{2}{3}\cdot \frac{3}{4}\cdots \cdot \frac{k-1}{k} \right) \left( \frac{k+1}{k}\cdot \frac{k+2}{k+1}\cdots \cdot \frac{n}{n-1} \right). \]
Now, we must prove that only perfect squares work. Notice that the numerator and denominator must be equal, or the product of the numerator and denominator must be a perfect square. Now, this value always stays constant throughout, so we have that

\[n!(n-1)!=n((n-1)!)^2\]
is a perfect square, implying that $n$ must be a perfect square.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
cj13609517288
1916 posts
#25 • 1 Y
Y by cubres
The answer is when $n$ is a perfect square greater than one.

If the product can be made into $1$, the product of the numerator and the denominator must be a square. Thus $(n-1)!\cdot n!$ is a square, so $n$ is a square. When $n$ is a square, we can flip over $\frac21,\frac32,\dots,\frac{\sqrt{n}}{\sqrt{n}-1}$ and win. $\blacksquare$
This post has been edited 1 time. Last edited by cj13609517288, Dec 8, 2023, 4:49 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
eibc
600 posts
#26 • 1 Y
Y by cubres
The answer is all $n$ which are perfect squares. Note that the product of all the numerators must be equal to the product of all of the denominators of the fractions (after some are flipped) for the product to be $1$. Hence $1 \cdot 2^2 \cdot 3^2 \cdots (n - 1)^2 \cdot n$ must be a perfect square, so $n$ is a perfect square.

For $n = k^2$, notice that
$$\frac{k^2}{k^2 - 1} \cdot \frac{k^2 - 1}{k^2 - 2} \cdots \frac{k + 1}{k} \cdot \frac{k - 1}{k} \cdot \frac{k - 2}{k - 1} \cdots \frac{1}{2} = \frac{k^2}{k \cdot k} = 1. $$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
cursed_tangent1434
628 posts
#27 • 2 Y
Y by GeoKing, cubres
We claim that the answer is any square number. Let an integer which satisfies the required condition be called good.

Claim : Any $n$ such that $v_p(n)=k$ where $k$ is odd is not good
Proof : Notice that if the numerator of a certain fraction is divisible by a certain prime, the denominator is not, and vice versa. Thus, if $v_p(n!)+v_p(n-1)!$ is an odd number it is impossible to divide it by two (such that $v_p$ of the numerator is equal to the denominator - so that the final product is 1). Now, notice that when $n=p^km$ for odd $k$, and $p \nmid m$
$$v_p(2^km!) + v_p((2^km-1)!) = 2^k + (2^k - k) = 2^{k+1} - k$$Thus, if $k$ is odd $v_p(n!)+v_p(n-1)!$, is also clearly odd. Thus, all odd numbers are not good as claimed.

Now, we will show that sqaure numbers are in fact good.

Algorithm : All squares numbers $n$ are clearly good, by the following algorithm.
Simply reciprocate the first $k-1$ fractions. Thus, we obtain,
\[\frac{1}{2}\cdot \frac{2}{3} \cdots \frac{k-1}{k}\cdot \frac{k+1}{k} \cdot \frac{k+2}{k+1} \cdots \frac{k^2}{k^2-1}\]
Proof : Clearly, this product $P = \frac{k^2}{k\cdot k} = 1$, thus all squares obviously work.
This post has been edited 3 times. Last edited by cursed_tangent1434, Dec 29, 2023, 4:09 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
shendrew7
796 posts
#28 • 1 Y
Y by cubres
The boolean "product is the square of a rational" is invariant. Thus $n$ must be a $\boxed{\text{perfect square}}$. Our construction is to flip the first $\sqrt{n}-1$ fractions. $\blacksquare$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AshAuktober
1007 posts
#29 • 1 Y
Y by cubres
Note that flipping any of the fractions is equivalent to dividing the product by a rational square, so if $n$ is a value such that the product can be $1$, then $n$ must be a perfect square $>1$. But note that all such n work; indeed, let $n = k^2$.Then we can flip the fractions $\frac{2}{1}, \cdots, \frac{k}{k-1}$. This divides the original product by $k^2 = n$, so the final product becomes $1$, which is what we wanted. $\square$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
lpieleanu
3001 posts
#30 • 1 Y
Y by cubres
Solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
eg4334
637 posts
#31 • 1 Y
Y by cubres
First off, considering any prime $p$ after we flip it the $v_p$ of the numerator is equal to the $v_p$ of the denominator, hence the product of the numerator and denominator is a square, i.e: $$n! \cdot (n-1)! \text{ = square} \implies n \text{ = square}$$I claim $\boxed{\text{all squares}}$ work. We use induction. $2^2$ case is obvious. If the result is true for $k^2$, then to construct $(k+1)^2$ look at the final $2k+1$ terms because the first $k^2$ already work. Out of the last $2k+1$ terms, flip the last $k+1$. Keep the rest the same. The product of the last $2k+1$ then turns into $$\frac{k^2+k}{k^2} \cdot \frac{k^2+k}{(k+1)^2} = 1$$, done.
This post has been edited 1 time. Last edited by eg4334, Dec 6, 2024, 3:07 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Benbenwang
548 posts
#32 • 1 Y
Y by cubres
We claim that all perfect squares $n \ge 4$ work.

Let the product of the fractions we wish to reciprocate be $\frac{a}{b}$ and the product of the remaining fractions be $k$. Clearly we have that:
$$k\cdot\frac{a}{b} = n  \:\:\: \text{and} \:\:\: k\cdot\frac{b}{a} = 1.$$Dividing equations yields
$$n = \left(\frac{a}{b}\right)^2$$since $n$ is an integer it must be a perfect square.

It is also easy to see that the first $\sqrt{n}-1$ terms multiply to $\sqrt{n}$, and as a result the last $n-\sqrt{n}$ terms also multiply to $\sqrt{n}.$ Reciprocate either the first $\sqrt{n}-1$ terms or last $n-\sqrt{n}$ terms and we are done. $\square$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Maximilian113
575 posts
#33 • 1 Y
Y by cubres
Suppose that we reciprocate the fractions $a_1, a_2, \cdots, a_k,$ which should obviously be distinct. Then we have that $\frac{n}{(a_1a_2 \cdots a_k)^2} = 1 \implies n = (a_1a_2 \cdots a_k)^2.$ Thus $n$ is a perfect square.

Now, we show that all perfect squares greater than $1$ work. For the construction, consider $a_1=\frac{2}{1}, a_2 = \frac{3}{2}, \cdots a_k = \frac{\sqrt{n}}{\sqrt{n}-1}.$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sansgankrsngupta
143 posts
#34 • 1 Y
Y by cubres
OG! The answer is all perfect squares $n$
Construction:
Let $n=k^2$, reciprocate the fractions $$ \frac{2}{1}, \frac{3}{2} \ldots \frac{k}{k-1}$$Proof of necessity:
$$P= \frac{2}{1}* \frac{3}{2} \cdots * \frac{n}{n-1}=n$$Assume you reciprocate some of the fractions among the fractions to get 1 .
We view reciprocation of a fraction $f$ as $\frac{1}{f}=f.\frac{1}{f^2}$. Hence we are essentially multiplying $P$ by the square of some rational number.
Hence we get $Pq^2=nq^2=1 \iff n= (\frac{1}{q})^2$, where $q$ is a rational number. so $n$ is also the square of some rational number.
$n= \frac{p^2}{q^2}$ where $(p,q)=1$ and $p$ and $q$ are integers since $n$ is an integer we have that $p^2|q^2$ but we know that $gcd(p^2,q^2)=1$. Thus, $p^2=1$. Hence $n=p^2$ as desired.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
gladIasked
648 posts
#35
Y by
The answer is all $n=k^2$.

Let $c=p_1^{e_1}p_2^{e_2}\cdots$ be the ``prime factorization" of the product of (possibly reciprocated) fractions, where each $e_i$ is a not necessarily positive integer. Clearly, the parity of each $e_i$ is invariant no matter how we reciprocate the fractions. Because $1=p_1^0p_2^0\cdots$, we know that $n$ must be a perfect square (as the product of the fractions can equal $n$).

When $n=k^2$, it's easy to see that reciprocating the first $k-1$ fractions yields a product of $1$, as desired. $\blacksquare$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
de-Kirschbaum
199 posts
#36
Y by
We claim that we can do this for all $n=k^2>2$. Note that each time we flip a fraction $\frac{a}{b}$ it is equivalent to multiplying it by $\frac{b^2}{a^2}$. So this is saying that for some $S^2$ where $S \in \mathbb Q$, representing the product of all the inverses of fractions we are flipping, we have $nS^2=1 \implies n=(\frac{1}{S})^2$. Since $n \in \mathbb Z$ we must have $\frac{1}{S} \in \mathbb Z$ and thus $n$ is a perfect square.

Now we will flip every fraction up until $\frac{\sqrt{n}}{\sqrt{n}-1}$ and keep the rest the same. Then we have $$\frac{1}{2}\frac{2}{3}\frac{3}{4}\cdots\frac{\sqrt{n}-2}{\sqrt{n}-1}\frac{\sqrt{n}-1}{\sqrt{n}}\frac{\sqrt{n}+1}{\sqrt{n}}\cdots\frac{n}{n-1}=\frac{n}{\sqrt{n}\sqrt{n}}=1$$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Ilikeminecraft
631 posts
#37
Y by
I claim that all perfect squares $n > 1$ are valid. Let $n = k^2.$ Thus, $1$ can be made from: $$\frac12 \cdot \frac23 \cdot \ldots \cdot \frac{k - 1}{k} \cdot \frac{k + 1}{k} \cdot \ldots \cdot \frac{k^2}{k^2-1} = 1$$Now, I claim that if $n$ isn't a perfect square, then it won't work. Notice that flipping a fraction $\frac c{c-1}$ will just multiply the current value by the square number $\frac{(c-1)^2}{c^2}.$ Thus, since $n$ isn't a perfect square, you can never achieve another perfect square, $1.$
Z K Y
N Quick Reply
G
H
=
a