from
stringclasses 2
values | value
stringlengths 16
6.77k
|
|---|---|
human
|
What is the coefficient of $x^3$ in the expansion of $$(x+2\sqrt3)^7?$$
|
gpt
|
By the binomial theorem, this term is $$\binom73x^3(2\sqrt3)^4=35x^3\cdot144=\boxed{5040}x^3.$$
|
human
|
How many ways are there to put 5 balls in 3 boxes if the balls are not distinguishable and neither are the boxes?
|
gpt
|
The ways to arrange indistinguishable balls into indistinguishable boxes only depends on the number of balls in the boxes. The ways to do this are $(5,0,0)$, $(4,1,0)$, $(3,2,0)$, $(3,1,1)$, $(2,2,1)$. There are $\boxed{5}$ ways.
|
human
|
James has 7 apples. 4 of them are red, and 3 of them are green. If he chooses 2 apples at random, what is the probability that both the apples he chooses are green?
|
gpt
|
There are $\binom{7}{2}=21$ total ways for James to choose 2 apples from 7, but only $\binom{3}{2}=3$ ways for him to choose 2 green apples. So, the probability that he chooses 2 green apples is $\frac{3}{21}=\boxed{\frac{1}{7}}$.
|
human
|
What is the coefficient of $x^4$ in the expansion of $(1-2x^2)^5$?
|
gpt
|
Using the binomial theorem, we find that the $x^4=(x^2)^2$ term of the expansion is $\binom{5}{2}(1)^3(-2x^2)^2=10(4x^4)=40x^4$. Thus, the desired coefficient is $\boxed{40}$.
|
human
|
A pizza parlor offers six toppings. What is the greatest number of four-topping pizzas that can be made such that no two pizzas have the same topping combination?
|
gpt
|
Because there are 6 choices of toppings, and each pizza must have 4 of them, there are ${6 \choose 4} = \boxed{15}$ four-topping pizzas.
|
human
|
Suppose two distinct integers are chosen from between 5 and 17, inclusive. What is the probability that their product is odd?
|
gpt
|
There are 13 integers between 5 and 17 inclusive, so there are $\binom{13}{2} = 78$ ways to choose two of them without regard to order. In order for the product of two integers to be odd, both of the integers themselves must be odd. There are 7 odd integers between 5 and 17 inclusive, so there are $\binom72 = 21$ ways to choose two of them without regard to order. Therefore, the desired probability is $\dfrac{21}{78} = \boxed{\dfrac{7}{26}}$.
|
human
|
My school's math club has 6 boys and 8 girls. I need to select a team to send to the state math competition. We want 6 people on the team. In how many ways can I select the team to have 3 boys and 3 girls?
|
gpt
|
We are picking 3 boys out of 6, so there are $\binom{6}{3} = 20$ options for the boys on the team. We are picking 3 girls out of 8, so there are $\binom{8}{3} = 56$ options for the girls on the team. This gives a total of $20 \times 56 = \boxed{1120}$ choices.
|
human
|
The lottery in our state consists of two drawings. First, a MegaBall is picked from among 27 numbered balls. Second, five WinnerBalls are picked from among 44 numbered balls. To win the lottery, you must pick the MegaBall number correctly and also pick the numbers on the five WinnerBalls (but you don't need to get the order right for the WinnerBalls). What is the probability that the ticket I hold has the winning numbers?
|
gpt
|
The probability that the MegaBall matches is $\dfrac{1}{27}$ . The probability that the 5 WinnerBalls match is $\dfrac{1}{\binom{44}{5}}$. So my chances of winning are $\left(\dfrac{1}{27}\right)\times\left(\dfrac{1}{\binom{44}{5}}\right) = \boxed{\dfrac{1}{29,\!322,\!216}}$.
|
human
|
How many ways are there to put 4 distinguishable balls into 2 distinguishable boxes?
|
gpt
|
For each ball, there are 2 choices of which box to place it in. Since this choice is independent for each of the 4 balls, we multiply the number of choices together. Hence there are $2^4 = \boxed{16}$ ways to place 4 distinguishable balls into 2 distinguishable boxes.
|
human
|
I have two 20-sided dice that each have 4 maroon sides, 7 teal sides, 8 cyan sides, and one sparkly side. If I roll both dice, what is the probability they come up the same?
|
gpt
|
This problem requires a little bit of casework. There are four ways in which the dice can both show the same thing: if they both show maroon, both show teal, both show cyan or both show sparkly. The probability of getting maroon is $\dfrac{4}{20}$, so the probability that they will both show maroon is $\left(\dfrac{4}{20}\right)^2=\dfrac{16}{400}$. Similarly, the probability of getting teal is $\dfrac{7}{20}$, so the probability that they will both show teal is $\left(\dfrac{7}{20}\right)^2=\dfrac{49}{400}$, the probability of getting cyan is $\dfrac{8}{20}$, so the probability that they will both show cyan is $\left(\dfrac{8}{20}\right)^2=\dfrac{64}{400}$ and the probability of getting sparkly is $\dfrac{1}{20}$, so the probability that they will both get sparkly is $\left(\dfrac{1}{20}\right)^2=\dfrac{1}{400}$. So our answer is $\dfrac{16}{400}+\dfrac{49}{400}+\dfrac{64}{400}+\dfrac{1}{400}=\frac{130}{400}=\boxed{\dfrac{13}{40}}$.
|
human
|
Ten 6-sided dice are rolled. What is the probability that exactly three of the dice show a 1? Express your answer as a decimal rounded to the nearest thousandth.
|
gpt
|
There are $\binom{10}{3}=120$ ways to select exactly three dice to roll 1's ones out of ten dice total. The probability of any one of these outcomes occurring is $\left(\dfrac{1}{6}\right)^3\left(\dfrac{5}{6}\right)^7$ and they're all mutually exclusive cases, so the probability that one of them will occur (which is the probability that we're looking for) is $\binom{10}{3}\left(\dfrac{1}{6}\right)^3\left(\dfrac{5}{6}\right)^7=\dfrac{120\cdot5^7\cdot1^3}{6^{10}}\approx \boxed{.155}$.
|
human
|
Our club has 20 members, 10 boys and 10 girls. In how many ways can we choose a president and a vice-president if they must be of different gender?
|
gpt
|
The president can be any one of the 20 members, and the vice-president can be any one of the 10 members of the opposite sex. The answer is $20\times 10=\boxed{200}$.
|
human
|
What is the second smallest four-digit number in Pascal's triangle?
|
gpt
|
Every positive integer appears in Pascal's triangle! The number 1000 appears in the row that starts 1, 1000. Then 1001 appears in the next row. So, the answer is $\boxed{1001}$.
|
human
|
Steve guesses randomly on a 15-question multiple choice test in which each problem has two choices, a correct one and an incorrect one. What is the probability that he gets at least half of the questions correct? Express your answer as a common fraction.
|
gpt
|
Steve cannot get exactly half the questions right since there are an odd number of questions. So he can get either more than half or less than half correct, with equal probability, since he has a $1/2$ chance of getting any individual question correct. This means that Steve has a probability of $\boxed{\frac{1}{2}}$ of getting more than half correct, or identically, at least half correct.
|
human
|
Suppose we flip four coins simultaneously: a penny, a nickel, a dime, and a quarter. What is the probability that at least 15 cents worth of coins come up heads?
|
gpt
|
There are $2^4=16$ possible outcomes, since each of the 4 coins can land 2 different ways (heads or tails). If the quarter is heads, there are 8 possibilities, since each of the other three coins may come up heads or tails. If the quarter is tails, then the nickel and dime must be heads, so there are 2 possibilities, since the penny can be heads or tails. So there are $8+2 = 10$ successful outcomes, and the probability of success is $\dfrac{10}{16} = \boxed{\dfrac{5}{8}}$.
|
human
|
Two cards are chosen at random from a standard 52-card deck. What is the probability that both cards are numbers (2 through 10) totaling to 12?
|
gpt
|
There are two cases that we have to consider.
$\bullet~$ Case 1: The first card is one of 2, 3, 4, 5, 7, 8, 9, 10.
There are 32 such cards, so this occurs with probability $\dfrac{32}{52}$. For any of these cards, there are 4 cards left in the deck such that the cards sum to 12, so the probability of drawing one is $\dfrac{4}{51}$. Thus, the probability that this case occurs is $\dfrac{32}{52}\times\dfrac{4}{51} = \dfrac{32}{663}$.
$\bullet~$ Case 2: The first card is a 6.
There are 4 of these, so this occurs with probability $\dfrac{4}{52}$. Now we need to draw another 6. There are only 3 left in the deck, so the probability of drawing one is $\dfrac{3}{51}$. Thus, the probability that this case occurs is $\dfrac{4}{52}\times\dfrac{3}{51} = \dfrac{3}{663}$.
Therefore the overall probability is $\dfrac{32}{663} + \dfrac{3}{663} = \boxed{\frac{35}{663}}. $
|
human
|
My grandpa has 10 pieces of art, including 3 prints by Escher. If he hangs the pieces of art in a row in a random order, what is the probability that all three pieces by Escher will be placed consecutively?
|
gpt
|
To count the number of ways of arranging the 10 pieces of art with the three Escher's consecutively, treat the three of them as one item. It is clear that we are then selecting the location of 1 item out of 8 total which can be done in $\binom{8}{1}=8$ ways. There are also a total of $\binom{10}{3}=120$ ways to place the three pictures without restrictions. Thus the probability that we want is $\dfrac{8}{120}=\boxed{\dfrac{1}{15}}$.
|
human
|
Phil rolls 6 fair 6-sided dice. What is the probability that at least two dice show the same number?
|
gpt
|
The only way in which there won't be two dice of the same number is if for each number between 1 and 6 there is exactly one die displaying that number. If we line the dice up, there are a total of $6!$ ways in which we could order 6 dice all displaying different numbers and a total of $6^6$ possible outcomes since each of the 6 dice can have 6 outcomes and all of the rolls are determined independently. That means that the probability of all of the dice showing different numbers is $\dfrac{6!}{6^6}=\dfrac{5}{324}$, so the probability that we want is $1-\dfrac{5}{324}=\boxed{\dfrac{319}{324}}$.
|
human
|
Four horizontal lines and four vertical lines are drawn in a plane. In how many ways can four lines be chosen such that a rectangular region is enclosed?
|
gpt
|
In order for the four lines to enclose a rectangular region, we must choose two horizontal and two vertical lines. If we were to choose more than two of one of these types of lines, we would not be able to enclose any region. We can count independently the number of ways to choose vertical and horizontal lines. There will be $\dbinom{4}{2}=6$ ways to choose horizontal lines, and the same number of ways to choose two vertical lines. Since these are independent, there are a total of $6\cdot 6=\boxed{36}$ ways to choose four lines that enclose a rectangle.
|
human
|
Interior numbers begin in the third row of Pascal's Triangle. The sum of the interior numbers in the fourth row is 6. The sum of the interior numbers of the fifth row is 14. What is the sum of the interior numbers of the seventh row?
|
gpt
|
If Pascal's Triangle begins with row 1, then the sum of the elements in row $n$ is $2^{n-1}$. The interior numbers refer to all numbers in the row except the $1$ at each end, so the sum of the interior elements in row $n$ is $2^{n-1}-1-1=2^{n-1}-2$. For the fourth row, the sum is $2^3-2=6$. For the fifth row, the sum is $2^4-2=14$. So for the seventh row the sum is $2^{7-1}-2=64-2=\boxed{62}$.
|
human
|
What is the 39th number in the row of Pascal's triangle that has 41 numbers?
|
gpt
|
The row 1, 1 has 2 numbers. The row 1, 2, 1 has 3 numbers. The row 1, 3, 3, 1 has 4 numbers. Each time we go down one row, we have one more number in the list. So, the row that starts 1, $k$ has $k+1$ numbers (namely, the numbers $\binom{k}{0}, \binom{k}{1}, \binom{k}{2}, \ldots, \binom{k}{k}$.) So the row with 41 numbers starts $\binom{40}{0}, \binom{40}{1}, \binom{40}{2}, \ldots$. The 39th number has two numbers after it, and it is the same as the number in the row with only two numbers before it (that is, the 39th number is the same as the 3rd). So, the 39th number is $\binom{40}{2} = \frac{40\cdot 39}{2\cdot 1} = \boxed{780}$.
|
human
|
The length of the shortest trip from $A$ to $B$ along the edges of the cube shown is the length of 3 edges. How many different 3-edge trips are there from $A$ to $B$?
[asy]
size(4cm,4cm);
pair a1, b1, c1, d1;
a1=(1,1);
b1=(0,1);
c1=(1.6,1.4);
d1=(1,0);
pair e1, f1, g1, h1;
e1=(0,0);
f1=c1-(a1-d1);
g1=b1+(c1-a1);
h1=e1+(g1-b1);
draw(a1--d1--e1--b1--a1);
draw(b1--g1--c1--a1);
draw(c1--f1--d1);
draw(g1--h1--e1,dotted+1pt);
draw(h1--f1,dotted+1pt);
label("$A$",e1,SW);
label("$B$",c1,NE);
[/asy]
|
gpt
|
There are 3 choices for the first move starting from $A$. Having made the first move, then there are 2 choices for the second move. Then there is just 1 choice for the third move. Thus, there are $3\times2\times1$ or $\boxed{6}$ paths from $A$ to $B$.
|
human
|
How many ways are there to put 4 balls in 3 boxes if the balls are not distinguishable and neither are the boxes?
|
gpt
|
Since the balls and boxes are indistinguishable, we only need to consider the number of the balls in boxes without considering order. The arrangements are (4,0,0),(3,1,0),(2,2,0),(2,1,1), for a total of $\boxed{4}$ ways.
|
human
|
In how many ways is it possible to arrange the digits of 1150 to get a four-digit multiple of 5?
|
gpt
|
A multiple of 5 has to end in 0 or 5. If it ends in 0, the three remaining digits can go anywhere. There are 3! ways to arrange 3 digits, but we must divide by 2! to correct for overcounting since the 1's are identical. If the number ends in 5, the digit 0 can go in either of 2 places. Then the two remaining digits can go anywhere. There are 2! ways to arrange 2 digits, but we must divide this by 2! to correct for overcounting since the 1's are identical. So, there are $3!/2!+2\cdot 2!/2!=3+2=\boxed{5}$ possible ways to arrange the digits of 1150 to get a four-digit multiple of 5.
|
human
|
After a gymnastics meet, each gymnast shook hands once with every gymnast on every team (except herself). Afterwards, a coach came down and only shook hands with each gymnast from her own team. There were a total of 281 handshakes. What is the fewest number of handshakes the coach could have participated in?
|
gpt
|
The number of gymnasts is some integer $n$, so that the number of gymnast-gymnast handshakes is ${n \choose 2}$ for some $n$. Also, the coach must participate in an integer $k<n$ number of handshakes. So, ${n \choose 2} + k = 281$. If we want to minimize $k$, we need the maximal $n$ such that ${n \choose 2} \le 281$, which implies $\frac{n(n-1)}{2} \le 281$ or $n^2 - n - 562 \le 0 $. So, the maximal $n$ is 24. So, $k = 281 - {24 \choose 2} = 281 - 12 \cdot 23 = 281 - 276 = \boxed{5}$.
|
human
|
If two distinct members of the set $\{ 3, 7, 21, 27, 35, 42, 51 \}$ are randomly selected and multiplied, what is the probability that the product is a multiple of 63? Express your answer as a common fraction.
|
gpt
|
In order to produce a multiple of 63, we must choose at least two factors of 3 and one factor of 7 among the prime factorizations of the two numbers we choose. We count the number of ways in which we can do this by considering the four multiples of 7 in our list. There are two which are not multiples of 3 (7 and 35) and two that are multiples of 3 but not 9 (21 and 42). Each of 7 and 35 can be paired with 27 to give a multiple of 63, so that's two successes. Each of 21 and 42 can be paired with any of 3, 27, or 51, which gives another $2\cdot 3 = 6$ successes. Finally, we can choose both 21 and 42, and we have a total of $2+6+1 = 9$ successes.
Since there are $\binom{7}{2}=21$ total ways to choose a pair of numbers from the list, the probability that a randomly chosen pair of numbers will have a product which is a multiple of 63 is $\frac{9}{21}=\boxed{\frac{3}{7}}$.
|
human
|
A student must choose a program of four courses from a list of courses consisting of English, Algebra, Geometry, History, Art, and Latin. This program must contain English and at least one mathematics course. In how many ways can this program be chosen?
|
gpt
|
The program must contain exactly $3$ of the $5$ classes that are not English. Therefore, there are $\tbinom{5}{3} = 10$ valid programs if we ignore the mathematics requirement.
Since there are $2$ math classes (Algebra and Geometry), $3$ of the $5$ classes besides English are not math. Therefore, there is only one program that satisfies the English requirement, but does not satisfy the mathematics requirement (the program consisting of English, History, Art, and Latin). It follows that the number of programs satisfying both requirements is $10-1=\boxed{9}.$
|
human
|
A pet store has 15 puppies, 6 kittens, and 8 hamsters. Alice, Bob, and Charlie each want to buy a pet. For variety, they each want a different kind of pet. How many ways can Alice, Bob, and Charlie buy pets and leave the store satisfied?
|
gpt
|
Ignoring who gets which pet for now, we can see that there are $15 \cdot 6 \cdot 8$ ways to choose one puppy, one kitten, and one hamster. Now, Alice has three choices for which type of pet she wants, Bob has two, and Charlie has one, due to the constraint that they must each have a different type of pet. Thus, there are $15 \cdot 6 \cdot 8 \cdot 3 \cdot 2 = \boxed{4320}$ such ways.
|
human
|
How many four-digit numbers greater than 2999 can be formed such that the product of the middle two digits exceeds 5?
|
gpt
|
For the first digit, there are seven choices (3, 4, 5, 6, 7, 8, or 9). For the last digit, there are ten choices (0 through 9).
We know that if either of the middle digits is 0, their product will not exceed 5. So, only consider pairs of middle digits formed from choosing two numbers between 1 and 9, inclusive. There are $9 \cdot 9$ such pairs possible. The only pairs whose product will not exceed 5 are 11, 12, 13, 14, 15, 21, 22, 31, 41, and 51. Thus, there are $9 \cdot 9 - 10 = 71$ ways in which we can choose the middle two digits.
Thus, there are $ 7 \cdot 71 \cdot 10 = \boxed{4970}$ such numbers.
|
human
|
What is the nearest integer to $(2+\sqrt3)^4$?
|
gpt
|
If we expand this using the binomial theorem, we get a bunch of terms with $\sqrt3$ in them. To avoid painful estimation, we use the following trick: Add $(2-\sqrt3)^4$ to this expression. We know that $(2-\sqrt3)^4$ is small, since $2-\sqrt3<1$. When we add these together, the $\sqrt3$ terms magically cancel out. By the Binomial Theorem, $$(2+\sqrt3)^4=2^4+4\cdot2^3\cdot(\sqrt3)+6\cdot2^2\cdot(\sqrt3)^2+4\cdot2\cdot(\sqrt3)^3+(\sqrt3)^4$$ whereas $$(2-\sqrt3)^4=2^4-4\cdot2^3\cdot(\sqrt3)+6\cdot2^2\cdot(\sqrt3)^2-4\cdot2\cdot(\sqrt3)^3+(\sqrt3)^4$$ Therefore, their sum is $$2(2^4+6\cdot2^2(\sqrt3)^2+(\sqrt3)^4)=2(16+72+9)=194$$ Since the term we added, $(2-\sqrt3)^4$, is less than a half (actually, it's less than .01), $\boxed{194}$ is the closest integer to $(2+\sqrt3)^4$.
|
human
|
I have 5 books, two of which are identical copies of the same math book (and all of the rest of the books are different). In how many ways can I arrange them on a shelf?
|
gpt
|
There are $5!$ ways to arrange the books if they are unique, but two are identical so we must divide by $2!$ for an answer of $\dfrac{5!}{2!} = \boxed{60}$.
|
human
|
How many 4-letter words with at least one vowel can be constructed from the letters A, B, C, D, and E? (Note that A and E are vowels, any word is valid, not just English language words, and letters may be used more than once.)
|
gpt
|
First we count the number of all 4-letter words with no restrictions on the word. Then we count the number of 4-letter words with no vowels. We then subtract to get the answer.
Each letter of a word must be one of A, B, C, D, or E, so the number of 4-letter words with no restrictions on the word is $5\times 5\times 5\times 5=625$. Each letter of a word with no vowel must be one of B, C, or D. So the number of all 4-letter words with no vowels in the word is $3\times 3\times 3\times 3=81$. Therefore, the number of 4-letter words with at least one vowel is $625-81=\boxed{544}$.
|
human
|
The Grammar club has 20 members: 10 boys and 10 girls. A 4-person committee is chosen at random. What is the probability that the committee has at least 1 boy and at least 1 girl?
|
gpt
|
The number of ways to choose a committee of all boys or all girls is $2\times\binom{10}{4}=420$. The total number of committees is $\binom{20}{4}=4845$. Thus the answer is $1-\dfrac{420}{4845} = \dfrac{4425}{4845} = \boxed{\dfrac{295}{323}}$.
|
human
|
Find the greatest common divisor of $7!$ and $(5!)^2.$
|
gpt
|
$$ \begin{array}{rcrcr} 7! &=& 7 \cdot 6 \cdot 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1 &=& 2^4 \cdot 3^2 \cdot 5^1 \cdot 7^1 \\ (5!)^2 &=& (5 \cdot 4 \cdot 3 \cdot 2 \cdot 1)^2 &=& 2^6 \cdot 3^2 \cdot 5^2 \\ \text{gcd}(7!, (5!)^2) &=& 2^4 \cdot 3^2 \cdot 5^1 &=& \boxed{720} \end{array} $$
|
human
|
William is taking the 25-question, multiple choice American Mathematics Competition. Each question has five answer choices. William guesses random answers for the last four questions. What is the probability that he will get at least one of these final four questions right?
|
gpt
|
We find the probability that William misses the last four questions, and subtract from 1. The probability of William missing a question is $\frac{4}{5}$, so the probability that he misses all four is $\left(\frac{4}{5}\right)^4 = \frac{256}{625}$. The probability that he gets at least one right is $1-\frac{256}{625} =\boxed{\frac{369}{625}}$.
|
human
|
How many ways are there to put 5 balls in 2 boxes if the balls are distinguishable but the boxes are not?
|
gpt
|
Since the boxes are indistinguishable, there are 3 possibilities for arrangements of the number of balls in each box.
Case 1: 5 balls in one box, 0 in the other box. We must choose 5 balls to go in one box, which can be done in $\binom{5}{5} = 1$ way.
Case 2: 4 balls in one box, 1 in the other box. We must choose 4 balls to go in one box, which can be done in $\binom{5}{4} = 5$ ways.
Case 3: 3 balls in one box, 2 in the other box. We must choose 3 balls to go in one box, which can be done in $\binom{5}{3} = 10$ ways.
This gives us a total of $1 + 5 + 10 = \boxed{16}$ arrangements.
|
human
|
At breakfast, lunch, and dinner, Joe randomly chooses with equal probabilities either an apple, an orange, or a banana to eat. On a given day, what is the probability that Joe will eat at least two different kinds of fruit?
|
gpt
|
The only way for Joe not to eat at least two different kinds of fruit is if he eats all apples, all oranges, or all bananas. The probability that he eats all apples is $\left( \frac{1}{3} \right) ^3=\frac{1}{27}$. The probability that he eats all oranges and the probability that he eats all bananas are the same. So, the probability that Joe eats at least two different kinds of fruit is $1-\frac{1}{27}-\frac{1}{27}-\frac{1}{27}=\boxed{\frac{8}{9}}$.
|
human
|
Forty cards are placed into a box, each bearing a number 1, 2, 3, 4, 5, 6, 7, 8, 9, or 10, with each number entered on four cards. Four cards are drawn from the box at random and without replacement. Let $p$ be the probability that all four cards bear the same number. Let $q$ be the probability that three of the cards bear a number $a$ and the other bears a number $b$ that is not equal to $a$. What is the value of $q/p$?
|
gpt
|
The total number of ways that the numbers can be chosen is $\binom{40}{4}.$ Exactly 10 of these possibilities result in the four cards having the same number.
Now we need to determine the number of ways that three cards can have a number $a$ and the other card have a number $b$, with $b\ne a$. There are $10\cdot 9 = 90$ ways to choose the distinct numbers $a$ and $b$. (Notice that the order in which we choose these two number matters, since we get 3 of $a$ and 1 of $b$.)
For each value of $a$ there are $\binom{4}{3}$ ways to choose the three cards with $a$ and for each value of $b$ there are $\binom{4}{1}$ ways to choose the card with $b$. Hence the number of ways that three cards have some number $a$ and the other card has some distinct number $b$ is $$90\cdot\binom{4}{3}\cdot\binom{4}{1}=90\cdot 4 \cdot 4 = 1440.$$ So the probabilities $p$ and $q$ are $\displaystyle \frac{10}{\binom{40}{4}}$ and $\displaystyle \frac{1440}{\binom{40}{4}}$, respectively, which implies that $$\frac{q}{p} = \frac{1440}{10} = \boxed{144}.$$
|
human
|
A weather forecast predicts that for each day from Monday to Friday this week, there is a $40\%$ chance of sun, a $25\%$ chance of getting 4 inches of rain, and a $35\%$ chance of getting 10 inches of rain. What is the expected value of the total number of inches of rain which will fall from Monday to Friday? Give your answer as a decimal rounded to the nearest tenth.
|
gpt
|
For each day, the expected amount of rain is $(.40)(0)+(.25)(4)+(.35)(10)=0+1+3.5=4.5$. To find the total expected amount of rain for the days from Monday to Friday, we can add the amounts for each day, getting $5\cdot4.5= \boxed{22.5}$ inches total.
|
human
|
In how many distinct ways can I arrange my five keys on a keychain, if I want to put my house key next to my car key? Two arrangements are not considered different if the keys are in the same order (or can be made to be in the same order without taking the keys off the chain--that is, by reflection or rotation).
|
gpt
|
First, put the house key and car key next to each other on the keychain. It doesn't matter where they are put, because the keychain can be rotated and reflected to move them to any other pair of adjacent locations. The remaining three keys can be put on the keychain in $3!=\boxed{6}$ ways.
|
human
|
Compute $\frac{6! + 7!}{5!}$
|
gpt
|
This simplifies nicely because $5!$ divides both $6!$ and $7!$ evenly:
\begin{align*}
\frac{6! + 7!}{5!} &=\frac{6!}{5!} + \frac{7!}{5!}\\&= 6 + 6 \cdot 7\\
&= 6 \cdot 8 \\
&= \boxed{48}
\end{align*}
|
human
|
How many positive integers less than $500$ can be written as the sum of two positive perfect cubes?
|
gpt
|
Note that $7^3 < 500 < 8^3,$ so any positive integer that can be written as the sum of two positive perfect cubes must be written as the sum of two cubes $a^3 + b^3$ where $1 \le a \le 7$ and $1 \le b \le 7.$ We can make a chart of the sum of two such cubes: $$
\begin{array}{c|ccccccc}
& 1^3 & 2^3 & 3^3 & 4^3 & 5^3 & 6^3 & 7^3 \\ \hline
1^3 & 2 & 9 & 28 & 65 & 126 & 217 & 344 \\
2^3 & & 16 & 35 & 72 & 133 & 224 & 351 \\
3^3 & & & 54 & 91 & 152 & 243 & 370 \\
4^3 & & & & 128 & 189 & 280 & 407 \\
5^3 & & & & & 250 & 341 & 468 \\
6^3 & & & & & & 432 & {559} \\
7^3 & & & & & & & {686}
\end{array}
$$ As we can see from the chart, there are $\boxed{26}$ such numbers less than $500.$
|
human
|
Keisha's basketball team must decide on a new uniform. The seventh-graders will pick the color of the shorts (black or gold) and the eighth-graders will pick the color of the jersey (black, white, or gold), but the two groups of players will not confer together. If, for both garments, each possible color is equally likely to be chosen, what is the probability that the shorts will be a different color than the jersey? Express your answer as a common fraction.
|
gpt
|
We will count the number of garment configurations in which the garments do not match color and divide by the total number of garment configurations in order to find the probability that the garments do not match. If the seventh-graders choose a black garment, there are two garments the eighth-graders can choose such that the garments don't match: white and gold. If the seventh-graders choose a gold garment, there are two garments the eighth-graders can choose to not match: black and white. Thus, there are $2+2=4$ garment configurations such that the garments don't match. The total number of garment configurations is $2\cdot3=6$ (one of two shorts and one of three jerseys), so the probability that the garments don't match is $4/6=\boxed{\frac{2}{3}}$.
|
human
|
Compute $\dbinom{8}{2}$.
|
gpt
|
$\dbinom{8}{2} = \dfrac{8!}{2!6!}=\dfrac{8\times 7}{2\times 1}=\boxed{28}.$
|
human
|
Three tiles are marked X and two other tiles are marked O. The five tiles are randomly arranged in a row. What is the probability that the arrangement reads XOXOX?
|
gpt
|
There are three X's and two O's, and the tiles are selected without replacement, so the probability is \[
\frac{3}{5}\cdot\frac{2}{4}\cdot\frac{2}{3}\cdot\frac{1}{2}\cdot\frac{1}{1}= \frac{1}{10}.
\]OR
The three tiles marked X are equally likely to lie in any of $\binom{5}{3}=10$ positions, so the probability of this arrangement is $\boxed{\frac{1}{10}}$.
|
human
|
How many two-digit numbers are there in which the tens digit is greater than the ones digit?
|
gpt
|
In addition to two-digit numbers, consider the one-digit numbers $01$ through $09.$ Of these $99$ numbers, $9$ have repeated digits $01,$ $02,$ $03,$ $\ldots,$ $99,$ namely: $11,$ $22,$ $33,$ $\ldots,$ and $99.$ Of the remaining $90$ numbers, each one has a unique counterpart formed by swapping their tens and units digit. Thus among these, $45$ have a tens digit greater than the units digit. (The other $45$ have a tens digit smaller than the units digit.) The required answer is $\boxed{45}.$
|
human
|
There are 5 blue chips and 3 yellow chips in a bag. One chip is drawn from the bag. That chip is placed back into the bag. A second chip is then drawn. What is the probability that the two selected chips are of different colors? Express your answer as a common fraction.
|
gpt
|
If we draw a blue chip and then a yellow chip, or if we draw a yellow chip and then a blue chip, then our draws will be different colors. So, the probability is $\frac{5}{8} \cdot \frac{3}{8} + \frac{3}{8} \cdot \frac{5}{8} = 2 \cdot \frac{15}{64} = \boxed{\frac{15}{32}}$.
|
human
|
Cory has $3$ apples, $2$ oranges and $2$ bananas. If Cory eats one piece of his fruit per day for a week and the pieces of fruit within each category are indistinguishable, in how many orders can Cory eat the fruit? One such order is $AAAOOBB.$
|
gpt
|
There are a total of $7$ fruits, so there are $7!$ ways to arrange them. However, since the fruits in each category are indistinguishable, we must divide out the repeats: $$\frac{7!}{3!2!2!}=7\times6\times5=\boxed{210}.$$
|
human
|
A circular dartboard is divided into regions with various central angles, as shown. The probability of a dart randomly landing in a particular region is $\frac16$. What is the corresponding measure, in degrees, of the central angle of this section of the dartboard? [asy]
unitsize(1.5cm);
defaultpen(linewidth(.7pt));
pair O=(0,0);
draw(Circle(O,1));
draw(dir(0)--O--dir(90));
draw(dir(150)--O--dir(225));
[/asy]
|
gpt
|
Let $A$ be the area of the circular dartboard. If the measure of a central angle of a sector is $x$ degrees, then the area of the sector is $\left(\frac{x}{360}\right)A$. The probability of the dart landing in a region is ratio of the area of the region to the area of the dartboard, so \[
\frac{1}{6} = \frac{\left(\frac{x}{360}\right)A}{A}.
\] Solve to find $x=\boxed{60}$.
|
human
|
Allen and Bethany each arrive at a party at a random time between 1:00 and 2:00. Each stays for 15 minutes, then leaves. What is the probability that Allen and Bethany see each other at the party?
|
gpt
|
We let the $x$ axis represent the time Allen arrives, and the $y$ axis represent the time Bethany arrives.
[asy]
draw((0,0)--(60,0), Arrow);
draw((0,0)--(0,60), Arrow);
label("1:00", (0,0), SW);
label("1:15", (0,15), W);
label("1:45", (60,45), E);
label("1:15", (15,0), S);
label("2:00", (60,0), S);
label("2:00", (0,60), W);
fill((0,0)--(60,60)--(60,45)--(15,0)--cycle, gray(.7));
fill((0,0)--(60,60)--(45,60)--(0,15)--cycle, gray(.7));
[/asy]
The shaded region represents the times that Allen and Bethany would see each other at the party. For example, if Allen arrived at 1:30, Bethany could arrive at any time between 1:15 and 1:45 and see Allen at the party. Let one hour equal one unit. Then, we can calculate the area of the shaded region as the area of the entire square minus the areas of the two unshaded triangles. This will be equal to $2\cdot \frac{1}{2} \cdot \frac{3}{4} \cdot \frac{3}{4}=\frac{9}{16}$. So, the area of the shaded region is $1-\frac{9}{16}=\boxed{\frac{7}{16}}$. Since the area of the square is 1, this is the probability that Allen and Bethany see each other at the party.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.