Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2005 AIME II Problems"

(→‎Problem 1)
Line 2: Line 2:
 
A game uses a deck of <math> n </math> different cards, where <math> n </math> is an integer and <math> n \geq 6. </math> The number of possible sets of 6 cards that can be drawn from the deck is 6 times the number of possible sets of 3 cards that can be drawn. Find <math> n. </math>
 
A game uses a deck of <math> n </math> different cards, where <math> n </math> is an integer and <math> n \geq 6. </math> The number of possible sets of 6 cards that can be drawn from the deck is 6 times the number of possible sets of 3 cards that can be drawn. Find <math> n. </math>
  
−
[[2005 AIME I Problems/Problem 1|Solution]]
+
[[2005 AIME II Problems/Problem 1|Solution]]
  
 
== Problem 2 ==
 
== Problem 2 ==

Revision as of 22:16, 8 July 2006

Problem 1

A game uses a deck of $n$ different cards, where $n$ is an integer and $n \geq 6.$ The number of possible sets of 6 cards that can be drawn from the deck is 6 times the number of possible sets of 3 cards that can be drawn. Find $n.$

Solution

Problem 2

For each positive integer k, let $S_k$ denote the increasing arithmetic sequence of integers whose first term is 1 and whose common difference is k. For example, $S_3$ is the squence $1,4,7,10 ...$. For how many values of k does $S_k$ contain the term 2005?

Solution

Problem 3

How many positive integers have exactly three proper divisors, each of which is less than 50?

Solution

Problem 4

The director of a marching band wishes to place the members into a formation that includes all of them and has no unfilled positions. If they are arranged in a square formation, there are 5 members left over. The director realizes that if he arranges the group in a formation with 7 more rows than columns, there are no members left over. Find the maximum number of members this band can have.

Solution

Problem 5

Robert has 4 indistinguishable gold coins and 4 indistinguishable silver coins. Each coin has an engraving of one face on one side, but not on the other. He wants to stack the eight coins on a table into a single stack so that no two adjacent coins are face to face. Find the number of possible distunguishable arrangements of the 8 coins.

Solution

Problem 6

Let $P$ be the product of nonreal roots of $x^4-4x^3+6x^2-4x=2005$. Find $\lfloor P \rfloor$

Solution

Problem 7

In quadrilateral $ABCD$, $BC=8$, $CD=12$, $AD=10$ and $m\angle A=m\angle B=60\circ$. Given that $AB=p+\sqrt{q}$, where p and q are positive integers, find $p+q$.

Solution

Problem 8

The equation $2^{333x-2}+2^{111x+2}=2^{222x+1}+1$ has three real roots. Given that their sum is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers, find $m+n$.

Solution

Problem 9

Twenty seven unit cubes are painted orange on a set of four faces so that two non-painted faces share an edge. The $27$ cubes are randomly arranged to form a $3\times 3\times 3$ cube. Given the probability of the entire surface area of the larger cube is orange is $\frac{p^a}{q^b r^c}$ where $p,q,$ and $r$ are distinct primes and $a,b,$ and $c$ are positive integers, find $a+b+c+p+q+r$.

Solution

Problem 10

Triangle $ABC$ lies in the Cartesian Plane and has an area of 70. The coordinates of $B$ and $C$ are $(12,19)$ and $(23,20),$ respectively, and the coordinates of $A$ are $(p,q).$ The line containing the median to side $BC$ has slope $-5$. Find the largest possible value of $p+q$.

Solution

Problem 11

A semicircle with diameter $d$ is contained in a square whose sides have length 8. Given the maximum value of $d$ is $m-\sqrt{n}$, find $m+n$.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2005_AIME_II_Problems&oldid=6433"