Consider the following two-player game. There are two piles of matches. Initially each pile contains n matches. Players alternate moves. A move consists of choosing one of the two piles and removing some nonzero number of matches from it. The player who removes the last match wins. Using strong induction, show that the second player always has a winning strategy.

answer: options?

step-by-step explanation:

hello :

70y^8 + 30y^6 = 2 ( 35 y^8 + 15y^6)

the lenght is : 35 y^8

the width is : 15y^6

part d

step-by-step explanation:

theresa talked her parents into getting sd cards for her phone and her brother’s phone. inserting an sd card into a phone gives it more storage. they both get 8-gigabyte sd cards. how many bits of storage come with each sd card? type your answer in both scientific and standard notation.

answer: 0.64

step-by-step explanation: