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

Contests & Programs AMC and other contests, summer programs, etc.
AMC and other contests, summer programs, etc.
3 M G
BBookmark  VNew Topic kLocked
Contests & Programs AMC and other contests, summer programs, etc.
AMC and other contests, summer programs, etc.
3 M G
BBookmark  VNew Topic kLocked
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
k i Adding contests to the Contest Collections
dcouchman   1
N Apr 5, 2023 by v_Enhance
Want to help AoPS remain a valuable Olympiad resource? Help us add contests to AoPS's Contest Collections.

Find instructions and a list of contests to add here: https://artofproblemsolving.com/community/c40244h1064480_contests_to_add
1 reply
dcouchman
Sep 9, 2019
v_Enhance
Apr 5, 2023
k i Zero tolerance
ZetaX   49
N May 4, 2019 by NoDealsHere
Source: Use your common sense! (enough is enough)
Some users don't want to learn, some other simply ignore advises.
But please follow the following guideline:


To make it short: ALWAYS USE YOUR COMMON SENSE IF POSTING!
If you don't have common sense, don't post.


More specifically:

For new threads:


a) Good, meaningful title:
The title has to say what the problem is about in best way possible.
If that title occured already, it's definitely bad. And contest names aren't good either.
That's in fact a requirement for being able to search old problems.

Examples:
Bad titles:
- "Hard"/"Medium"/"Easy" (if you find it so cool how hard/easy it is, tell it in the post and use a title that tells us the problem)
- "Number Theory" (hey guy, guess why this forum's named that way¿ and is it the only such problem on earth¿)
- "Fibonacci" (there are millions of Fibonacci problems out there, all posted and named the same...)
- "Chinese TST 2003" (does this say anything about the problem¿)
Good titles:
- "On divisors of a³+2b³+4c³-6abc"
- "Number of solutions to x²+y²=6z²"
- "Fibonacci numbers are never squares"


b) Use search function:
Before posting a "new" problem spend at least two, better five, minutes to look if this problem was posted before. If it was, don't repost it. If you have anything important to say on topic, post it in one of the older threads.
If the thread is locked cause of this, use search function.

Update (by Amir Hossein). The best way to search for two keywords in AoPS is to input
[code]+"first keyword" +"second keyword"[/code]
so that any post containing both strings "first word" and "second form".


c) Good problem statement:
Some recent really bad post was:
[quote]$lim_{n\to 1}^{+\infty}\frac{1}{n}-lnn$[/quote]
It contains no question and no answer.
If you do this, too, you are on the best way to get your thread deleted. Write everything clearly, define where your variables come from (and define the "natural" numbers if used). Additionally read your post at least twice before submitting. After you sent it, read it again and use the Edit-Button if necessary to correct errors.


For answers to already existing threads:


d) Of any interest and with content:
Don't post things that are more trivial than completely obvious. For example, if the question is to solve $x^{3}+y^{3}=z^{3}$, do not answer with "$x=y=z=0$ is a solution" only. Either you post any kind of proof or at least something unexpected (like "$x=1337, y=481, z=42$ is the smallest solution). Someone that does not see that $x=y=z=0$ is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
Similar, posting "I have solved this problem" but not posting anything else is not welcome; it even looks that you just want to show off what a genius you are.

e) Well written and checked answers:
Like c) for new threads, check your solutions at least twice for mistakes. And after sending, read it again and use the Edit-Button if necessary to correct errors.



To repeat it: ALWAYS USE YOUR COMMON SENSE IF POSTING!


Everything definitely out of range of common sense will be locked or deleted (exept for new users having less than about 42 posts, they are newbies and need/get some time to learn).

The above rules will be applied from next monday (5. march of 2007).
Feel free to discuss on this here.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
MOP EMAILS OUT!!!
youlost_thegame_1434   27
N 14 minutes ago by mdk2013
CONGRATS TO EVERYONE WHO MADE IT!

IMAGE
27 replies
+4 w
youlost_thegame_1434
2 hours ago
mdk2013
14 minutes ago
memorize your 60 120 degree triangles
OronSH   19
N 17 minutes ago by sadas123
Source: 2024 AMC 12A #19
Cyclic quadrilateral $ABCD$ has lengths $BC=CD=3$ and $DA=5$ with $\angle CDA=120^\circ$. What is the length of the shorter diagonal of $ABCD$?

$
\textbf{(A) }\frac{31}7 \qquad
\textbf{(B) }\frac{33}7 \qquad
\textbf{(C) }5 \qquad
\textbf{(D) }\frac{39}7 \qquad
\textbf{(E) }\frac{41}7 \qquad
$
19 replies
OronSH
Nov 7, 2024
sadas123
17 minutes ago
Something nice
KhuongTrang   25
N an hour ago by KhuongTrang
Source: own
Problem. Given $a,b,c$ be non-negative real numbers such that $ab+bc+ca=1.$ Prove that

$$\sqrt{a+1}+\sqrt{b+1}+\sqrt{c+1}\le 1+2\sqrt{a+b+c+abc}.$$
25 replies
KhuongTrang
Nov 1, 2023
KhuongTrang
an hour ago
Two Functional Inequalities
Mathdreams   6
N 2 hours ago by Assassino9931
Source: 2025 Nepal Mock TST Day 2 Problem 2
Determine all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(x) \le x^3$$and $$f(x + y) \le f(x) + f(y) + 3xy(x + y)$$for any real numbers $x$ and $y$.

(Miroslav Marinov, Bulgaria)
6 replies
Mathdreams
Today at 1:34 PM
Assassino9931
2 hours ago
Pythagorean new journey
XAN4   2
N 2 hours ago by mathprodigy2011
Source: Inspired by sarjinius
The number $4$ is written on the blackboard. Every time, Carmela can erase the number $n$ on the black board and replace it with a new number $m$, if and only if $|n^2-m^2|$ is a perfect square. Prove or disprove that all positive integers $n\geq4$ can be written exactly once on the blackboard.
2 replies
XAN4
Today at 3:41 AM
mathprodigy2011
2 hours ago
sqrt(2) and sqrt(3) differ in at least 1000 digits
Stuttgarden   2
N 2 hours ago by straight
Source: Spain MO 2025 P3
We write the decimal expressions of $\sqrt{2}$ and $\sqrt{3}$ as \[\sqrt{2}=1.a_1a_2a_3\dots\quad\quad\sqrt{3}=1.b_1b_2b_3\dots\]where each $a_i$ or $b_i$ is a digit between 0 and 9. Prove that there exist at least 1000 values of $i$ between $1$ and $10^{1000}$ such that $a_i\neq b_i$.
2 replies
Stuttgarden
Mar 31, 2025
straight
2 hours ago
combinatorics and number theory beautiful problem
Medjl   2
N 2 hours ago by mathprodigy2011
Source: Netherlands TST for BxMo 2017 problem 4
A quadruple $(a; b; c; d)$ of positive integers with $a \leq b \leq c \leq d$ is called good if we can colour each integer red, blue, green or purple, in such a way that
$i$ of each $a$ consecutive integers at least one is coloured red;
$ii$ of each $b$ consecutive integers at least one is coloured blue;
$iii$ of each $c$ consecutive integers at least one is coloured green;
$iiii$ of each $d$ consecutive integers at least one is coloured purple.
Determine all good quadruples with $a = 2.$
2 replies
Medjl
Feb 1, 2018
mathprodigy2011
2 hours ago
Squence problem
AlephG_64   1
N 2 hours ago by RagvaloD
Source: 2025 Finals Portuguese Math Olympiad P1
Francisco wrote a sequence of numbers starting with $25$. From the fourth term of the sequence onwards, each term of the sequence is the average of the previous three. Given that the first six terms of the sequence are natural numbers and that the sixth number written was $8$, what is the fifth term of the sequence?
1 reply
AlephG_64
Yesterday at 1:19 PM
RagvaloD
2 hours ago
50 points in plane
pohoatza   12
N 2 hours ago by de-Kirschbaum
Source: JBMO 2007, Bulgaria, problem 3
Given are $50$ points in the plane, no three of them belonging to a same line. Each of these points is colored using one of four given colors. Prove that there is a color and at least $130$ scalene triangles with vertices of that color.
12 replies
pohoatza
Jun 28, 2007
de-Kirschbaum
2 hours ago
beautiful functional equation problem
Medjl   6
N 3 hours ago by Sadigly
Source: Netherlands TST for BxMO 2017 problem 2
Let define a function $f: \mathbb{N} \rightarrow \mathbb{Z}$ such that :
$i)$$f(p)=1$ for all prime numbers $p$.
$ii)$$f(xy)=xf(y)+yf(x)$ for all positive integers $x,y$
find the smallest $n \geq 2016$ such that $f(n)=n$
6 replies
Medjl
Feb 1, 2018
Sadigly
3 hours ago
Line Combining Fermat Point, Orthocenter, and Centroid
cooljoseph   0
3 hours ago
On triangle $ABC$, draw exterior equilateral triangles on sides $AB$ and $AC$ to obtain $ABC'$ and $ACB'$, respectively. Let $X$ be the intersection of the altitude through $B$ and the median through $C$. Let $Y$ be the intersection of the altitude through $A$ and line $CC'$. Let $Z$ be the intersection of the median through $A$ and the line $BB'$. Prove that $X$, $Y$, and $Z$ lie on a common line.

IMAGE
0 replies
cooljoseph
3 hours ago
0 replies
complete integral values
Medjl   2
N 3 hours ago by Sadigly
Source: Netherlands TST for BxMO 2017 problem 1
Let $n$ be an even positive integer. A sequence of $n$ real numbers is called complete if for every integer $m$ with $1 \leq  m \leq  n$ either the sum of the first $m$ terms of the sum or the sum of the last $m$ terms is integral. Determine
the minimum number of integers in a complete sequence of $n$ numbers.
2 replies
Medjl
Feb 1, 2018
Sadigly
3 hours ago
centslordm
centslordm   48
N 4 hours ago by sadas123
Source: AIME II #8
From an unlimited supply of 1-cent coins, 10-cent coins, and 25-cent coins, Silas wants to find a collection of coins that has a total value of $N$ cents, where $N$ is a positive integer. He uses the so-called greedy algorithm, successively choosing the coin of greatest value that does not cause the value of his collection to exceed $N.$ For example, to get 42 cents, Silas will choose a 25-cent coin, then a 10-cent coin, then 7 1-cent coins. However, this collection of 9 coins uses more coins than necessary to get a total of 42 cents; indeed, choosing 4 10-cent coins and 2 1-cent coins achieves the same total value with only 6 coins. In general, the greedy algorithm succeeds for a given $N$ if no other collection of 1-cent, 10-cent, and 25-cent coins gives a total value of $N$ cents using strictly fewer coins than the collection given by the greedy algorithm. Find the number of values of $N$ between $1$ and $1000$ inclusive for which the greedy algorithm succeeds.
48 replies
centslordm
Feb 13, 2025
sadas123
4 hours ago
Catch those negatives
cappucher   44
N 5 hours ago by Apple_maths60
Source: 2024 AMC 10A P11
How many ordered pairs of integers $(m, n)$ satisfy $\sqrt{n^2 - 49} = m$?

$
\textbf{(A) }1 \qquad
\textbf{(B) }2 \qquad
\textbf{(C) }3 \qquad
\textbf{(D) }4 \qquad
\textbf{(E) } \text{Infinitely many} \qquad
$
44 replies
cappucher
Nov 7, 2024
Apple_maths60
5 hours ago
k Gauging Interest - Mock MATHCOUNTS Nationals
BOGTRO   169
N Jan 29, 2012 by Binomial-theorem
I'm trying to gauge interest for a mock MATHCOUNTS National Competition. I'm starting to write one, but I'm not going to finish it unless there is some amount of interest. If you would be interested in taking this, post here or PM me please.

EDIT: And I'll probably need a proof-reader, if anyone is interested in that.
169 replies
BOGTRO
Mar 21, 2011
Binomial-theorem
Jan 29, 2012
Gauging Interest - Mock MATHCOUNTS Nationals
G H J
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
BOGTRO
5818 posts
#156 • 2 Y
Y by Adventure10, Mango247
Results:

applepi2000 defeats ksun48 4-3
mathocean advances by default. (Against luppleAoPS)
mathocean defeats dragon96 4-3
applepi2000 advances by default. (Against Iggy)
applepi2000 defeats mathocean97 to become the BOGTRO MOCK TEST CHAMPION.

E-mail me at bogtro123@gmail.com for prizes if applicable.
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AwesomeToad
4535 posts
#157 • 3 Y
Y by Adventure10, Mango247, and 1 other user
Darn ksun48

Darn.
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Iggy Iguana
246 posts
#158 • 1 Y
Y by Adventure10
Sorry for not making it.

Took a nap at 5:30 after JMO.
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
luppleAOPS
70 posts
#159 • 2 Y
Y by Adventure10, Mango247
did you say you were coming out with another test bogtro?
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
BOGTRO
5818 posts
#160 • 2 Y
Y by Adventure10, Mango247
Doubtfully. I expected to end this much earlier than I did.
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
g.c.boxd
181 posts
#161 • 2 Y
Y by Adventure10, Mango247
BOGTRO wrote:
17. Note that $2^{n+100}=2^n \pmod {1000}$
Umm why is this true? I know it is (using wolfram)... but why? Im probably missing something really stupid.....
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
BOGTRO
5818 posts
#162 • 2 Y
Y by Adventure10, Mango247
Since $2^{100} \equiv 0 \pmod 8$, it suffices to show that $2^{100} \equiv 1 \pmod {125}$, which is true, although not simple to prove (best method is to go to wolframalpha :P).
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
applepi2000
2226 posts
#163 • 2 Y
Y by Adventure10, Mango247
BOGTRO wrote:
Since $2^{100} \equiv 0 \pmod 8$, it suffices to show that $2^{100} \equiv 1 \pmod {125}$, which is true, although not simple to prove (best method is to go to wolframalpha :P).

Or, use the totient theorem, since $\Phi(125)=100$ gives $2^{100}\equiv 1\mod 125$.
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
dragon96
3212 posts
#164 • 2 Y
Y by Adventure10, Mango247
If you're doing MathCounts in the future, hopefully they won't add any questions about Euler's Theorem. However, you'll probably need it if you're planning on doing well on Olympiads in the future. Or BOGTRO's tests.
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
BOGTRO
5818 posts
#165 • 2 Y
Y by Adventure10, Mango247
Ha.

It's kind of one of those things you should know, that last two digits repeat every 20 and last 3 repeat every 100 (it's not that much more complicated than knowing that last digits repeat every 4).
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
g.c.boxd
181 posts
#166 • 1 Y
Y by Adventure10
BOGTRO wrote:
Since $2^{100} \equiv 0 \pmod 8$, it suffices to show that $2^{100} \equiv 1 \pmod {125}$, which is true, although not simple to prove (best method is to go to wolframalpha :P).

Ok yeah I get that part... but doesnt $2^{n+100}=2^n \pmod {1000}$ mean that $2^{100} \equiv 1 \pmod {1000}
$? Which obviously isnt true... what am I mistaken in thinking? Its probably really stupid...
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AIME15
7892 posts
#167 • 2 Y
Y by Adventure10, Mango247
$ad \equiv bd \pmod{m}$ does not imply that $a \equiv b \pmod{m}$. This only holds if $(d,m) = 1$.

More generally, $ad \equiv bd \pmod{m} \implies a \equiv b \pmod{(d,m)}$.
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Angry_Bird_010112
46 posts
#168 • 2 Y
Y by Adventure10, Mango247
hello, Why can't I see the target round problems 4-8???, Angry_Bird_010112
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
EuclidGenius
1180 posts
#169 • 2 Y
Y by Adventure10, Mango247
Please do not revive posts that are about 6 months old.
Z Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Binomial-theorem
3982 posts
#170 • 2 Y
Y by Adventure10, Mango247
Angry_Bird_010112, try re-downloading the file. The problems are in the file, so it has to do with something on your computer. Also
EuclidGenius wrote:
Please do not revive posts that are about 6 months old.
Locked.
Z Y
G
H
=
a