Summer is a great time to explore cool problems to keep your skills sharp!  Schedule a class today!

G
Topic
First Poster
Last Poster
k a June Highlights and 2025 AoPS Online Class Information
jlacosta   0
Jun 2, 2025
Congratulations to all the mathletes who competed at National MATHCOUNTS! If you missed the exciting Countdown Round, you can watch the video at this link. Are you interested in training for MATHCOUNTS or AMC 10 contests? How would you like to train for these math competitions in half the time? We have accelerated sections which meet twice per week instead of once starting on July 8th (7:30pm ET). These sections fill quickly so enroll today!

[list][*]MATHCOUNTS/AMC 8 Basics
[*]MATHCOUNTS/AMC 8 Advanced
[*]AMC 10 Problem Series[/list]
For those interested in Olympiad level training in math, computer science, physics, and chemistry, be sure to enroll in our WOOT courses before August 19th to take advantage of early bird pricing!

Summer camps are starting this month at the Virtual Campus in math and language arts that are 2 - to 4 - weeks in duration. Spaces are still available - don’t miss your chance to have a transformative summer experience. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

Be sure to mark your calendars for the following upcoming events:
[list][*]June 5th, Thursday, 7:30pm ET: Open Discussion with Ben Kornell and Andrew Sutherland, Art of Problem Solving's incoming CEO Ben Kornell and CPO Andrew Sutherland host an Ask Me Anything-style chat. Come ask your questions and get to know our incoming CEO & CPO!
[*]June 9th, Monday, 7:30pm ET, Game Jam: Operation Shuffle!, Come join us to play our second round of Operation Shuffle! If you enjoy number sense, logic, and a healthy dose of luck, this is the game for you. No specific math background is required; all are welcome.[/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29
Sunday, Aug 17 - Dec 14
Tuesday, Aug 26 - Dec 16
Friday, Sep 5 - Jan 16
Monday, Sep 8 - Jan 12
Tuesday, Sep 16 - Jan 20 (4:30 - 5:45 pm ET/1:30 - 2:45 pm PT)
Sunday, Sep 21 - Jan 25
Thursday, Sep 25 - Jan 29
Wednesday, Oct 22 - Feb 25
Tuesday, Nov 4 - Mar 10
Friday, Dec 12 - Apr 10

Prealgebra 2 Self-Paced

Prealgebra 2
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21
Sunday, Aug 17 - Dec 14
Tuesday, Sep 9 - Jan 13
Thursday, Sep 25 - Jan 29
Sunday, Oct 19 - Feb 22
Monday, Oct 27 - Mar 2
Wednesday, Nov 12 - Mar 18

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28
Sunday, Aug 17 - Dec 14
Wednesday, Aug 27 - Dec 17
Friday, Sep 5 - Jan 16
Thursday, Sep 11 - Jan 15
Sunday, Sep 28 - Feb 1
Monday, Oct 6 - Feb 9
Tuesday, Oct 21 - Feb 24
Sunday, Nov 9 - Mar 15
Friday, Dec 5 - Apr 3

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 2 - Sep 17
Sunday, Jul 27 - Oct 19
Monday, Aug 11 - Nov 3
Wednesday, Sep 3 - Nov 19
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Friday, Oct 3 - Jan 16
Tuesday, Nov 4 - Feb 10
Sunday, Dec 7 - Mar 8

Introduction to Number Theory
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30
Wednesday, Aug 13 - Oct 29
Friday, Sep 12 - Dec 12
Sunday, Oct 26 - Feb 1
Monday, Dec 1 - Mar 2

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14
Thursday, Aug 7 - Nov 20
Monday, Aug 18 - Dec 15
Sunday, Sep 7 - Jan 11
Thursday, Sep 11 - Jan 15
Wednesday, Sep 24 - Jan 28
Sunday, Oct 26 - Mar 1
Tuesday, Nov 4 - Mar 10
Monday, Dec 1 - Mar 30

Introduction to Geometry
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19
Wednesday, Aug 13 - Feb 11
Tuesday, Aug 26 - Feb 24
Sunday, Sep 7 - Mar 8
Thursday, Sep 11 - Mar 12
Wednesday, Sep 24 - Mar 25
Sunday, Oct 26 - Apr 26
Monday, Nov 3 - May 4
Friday, Dec 5 - May 29

Paradoxes and Infinity
Mon, Tue, Wed, & Thurs, Jul 14 - Jul 16 (meets every day of the week!)

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22
Friday, Aug 8 - Feb 20
Tuesday, Aug 26 - Feb 24
Sunday, Sep 28 - Mar 29
Wednesday, Oct 8 - Mar 8
Sunday, Nov 16 - May 17
Thursday, Dec 11 - Jun 4

Intermediate Counting & Probability
Sunday, Jun 22 - Nov 2
Sunday, Sep 28 - Feb 15
Tuesday, Nov 4 - Mar 24

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

Precalculus
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8
Wednesday, Aug 6 - Jan 21
Tuesday, Sep 9 - Feb 24
Sunday, Sep 21 - Mar 8
Monday, Oct 20 - Apr 6
Sunday, Dec 14 - May 31

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Wednesday, Jun 25 - Dec 17
Sunday, Sep 7 - Mar 15
Wednesday, Sep 24 - Apr 1
Friday, Nov 14 - May 22

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Wednesday, Sep 3 - Nov 19
Tuesday, Sep 16 - Dec 9
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Oct 6 - Jan 12
Thursday, Oct 16 - Jan 22
Tues, Thurs & Sun, Dec 9 - Jan 18 (meets three times a week!)

MATHCOUNTS/AMC 8 Advanced
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Tuesday, Aug 26 - Nov 11
Thursday, Sep 4 - Nov 20
Friday, Sep 12 - Dec 12
Monday, Sep 15 - Dec 8
Sunday, Oct 5 - Jan 11
Tues, Thurs & Sun, Dec 2 - Jan 11 (meets three times a week!)
Mon, Wed & Fri, Dec 8 - Jan 16 (meets three times a week!)

AMC 10 Problem Series
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 10 - Nov 2
Thursday, Aug 14 - Oct 30
Tuesday, Aug 19 - Nov 4
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Mon, Wed & Fri, Oct 6 - Nov 3 (meets three times a week!)
Tue, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 10 Final Fives
Monday, Jun 30 - Jul 21
Friday, Aug 15 - Sep 12
Sunday, Sep 7 - Sep 28
Tuesday, Sep 9 - Sep 30
Monday, Sep 22 - Oct 13
Sunday, Sep 28 - Oct 19 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, Oct 8 - Oct 29
Thursday, Oct 9 - Oct 30

AMC 12 Problem Series
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22
Sunday, Aug 10 - Nov 2
Monday, Aug 18 - Nov 10
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Tues, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 12 Final Fives
Thursday, Sep 4 - Sep 25
Sunday, Sep 28 - Oct 19
Tuesday, Oct 7 - Oct 28

AIME Problem Series A
Thursday, Oct 23 - Jan 29

AIME Problem Series B
Sunday, Jun 22 - Sep 21
Tuesday, Sep 2 - Nov 18

F=ma Problem Series
Wednesday, Jun 11 - Aug 27
Tuesday, Sep 16 - Dec 9
Friday, Oct 17 - Jan 30

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Sunday, Jun 15 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Tuesday, Jun 17 - Sep 2
Monday, Jun 30 - Sep 22
Thursday, Aug 14 - Oct 30
Sunday, Sep 7 - Nov 23
Tuesday, Dec 2 - Mar 3

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22
Friday, Oct 3 - Jan 16

USACO Bronze Problem Series
Sunday, Jun 22 - Sep 1
Wednesday, Sep 3 - Dec 3
Thursday, Oct 30 - Feb 5
Tuesday, Dec 2 - Mar 3

Physics

Introduction to Physics
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15
Tuesday, Sep 2 - Nov 18
Sunday, Oct 5 - Jan 11
Wednesday, Dec 10 - Mar 11

Physics 1: Mechanics
Monday, Jun 23 - Dec 15
Sunday, Sep 21 - Mar 22
Sunday, Oct 26 - Apr 26

Relativity
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Jun 2, 2025
0 replies
Calvin needs to cover all squares
Rijul saini   5
N 2 minutes ago by quantam13
Source: India IMOTC 2025 Day 2 Problem 1
Consider a $2025\times 2025$ board where we identify the squares with pairs $(i,j)$ where $i$ and $j$ denote the row and column number of that square, respectively.

Calvin picks two positive integers $a,b<2025$ and places a pawn at the bottom left corner (i.e. on $(1,1)$) and makes the following moves. In his $k$-th move, he moves the pawn from $(i,j)$ to either $(i+a,j)$ or $(i,j+a)$ if $k$ is odd and to either $(i+b,j)$ and $(i,j+b)$ if $k$ is even. Here all the numbers are taken modulo $2025$. Find the number of pairs $(a,b)$ that Calvin could have picked such that he can make moves so that the pawn covers all the squares on the board without being on any square twice.

Proposed by Tejaswi Navilarekallu
5 replies
Rijul saini
Wednesday at 6:35 PM
quantam13
2 minutes ago
Inspired by SunnyEvan
sqing   0
13 minutes ago
Source: Own
Let $ x,y \geq 0 ,  \frac{x^2}{x^3+y}+\frac{y^2}{x+y^3} \geq 1 .$ Prove that
$$ (x-\frac{1}{2})^2+(y+\frac{1}{2})^2 \leq \frac{5}{2} $$$$ (x-1)^2+(y+1)^2 \leq 5 $$$$ (x-2)^2+(y+2)^2 \leq 13$$$$ (x-\frac{1}{2})^2+(y+1)^2 \leq \frac{17}{4} $$$$ (x-1)^2+(y+2)^2 \leq 10  $$$$ (x-\frac{1}{2})^2+(y+2)^2 \leq \frac{37}{4}  $$
0 replies
sqing
13 minutes ago
0 replies
Beware the degeneracies!
Rijul saini   8
N 16 minutes ago by AR17296174
Source: India IMOTC 2025 Day 1 Problem 1
Let $a,b,c$ be real numbers satisfying $$\max \{a(b^2+c^2),b(c^2+a^2),c(a^2+b^2) \} \leqslant 2abc+1$$Prove that $$a(b^2+c^2)+b(c^2+a^2)+c(a^2+b^2) \leqslant 6abc+2$$and determine all cases of equality.

Proposed by Shantanu Nene
8 replies
Rijul saini
Wednesday at 6:30 PM
AR17296174
16 minutes ago
Griphook the globin plays a game
mathscrazy   19
N 25 minutes ago by heheman
Source: INMO 2025/5
Greedy goblin Griphook has a regular $2000$-gon, whose every vertex has a single coin. In a move, he chooses a vertex, removes one coin each from the two adjacent vertices, and adds one coin to the chosen vertex, keeping the remaining coin for himself. He can only make such a move if both adjacent vertices have at least one coin. Griphook stops only when he cannot make any more moves. What is the maximum and minimum number of coins he could have collected?

Proposed by Pranjal Srivastava and Rohan Goyal
19 replies
mathscrazy
Jan 19, 2025
heheman
25 minutes ago
No more topics!
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
1482 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
5005 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
8881 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_
280 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
1930 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
662 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
808 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
1016 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
3012 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
639 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
578 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
154 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
204 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
685 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