A Problem Solving Approach to Mathematics for Elementary School Teachers, Books a la Carte Edition plus NEW MyLab Math with Pearson eText - Access Card Package (12th Edition)

12th Edition

ISBN: 9780133865479

Author: Rick Billstein, Shlomo Libeskind, Johnny Lott

Publisher: PEARSON

See similar textbooks

Concept explainers

Permutations and Combinations

If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba…

Counting Theory

The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.

Videos

Textbook Question

Chapter 1.1, Problem 4MC

Consider a game where you have two distict piles of objects.

Two players alternates moves, each player taking any number ( not 0 ) of objects desired from a single pile.

The player who takes the last objects (so nothing is left in either pile) is the winner.

If there are a objects in one pile and b objects in the second, we write ( a , b ) .

Given the game ( 1 , 1 ) , the first player loses because if she takes 1 from a pile, the second player takes 1 from the other pile. Answer the following:

a. Show that the first player can win the game ( 1 , 2 ) as well as ( 1 , 100 ) .

b. Who will win the game ( 1 , a ) if a > 1 ? Why?

c. Which player will win the games ( 2 , 2 ) , ( 3 , 3 ) , ( 4 , 4 ) ?

Why?

d. Which games can the first player always win? Why?

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 1.1, Problem 3MC

Chapter 1.1, Problem 5MC

Students have asked these similar questions

A particular two-player game starts with a pile of diamonds and a pile of rubies. Onyour turn, you can take any number of diamonds, or any number of rubies, or an equalnumber of each. You must take at least one gem on each of your turns. Whoever takesthe last gem wins the game. For example, in a game that starts with 5 diamonds and10 rubies, a game could look like: you take 2 diamonds, then your opponent takes 7rubies, then you take 3 diamonds and 3 rubies to win the game.You get to choose the starting number of diamonds and rubies, and whether you gofirst or second. Find all starting configurations (including who goes first) with 8 gemswhere you are guaranteed to win. If you have to let your opponent go first, what arethe starting configurations of gems where you are guaranteed to win? If you can’t findall such configurations, describe the ones you do find and any patterns you see.

In this game, two chips are placed in a cup. One chip has two red sides and one chip has a red and a blue side. The player shakes the cup and dumps out the chips. The player wins if both chips land red side up and loses if one chip lands red side up and one chip lands blue side up. The cost to play is $4 and the prize is worth $6. Is this a fair game. = Win a prize = Do not win a prize 1. Start by determining the probabilities for winning a prize and not winning a prize. Draw a probability tree to find the possible outcomes and the probabilities. After you draw the tree, check you work by clicking on the link below. Click to hide hint CHIP 1 CHIP 2 Probability P(Red) & P(Red) = P(R) - P(R) = 0.5. 0.5 = 0.25 0.5 0.5 0.5 P(Red) & P(Blue) = P(R) - P(B) = 0.5.0.5 = 0.25 Start 0.5 0.5 P(Red) & P(Red) = P(R) - P(R) = 0.5. 0.5 = 0.25 0.5 P(Red) & P(Blue) = P(R) - P(B) = 0.5.0.5 = 0.25

Maria plays the following game: There is a jar containing 2 gold coins, 2 silver coins, and 6 bronze coins. She must select two coins. She gets $2 for each gold coin she selects. She gets $1 for each silver coin she selects. She gets nothing for selecting bronze coins. For example, if she picks one gold and one silver coin, she will get $3 total. If she picks one silver and one bronze coin, she gets $1 total. Let X be her winnings for this game. Fill in the pmf table (leave your answers here as fractions). x 0 1 2 3 4 p(x) Compute the expected value. Write your answer as a decimal (as you would a dollar amount): $ .

Chapter 1 Solutions

A Problem Solving Approach to Mathematics for Elementary School Teachers, Books a la Carte Edition plus NEW MyLab Math with Pearson eText - Access Card Package (12th Edition)

Ch. 1.1 - Mathematical Connections 1-2 a. If a fixed number...Ch. 1.1 - Mathematical Connections 1-2 A student says she...Ch. 1.1 - Mathematical Connections 1-2 Abby and Dan are...Ch. 1.1 - Consider a game where you have two distict piles...Ch. 1.1 - Mathematical Connections 1-2 A mathematician named...Ch. 1.1 - Mathematical Connections 1-2 The figure below...Ch. 1.1 - Mathematical Connections 1-1 The distance around...Ch. 1.1 - Work in pairs on the following versions of a game...Ch. 1.1 - John asks why the last step of Polyas four-step...Ch. 1.1 - Mathematical Connections 1-2 Connecting...

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

Solution Summary: The author explains that there are two distinct piles of objects. The first player wins the game (1,2) and the second player takes the last object from the pile.

Concept explainers

Videos

Want to see the full answer?

Chapter 1 Solutions