A shopkeeper takes 12 bags of coins to the bank. The bags contain the following numbers of coins: 150, 163, 158, 165, 172, 152, 160, 170, 156, 162, 159 and 175. a Represent this information in a stem-and-leaf diagram. b Each bag contains coins of the same value, and the shopkeeper has at least one bag containing coins with dollar values of 0.10, 0.25, 0.50 and 1.00 only. What is the greatest possible value of all the coins in the 12 bags?

A shopkeeper takes 12 bags of coins to the bank. The bags contain the following numbers of coins: 150, 163, 158, 165, 172, 152, 160, 170, 156, 162, 159 and 175. a Represent this information in a stem-and-leaf diagram. b Each bag contains coins of the same value, and the shopkeeper has at least one bag containing coins with dollar values of 0.10, 0.25, 0.50 and 1.00 only. What is the greatest possible value of all the coins in the 12 bags?

College Algebra (MindTap Course List)

12th Edition

ISBN:9781305652231

Author:R. David Gustafson, Jeff Hughes

Publisher:R. David Gustafson, Jeff Hughes

Chapter8: Sequences, Series, And Probability

Section8.6: Permutations And Combinations

Problem 2SC: How many different signals can be sent, when three flags are used, if two of the 9 flags are...

See similar textbooks