the game of monopoly is played on a square board with 10 spaces per side (so 40 in total). a player starts at the space marked "go" and on each turn rolls two sided dice, advancing forward a number of spaces equal to the sum of the two numbers that lands face up. let p be the probability that a player after they "loop around" the board 10 times, lands on the space "boardwalk" (the 40th square) before they "loop around" the board an eleventh time. Which integer is closest to the value 20p

step-by-step explanation:

if you want to solve percent error follow these steps.

1. subtract the accepted value from the experimental value.

2. take the absolute value of step 1.

3. divide that answer by the accepted value.

4. multiply that answer by 100 and add the % symbol to express the answer as a percentage.

if you want to solve percent of change just do this.

1. work out the difference (increase) between the two numbers you are comparing.

2. divide the increase by the original number and multiply the answer by 100. if your answer is a negative number then this is a percentage decrease.

hope this : )

49%

step-by-step explanation:

when you realize that you dont know just realize i just took a test and im so smart

< xcy ≅ < xby

step-by-step explanation:

in δcax and δbax,

so, δcax ≅ δbax (side-angle-side or sas)

since δcax ≅ δbax, we can conclude < acx ≅ < abx

in δacy and δaby,

so, δacy ≅ δaby (side-angle-side or sas)

since δacy ≅ δaby, we can conclude < acy ≅ < aby

now,

< acy ≅ < aby

=> < acx + < xcy ≅ < abx + < xby

=> < acx + < xcy ≅ < acx + < xby   (since < acx ≅ < abx already proved above)

subtracting < acx from both sides, we get

< acx + < xcy -< acx ≅ < acx + < xby -< acx

cancelling out < acx and -< acx from both sides, we get

< xcy ≅ < xby (proved)