Chapter 6: Q23E (page 396)
How many positive integers between \(100\) and \(999\) inclusive are divisible by \(3\)and by \(4\) ?
Short Answer
\(75\) integers are divisible by \(3\) and \(4\).
Chapter 6: Q23E (page 396)
How many positive integers between \(100\) and \(999\) inclusive are divisible by \(3\)and by \(4\) ?
\(75\) integers are divisible by \(3\) and \(4\).
All the tools & learning materials you need for study success - in one app.
Get started for free4. Every day a student randomly chooses a sandwich for lunch from a pile of wrapped sandwiches. If there are six kinds of sandwiches, how many different ways are there for the student to choose sandwiches for the seven days of a week if the order in which the sandwiches are chosen matters?
a) State the pigeonhole principle.
b) Explain how the pigeonhole principle can be used to show that among any 11 integers, at least two must have the same last digit.
How many permutations of {a,b,c,d,e,f,,g}end with a?
What is the coefficient of?
An ice cream parlour has \({\rm{28}}\) different flavours, \({\rm{8}}\) different kinds of sauce, and \({\rm{12}}\) toppings.
a) In how many different ways can a dish of three scoops of ice cream be made where each flavour can be used more than once and the order of the scoops does not matter?
b) How many different kinds of small sundaes are there if a small sundae contains one scoop of ice cream, a sauce, and a topping?
c) How many different kinds of large sundaes are there if a large sundae contains three scoops of ice cream, where each flavour can be used more than once and the order of the scoops does not matter; two kinds of sauce, where each sauce can be used only once and the order of the sauces does not matter; and three toppings, where each topping can be used only once and the order of the toppings does not matter?
What do you think about this solution?
We value your feedback to improve our textbook solutions.