Happy Memorial Day! Please note that AoPS Online is closed May 24-26th.

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 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
[TEST RELEASED] OMMC Year 5
DottedCaculator   132
N 3 hours ago by MathCosine
Test portal: https://ommc-test-portal-2025.vercel.app/

Hello to all creative problem solvers,

Do you want to work on a fun, untimed team math competition with amazing questions by MOPpers and IMO & EGMO medalists? $\phantom{You lost the game.}$
Do you want to have a chance to win thousands in cash and raffle prizes (no matter your skill level)?

Check out the fifth annual iteration of the

Online Monmouth Math Competition!

Online Monmouth Math Competition, or OMMC, is a 501c3 accredited nonprofit organization managed by adults, college students, and high schoolers which aims to give talented high school and middle school students an exciting way to develop their skills in mathematics.

Our website: https://www.ommcofficial.org/

This is not a local competition; any student 18 or younger anywhere in the world can attend. We have changed some elements of our contest format, so read carefully and thoroughly. Join our Discord or monitor this thread for updates and test releases.

How hard is it?

We plan to raffle out a TON of prizes over all competitors regardless of performance. So just submit: a few minutes of your time will give you a great chance to win amazing prizes!

How are the problems?

You can check out our past problems and sample problems here:
https://www.ommcofficial.org/sample
https://www.ommcofficial.org/2022-documents
https://www.ommcofficial.org/2023-documents
https://www.ommcofficial.org/ommc-amc

How will the test be held?/How do I sign up?

Solo teams?

Test Policy

Timeline:
Main Round: May 17th - May 24th
Test Portal Released. The Main Round of the contest is held. The Main Round consists of 25 questions that each have a numerical answer. Teams will have the entire time interval to work on the questions. They can submit any time during the interval. Teams are free to edit their submissions before the period ends, even after they submit.

Final Round: May 26th - May 28th
The top placing teams will qualify for this invitational round (5-10 questions). The final round consists of 5-10 proof questions. Teams again will have the entire time interval to work on these questions and can submit their proofs any time during this interval. Teams are free to edit their submissions before the period ends, even after they submit.

Conclusion of Competition: Early June
Solutions will be released, winners announced, and prizes sent out to winners.

Scoring:

Prizes:

I have more questions. Whom do I ask?

We hope for your participation, and good luck!

OMMC staff

OMMC’S 2025 EVENTS ARE SPONSORED BY:

[list]
[*]Nontrivial Fellowship
[*]Citadel
[*]SPARC
[*]Jane Street
[*]And counting!
[/list]
132 replies
DottedCaculator
Apr 26, 2025
MathCosine
3 hours ago
Base 2n of n^k
KevinYang2.71   50
N Today at 1:39 AM by ray66
Source: USAMO 2025/1, USAJMO 2025/2
Let $k$ and $d$ be positive integers. Prove that there exists a positive integer $N$ such that for every odd integer $n>N$, the digits in the base-$2n$ representation of $n^k$ are all greater than $d$.
50 replies
KevinYang2.71
Mar 20, 2025
ray66
Today at 1:39 AM
[CASH PRIZES] IndyINTEGIRLS Spring Math Competition
Indy_Integirls   55
N Today at 1:28 AM by GallopingUnicorn45
[center]IMAGE

Greetings, AoPS! IndyINTEGIRLS will be hosting a virtual math competition on May 25,
2024 from 12 PM to 3 PM EST.
Join other woman-identifying and/or non-binary "STEMinists" in solving problems, socializing, playing games, winning prizes, and more! If you are interested in competing, please register here![/center]

----------

[center]Important Information[/center]

Eligibility: This competition is open to all woman-identifying and non-binary students in middle and high school. Non-Indiana residents and international students are welcome as well!

Format: There will be a middle school and high school division. In each separate division, there will be an individual round and a team round, where students are grouped into teams of 3-4 and collaboratively solve a set of difficult problems. There will also be a buzzer/countdown/Kahoot-style round, where students from both divisions are grouped together to compete in a MATHCOUNTS-style countdown round! There will be prizes for the top competitors in each division.

Problem Difficulty: Our amazing team of problem writers is working hard to ensure that there will be problems for problem-solvers of all levels! The middle school problems will range from MATHCOUNTS school round to AMC 10 level, while the high school problems will be for more advanced problem-solvers. The team round problems will cover various difficulty levels and are meant to be more difficult, while the countdown/buzzer/Kahoot round questions will be similar to MATHCOUNTS state to MATHCOUNTS Nationals countdown round in difficulty.

Platform: This contest will be held virtually through Zoom. All competitors are required to have their cameras turned on at all times unless they have a reason for otherwise. Proctors and volunteers will be monitoring students at all times to prevent cheating and to create a fair environment for all students.

Prizes: At this moment, prizes are TBD, and more information will be provided and attached to this post as the competition date approaches. Rest assured, IndyINTEGIRLS has historically given out very generous cash prizes, and we intend on maintaining this generosity into our Spring Competition.

Contact & Connect With Us: Email us at indy@integirls.org.

---------
[center]Help Us Out

Please help us in sharing the news of this competition! Our amazing team of officers has worked very hard to provide this educational opportunity to as many students as possible, and we would appreciate it if you could help us spread the word!
55 replies
Indy_Integirls
May 11, 2025
GallopingUnicorn45
Today at 1:28 AM
How Math WOOT Level 2 prepare you for olympiad contest
AMC10JA   0
Yesterday at 11:35 PM
I know how you do on Olympiad is based on your effort and your thinking skill, but I am just curious is WOOT level 2 is generally for practicing the beginner olympiad contest (like USAJMO or lower), or also good to learn for hard olympiad contest (like USAMO and IMO).
Please share your thought and experience. Thank you!
0 replies
AMC10JA
Yesterday at 11:35 PM
0 replies
No more topics!
Official Mock AMC Solutions Thread
samus   20
N Mar 21, 2005 by kaycubs
Since people may be wondering about the answers to some problems, why don't we put all of the detailed solutions on this thread. Some rules
-let's try to post in the general order of questions
-try to explain in as much detail as possible
-If anyone has any questions, lets post in another thread.
-Try to quote the question.

Here's questions 1-4:
1. A space diagonal of a polyhedron is a line that connects two vertices of the polyhedron that do not lie on the same face. How many space diagonals does a cube have?

(A) 0 (B) 2 (C) 4 (D) 8 (E) 28

Answer: Let us call the cube ABCDEFGH, ABCD being the face closer to us with A: top left corner, B: top right corner, C: bottom right corner, D:bottom left corner; EFGH being the face farther away from us with E: top left corner, F: top right corner, G: bottom right corner, H:bottom left corner. The space diagnolls have to be on opposite faces, left/right positions, and up/down positions. So the space diagnols are AG,BH, EC, and FD. There are 4, so the answer is: (C) 4.

2. Find the units digit of the product of the first 2004 odd primes.

(A) 1 (B) 3 (C) 5 (D) 7 (E) 9

Answer: The first odd prime numbers are 3,5,7,11,17..... The product of the first 3 prime #'s is 105, first 4 primes is 735, and so on. Therefore, from this pattern, we determine that the units dgit of the first 2004 odd primes will be 5. Another way to look at it: 5 times any number of odd #'s (such a 2003 more) will always have a unit digit of 5. Therefore the answer is: (C) 5.

3. The area of the triangle bounded by the lines y=x, y=-x, and y=6 is

(A) 12 (B) 12 :sqrt:2 (C) 24 (D) 24 :sqrt:2 (E) 36

Answer: The three intersection points of these lines are (0,0),(-6,6), and (6,6). This forms a triangle of height 6 (from a point (x,6) to (x,0)) and length (base) of 12 ((6,6)-(-6,6)=(12,0)). The area of a triangle is bh/2, so the area of this triangle is 12*6/2=36. Therefore the answer is: (E) 36.

4. How many odd positive integers between 1000 and 2000, inclusive, have all digits different?

(A) 224 (B) 280 (C) 504 (D) 512 (E) 729

Answer: This is a combanatorics/counting problem. There are 4 digits:_ _ _ _. We know that the thousands digit can only be 1 (2000 isn't odd). There are 4 possibilities for the units digit: one of the odd numbers 3,5,7,9 since 1 has already been used and we need all the digits different. The tens digit can have only 8 possibities from the 10 digits; 1 can't be used since it is used in the thousands digit, and another digit can't be used since it has already been used in the units place. The hundreds digit has 7 possibilities: 1 can't be used since it is used in the thousands digit, and another digit can't be used since it has already been used in the units place, and yet another digit can't be used since it has been used in the tens digit. We already know there is 1 possibility for the thousands digit: the number 1. Therefore the total number of possibilities for this number are 1 * 7 * 8 * 4 = 224. The answer is therefore: (A) 224.




Again: lets keep questions in order and POST YOUR ANSWERS!
20 replies
samus
Jul 24, 2004
kaycubs
Mar 21, 2005
Official Mock AMC Solutions Thread
G H J
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
samus
155 posts
#1 • 2 Y
Y by Adventure10, Mango247
Since people may be wondering about the answers to some problems, why don't we put all of the detailed solutions on this thread. Some rules
-let's try to post in the general order of questions
-try to explain in as much detail as possible
-If anyone has any questions, lets post in another thread.
-Try to quote the question.

Here's questions 1-4:
1. A space diagonal of a polyhedron is a line that connects two vertices of the polyhedron that do not lie on the same face. How many space diagonals does a cube have?

(A) 0 (B) 2 (C) 4 (D) 8 (E) 28

Answer: Let us call the cube ABCDEFGH, ABCD being the face closer to us with A: top left corner, B: top right corner, C: bottom right corner, D:bottom left corner; EFGH being the face farther away from us with E: top left corner, F: top right corner, G: bottom right corner, H:bottom left corner. The space diagnolls have to be on opposite faces, left/right positions, and up/down positions. So the space diagnols are AG,BH, EC, and FD. There are 4, so the answer is: (C) 4.

2. Find the units digit of the product of the first 2004 odd primes.

(A) 1 (B) 3 (C) 5 (D) 7 (E) 9

Answer: The first odd prime numbers are 3,5,7,11,17..... The product of the first 3 prime #'s is 105, first 4 primes is 735, and so on. Therefore, from this pattern, we determine that the units dgit of the first 2004 odd primes will be 5. Another way to look at it: 5 times any number of odd #'s (such a 2003 more) will always have a unit digit of 5. Therefore the answer is: (C) 5.

3. The area of the triangle bounded by the lines y=x, y=-x, and y=6 is

(A) 12 (B) 12 :sqrt:2 (C) 24 (D) 24 :sqrt:2 (E) 36

Answer: The three intersection points of these lines are (0,0),(-6,6), and (6,6). This forms a triangle of height 6 (from a point (x,6) to (x,0)) and length (base) of 12 ((6,6)-(-6,6)=(12,0)). The area of a triangle is bh/2, so the area of this triangle is 12*6/2=36. Therefore the answer is: (E) 36.

4. How many odd positive integers between 1000 and 2000, inclusive, have all digits different?

(A) 224 (B) 280 (C) 504 (D) 512 (E) 729

Answer: This is a combanatorics/counting problem. There are 4 digits:_ _ _ _. We know that the thousands digit can only be 1 (2000 isn't odd). There are 4 possibilities for the units digit: one of the odd numbers 3,5,7,9 since 1 has already been used and we need all the digits different. The tens digit can have only 8 possibities from the 10 digits; 1 can't be used since it is used in the thousands digit, and another digit can't be used since it has already been used in the units place. The hundreds digit has 7 possibilities: 1 can't be used since it is used in the thousands digit, and another digit can't be used since it has already been used in the units place, and yet another digit can't be used since it has been used in the tens digit. We already know there is 1 possibility for the thousands digit: the number 1. Therefore the total number of possibilities for this number are 1 * 7 * 8 * 4 = 224. The answer is therefore: (A) 224.




Again: lets keep questions in order and POST YOUR ANSWERS!
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
beta
3001 posts
#2 • 4 Y
Y by Adventure10, Adventure10, Adventure10, Mango247
Don't we already have a discussion thread??
5. For how many integer values of x will there be a non-degenerate triangle with distinct side lengths 11, 15, and x?

(A) 18 (B) 19 (C) 20 (D) 21 (E) 22

Solution: By Triangle Inequality, 11+15>x, or 26>x. By Triangle Inequality again, 11+x>15, x>15-11=4. Therefore 26>x>4. The total number of possiblity for x is 26-4-1=21. However, we included 11 and 15 in the 21 values of x. Thus 21-19=2, or B.

6. How many right triangles with integer side lengths are such that their side lengths are in a nonconstant geometric sequence?

(A) 0 (B) 1 (C) 2 (D) 4 (E) Infinitely many

Solution: Call the sides a b and c. Since they are in geom. progression they can be labeled like this: a, ar, and ar^2 respectively. For this to be a right triangle a^2+(ar)^2=(ar^2)^2 must be true.

Factor an a^2 from the left sides and divide by a^2 on both sides and we are left with 1+r^2=r^4. To find r we use quad form. and take the square root of it(when using quad form we find r^2 so we need to take the sq. root). You can find this and figure out it is irrational. But the sides must be integers. With integer sides and an irrational ratio there are no solutions.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
nr1337
1213 posts
#3 • 2 Y
Y by Adventure10, Mango247
Yay number 5!

5. For how many integer values of x will there be a non-degenerate triangle with distinct side lengths 11, 15, and x?

(A) 18 (B) 19 (C) 20 (D) 21 (E) 22

First we look for x such that 11 + x > 15 and x <= 15. Thus x > 4 from our first inequality, so the minimum x is 5. Next we look for 11+15 > x. So 26 > x, and the maximum x is 25. There are 25-5+1 = 21 numbers between 5 and 25 inclusive BUT WAIT! The problem said DISTINCT side lengths! Thus 11 and 15 don't work for x, so we subtract 2. 21 - 2 = 19, thus our answer is B.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
JSRosen3
335 posts
#4 • 2 Y
Y by Adventure10, Mango247
nr1337 wrote:
BUT WAIT! The problem said DISTINCT side lengths!

<Evil cackle> :twisted:

Only 6 people got this right!!! :(
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
joml88
6343 posts
#5 • 2 Y
Y by Adventure10, Mango247
7. 7. A box contains 11 marbles, numbered 1, 2, 3, ... , 11. If 6 marbles are drawn simultaneously at random, and the probability that the sum of the numbers drawn is odd is D/Q, with D and Q relatively prime positive integers, find D + Q.

(A) 3 (B) 17 (C) 331 (D) 346 (E) 349


First note that:
Even+Even=even, Even+Odd=odd, and Odd+odd=even and that we have 6 odds and 5 evens in our set of numbers.

We are going to try to find the number of times that it makes it odd over the total number of times. You can choose 6 from a group of 11 in \[{11\choose 6}=462\]

Now to find how many ways it will be even we break it into cases.

1st case- 6 evens... this doesn't create an odd

2nd-5 evens and 1 odd...this creates odd numbers. There is one way to get 5 evens and 6 to get an odd making 6 total ways.

3rd-4 evens 2 odd... none

4th-3 even 3 odds... this works. 10 ways to choose 3 odds and 20 for the evens, 200 ways

5th-2 evens 4 odds...none.

6th-1 even 5 odds... works. 5 ways for the evens and 6 for the odds 30.

So we have $\frac{200+30+6}{462}=\frac{118}{231}$.

D+Q=349 (E)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
beta
3001 posts
#6 • 2 Y
Y by Adventure10, Mango247
7. A box contains 11 marbles, numbered 1, 2, 3, ... , 11. If 6 marbles are drawn simultaneously at random, and the probability that the sum of the numbers drawn is odd is
\frac{D}{Q}
, with D and Q relatively prime positive integers, find D + Q.

(A) 3 (B) 17 (C) 331 (D) 346 (E) 349

Solution: There are 6 odd numbers and 5 even numbers. If the sum of the six numbers chosen is odd, then we have 3 cases:
1)5 odd and 1 even
2) 3 odd and 3 even
3) 1 odd and 5 even.
In case 1), the total number of ways to get the result is (6C5)(5C1)
In case 2), the total number of ways to get the result is (6C3)(5C3)
In case 3), the total number of ways to get the result is (6C1)(5C5)
Thus, the total number of way of getting the sum of 6 numbers odd is
(6C5)(5C1)+(6C3)(5C3)+(6C1)(5C5)=236
The total number of ways to draw 6 marbles simultaneously is 11C6
The probability is 236/11C6=118/231. 118+231=349, the answer is E.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
beta
3001 posts
#7 • 2 Y
Y by Adventure10, Mango247
8. Find the number of integers
k
such that
k^3 + k^2 + k + 7
is divisible by
k+1
.

(A) 2 (B) 4 (C) 6 (D) 8 (E) Infinitely many

Solution:$k^3+k^2+k+7$ must be divisible by $k+1$, so divide it to get $\displaystyle k^2+1+\frac{6}{k+1}$. If it's divisible, that will have to be an integer, meaning $k+1|6$. From this, we see $\pm(k+1)\in \{1,2,3,6\}$ So there are 8 possible values, 1, 2, 5, 0, -2, -3, -4, -7 for k, and the answer is d.

9. Circle A is inscribed in an isosceles right triangle and circle B is circumscribed about the same triangle. The ratio of the area of circle A to the area of circle B is

(A)
\frac{1}{2}
(B)
3 - \sqrt{2}
(C)
3 + \sqrt{2}
(D)
3 - 2\sqrt{2}
(E)
3 + 2\sqrt{2}


Solution: Without Loss of generality let the length of the leg of right triangle be 1. Thus the length of the hypotenuse is $\sqrt2$.Since the center of the circumscribed circle of a right triangle is the midpoint of the hypotenuse of the right triangle. The length of the circumradius is $\frac{\sqrt2}{2}$. Now note that the area of the triangle is $1(1)/2=\frac{1}{2}=rs$, where r is the inradius, and s is the semiperimeter. The semiperimeter=$\frac{1+1+\sqrt2}{2}$. Thus the inradius$=\frac{1}{2}/ \frac{2+\sqrt2}{2}=\frac{1}{2+\sqrt2}$. Inradius: Circumradius=$\frac{1}{2+\sqrt2}:\frac{\sqrt2}{2}=\frac{\sqrt2}{2+\sqrt2}=\sqrt 2-1$. Ratio of area=ratio of radius^2
=$(\sqrt 2-1)^2=3-2\sqrt2$, or D
This post has been edited 1 time. Last edited by beta, Jul 25, 2004, 2:33 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
kool_dudy
303 posts
#8 • 2 Y
Y by Adventure10, Mango247
Thx to all solution posters.

This is what a getting started problem solver needs.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
joml88
6343 posts
#9 • 2 Y
Y by Adventure10, Mango247
10. A box contains 2 pennies, 4 nickels, and 6 dimes. Six coins are drawn randomly and without replacement. Given that the probability that the value of the coins drawn is at least 50 cents is m/n, with m and n relatively prime positive integers, find m + n.

(A) 961 (B) 1015 (C) 1051 (D) 1056 (E) None of these


The total number of ways to choose 6 is . We are left with finding how many ways to get 50 or over.

We can have
dddddd
dddddn
dddddp or
ddddnn
There is one way to get the first case.

For the second case you can chose the 5 d's in ways and the n in 4 ways(since order doesn't matter). So we have 6*4=24 ways for this case.

For case 3, the d's can be chosen in 6 again. The p can be chosen in 2 which means there are 12 for this case.

For the last case, the d's can be picked in ways and the n's in ${4\choose 2}=6$ ways. This makes 90 ways.

So the answer is 127/924. m+n= 1051 (C)

11. 11. Given that $i^2=-1$, for how many integers n is $(n+i)^4$ an integer?

(A) 0 (B) 1 (C) 2 (D) 3 (E) 4

Expanding the binomial we get
\[n^4+4n^3i+6n^2i^2+4ni^3+i^4=n^4+4n^3i-6n^2-4ni+1\]

Taking away the parts that we know are integers we are left with:
\[4n^3i-4ni=4ni(n+1)(n-1)\]
This is only an integer when it is 0. so $n\in \{-1,0,1\}$. (D)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
JSRosen3
335 posts
#10 • 2 Y
Y by Adventure10, Mango247
Pork_Chop8 wrote:
5. I missed the distinct part. Great trick, evil problem writer. :lol:

Hey, I resent that... ;)

Only 6 people out of 29 got that one right.

Also, I think this thread was intended have the solutions in order of the questions...so you may want to edit your post, or move it to the other discussion thread where solutions are not being discussed in order.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
beta
3001 posts
#11 • 2 Y
Y by Adventure10, Mango247
12. A quadrilateral circumscribed about a circle has three of its side lengths 132, 162, and 201. What is the positive difference between the minimum and maximum lengths for the fourth side?

(A) 60 (B) 78 (C) 93 (D) 138 (E) 231

Solution:
Lemma: If a circle can be inscribed in a quadrilateral ABCD, then AB+CD=AD+BC, so AD=AB+CD-BC.
Proof: Let the circle be tangent at AB, BC, CD, AD at W, X, Y, Z respectively.
Thus AW=AZ, BW=BX, CY=CX, DY=DZ. Add all the equations up yields
AB+CD=BC+AD as desired.
Therefore, let AD be the fourth side, AD is at minimum when AB+CD=132+162=294, and BC=201. AD=294-201=93.
AD is at maximum when AB+CD=201+162=363, BC=132. AD=363-132=231.
Thus 231-93=138, or D.

13. For how many primes
p
is
p^4 + p^5
the square of an integer?

(A) 0 (B) 1 (C) 2 (D) 3 (E) Infinitely many

Solution: First we factor \[p^4(p+1)\].
So we need the square root of this to be an integer. $p^4$ will come out of the square so we are left with finding were $\sqrt{p+1}$ is an integer. In other words we want \[p+1=a^2\] where a is an integer.

Subtract by one on both sides and factor to get \[p=(a+1)(a-1)\] Wait a minute a prime is only divisible by one and itself. So this could only work when a-1=1. this makes p=3 and 3 is prime so we only have one solution, or B
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
beta
3001 posts
#12 • 2 Y
Y by Adventure10, Mango247
14. If
x
,
y
, and
z
are positive numbers satisfying
x + \frac{1}{y} = 4
,
y + \frac{1}{z} = 1
, and
z + \frac{1}{x} = \frac{7}{3}
, then find
xyz
.

(A)
\frac{2}{3}
(B)
1
(C)
\frac{4}{3}
(D)
2
(E)
\frac{7}{3}


Solution: $(x+\frac{1}{y})(y+\frac{1}{z}) (z+\frac{1}{x})$
$=xyz+x+y+z+\frac{1}{x}+\frac{1}{y}+\frac{1}{z}+\frac{1}{xyz}$
$=\frac{28}{3}$

Since
$x+y+z+\frac{1}{x}+\frac{1}{y}+\frac{1}{z}$
$=(x+\frac{1}{y})+ (y+\frac{1}{z})+(z+\frac{1}{x})$
$=\frac{22}{3}$
Sub that in, and let $xyz=k$
$k+\frac{1}{k}+\frac{22}{3}=\frac{28}{3}$
$3k^2-6k+3=0$
$(k-1)^2=0$
$k=1$, or B.

15. If
\frac{\pi}{2} < \alpha < \frac{3\pi}{4}
,
\cos{\alpha} + \sin{\alpha} = \frac{1}{3}
, and
\left|\cos{2\alpha} + \sin{2\alpha}\right|= \frac{n + \sqrt{p}}{q}
, where
n
,
p
, and
q
are relatively prime positive integers and
p
is not divisible by the square of any prime, find
n+p+q
.

(A) 34 (B) 35 (C) 36 (D) 37 (E) 38

Solution: $(\sin{\alpha}+\cos{\alpha})^2$
$=(\sin^2{\alpha}+\cos^2{\alpha})+2\sin{\alpha}\cos{\alpha}$
$=1+\sin{2\alpha}$
$=\frac{1}{9}$
Solve for $\sin{2\alpha}$
to get $\sin{2\alpha}=-\frac{8}{9}$
$\cos{2\alpha}=\pm \sqrt{1-(\frac{8}{9})^2}$
$=\pm \frac{\sqrt{17}}{9}$
Because of our restrictions, $\cos{2\alpha}$ is negative
$=-\frac{\sqrt{17}}{9}$
absolute value of $\cos{2\alpha}+\sin{2\alpha}=\frac{\sqrt{17}+8}{9}$
17+8+9=34, or A.

16. If
r_1
,
r_2
, and
r_3
are the solutions to the equation
x^3 - 4x^2 - 4x + 17 = 0
, find
r_1^3 + r_2^3 + r_3^3
.

(A) -68 (B) -4 (C) 0 (D) 61 (E) 68

Solution:First off, rename $ r_1=a; r_2=b; r_3=c $(so that you don't get all the r's confused). Since they are solutions to the equation, the equation $x^3-4x^2-4x+17=(x-a)(x-b)(x-c)$. Expanding the right side gives $x^3-(a+b+c)x^2+(ab+bc+ac)x-abc=0$. Therefore, $a+b+c=4; abc=-17$; $ab+bc+ac=-4$. Now take $a+b+c=4$ and multiply both sides by (a+b+c), giving $a^2+b^2+c^2+ab+ac+bc=16$. Replace $ab+ac+bc$ with -8, swing the -8 to the other side, then multiply both sides by $(a+b+c)$ again. Now you have (with a little bit of simplification):
$a^3+b^3+c^3+a(ab+ac)+b(ab+bc)+c(ac+bc)=96$
Change the equation we already had to ab+ac=-4-bc and put that into the equation we have, then repeat for the other two with the other variables. It now looks like this:
$a^3+b^3+c^3+a(-4-bc)+b(-4-ac)+c(-4-ab)=96$ which is equivalent to this:
$a^3+b^3+c^3-4(a+b+c)-3abc=96$ Substituting from our equations for a, b, and c, gives us $a^3+b^3+c^3-16+51=96$; therefore, $a^3+b^3+c^3=61$ and the answer is (D).

17. Find
\sum_{k=0}^{49} (-1)^k  {99 \choose 2k}
.

(A)
 
(B)
-2^{49}
(C)
2^{49}
(D)
-2^{50}
(E)
2^{50}


Solution:Note that
$(1-i)^{99}=1-{99 \choose 1}i-{99 \choose 2}+ {99 \choose 3}i+{99 \choose 4}.....$
$=\displaystyle\sum_{k=0}^{49} (-1)^k {99 \choose 2k}+i\sum_{k=0}^{49} (-1)^k {99 \choose {2k+1}}$
And $1=-(\sqrt2)(\cos\frac{3\pi}{4}), -1=-(\sqrt2)(\sin\frac{3\pi}{4})$
By DeMorvie's Theorem
$(1-i)^{99}=-((\sqrt2)(\cos\frac{3\pi}{4})+i(\sqrt2)(\sin\frac{3\pi}{4}))^{99}
=-(\sqrt2)^{99}(\cos\frac{(99)(3)\pi}{4}+i(\sin\frac{(99)(3)\pi}{4}))$
Thus
$\displaystyle\sum_{k=0}^{49} (-1)^k {99 \choose 2k}$
$=-(\sqrt2)^{99}(\cos\frac{297\pi}{4})$
$=-2^{49}(\sqrt2)(\cos\frac{\pi}{4})$
$=-2^{49}$, or B.

That took A LOT of Copy and Paste. :)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
joml88
6343 posts
#13 • 2 Y
Y by Adventure10, Mango247
18. A rising number is a positive integer, each digit of which is larger than each of the digits to its left, and no digit of which is 0. For example, 12689 is a rising number. When all five-digit rising numbers are listed from smallest to largest, the 97th number in the list does not contain the digit

(A) 4 (B) 5 (C) 6 (D) 7 (E) 8



The smallest is 12345. With 4 as the second number we have 5 that work(i.e.12345,12346,12347,12348,12349).
If we keep the first 3 the same and keep increasing the second number by 1 we will get 4, 3, 2 ,and 1 that work for each one. Therefore there are 5+4+3+2+1=15 rising numbers of the form 123_ _ . Continuing in this way we find that there are 4+3+2+1=10 rising numbers of the form 124_ _. 6 with a 5 in the third, 3 with a 6 and 1 with a 7. This makes 35 of the form 12_ _ _. For 13_ _ _ there are 4+3+2+1 + 3+2+1 + 2+1 + 1= 20. For 14_ _ _ we have 10. For 15_ _ _ there are 4. For 16_ _ _ there is 1. This makes a grand total of 70.
For 2 as the first number we do the same thing. We find that 24589 is the 96 so 24678 is the 97. This doesn't contain a 5 so (B)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
kool_dudy
303 posts
#14 • 2 Y
Y by Adventure10, Mango247
Joml, I understood your solution. Thx.

I got one question though. How do you know that 24589 is the 96th number in that pattern?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
confuted
711 posts
#15 • 2 Y
Y by Adventure10, Mango247
kool_dudy wrote:
Joml, I understood your solution. Thx.

I got one question though. How do you know that 24589 is the 96th number in that pattern?
Get as close as you can with the method he used up to 70, and then list the rest.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Ultimatemathgeek
111 posts
#16 • 2 Y
Y by Adventure10, Mango247
Thanks every one
More solutions please
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
beta
3001 posts
#17 • 2 Y
Y by Adventure10, Mango247
19.
\bigtriangleup ABC
has all side lengths distinct. Two altitudes of this triangle have lengths 4 and 12. If the length of the third altitude is also an integer, find its maximum value.

(A) 4 (B) 5 (C) 6 (D) 7 (E) None of these

Solution: Let the length of AB be a, BC be 1, AC be c. Let the altitude of length 4 and 12 be opposite to AB and BC respectively. Let the length of the third altitude be h. The area of ABC=base*altitude/2 $=\frac{4a}{2}=\frac{12}{2}=\frac{hc}{2}$. Multiply by 2 yields 4a=12=hc, thus a=3
Since AB, BC, AC must satisfy triangle inequality, c+1>3, c>2. Since hc=12,
h<6. The maximum integral value of h is 5, or (B).
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
beta
3001 posts
#18 • 2 Y
Y by Adventure10, Mango247
20. It is given that
(\log_z{3})(\log_x{3})+ (\log_y{3})(\log_x{3}) + (\log_y{3})(\log_z{3}) = 6(\log_z{3})(\log_x{3})(\log_y{3})
and
x<y<z
. If
x
,
y
, and
z
are in a geometric sequence with common ratio 2, and
x + y + z = \frac{m}{n}
, with m and n relatively prime positive integers, find
m + n
.

(A) 61 (B) 62 (C) 63 (D) 64 (E) 65

Solution: Note that $(\log_m{n})(\log_n{m})=1, \log_m{n}=\frac{1}{\log_n{m}}$. Divide both side of the original equation by $(\log_z{3})(\log_x{3})(\log_y{3})$ we have $\frac{1}{\log_y{3}}+\frac{1}{\log_z{3}}+\frac{1}{\log_x{3}}=6$, or $\log_3{y}+\log_3{z}+\log_3{x}=6$,
$\log_3{xyz}=6$, which yields $xyz=3^6=729$. Since x, y, z are in geometric squence of common ratio 2, y=2x, z=2y=4x. xyz=8x^3=729, solve for x yields $x=\frac{9}{2}$. $x+2x+4x=7x=\frac{63}{2}$. m+n=63+2=65, or (E).
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Ultimatemathgeek
111 posts
#19 • 2 Y
Y by Adventure10, Mango247
Where can I find the solutions for the rest of the test? Please, I need this.
I appreciate it
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
kaycubs
5 posts
#20 • 2 Y
Y by Adventure10, Mango247
22. Find the number of distinct pairs of integers (x, y) such that 0<x<y and sqrt{1984} =sqrt{x} +sqrt{y}

(A) 0 (B) 1 (C) 3 (D) 4 (E) 7



you have to factor out 1984 which is 2^6*31
root(1984) simplifies to 8root(31)



x has to be 31 and that multiplied by a perfect square for root(X) and root(y) to have a common factor of root 31

when x is 31*1, the other number is (8-root(1))squared*31 which is 49*31 and is 1519
(31,1519) is another solution

then you find the next perfect square

when x is 31*4, the other number is (8-root(4))squared*31 which is 36*31 and is 1116
(124,1116) is another solution

when x is 31*9, the other number is (8-root(9))squared*31 which is 25*31 and is 775
(279,775) is another solution

you can do this for the next perfect square until you realize that x and y will be the same in that

therefore:
(279,775),(124,1116), and (31,1519) are the 3 ordered pairs that work

the answer is (C). or 3

p.s. sorry for first response, i felt i had to correct myself
This post has been edited 4 times. Last edited by kaycubs, Mar 21, 2005, 3:14 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
kaycubs
5 posts
#21 • 2 Y
Y by Adventure10, Mango247
:( sorry, i didnt know calculators werent allowed, look back up for the non- calculator solution :P
Z K Y
N Quick Reply
G
H
=
a