X-intercept => 2x = 6 => x = 3
x-intercept is 3.
y-intercept => 3/2y = 6 => y = 4
y-intercept is 4.
z-intercept => 3z = 6 => z = 2
z-intercept is 2.
Depends how strong the bomb is. If the bomb is weak then you would most likely go up 20-30 floors. If the bomb is in the middle go to the stair case and prepare for impact. If the bomb is strong go down 40 floors if possible. If none of this is possible to do and you don't know what to do about it then you must do the following:
Cut all of the wires in the bomb. Get the bomb near of a wall or a window. If it is a window then throw the bomb out of the window. If it is a wall put it as close to the wall as possible gather all your coworkers and run off of the floor.
Hope this helps!
Answer:
6
Step-by-step explanation:
(8:100) * 75
(8*75) : 100
600:100 = 6
Answer:
Step-by-step explanation:
2005 AMC 8 Problems/Problem 20
Problem
Alice and Bob play a game involving a circle whose circumference is divided by 12 equally-spaced points. The points are numbered clockwise, from 1 to 12. Both start on point 12. Alice moves clockwise and Bob, counterclockwise. In a turn of the game, Alice moves 5 points clockwise and Bob moves 9 points counterclockwise. The game ends when they stop on the same point. How many turns will this take?
$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 14\qquad\textbf{(E)}\ 24$
Solution
Alice moves $5k$ steps and Bob moves $9k$ steps, where $k$ is the turn they are on. Alice and Bob coincide when the number of steps they move collectively, $14k$, is a multiple of $12$. Since this number must be a multiple of $12$, as stated in the previous sentence, $14$ has a factor $2$, $k$ must have a factor of $6$. The smallest number of turns that is a multiple of $6$ is $\boxed{\textbf{(A)}\ 6}$.
See Also
2005 AMC 8 (Problems • Answer Key • Resources)
Preceded by
Problem 19 Followed by
Problem 21
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AJHSME/AMC 8 Problems and Solutions
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.