A group of seven friends are playing poker one night, and one of the friends decides to try out a new game. They are using a standard 52-card deck. The dealer is going to deal the cards face up. There will be a round of betting after everyone gets one card. Another round of betting after each player gets a second card, etc. Once a total of 7 cards have been dealt to each player, the player with the best hand will win. However, if any player is dealt one of the designated cards, the dealer collects all cards, shuffles, and starts over. The designated cards are: 4 of Hearts, 7 of Spades, 5 of Diamonds. The players wish to determine the likelihood of actually getting to play a hand without mucking the cards and starting over. In how many ways can you deal the cards WITHOUT getting one of the designated cards

hope this .

r3t40

yess

step-by-step explanation:

idk whyy this is happening, i cant even read my notification bc i keep getting errors

~coco

(-5,-28)

i graphed to on desmos.

(b) 240

step-by-step explanation:

first, we use the pythagorean formula using the given side lengths to find x. then we use x to find the side lengths. then we add the side lengths to find the perimeter.

pythagorean theorem formula:

a^2 + b^2 = c^2

(x - 20)^2 + (x - 40)^2 = x^2

x^2 - 40x + 400 + x^2 - 80x + 1600 = x^2

x^2 -120x + 2000 = 0

(x - 100)(x - 20) = 0

x - 100 = 0 or x - 20 = 0

x = 100 or x = 20

we see that the solution x = 20 must be discarded because it will give a negative side length and a side length of 0. the only valid solution is x = 100.

perimeter = sum of the lengths of the sides

perimeter = x + x - 20 + x - 40

perimeter = 3x - 60

replace x with 100.

perimeter = 3(100) - 60

perimeter = 300 - 60

perimeter = 240