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 "2000 PMWC Problems"

(→‎Problem I8)
m (→‎Problem I7)
 
(11 intermediate revisions by one other user not shown)
Line 1: Line 1:
 
== Problem I1 ==
 
== Problem I1 ==
 +
<math>y</math> is a number that has <math>8</math> different factors (including the number <math>1</math> and itself). What is the smallest possible value of <math>y</math>?
  
 
[[2000 PMWC Problems/Problem I1|Solution]]
 
[[2000 PMWC Problems/Problem I1|Solution]]
  
 
== Problem I2 ==
 
== Problem I2 ==
 +
As far as we know, the greatest prime number is <math>2^{6972593}-1</math>. What is the remainder when <math>2^{6972593}-1</math> is divided by <math>5</math>?
  
 
[[2000 PMWC Problems/Problem I2|Solution]]
 
[[2000 PMWC Problems/Problem I2|Solution]]
  
 
== Problem I3 ==
 
== Problem I3 ==
 +
How many whole numbers less than <math>1000</math> contain at least one <math>2</math> but no <math>3</math>?
  
 
[[2000 PMWC Problems/Problem I3|Solution]]
 
[[2000 PMWC Problems/Problem I3|Solution]]
  
 
== Problem I4 ==
 
== Problem I4 ==
 +
Given that <math>A^4=75600\times B</math>. If <math>A</math> and <math>B</math> are positive integers, find the smallest value of <math>B</math>.
  
 
[[2000 PMWC Problems/Problem I4|Solution]]
 
[[2000 PMWC Problems/Problem I4|Solution]]
  
 
== Problem I5 ==
 
== Problem I5 ==
 +
In a language college, <math>72\%</math> students can speak Chinese, <math>65\%</math> students can speak English, and <math>10\%</math> students can speak neither Chinese nor English. Find the percentage of students who can speak both Chinese and English.
  
 
[[2000 PMWC Problems/Problem I5|Solution]]
 
[[2000 PMWC Problems/Problem I5|Solution]]
  
 
== Problem I6 ==
 
== Problem I6 ==
 +
<math>p</math> is the product of two <math>4</math>-digit numbers formed by the digits <math>1,2,3,4,5,6,7,8</math> without any repetition. Find the largest value of <math>p</math> in the form of <math>\Box\Box\Box\Box\times\Box\Box\Box\Box</math>. (You are not required to multiply the numbers).
  
 
[[2000 PMWC Problems/Problem I6|Solution]]
 
[[2000 PMWC Problems/Problem I6|Solution]]
  
 
== Problem I7 ==
 
== Problem I7 ==
 +
<math>a</math> and <math>b</math> are two numbers that have prime factors <math>3</math> and <math>5</math> only. <math>a</math> has <math>12</math> factors (<math>1</math> and itself are included), <math>b</math> has <math>10</math> factors (<math>1</math> and itself are included), and their HCF (Highest Common Factor) is <math>75</math>. What is the LCM (Least Common Multiple) of <math>a</math> and <math>b</math>?
  
 
[[2000 PMWC Problems/Problem I7|Solution]]
 
[[2000 PMWC Problems/Problem I7|Solution]]
  
 
== Problem I8 ==
 
== Problem I8 ==
 +
A circle and a triangle are placed on intersections of the grid. The circle and the triangle are not allowed to lie on the same vertical and horizontal line. How many total possible ways are there of placing the circle and the triangle? (the following is an example).
  
 
<asy>
 
<asy>
Line 42: Line 50:
 
}
 
}
 
filldraw(Circle((0,3),0.3),white);
 
filldraw(Circle((0,3),0.3),white);
−
filldraw((2-0.3*cos(pi/2),1+0.3*sin(pi/2))--(2-0.3*cos(7pi/6),1+0.3*sin(7pi/6))--(2-0.3*cos(11pi/6),1+0.3*sin(11pi/6))--cycle,white);</asy>
+
filldraw((2-0.3*cos(pi/2),1+0.3*sin(pi/2))--(2-0.3*cos(7pi/6),1+0.3*sin(7pi/6))--(2-0.3*cos(11pi/6),1+0.3*sin(11pi/6))--cycle,white);
 +
//Credit to chezbgone2 for the diagram</asy>
 
[[2000 PMWC Problems/Problem I8|Solution]]
 
[[2000 PMWC Problems/Problem I8|Solution]]
  
 
== Problem I9 ==
 
== Problem I9 ==
 +
Using only odd digits, all possible three-digit numbers are formed. Determine the sum of all such numbers.
  
 
[[2000 PMWC Problems/Problem I9|Solution]]
 
[[2000 PMWC Problems/Problem I9|Solution]]
  
 
== Problem I10 ==
 
== Problem I10 ==
 +
In the sum <math>\frac{a}{b}+\frac{c}{d}</math>, each letter represents a distinct digit from <math>1</math> to <math>9</math>. The sum is as close as possible to <math>1</math> without being greater than or equal to <math>1</math>. What is the sum?
  
 
[[2000 PMWC Problems/Problem I10|Solution]]
 
[[2000 PMWC Problems/Problem I10|Solution]]
  
 
== Problem I11 ==
 
== Problem I11 ==
 +
You have a pack of cards, among which are <math>20</math> red, <math>20</math> yellow, <math>20</math> green and <math>10</math> blue ones. How many cards would you need to draw out to ensure that you have <math>12</math> cards of the same colour?
  
 
[[2000 PMWC Problems/Problem I11|Solution]]
 
[[2000 PMWC Problems/Problem I11|Solution]]
  
 
== Problem I12 ==
 
== Problem I12 ==
 +
During the rest hour, one of five students (<math>A</math>, <math>B</math>, <math>C</math>, <math>D</math>, and <math>E</math>) dropped a glass of water. The following are the responses of the children when the teacher questioned them:
 +
 +
*<math>A</math>: It was <math>B</math> or <math>C</math> who dropped it.
 +
*<math>B</math>: Neither <math>E</math> nor I did it.
 +
*<math>C</math>: Both <math>A</math> and <math>B</math> are lying.
 +
*<math>D</math>: Only one of <math>A</math> or <math>B</math> is telling the truth.
 +
*<math>E</math>: <math>D</math> is not speaking the truth.
 +
 +
The class teacher knows that three of them NEVER lie while the other two ALWAYS lie. Who dropped the glass?
  
 
[[2000 PMWC Problems/Problem I12|Solution]]
 
[[2000 PMWC Problems/Problem I12|Solution]]
  
 
== Problem I13 ==
 
== Problem I13 ==
 +
In the figure, the squares <math>ABCD</math> and <math>DCEG</math> both have the same area of <math>64cm^2</math>. <math>EFG</math> is a semicircle. The point <math>F</math> is the mid-point of the arc <math>EFG</math>. Find the area of the shaded part. (Assume <math>\pi=3.14</math>)
 +
 +
<asy>
 +
void unitsquare(pair p){
 +
draw(p--(p.x+1,p.y)--(p.x+1,p.y+1)--(p.x,p.y+1)--cycle);
 +
return;
 +
}
 +
fill(buildcycle(arc((2,0.5),(2,0),(2,1)),(2,1)--(0,1)--(2.5,0.5)),gray);
 +
unitsquare((0,0));
 +
draw((1,0)--(2,0)--(2,1)--(1,1));
 +
draw(arc((2,0.5),(2,0),(2,1)));
 +
label("$A$",(0,1),NW);
 +
label("$B$",(0,0),SW);
 +
label("$C$",(1,0),S);
 +
label("$D$",(1,1),N);
 +
label("$E$",(2,0),S);
 +
label("$F$",(2.5,0.5),E);
 +
label("$G$",(2,1),N);
 +
//Credit to chezbgone2 for the diagram</asy>
  
 
[[2000 PMWC Problems/Problem I13|Solution]]
 
[[2000 PMWC Problems/Problem I13|Solution]]
  
 
== Problem I14 ==
 
== Problem I14 ==
 +
A copy machine has a following enlargement/reduction buttons:
 +
 +
<cmath>\begin{tabular}{|l|l|l|l|l|l|l|}
 +
\hline
 +
250\% & 200\% & 128\% & 125\% & 100\% & 50\% & 10\% \\ \hline
 +
\end{tabular}</cmath>
 +
 +
The buttons <math>\boxed{50\%}</math>, <math>\boxed{100\%}</math>, and <math>\boxed{250\%}</math> are out of order and cannot be used any more. Sam wants to make a copy that is the same size as the original document by using the remaining buttons. When he presses a button, he has to pay <math>\textdollar 1</math>. What is the minimum amount he has to pay?
  
 
[[2000 PMWC Problems/Problem I14|Solution]]
 
[[2000 PMWC Problems/Problem I14|Solution]]
  
 
== Problem I15 ==
 
== Problem I15 ==
 +
The sum of several positive integers is <math>20</math>. Find the largest product that can be formed by these integers.
  
 
[[2000 PMWC Problems/Problem I15|Solution]]
 
[[2000 PMWC Problems/Problem I15|Solution]]
  
 
== Problem T1 ==
 
== Problem T1 ==
 +
A box contains <math>4000</math> to <math>6000</math> candies. When the candies are evenly distributed to <math>5</math>, <math>6</math>, <math>7</math>, <math>8</math>, or <math>9</math> children, there is always one candy left. If the candies are packaged into small bags each having the same number of candies, what is the largest number of candies below <math>4000</math> in each bag so that no candies are left?
  
 
[[2000 PMWC Problems/Problem T1|Solution]]
 
[[2000 PMWC Problems/Problem T1|Solution]]
  
 
== Problem T2 ==  
 
== Problem T2 ==  
 +
A <math>5 \times 5 \times 5</math> cube is formed using <math>1 \times 1 \times 1</math> cubes. A number of the smaller cubes are removed by punching out the 15 designated columns from front to back, top to bottom, and side to side. Find the number of smaller cubes that remain.
 +
 +
<asy>
 +
import three;
 +
currentprojection=orthographic(1,1/2,0.4);
 +
draw(surface((5,1,1)--(5,1,2)--(5,2,2)--(5,2,1)--cycle),black,nolight);
 +
draw(surface((5,1,3)--(5,1,4)--(5,2,4)--(5,2,3)--cycle),black,nolight);
 +
draw(surface((5,3,1)--(5,3,2)--(5,4,2)--(5,4,1)--cycle),black,nolight);
 +
draw(surface((5,3,3)--(5,3,4)--(5,4,4)--(5,4,3)--cycle),black,nolight);
 +
draw(surface((5,2,2)--(5,2,3)--(5,3,3)--(5,3,2)--cycle),black,nolight);
 +
draw(surface((1,5,1)--(1,5,2)--(2,5,2)--(2,5,1)--cycle),black,nolight);
 +
draw(surface((1,5,3)--(1,5,4)--(2,5,4)--(2,5,3)--cycle),black,nolight);
 +
draw(surface((3,5,1)--(3,5,2)--(4,5,2)--(4,5,1)--cycle),black,nolight);
 +
draw(surface((3,5,3)--(3,5,4)--(4,5,4)--(4,5,3)--cycle),black,nolight);
 +
draw(surface((2,5,2)--(2,5,3)--(3,5,3)--(3,5,2)--cycle),black,nolight);
 +
draw(surface((1,1,5)--(1,2,5)--(2,2,5)--(2,1,5)--cycle),black,nolight);
 +
draw(surface((1,3,5)--(1,4,5)--(2,4,5)--(2,3,5)--cycle),black,nolight);
 +
draw(surface((3,1,5)--(3,2,5)--(4,2,5)--(4,1,5)--cycle),black,nolight);
 +
draw(surface((3,3,5)--(3,4,5)--(4,4,5)--(4,3,5)--cycle),black,nolight);
 +
draw(surface((2,2,5)--(2,3,5)--(3,3,5)--(3,2,5)--cycle),black,nolight);
 +
for(int i = 0; i <= 5; ++i) draw((i,0,5)--(i,5,5));
 +
for(int i = 0; i <= 5; ++i) draw((0,i,5)--(5,i,5));
 +
for(int i = 0; i <= 5; ++i) draw((5,i,0)--(5,i,5));
 +
for(int i = 0; i <= 5; ++i) draw((5,0,i)--(5,5,i));
 +
for(int i = 0; i <= 5; ++i) draw((i,5,0)--(i,5,5));
 +
for(int i = 0; i <= 5; ++i) draw((0,5,i)--(5,5,i));
 +
//Credit to chezbgone2 for the diagram</asy>
  
 
[[2000 PMWC Problems/Problem T2|Solution]]
 
[[2000 PMWC Problems/Problem T2|Solution]]
  
 
== Problem T3 ==
 
== Problem T3 ==
 +
In the figure, <math>ABCD</math> is a square, <math>P</math>, <math>Q</math>, <math>R</math>, and <math>S</math> are midpoints of the sides <math>AB</math>, <math>BC</math>, <math>CD</math> and <math>DA</math> respectively. Find the ratio of the shaded area to the area of the square <math>ABCD</math>.
  
 +
<asy>
 +
fill(buildcycle((0,2)--(1,0),(2,2)--(0,1),(2,0)--(1,2),(0,0)--(2,1)),gray);
 +
draw((0,0)--(2,0)--(2,2)--(0,2)--cycle);
 +
draw((0,2)--(1,0));
 +
draw((2,2)--(0,1));
 +
draw((2,0)--(1,2));
 +
draw((0,0)--(2,1));
 +
label("A",(0,2),NW);
 +
label("B",(2,2),NE);
 +
label("C",(2,0),SE);
 +
label("D",(0,0),SW);
 +
label("P",(1,2),N);
 +
label("Q",(2,1),E);
 +
label("R",(1,0),S);
 +
label("S",(0,1),W);
 +
//Credit to chezbgone2 for the diagram</asy>
 
[[2000 PMWC Problems/Problem T3|Solution]]
 
[[2000 PMWC Problems/Problem T3|Solution]]
  
 
== Problem T4 ==  
 
== Problem T4 ==  
 +
Use the four colours red, yellow, blue and green to fill in the regions of the following diagram so that the adjacent regions are not the same colour. How many different ways are there to colour the regions?
  
 +
<asy>
 +
import geometry;
 +
draw((0,0)--(3,0)--(3,2)--(0,2)--cycle);
 +
draw((0,1)--(1.5,2));
 +
draw((2.3,0)--(2.3,0.7)--(3,0.7));
 +
draw(ellipse((1.5,1),0.6,0.5));
 +
//Credit to chezbgone2 for the diagram</asy>
 
[[2000 PMWC Problems/Problem T4|Solution]]
 
[[2000 PMWC Problems/Problem T4|Solution]]
  
 
== Problem T5 ==
 
== Problem T5 ==
 +
Each of <math>20</math> children ranked <math>3</math> kinds of chocolate (A, B, and C) in order of their preferences, with no absentions. Suppose <math>11</math> children preferred B to C, <math>14</math> preferred C to A, and <math>12</math> preferred A to B, and all possible ordered of A, B, and C existed. Find the number of children who ranked A as their first preference.
  
 
[[2000 PMWC Problems/Problem T5|Solution]]
 
[[2000 PMWC Problems/Problem T5|Solution]]
  
 
== Problem T6 ==
 
== Problem T6 ==
 +
In <math>\triangle ABC</math>, <math>BC=6BD</math>, <math>AC=5EC</math>, <math>DG=GH=HE</math>, <math>AF=FG</math>. Find the ratio of the area of <math>\triangle FGH</math> to the area of <math>\triangle ABC</math>.
  
 +
<asy>
 +
fill((1,2.5)--(0.9,0.72)--(1.82,1.46)--cycle,black);
 +
draw((0,5)--(-3,0)--(4,0)--(0,5)--(0,0));
 +
draw((0,0)--(2.5,2));
 +
draw((0,5)--(1,2.5)--(0.9,0.72));
 +
draw((1,2.5)--(1.82,1.46));
 +
label("$A$",(0,5),N);
 +
label("$B$",(-3,0),W);
 +
label("$C$",(4,0),E);
 +
label("$D$",(0,0),S);
 +
label("$E$",(2.5,2),NE);
 +
label("$F$",(1,2.5),E);
 +
label("$G$",(0.9,0.72),S);
 +
label("$H$",(1.82,1.46),S);
 +
//Credit to chezbgone2 for the diagram</asy>
 
[[2000 PMWC Problems/Problem T6|Solution]]
 
[[2000 PMWC Problems/Problem T6|Solution]]
  
 
== Problem T7 ==  
 
== Problem T7 ==  
 +
The digits <math>0</math> to <math>9</math> without repetition form two 5-digit numbers <math>M</math> and <math>N</math>. Given that <math>\frac{M}{N}</math> equals to <math>\frac{1}{2}</math>, find the largest possible sum of <math>M</math> and <math>N</math>.
  
 
[[2000 PMWC Problems/Problem T7|Solution]]
 
[[2000 PMWC Problems/Problem T7|Solution]]
  
 
== Problem T8 ==
 
== Problem T8 ==
 +
There are positive integers <math>k</math>, <math>n</math>, <math>m</math> such that <math>\frac{19}{20}<\frac{1}{k}+\frac{1}{n}+\frac{1}{m}<1</math>. What is the smallest possible value of <math>k+n+m</math>?
  
 
[[2000 PMWC Problems/Problem T8|Solution]]
 
[[2000 PMWC Problems/Problem T8|Solution]]

Latest revision as of 21:47, 13 July 2023

Problem I1

$y$ is a number that has $8$ different factors (including the number $1$ and itself). What is the smallest possible value of $y$?

Solution

Problem I2

As far as we know, the greatest prime number is $2^{6972593}-1$. What is the remainder when $2^{6972593}-1$ is divided by $5$?

Solution

Problem I3

How many whole numbers less than $1000$ contain at least one $2$ but no $3$?

Solution

Problem I4

Given that $A^4=75600\times B$. If $A$ and $B$ are positive integers, find the smallest value of $B$.

Solution

Problem I5

In a language college, $72\%$ students can speak Chinese, $65\%$ students can speak English, and $10\%$ students can speak neither Chinese nor English. Find the percentage of students who can speak both Chinese and English.

Solution

Problem I6

$p$ is the product of two $4$-digit numbers formed by the digits $1,2,3,4,5,6,7,8$ without any repetition. Find the largest value of $p$ in the form of $\Box\Box\Box\Box\times\Box\Box\Box\Box$. (You are not required to multiply the numbers).

Solution

Problem I7

$a$ and $b$ are two numbers that have prime factors $3$ and $5$ only. $a$ has $12$ factors ($1$ and itself are included), $b$ has $10$ factors ($1$ and itself are included), and their HCF (Highest Common Factor) is $75$. What is the LCM (Least Common Multiple) of $a$ and $b$?

Solution

Problem I8

A circle and a triangle are placed on intersections of the grid. The circle and the triangle are not allowed to lie on the same vertical and horizontal line. How many total possible ways are there of placing the circle and the triangle? (the following is an example).

[asy] for(int i = 0; i < 4; ++i){ if(i < 2){ draw((i,0)--(i,3)); }else{ draw((i,0)--(i,2)); } } for(int i = 0; i < 4; ++i){ if(i < 3) draw((0,i)--(3,i)); else draw((0,i)--(1,i)); } filldraw(Circle((0,3),0.3),white); filldraw((2-0.3*cos(pi/2),1+0.3*sin(pi/2))--(2-0.3*cos(7pi/6),1+0.3*sin(7pi/6))--(2-0.3*cos(11pi/6),1+0.3*sin(11pi/6))--cycle,white); //Credit to chezbgone2 for the diagram[/asy] Solution

Problem I9

Using only odd digits, all possible three-digit numbers are formed. Determine the sum of all such numbers.

Solution

Problem I10

In the sum $\frac{a}{b}+\frac{c}{d}$, each letter represents a distinct digit from $1$ to $9$. The sum is as close as possible to $1$ without being greater than or equal to $1$. What is the sum?

Solution

Problem I11

You have a pack of cards, among which are $20$ red, $20$ yellow, $20$ green and $10$ blue ones. How many cards would you need to draw out to ensure that you have $12$ cards of the same colour?

Solution

Problem I12

During the rest hour, one of five students ($A$, $B$, $C$, $D$, and $E$) dropped a glass of water. The following are the responses of the children when the teacher questioned them:

  • $A$: It was $B$ or $C$ who dropped it.
  • $B$: Neither $E$ nor I did it.
  • $C$: Both $A$ and $B$ are lying.
  • $D$: Only one of $A$ or $B$ is telling the truth.
  • $E$: $D$ is not speaking the truth.

The class teacher knows that three of them NEVER lie while the other two ALWAYS lie. Who dropped the glass?

Solution

Problem I13

In the figure, the squares $ABCD$ and $DCEG$ both have the same area of $64cm^2$. $EFG$ is a semicircle. The point $F$ is the mid-point of the arc $EFG$. Find the area of the shaded part. (Assume $\pi=3.14$)

[asy] void unitsquare(pair p){ draw(p--(p.x+1,p.y)--(p.x+1,p.y+1)--(p.x,p.y+1)--cycle); return; } fill(buildcycle(arc((2,0.5),(2,0),(2,1)),(2,1)--(0,1)--(2.5,0.5)),gray); unitsquare((0,0)); draw((1,0)--(2,0)--(2,1)--(1,1)); draw(arc((2,0.5),(2,0),(2,1))); label("$A$",(0,1),NW); label("$B$",(0,0),SW); label("$C$",(1,0),S); label("$D$",(1,1),N); label("$E$",(2,0),S); label("$F$",(2.5,0.5),E); label("$G$",(2,1),N); //Credit to chezbgone2 for the diagram[/asy]

Solution

Problem I14

A copy machine has a following enlargement/reduction buttons:

\[\begin{tabular}{|l|l|l|l|l|l|l|} \hline 250\% & 200\% & 128\% & 125\% & 100\% & 50\% & 10\% \\ \hline \end{tabular}\]

The buttons $\boxed{50\%}$, $\boxed{100\%}$, and $\boxed{250\%}$ are out of order and cannot be used any more. Sam wants to make a copy that is the same size as the original document by using the remaining buttons. When he presses a button, he has to pay $\textdollar 1$. What is the minimum amount he has to pay?

Solution

Problem I15

The sum of several positive integers is $20$. Find the largest product that can be formed by these integers.

Solution

Problem T1

A box contains $4000$ to $6000$ candies. When the candies are evenly distributed to $5$, $6$, $7$, $8$, or $9$ children, there is always one candy left. If the candies are packaged into small bags each having the same number of candies, what is the largest number of candies below $4000$ in each bag so that no candies are left?

Solution

Problem T2

A $5 \times 5 \times 5$ cube is formed using $1 \times 1 \times 1$ cubes. A number of the smaller cubes are removed by punching out the 15 designated columns from front to back, top to bottom, and side to side. Find the number of smaller cubes that remain.

[asy] import three; currentprojection=orthographic(1,1/2,0.4); draw(surface((5,1,1)--(5,1,2)--(5,2,2)--(5,2,1)--cycle),black,nolight); draw(surface((5,1,3)--(5,1,4)--(5,2,4)--(5,2,3)--cycle),black,nolight); draw(surface((5,3,1)--(5,3,2)--(5,4,2)--(5,4,1)--cycle),black,nolight); draw(surface((5,3,3)--(5,3,4)--(5,4,4)--(5,4,3)--cycle),black,nolight); draw(surface((5,2,2)--(5,2,3)--(5,3,3)--(5,3,2)--cycle),black,nolight); draw(surface((1,5,1)--(1,5,2)--(2,5,2)--(2,5,1)--cycle),black,nolight); draw(surface((1,5,3)--(1,5,4)--(2,5,4)--(2,5,3)--cycle),black,nolight); draw(surface((3,5,1)--(3,5,2)--(4,5,2)--(4,5,1)--cycle),black,nolight); draw(surface((3,5,3)--(3,5,4)--(4,5,4)--(4,5,3)--cycle),black,nolight); draw(surface((2,5,2)--(2,5,3)--(3,5,3)--(3,5,2)--cycle),black,nolight); draw(surface((1,1,5)--(1,2,5)--(2,2,5)--(2,1,5)--cycle),black,nolight); draw(surface((1,3,5)--(1,4,5)--(2,4,5)--(2,3,5)--cycle),black,nolight); draw(surface((3,1,5)--(3,2,5)--(4,2,5)--(4,1,5)--cycle),black,nolight); draw(surface((3,3,5)--(3,4,5)--(4,4,5)--(4,3,5)--cycle),black,nolight); draw(surface((2,2,5)--(2,3,5)--(3,3,5)--(3,2,5)--cycle),black,nolight); for(int i = 0; i <= 5; ++i) draw((i,0,5)--(i,5,5)); for(int i = 0; i <= 5; ++i) draw((0,i,5)--(5,i,5)); for(int i = 0; i <= 5; ++i) draw((5,i,0)--(5,i,5)); for(int i = 0; i <= 5; ++i) draw((5,0,i)--(5,5,i)); for(int i = 0; i <= 5; ++i) draw((i,5,0)--(i,5,5)); for(int i = 0; i <= 5; ++i) draw((0,5,i)--(5,5,i)); //Credit to chezbgone2 for the diagram[/asy]

Solution

Problem T3

In the figure, $ABCD$ is a square, $P$, $Q$, $R$, and $S$ are midpoints of the sides $AB$, $BC$, $CD$ and $DA$ respectively. Find the ratio of the shaded area to the area of the square $ABCD$.

[asy] fill(buildcycle((0,2)--(1,0),(2,2)--(0,1),(2,0)--(1,2),(0,0)--(2,1)),gray); draw((0,0)--(2,0)--(2,2)--(0,2)--cycle); draw((0,2)--(1,0)); draw((2,2)--(0,1)); draw((2,0)--(1,2)); draw((0,0)--(2,1)); label("A",(0,2),NW); label("B",(2,2),NE); label("C",(2,0),SE); label("D",(0,0),SW); label("P",(1,2),N); label("Q",(2,1),E); label("R",(1,0),S); label("S",(0,1),W); //Credit to chezbgone2 for the diagram[/asy] Solution

Problem T4

Use the four colours red, yellow, blue and green to fill in the regions of the following diagram so that the adjacent regions are not the same colour. How many different ways are there to colour the regions?

[asy] import geometry; draw((0,0)--(3,0)--(3,2)--(0,2)--cycle); draw((0,1)--(1.5,2)); draw((2.3,0)--(2.3,0.7)--(3,0.7)); draw(ellipse((1.5,1),0.6,0.5)); //Credit to chezbgone2 for the diagram[/asy] Solution

Problem T5

Each of $20$ children ranked $3$ kinds of chocolate (A, B, and C) in order of their preferences, with no absentions. Suppose $11$ children preferred B to C, $14$ preferred C to A, and $12$ preferred A to B, and all possible ordered of A, B, and C existed. Find the number of children who ranked A as their first preference.

Solution

Problem T6

In $\triangle ABC$, $BC=6BD$, $AC=5EC$, $DG=GH=HE$, $AF=FG$. Find the ratio of the area of $\triangle FGH$ to the area of $\triangle ABC$.

[asy] fill((1,2.5)--(0.9,0.72)--(1.82,1.46)--cycle,black); draw((0,5)--(-3,0)--(4,0)--(0,5)--(0,0)); draw((0,0)--(2.5,2)); draw((0,5)--(1,2.5)--(0.9,0.72)); draw((1,2.5)--(1.82,1.46)); label("$A$",(0,5),N); label("$B$",(-3,0),W); label("$C$",(4,0),E); label("$D$",(0,0),S); label("$E$",(2.5,2),NE); label("$F$",(1,2.5),E); label("$G$",(0.9,0.72),S); label("$H$",(1.82,1.46),S); //Credit to chezbgone2 for the diagram[/asy] Solution

Problem T7

The digits $0$ to $9$ without repetition form two 5-digit numbers $M$ and $N$. Given that $\frac{M}{N}$ equals to $\frac{1}{2}$, find the largest possible sum of $M$ and $N$.

Solution

Problem T8

There are positive integers $k$, $n$, $m$ such that $\frac{19}{20}<\frac{1}{k}+\frac{1}{n}+\frac{1}{m}<1$. What is the smallest possible value of $k+n+m$?

Solution

Problem T9

Solution

Problem T10

Solution

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2000_PMWC_Problems&oldid=195685"