We have a regular deck of52playing cards, with exactly 4 cards of each of the 13 ranks. The cards have been arbitrarily dealt into13piles, each with4cards in it. Prove that no matter how the13piles have been dealt, there is always a way to take a card from each pile so that we take exactlyone card from each rank.

what is the question?

step-by-step explanation:

just get this app called photo math it should be able to do those

the degrees would remain the same ( the number to the left of the decimal point.

the multiply the decimal by 60 to get the minutes and use the numbers to the left of the decimal point.

then multiply the decimal portion of that by 60 for the seconds and round off as needed.

39 .956652

the 39 remains the degrees.

the minutes = 0.956652 x 60 = 57.39912

the minutes = 57

the seconds = 0.39912 x 60 = 23.95 = 24 ( rounded to nearest tenth)

so 39.956652 = 39 degrees, 57 minutes and 24 seconds

-75.159809

the -75 remains the degrees

the minutes = 0.159809 x 60 = 9.58854

the minutes = 9

the seconds = 0.58854 x 60 = 35.31, rounded to nearest tenth = 35.3 seconds

so -75.159809 = -75 degrees, 9 minutes and 35.3 seconds.

the first coordinate is north or south, since it it positive it is north.

the second number is east or west, because it is negative it is west.

39 degrees, 57 minutes and 24 seconds n

-75 degrees, 9 minutes and 35.3 seconds w