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 A Letter to MSM
Arr0w   23
N Sep 19, 2022 by scannose
Greetings.

I have seen many posts talking about commonly asked questions, such as finding the value of $0^0$, $\frac{1}{0}$,$\frac{0}{0}$, $\frac{\infty}{\infty}$, why $0.999...=1$ or even expressions of those terms combined as if that would make them defined. I have made this post to answer these questions once and for all, and I politely ask everyone to link this post to threads that are talking about this issue.
[list]
[*]Firstly, the case of $0^0$. It is usually regarded that $0^0=1$, not because this works numerically but because it is convenient to define it this way. You will see the convenience of defining other undefined things later on in this post.

[*]What about $\frac{\infty}{\infty}$? The issue here is that $\infty$ isn't even rigorously defined in this expression. What exactly do we mean by $\infty$? Unless the example in question is put in context in a formal manner, then we say that $\frac{\infty}{\infty}$ is meaningless.

[*]What about $\frac{1}{0}$? Suppose that $x=\frac{1}{0}$. Then we would have $x\cdot 0=0=1$, absurd. A more rigorous treatment of the idea is that $\lim_{x\to0}\frac{1}{x}$ does not exist in the first place, although you will see why in a calculus course. So the point is that $\frac{1}{0}$ is undefined.

[*]What about if $0.99999...=1$? An article from brilliant has a good explanation. Alternatively, you can just use a geometric series. Notice that
\begin{align*}
\sum_{n=1}^{\infty} \frac{9}{10^n}&=9\sum_{n=1}^{\infty}\frac{1}{10^n}=9\sum_{n=1}^{\infty}\biggr(\frac{1}{10}\biggr)^n=9\biggr(\frac{\frac{1}{10}}{1-\frac{1}{10}}\biggr)=9\biggr(\frac{\frac{1}{10}}{\frac{9}{10}}\biggr)=9\biggr(\frac{1}{9}\biggr)=\boxed{1}
\end{align*}
[*]What about $\frac{0}{0}$? Usually this is considered to be an indeterminate form, but I would also wager that this is also undefined.
[/list]
Hopefully all of these issues and their corollaries are finally put to rest. Cheers.

2nd EDIT (6/14/22): Since I originally posted this, it has since blown up so I will try to add additional information per the request of users in the thread below.

INDETERMINATE VS UNDEFINED

What makes something indeterminate? As you can see above, there are many things that are indeterminate. While definitions might vary slightly, it is the consensus that the following definition holds: A mathematical expression is be said to be indeterminate if it is not definitively or precisely determined. So how does this make, say, something like $0/0$ indeterminate? In analysis (the theory behind calculus and beyond), limits involving an algebraic combination of functions in an independent variable may often be evaluated by replacing these functions by their limits. However, if the expression obtained after this substitution does not provide sufficient information to determine the original limit, then the expression is called an indeterminate form. For example, we could say that $0/0$ is an indeterminate form.

But we need to more specific, this is still ambiguous. An indeterminate form is a mathematical expression involving at most two of $0$, $1$ or $\infty$, obtained by applying the algebraic limit theorem (a theorem in analysis, look this up for details) in the process of attempting to determine a limit, which fails to restrict that limit to one specific value or infinity, and thus does not determine the limit being calculated. This is why it is called indeterminate. Some examples of indeterminate forms are
\[0/0, \infty/\infty, \infty-\infty, \infty \times 0\]etc etc. So what makes something undefined? In the broader scope, something being undefined refers to an expression which is not assigned an interpretation or a value. A function is said to be undefined for points outside its domain. For example, the function $f:\mathbb{R}^{+}\cup\{0\}\rightarrow\mathbb{R}$ given by the mapping $x\mapsto \sqrt{x}$ is undefined for $x<0$. On the other hand, $1/0$ is undefined because dividing by $0$ is not defined in arithmetic by definition. In other words, something is undefined when it is not defined in some mathematical context.

WHEN THE WATERS GET MUDDIED

So with this notion of indeterminate and undefined, things get convoluted. First of all, just because something is indeterminate does not mean it is not undefined. For example $0/0$ is considered both indeterminate and undefined (but in the context of a limit then it is considered in indeterminate form). Additionally, this notion of something being undefined also means that we can define it in some way. To rephrase, this means that technically, we can make something that is undefined to something that is defined as long as we define it. I'll show you what I mean.

One example of making something undefined into something defined is the extended real number line, which we define as
\[\overline{\mathbb{R}}=\mathbb{R}\cup \{-\infty,+\infty\}.\]So instead of treating infinity as an idea, we define infinity (positively and negatively, mind you) as actual numbers in the reals. The advantage of doing this is for two reasons. The first is because we can turn this thing into a totally ordered set. Specifically, we can let $-\infty\le a\le \infty$ for each $a\in\overline{\mathbb{R}}$ which means that via this order topology each subset has an infimum and supremum and $\overline{\mathbb{R}}$ is therefore compact. While this is nice from an analytic standpoint, extending the reals in this way can allow for interesting arithmetic! In $\overline{\mathbb{R}}$ it is perfectly OK to say that,
\begin{align*}
a + \infty = \infty + a & = \infty, & a & \neq -\infty \\
a - \infty = -\infty + a & = -\infty, & a & \neq \infty \\
a \cdot (\pm\infty) = \pm\infty \cdot a & = \pm\infty, & a & \in (0, +\infty] \\
a \cdot (\pm\infty) = \pm\infty \cdot a & = \mp\infty, & a & \in [-\infty, 0) \\
\frac{a}{\pm\infty} & = 0, & a & \in \mathbb{R} \\
\frac{\pm\infty}{a} & = \pm\infty, & a & \in (0, +\infty) \\
\frac{\pm\infty}{a} & = \mp\infty, & a & \in (-\infty, 0).
\end{align*}So addition, multiplication, and division are all defined nicely. However, notice that we have some indeterminate forms here which are also undefined,
\[\infty-\infty,\frac{\pm\infty}{\pm\infty},\frac{\pm\infty}{0},0\cdot \pm\infty.\]So while we define certain things, we also left others undefined/indeterminate in the process! However, in the context of measure theory it is common to define $\infty \times 0=0$ as greenturtle3141 noted below. I encourage to reread what he wrote, it's great stuff! As you may notice, though, dividing by $0$ is undefined still! Is there a place where it isn't? Kind of. To do this, we can extend the complex numbers! More formally, we can define this extension as
\[\mathbb{C}^*=\mathbb{C}\cup\{\tilde{\infty}\}\]which we call the Riemann Sphere (it actually forms a sphere, pretty cool right?). As a note, $\tilde{\infty}$ means complex infinity, since we are in the complex plane now. Here's the catch: division by $0$ is allowed here! In fact, we have
\[\frac{z}{0}=\tilde{\infty},\frac{z}{\tilde{\infty}}=0.\]where $\tilde{\infty}/\tilde{\infty}$ and $0/0$ are left undefined. We also have
\begin{align*}
z+\tilde{\infty}=\tilde{\infty}, \forall z\ne -\infty\\
z\times \tilde{\infty}=\tilde{\infty}, \forall z\ne 0
\end{align*}Furthermore, we actually have some nice properties with multiplication that we didn't have before. In $\mathbb{C}^*$ it holds that
\[\tilde{\infty}\times \tilde{\infty}=\tilde{\infty}\]but $\tilde{\infty}-\tilde{\infty}$ and $0\times \tilde{\infty}$ are left as undefined (unless there is an explicit need to change that somehow). One could define the projectively extended reals as we did with $\mathbb{C}^*$, by defining them as
\[{\widehat {\mathbb {R} }}=\mathbb {R} \cup \{\infty \}.\]They behave in a similar way to the Riemann Sphere, with division by $0$ also being allowed with the same indeterminate forms (in addition to some other ones).
23 replies
Arr0w
Feb 11, 2022
scannose
Sep 19, 2022
k i Marathon Threads
LauraZed   0
Jul 2, 2019
Due to excessive spam and inappropriate posts, we have locked the Prealgebra and Beginning Algebra threads.

We will either unlock these threads once we've cleaned them up or start new ones, but for now, do not start new marathon threads for these subjects. Any new marathon threads started while this announcement is up will be immediately deleted.
0 replies
LauraZed
Jul 2, 2019
0 replies
k i Basic Forum Rules and Info (Read before posting)
jellymoop   368
N May 16, 2018 by harry1234
f (Reminder: Do not post Alcumus or class homework questions on this forum. Instructions below.) f
Welcome to the Middle School Math Forum! Please take a moment to familiarize yourself with the rules.

Overview:
[list]
[*] When you're posting a new topic with a math problem, give the topic a detailed title that includes the subject of the problem (not just "easy problem" or "nice problem")
[*] Stay on topic and be courteous.
[*] Hide solutions!
[*] If you see an inappropriate post in this forum, simply report the post and a moderator will deal with it. Don't make your own post telling people they're not following the rules - that usually just makes the issue worse.
[*] When you post a question that you need help solving, post what you've attempted so far and not just the question. We are here to learn from each other, not to do your homework. :P
[*] Avoid making posts just to thank someone - you can use the upvote function instead
[*] Don't make a new reply just to repeat yourself or comment on the quality of others' posts; instead, post when you have a new insight or question. You can also edit your post if it's the most recent and you want to add more information.
[*] Avoid bumping old posts.
[*] Use GameBot to post alcumus questions.
[*] If you need general MATHCOUNTS/math competition advice, check out the threads below.
[*] Don't post other users' real names.
[*] Advertisements are not allowed. You can advertise your forum on your profile with a link, on your blog, and on user-created forums that permit forum advertisements.
[/list]

Here are links to more detailed versions of the rules. These are from the older forums, so you can overlook "Classroom math/Competition math only" instructions.
Posting Guidelines
Update on Basic Forum Rules
What belongs on this forum?
How do I write a thorough solution?
How do I get a problem on the contest page?
How do I study for mathcounts?
Mathcounts FAQ and resources
Mathcounts and how to learn

As always, if you have any questions, you can PM me or any of the other Middle School Moderators. Once again, if you see spam, it would help a lot if you filed a report instead of responding :)

Marathons!
Relays might be a better way to describe it, but these threads definitely go the distance! One person starts off by posting a problem, and the next person comes up with a solution and a new problem for another user to solve. Here's some of the frequently active marathons running in this forum:
[list][*]Algebra
[*]Prealgebra
[*]Proofs
[*]Factoring
[*]Geometry
[*]Counting & Probability
[*]Number Theory[/list]
Some of these haven't received attention in a while, but these are the main ones for their respective subjects. Rather than starting a new marathon, please give the existing ones a shot first.

You can also view marathons via the Marathon tag.

Think this list is incomplete or needs changes? Let the mods know and we'll take a look.
368 replies
jellymoop
May 8, 2015
harry1234
May 16, 2018
max value
Bet667   2
N 3 minutes ago by Natrium
Let $a,b$ be a real numbers such that $a^2+ab+b^2\ge a^3+b^3.$Then find maximum value of $a+b$
2 replies
Bet667
an hour ago
Natrium
3 minutes ago
Inspired by Austria 2025
sqing   2
N 6 minutes ago by Tkn
Source: Own
Let $ a,b\geq 0 ,a,b\neq 1$ and $  a^2+b^2=1. $ Prove that$$   (a + b ) \left( \frac{a}{(b -1)^2} + \frac{b}{(a - 1)^2} \right) \geq 12+8\sqrt 2$$
2 replies
sqing
Today at 2:01 AM
Tkn
6 minutes ago
Geometry
gggzul   2
N 11 minutes ago by gggzul
In trapezoid $ABCD$ segments $AB$ and $CD$ are parallel. Angle bisectors of $\angle A$ and $\angle C$ meet at $P$. Angle bisectors of $\angle B$ and $\angle D$ meet at $Q$. Prove that $ABPQ$ is cyclic
2 replies
gggzul
an hour ago
gggzul
11 minutes ago
thank you !
Piwbo   2
N 16 minutes ago by Piwbo
Given positive integers $a,b$ such that $a$ is even , $b$ is odd and $ab(a+b)^{2023}$ is divisible by $a^{2024}+b^{2024}$ .Prove that there exists a prime number $p$ such that $a^{2024}+b^{2024}$ is divisible by $p^{2025}$
2 replies
Piwbo
an hour ago
Piwbo
16 minutes ago
Doubt on a math problem
AVY2024   14
N Today at 2:35 AM by Soupboy0
Solve for x and y given that xy=923, x+y=84
14 replies
AVY2024
Apr 8, 2025
Soupboy0
Today at 2:35 AM
Mass points question
Wesoar   0
Today at 2:27 AM
So I was working my way through mass points, and I found a rule that basically says:

"If transversal line EF crosses cevian AD in triangle ABC, you must split mass A into Mass ab and Mass ac. Could someone explain to me why this makes sense/why we couldn't just use mass A?
0 replies
Wesoar
Today at 2:27 AM
0 replies
What's the chance that two AoPS accounts generate with the same icon?
Math-lover1   16
N Today at 2:21 AM by martianrunner
So I've been wondering how many possible "icons" can be generated when you first create an account. By "icon" I mean the stack of cubes as the first profile picture before changing it.

I don't know a lot about how AoPS icons generate, so I have a few questions:
- Do the colors on AoPS icons generate through a preset of colors or the RGB (red, green, blue in hexadecimal form) scale? If it generates through the RGB scale, then there may be greater than $256^3 = 16777216$ different icons.
- Do the arrangements of the stacks of blocks in the icon change with each account? If so, I think we can calculate this through considering each stack of blocks independently.
16 replies
Math-lover1
May 2, 2025
martianrunner
Today at 2:21 AM
Easy number theory
britishprobe17   31
N Today at 2:20 AM by martianrunner
The number of factors from 2024 that are greater than $\sqrt{2024}$ are
31 replies
britishprobe17
Oct 16, 2024
martianrunner
Today at 2:20 AM
prime numbers
wpdnjs   109
N Today at 1:44 AM by ReticulatedPython
does anyone know how to quickly identify prime numbers?

thanks.
109 replies
wpdnjs
Oct 2, 2024
ReticulatedPython
Today at 1:44 AM
max number of candies
orangefronted   12
N Today at 1:27 AM by iwastedmyusername
A store sells a strawberry flavoured candy for 1 dollar each. The store offers a promo where every 4 candy wrappers can be exchanged for one candy. If there is no limit to how many times you can exchange candy wrappers for candies, what is the maximum number of candies I can obtain with 100 dollars?
12 replies
orangefronted
Apr 3, 2025
iwastedmyusername
Today at 1:27 AM
9 Have you participated in the MATHCOUNTS competition?
aadimathgenius9   43
N Today at 12:29 AM by Inaaya
Have you participated in the MATHCOUNTS competition before?
43 replies
aadimathgenius9
Jan 1, 2025
Inaaya
Today at 12:29 AM
How to get a 300+ on the NWEA MAP MATH test (URGENT)
nmlikesmath   16
N Today at 12:26 AM by Inaaya
I have 4 days till this test, I'm wondering how do I get a 300+ and what do I need to know, thank you.
16 replies
nmlikesmath
May 3, 2025
Inaaya
Today at 12:26 AM
Warning!
VivaanKam   18
N Today at 12:18 AM by Iwowowl253
This problem will try to trick you! :!:

18 replies
VivaanKam
Yesterday at 5:08 PM
Iwowowl253
Today at 12:18 AM
9 Was the 2025 AMC 8 harder or easier than last year?
Sunshine_Paradise   196
N Yesterday at 11:49 PM by giratina3
Also what will be the DHR?
196 replies
Sunshine_Paradise
Jan 30, 2025
giratina3
Yesterday at 11:49 PM
Good Permutations in Modulo n
swynca   8
N May 2, 2025 by Thapakazi
Source: BMO 2025 P1
An integer $n > 1$ is called $\emph{good}$ if there exists a permutation $a_1, a_2, a_3, \dots, a_n$ of the numbers $1, 2, 3, \dots, n$, such that:
$(i)$ $a_i$ and $a_{i+1}$ have different parities for every $1 \leq i \leq n-1$;
$(ii)$ the sum $a_1 + a_2 + \cdots + a_k$ is a quadratic residue modulo $n$ for every $1 \leq k \leq n$.
Prove that there exist infinitely many good numbers, as well as infinitely many positive integers which are not good.
8 replies
swynca
Apr 27, 2025
Thapakazi
May 2, 2025
Good Permutations in Modulo n
G H J
G H BBookmark kLocked kLocked NReply
Source: BMO 2025 P1
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
swynca
16 posts
#1 • 2 Y
Y by dangerousliri, megarnie
An integer $n > 1$ is called $\emph{good}$ if there exists a permutation $a_1, a_2, a_3, \dots, a_n$ of the numbers $1, 2, 3, \dots, n$, such that:
$(i)$ $a_i$ and $a_{i+1}$ have different parities for every $1 \leq i \leq n-1$;
$(ii)$ the sum $a_1 + a_2 + \cdots + a_k$ is a quadratic residue modulo $n$ for every $1 \leq k \leq n$.
Prove that there exist infinitely many good numbers, as well as infinitely many positive integers which are not good.
This post has been edited 2 times. Last edited by swynca, Apr 27, 2025, 4:15 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Double07
79 posts
#2 • 2 Y
Y by lksb, Assassino9931
We prove that any prime $p\equiv 3\mod 4$ works.
We have $\left(\frac{-1}{p}\right)=-1$, so we can split $1, 2, ..., p-1$ into $\frac{p-1}{2}$ pairs $(r_i, s_i)$ such that $r_i+s_i=p$, $\left(\frac{r_i}{p}\right)=1$ and $\left(\frac{s_i}{p}\right)=-1$.
Order the pairs such that, for all $1\leq i\leq k$, $r_i$ is odd and, for all $k+1\leq i\leq \frac{p-1}{2}$, $r_i$ is even.
Now just consider the permutation $r_1, s_1, r_2, s_2, ..., r_k, s_k, p, r_{k+1}, s_{k+1}, ..., r_{\frac{p-1}{2}}, s_{\frac{p-1}{2}}$.
Modulo $2$ this will be $1, 0, 1, 0, ..., 1, 0, 1, 0, 1, ..., 0, 1$, so $(i)$ is achieved.
At any point the sum $a_1+...+a_m\mod p$ will be either $0$ or $r_i$, for a $1\leq i\leq \frac{p-1}{2}$, so a quadratic residue.

Now, for the second part, just choose $n=2^k, k\geq 2$.
We will prove that there don't exist two quadratic residues with difference equal to $2$, hence such a permutation wouldn't exist, since there must exist $a_i=2$ in the permutation.
Suppose there existed $a, b$ such that $\left(\frac{a}{p}\right)=\left(\frac{b}{p}\right)=1$ and $b-a\equiv 2\mod 2^k$.
Since $b-a\equiv 2\mod 2^k$, we have two cases:
1. $\{a,b\}\equiv \{0,2\}\mod4$, in which case there should exist a perfect square $m^2\equiv 2\mod 4$, impossible.
2. $\{a,b\}\equiv \{1,3\}\mod4$, in which case there should exist a perfect square $m^2\equiv 3\mod 4$, impossible.
So such permutation doesn't exist for all $n=2^k$.
This post has been edited 2 times. Last edited by Double07, Apr 27, 2025, 6:56 PM
Reason: Deleted a mistake
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
DensSv
63 posts
#3
Y by
Does anyone know the proposer?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Ivan_Borsenco
28 posts
#5
Y by
The (i) condition adds a small twist to the problem.
I believe the problem looks also complete and interesting to solve without the (i) condition.

-- To construct such a permutation, it is natural to look for a sequence with pairs that add up to 0 mod $p$.
The next desire is to pair a residue with a non-residue and also for them to alternate.
Choosing $p \equiv 3 \pmod 4$ solves this, as Double07 showed in his/her post.

-- When we need to prove that no such sequence exists. We can choose $n=2k$, then
the last sum is a number that we can compute: $k(2k+1)\equiv k \pmod{2k}$. If there exists $x^2 \equiv k \pmod{2k}$,
then $x^2 = 2k\cdot s + k = k (2s +1)$. Choosing $k = 2m^2$ assures that no such $x$ exists.
This post has been edited 2 times. Last edited by Ivan_Borsenco, Apr 27, 2025, 3:25 PM
Reason: -
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
megarnie
5606 posts
#7
Y by
Part 1) Prove that there are infinitely many good numbers.
Fix any prime $p \equiv 3 \pmod 4$. Let $n = p$. Choose values for these odd indices of the sequence $a_1, a_3, a_5,\ldots, a_{2k - 1} $ so that they consist of all the even quadratic residues modulo $p$ exactly once and $a_{2k - 1} = 0$. Now, choose the values of these even indices of the sequence $a_{2k}, a_{2k + 2}, a_{2k + 4} , \ldots, a_{p - 1}$ so that they consist of all the odd quadratic residues modulo $p$ exactly once. Now, for any index $i$, if $a_i$ is a nonzero QR mod $p$, then choose $a_{i + 1} = p - a_i$. One can check that this sequence works.
Part 2) Prove that there are infinitely many numbers that are not good.
Let $n = 8k + 4$. We compute $a_1 + a_2 + \cdots + a_n = 1 + 2 + \cdots + n = \frac{n(n+1)}{2} = (4k + 2)(8k +5) \equiv 4k + 2 \pmod{8k + 4}$. Anything that is $4k + 2\pmod{8k + 4}$ must also be $2 \pmod 4$, so it cannot 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.
EVKV
70 posts
#8
Y by
Claim 1 : All primes $p \equiv 3 $ mod $4$ are good

Proof 1 :

Claim 1.1 : If a is a QR mod p then p-a is not where a $\neq$ pk for some integer k

Proof 1.1 : FTSOC assume for some integer x,y $x^{2} +y^{2} \equiv a +p-a \equiv 0 $ mod $p$
Which is nonsense by Fermat's christmas theorem

Defination 1.1 : We define $a_{i}$ as the odd numbers which are QR mod p and lesser than p. . Here
$1 \leq i \leq r$ where r is the amount of odd numbers which are QR mod p and lesser than p.

Defination 1.2 : We define $b_{i}$ as the even numbers which are QR mod p and lesser than p. . Here
$1 \leq i \leq k$ where k is the amount of even numbers which are QR mod p and lesser than p.

Also clearly $a_{i}$ and $p-a_{i}$ have different parity so do $b_{i}$ and $p-b_{i}$

Now we already know there are $\frac{p-1}{2}$ non-zero quadratic residues mod p. So, $a_{i}$ and $p-a_{i}$ and $b_{i}$ and $p-b_{i}$ form $\frac{p-1}{2}$ pairs and as none of them include p ( all are non zero quadratic residues)
we will get all numbers $ \leq p $ in the following sequence which will also satisfy the other conditions clearly as at any point it will be either 0,$a_{i}$,$b_{i}$ which are all QRs

$a_{1}$,$p-a_{1}$, $ \cdots $,$a_{r}$,$p-a_{r}$,$p$,$b_{1}$,$p-b_{1}$, $ \cdots $,$b_{k}$,$p-b_{k}$,

Claim 2 : All numbers of the form $4K$ where K is odd are not good (They are bad)

Proof 2 : Obviously If x is a QR mod $4K$ it is a QR mod 4
So, All $\sum_1 ^{k} a_{i}$ $ \equiv $ $0,1$ mod 4
Now as $0+2$ and $1+2$ are not QRs mod 4
Thus we can never have $a_{i+1} \equiv 2$ mod 4 for all $i \leq 4K-1$ but that is nonsense as for all $r \leq 4K$ there is an $a_{g} = r$

QED

Remark : A very very tasty problem which i never expected to be able to solve. Had so much fun tho had fake solved once lol.

I rate it d6

Solved : 27/4/25
This post has been edited 4 times. Last edited by EVKV, Apr 28, 2025, 7:38 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
dangerousliri
930 posts
#9 • 3 Y
Y by bsf714, NO_SQUARES, Achilleas
One of the best Number Theory problems on Olympiads. I will show my solution in some details another way how it could be done since I think most likely it would be hard someone to thought of this.

As before to show that there are infinitely non good numbers we take $n=4^m$.

We are going to prove that $n=2p$ is a good number where $p$ is a prime number such that $p\equiv 5\pmod6$. To do that with some manipulation we can prove $x^3$ is a complete residue for $x=1,2,...,2p$ modulo $2p$. After that we have for every $i=1,2,...,2p$ there exist a unique $x_i\in\{1,2,...,2p\}$ such that $i\equiv x_i^3\pmod{2p}$ and we have that $i$ and $x_i$ have same parities. Now to finish the problem we use the identity,
$$1^3+2^3+...+k^3=\left(\frac{k(k+1)}{2}\right)^2.$$
This post has been edited 3 times. Last edited by dangerousliri, Apr 27, 2025, 7:19 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MathLuis
1523 posts
#10
Y by
For the first part just notice that taking $n$ as a prime $p \equiv 3 \pmod 4$ just works as $-1$ is NQR mod $p$ and as a result we have that $k(p-k) \equiv -k^2 \pmod p$ which is an NQR by multiplicativiness of the Legendre Symbol and therefore we can split in $\frac{p-1}{2}$ pairs $(q_i,n_i)$ for which $q_i+n_i=p$ and one is a QR and the other is NQR, and the idea for the parity part is just to put $1$ first then $p-1$ and then another odd one and so on until you run out of odd ones then add zero and add even ones and then their pair to finish.
Now to see infinitely many $n$ that fail we pick $n=2^k$ for $k$ large and the reason for this pick is that clearly we can't have two QRs that are consecutive by $2$ as it leads to a contradiction $\pmod 4$ but at some point we have to add $2$ to the sum so that gives a contradiction for it working, thus done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Thapakazi
60 posts
#11 • 2 Y
Y by missionjoshi.65, Bergo1305
For the first part, we take $n$ as a prime $p \equiv 3 \pmod 4$. Note that if $i$ is a QR, then $p-i$ is NQR, and vice versa. Then we start pairing the terms as follows:

Let $s_2, s_3, \cdots, s_{\frac{p-1}2}$ be all quadratic residues mod $p$ not including $1$.

- First pair $(1, p-1)$.
- Then for $i > 1$, keep on pairing $(a_i, a_{i+1}) = (s_i, p-s_i)$ where $s_i$ is odd, till we run out of odd QR's.
- Then we let the next term be $p$.
- Finally pair $(a_i, a_{i+1}) = (s_i, p-s_i)$ where $s_i$ is even, till we run out of them.

It is clear that this pairing works.

For the second part, we let $n = 4p$ for an odd prime $p$. Then, note that $t^2 \equiv \sum a_i = 2p(4p+1) \equiv 2p \pmod {4p}.$

Then, we get a contradiction as

$$4p \mid t^2 - 2p \implies 2p \mid t^2 \implies 4p^2 \mid t^2 \implies 4p \mid t^2 \implies 4p \mid 2p.$$
This post has been edited 5 times. Last edited by Thapakazi, May 2, 2025, 4:07 PM
Z K Y
N Quick Reply
G
H
=
a