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

G
Topic
First Poster
Last Poster
k a April Highlights and 2025 AoPS Online Class Information
jlacosta   0
Apr 2, 2025
Spring is in full swing and summer is right around the corner, what are your plans? At AoPS Online our schedule has new classes starting now through July, so be sure to keep your skills sharp and be prepared for the Fall school year! Check out the schedule of upcoming classes below.

WOOT early bird pricing is in effect, don’t miss out! If you took MathWOOT Level 2 last year, no worries, it is all new problems this year! Our Worldwide Online Olympiad Training program is for high school level competitors. AoPS designed these courses to help our top students get the deep focus they need to succeed in their specific competition goals. Check out the details at this link for all our WOOT programs in math, computer science, chemistry, and physics.

Looking for summer camps in math and language arts? Be sure to check out the video-based summer camps offered at the Virtual Campus that are 2- to 4-weeks in duration. 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 events:
[list][*]April 3rd (Webinar), 4pm PT/7:00pm ET, Learning with AoPS: Perspectives from a Parent, Math Camp Instructor, and University Professor
[*]April 8th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS State Discussion
April 9th (Webinar), 4:00pm PT/7:00pm ET, Learn about Video-based Summer Camps at the Virtual Campus
[*]April 10th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MathILy and MathILy-Er Math Jam: Multibackwards Numbers
[*]April 22nd (Webinar), 4:00pm PT/7:00pm ET, Competitive Programming at AoPS (USACO).[/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, Apr 13 - Aug 10
Tuesday, May 13 - Aug 26
Thursday, May 29 - Sep 11
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29

Prealgebra 2 Self-Paced

Prealgebra 2
Sunday, Apr 13 - Aug 10
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Monday, Apr 7 - Jul 28
Sunday, May 11 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, May 14 - Aug 27
Friday, May 30 - Sep 26
Monday, Jun 2 - Sep 22
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Wednesday, Apr 16 - Jul 2
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Thursday, Apr 17 - Jul 3
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Wednesday, Apr 16 - Jul 30
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Wednesday, Apr 23 - Oct 1
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

Intermediate: Grades 8-12

Intermediate Algebra
Monday, Apr 21 - Oct 13
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22

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

Intermediate Number Theory
Friday, Apr 11 - Jun 27
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Wednesday, Apr 9 - Sep 3
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
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
Wednesday, Apr 16 - Jul 2
Friday, May 23 - Aug 15
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

MATHCOUNTS/AMC 8 Advanced
Friday, Apr 11 - Jun 27
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Friday, May 9 - Aug 1
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

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


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
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
Sat & Sun, Apr 26 - Apr 27 (4:00 - 7:00 pm ET/1:00 - 4:00pm PT)
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Apr 2, 2025
0 replies
Divisibility NT FE
CHESSR1DER   11
N 9 minutes ago by Frd_19_Hsnzde
Source: Own
Find all functions $f$ $N \rightarrow N$ such for any $a,b$:
$(a+b)|a^{f(b)} + b^{f(a)}$.
11 replies
CHESSR1DER
Monday at 7:07 PM
Frd_19_Hsnzde
9 minutes ago
Turbo's en route to visit each cell of the board
Lukaluce   16
N 13 minutes ago by Assassino9931
Source: EGMO 2025 P5
Let $n > 1$ be an integer. In a configuration of an $n \times n$ board, each of the $n^2$ cells contains an arrow, either pointing up, down, left, or right. Given a starting configuration, Turbo the snail starts in one of the cells of the board and travels from cell to cell. In each move, Turbo moves one square unit in the direction indicated by the arrow in her cell (possibly leaving the board). After each move, the arrows in all of the cells rotate $90^{\circ}$ counterclockwise. We call a cell good if, starting from that cell, Turbo visits each cell of the board exactly once, without leaving the board, and returns to her initial cell at the end. Determine, in terms of $n$, the maximum number of good cells over all possible starting configurations.

Proposed by Melek Güngör, Turkey
16 replies
Lukaluce
Monday at 11:01 AM
Assassino9931
13 minutes ago
EGMO magic square
Lukaluce   15
N an hour ago by Assassino9931
Source: EGMO 2025 P6
In each cell of a $2025 \times 2025$ board, a nonnegative real number is written in such a way that the sum of the numbers in each row is equal to $1$, and the sum of the numbers in each column is equal to $1$. Define $r_i$ to be the largest value in row $i$, and let $R = r_1 + r_2 + ... + r_{2025}$. Similarly, define $c_i$ to be the largest value in column $i$, and let $C = c_1 + c_2 + ... + c_{2025}$.
What is the largest possible value of $\frac{R}{C}$?

Proposed by Paulius Aleknavičius, Lithuania
15 replies
Lukaluce
Monday at 11:03 AM
Assassino9931
an hour ago
Ant wanna come to A
Rohit-2006   2
N an hour ago by zhaoli
An insect starts from $A$ and in $10$ steps and has to reach $A$ again. But in between one of the s steps and can't go $A$. Find probability. For example $ABCDCDEDEA$ is valid but $ABCDEDEDEA$ is not valid.
2 replies
Rohit-2006
Yesterday at 6:47 PM
zhaoli
an hour ago
MVT question
mqoi_KOLA   11
N Yesterday at 5:03 PM by Rohit-2006
Let \( f \) be a function which is continuous on \( [0,1] \) and differentiable on \( (0,1) \), with \( f(0) = f(1) = 0 \). Assume that there is some \( c \in (0,1) \) such that \( f(c) = 1 \). Prove that there exists some \( x_0 \in (0,1) \) such that \( |f'(x_0)| > 2 \).
11 replies
mqoi_KOLA
Apr 10, 2025
Rohit-2006
Yesterday at 5:03 PM
polynomial with real coefficients
Peter   9
N Yesterday at 4:58 PM by Rohit-2006
Source: IMC 1998 day 1 problem 5
Let $P$ be a polynomial of degree $n$ with only real zeros and real coefficients.
Prove that for every real $x$ we have $(n-1)(P'(x))^2\ge nP(x)P''(x)$. When does equality occur?
9 replies
Peter
Nov 1, 2005
Rohit-2006
Yesterday at 4:58 PM
Integral Inequality with better bound than usual cauchy
StarLex1   5
N Yesterday at 4:47 PM by RobertRogo
Source: a friend of mine
Suppose that $f:[0,1]\rightarrow\mathbb{R}$ ,is a convex function and $f(0) = 0 $
Prove that
\[\left(\int^{1}_{0}f(x)dx\right)^2\leq \dfrac{3}{4}\int^1_{0}f^2(x)dx\]
Note
5 replies
StarLex1
Yesterday at 7:58 AM
RobertRogo
Yesterday at 4:47 PM
Kyiv Taras Shevchenko University Mechmat Competition 1974-92 book
rogue   1
N Yesterday at 4:34 PM by rogue
Source: Kyiv Taras Shevchenko University Mechmat Competition
Kyiv Taras Shevchenko University Mechmat Competition 1974-92 book [in Ukrainian]
https://mechmat.knu.ua/wp-content/uploads/2024/03/mechmat1974-92.pdf
1 reply
rogue
Sep 2, 2023
rogue
Yesterday at 4:34 PM
Romanian National Olympiad 1996 – Grade 11 – Problem 4
Filipjack   2
N Yesterday at 2:28 PM by loup blanc
Source: Romanian National Olympiad 1996 – Grade 11 – Problem 4
Let $A,B,C,D \in \mathcal{M}_n(\mathbb{C}),$ $A$ and $C$ invertible. Prove that if $A^k B = C^k D$ for any positive integer $k,$ then $B=D.$
2 replies
Filipjack
Apr 13, 2025
loup blanc
Yesterday at 2:28 PM
Simple limit with standard recurrence
AndreiVila   3
N Yesterday at 1:50 PM by ZeroAlephZeta
Source: Romanian District Olympiad 2025 11.1
Consider the sequence $(a_n)_{n\geq 1}$ given by $a_1=1$ and $a_{n+1}=\frac{a_n}{1+\sqrt{1+a_n}}$, for all $n\geq 1$. Show that $$\lim_{n\rightarrow\infty}\frac{a_{n+1}}{a_n} = \lim_{n\rightarrow\infty}\sum_{k=1}^n \log_2(1+a_k)=2.$$Mathematical Gazette
3 replies
AndreiVila
Mar 8, 2025
ZeroAlephZeta
Yesterday at 1:50 PM
Putnam 1999 A6
djmathman   3
N Yesterday at 1:38 PM by zhoujef000
The sequence $(a_n)_{n\geq 1}$ is defined by $a_1=1,a_2=2,a_3=24,$ and, for $n\geq 4,$ \[a_n=\dfrac{6a_{n-1}^2a_{n-3}-8a_{n-1}a_{n-2}^2}{a_{n-2}a_{n-3}}.\] Show that, for all $n$, $a_n$ is an integer multiple of $n$.
3 replies
djmathman
Dec 22, 2012
zhoujef000
Yesterday at 1:38 PM
Convex geometry
ILOVEMYFAMILY   2
N Yesterday at 1:02 PM by alexheinis
1) Find all closed convex sets with nonempty interior that have exactly one supporting hyperplane in the plane.

2) Find all closed convex sets with nonempty interior that have exactly two supporting hyperplane in the plane.

2 replies
ILOVEMYFAMILY
Yesterday at 4:12 AM
alexheinis
Yesterday at 1:02 PM
Pyramid packing in sphere
smartvong   1
N Yesterday at 12:04 PM by smartvong
Source: own
Let $A_1$ and $B$ be two points that are diametrically opposite to each other on a unit sphere. $n$ right square pyramids are fitted along the line segment $\overline{A_1B}$, such that the apex and altitude of each pyramid $i$, where $1\le i\le n$, are $A_i$ and $\overline{A_iA_{i+1}}$ respectively, and the points $A_1, A_2, \dots, A_n, A_{n+1}, B$ are collinear.

(a) Find the maximum total volume of $n$ pyramids, with altitudes of equal length, that can be fitted in the sphere, in terms of $n$.

(b) Find the maximum total volume of $n$ pyramids that can be fitted in the sphere, in terms of $n$.

(c) Find the maximum total volume of the pyramids that can be fitted in the sphere as $n$ tends to infinity.

Note: The altitudes of the pyramids are not necessarily equal in length for (b) and (c).
1 reply
smartvong
Apr 13, 2025
smartvong
Yesterday at 12:04 PM
Putnam 2021 B3
awesomemathlete   6
N Yesterday at 11:38 AM by HacheB2031
Let $h(x,y)$ be a real-valued function that is twice continuously differentiable throughout $\mathbb{R}^2$, and define
\[
\rho (x,y)=yh_x -xh_y .
\]Prove or disprove: For any positive constants $d$ and $r$ with $d>r$, there is a circle $S$ of radius $r$ whose center is a distance $d$ away from the origin such that the integral of $\rho$ over the interior of $S$ is zero.
6 replies
awesomemathlete
Dec 5, 2021
HacheB2031
Yesterday at 11:38 AM
Olympiad Combinatorics Book
Pascal96   126
N Dec 27, 2023 by zaahir
Hi everyone, I am currently writing a book on combinatorics for people preparing for national and international math competitions, especially the IMO and selection tests leading up to it. The book is intended to expose readers to a variety of ideas, techniques and problem solving strategies, ranging from the intuitive “greedy algorithms” in the first chapter to the powerful Probabilistic Method in chapter nine.
I am uploading chapter one here, and would appreciate your feedback and any suggestions. Over the coming weeks, I will be uploading the remaining chapters one at a time.
The only prerequisites are familiarity with basic graph theoretic concepts and terminology, algebraic inequalities, induction and the pigeonhole principle. Experience with invariants and the extremal principle is also helpful.
EDIT: CHAPTER 9 IS OUT! Since only 3 attachments are allowed per post, I have uploaded chapters 4, 5 and 6 in my comment below (10th on this page), and chapters 7, 8, and 9 further below (comment number 49 on this page).
NOTE: The solution to example 8 in chapter 1 is incorrect, and will be corrected in the final version of the book. For now, ignore this example.

Full book (uploaded by green_dog_7983): Dead Link
[Amir: new link]
126 replies
Pascal96
Aug 6, 2014
zaahir
Dec 27, 2023
Olympiad Combinatorics Book
G H J
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pascal96
124 posts
#127 • 5 Y
Y by 606234, lneis1, Aimingformygoal, 554183, winniep008hfi
Here is the second handout I created for the training camp, on advanced combinatorial algorithms.
Attachments:
Advanced_Combinatorial_Algorithms.pdf (171kb)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pascal96
124 posts
#128 • 1 Y
Y by quirtt
DebayuRMO wrote:
Btw when can we expect the the new beginner friendly chapters that you were planning to write? I know you are really busy but at the same time I'm too excited about this extension so that I can start reading your book.
Thank You

I appreciate the excitement! I have a few rough drafts in the works, but creating the polished final versions takes time unfortunately. I don't want to commit to any particular date at this point. In the mean time, I hope the introductory problem set serves as some solid material for beginners to work through.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MelonGirl
572 posts
#129 • 2 Y
Y by Pascal96, Mango247
not directly related to last few posts, but I pm-ed you about this sometime back, so I guess I'll post it here as well for anyone who's worked on the problem.
Quote:
On each square of a chessboard is a light which has two states-
on or off. A move consists of choosing a square and changing
the state of the bulbs in that square and in its neighboring
squares (squares that share a side with it). Show that starting
from any configuration we can make finitely many moves to
reach a point where all the bulbs are switched off

This is under the algorithms chapter (2). People have found ways to do this with linear algebra and brute force (similar to the row reduction method here.)

Does anyone know of a purely combinatorial algorithm approach to this problem?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pascal96
124 posts
#130
Y by
@MelonGirl no I'm actually not aware of a purely combinatorial solution. For a few of the exercises in the book, I did not know the original source (usually because I saw the problem on some handout at an olympiad training camp). This was one such problem, and I'd actually tried it and hadn't been able to solve it. I figured it would make sense as one of the later exercises in the algorithms chapters, so placed it there without realizing it required linear algebra.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Physicsknight
639 posts
#131
Y by
I think the linalgb and matrix makes it easier to see the grid rather than a combinatorial approach. You can check the $4$ vectors $(1,1,1,0) \,(1,1,0,1)\,(1,0,1,1)\,(0,1,1,1) $ are independent over $\mathbb{F}_2. $.
Turn the the space of the states of the chessboard into a $64$ dimensional vector space over $\mathbb {F}_2$. The field with $2$ elements $0,1, $ with addition $\pmod{2} $.
The only gruesome task is to prove that $64$ vectors are not linearly independent.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
KAKAAB
23 posts
#132
Y by
Pascal96 wrote:
DebayuRMO wrote:
Btw when can we expect the the new beginner friendly chapters that you were planning to write? I know you are really busy but at the same time I'm too excited about this extension so that I can start reading your book.
Thank You

I appreciate the excitement! I have a few rough drafts in the works, but creating the polished final versions takes time unfortunately. I don't want to commit to any particular date at this point. In the mean time, I hope the introductory problem set serves as some solid material for beginners to work through.

eagerly waiting for it :D
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
TheMath_boy
1235 posts
#134
Y by
the drop box link for thefull pdf isn't working
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
HoRI_DA_GRe8
596 posts
#135
Y by
Pascal96 wrote:
Hi everyone, I am currently writing a book on combinatorics for people preparing for national and international math competitions, especially the IMO and selection tests leading up to it. The book is intended to expose readers to a variety of ideas, techniques and problem solving strategies, ranging from the intuitive “greedy algorithms” in the first chapter to the powerful Probabilistic Method in chapter nine.
I am uploading chapter one here, and would appreciate your feedback and any suggestions. Over the coming weeks, I will be uploading the remaining chapters one at a time.
The only prerequisites are familiarity with basic graph theoretic concepts and terminology, algebraic inequalities, induction and the pigeonhole principle. Experience with invariants and the extremal principle is also helpful.
EDIT: CHAPTER 9 IS OUT! Since only 3 attachments are allowed per post, I have uploaded chapters 4, 5 and 6 in my comment below (10th on this page), and chapters 7, 8, and 9 further below (comment number 49 on this page).
NOTE: The solution to example 8 in chapter 1 is incorrect, and will be corrected in the final version of the book. For now, ignore this example.

Full book (uploaded by green_dog_7983): Dead Link
[Amir: new link]

Is there any hints/solution key here??
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
IceWolf10
1577 posts
#136
Y by
no but there's a discussion forum
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
dgrozev
2460 posts
#137
Y by
MelonGirl wrote:
not directly related to last few posts, but I pm-ed you about this sometime back, so I guess I'll post it here as well for anyone who's worked on the problem.
Quote:
On each square of a chessboard is a light which has two states-
on or off. A move consists of choosing a square and changing
the state of the bulbs in that square and in its neighboring
squares (squares that share a side with it). Show that starting
from any configuration we can make finitely many moves to
reach a point where all the bulbs are switched off

This is under the algorithms chapter (2). People have found ways to do this with linear algebra and brute force (similar to the row reduction method here.)

Does anyone know of a purely combinatorial algorithm approach to this problem?
Let the cells of the chessboard be vertices of a graph $G$. Connect any two neighboring vertices (squares). So, you can change the binary state (0,1) of any vertex and all of its neighbors. It does not matter what a graph $G$ is. For any simple graph the same claim holds. It was posted already here, in this forum. Here is a solution using linear algebra. There is a T. Gallai's result saying that the vertices of any graph can be partitioned into two sets $V_1,V_2$ such that the subgraphs induced on $V_1$ and $V_2$ have all vertices of even degrees. It's possible the above problem to be proved as a corollary of Gallai's theorem. In this blog post, the converse approach is shown.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Karmanka
3 posts
#138 • 3 Y
Y by Mango247, Mango247, Mango247
Is it a mistake in task 5 [Czech and Slovak Republics 1997] after 1st Chapter?
Shouldn't there be only (2n+1)-gon or am I missing something (pls, explain then)?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
StefanSebez
53 posts
#139 • 4 Y
Y by adorefunctionalequation, Mango247, Mango247, Mango247
Karmanka wrote:
Is it a mistake in task 5 [Czech and Slovak Republics 1997] after 1st Chapter?
Shouldn't there be only (2n+1)-gon or am I missing something (pls, explain then)?

Yes, n should be an odd integer
Also here is that problem on aops
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Helixglich
113 posts
#140 • 2 Y
Y by adorefunctionalequation, theSpider
That book is a good one. Fairly friendly to newcomers too :blush:
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Phusy
2 posts
#141
Y by
Thanks alot. I love your style. Wish all the good thing for you <3
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
zaahir
6 posts
#142
Y by
When can we expect the beginner version @Pascal96 ?
Z K Y
N Quick Reply
G
H
=
a