A computer user has downloaded 25 songs using an online file-sharing program and wants to create a CD-R with 11 songs to use in his portable CD player. If the order that the songs are placed on the CD-R is not important to him, how
many different CD-Rs could he make from the 25 songs available to him?

hi there!

first we need to find out how much they are adding to each number to make the next number.

ex: 4 + 4 = 8, 8 + 8 = 16, and so on.

so continuing with 32,

32 + 32 = 64

64 + 64 = 128

128 + 128 = 256

256 + 256 = 512

4, 8, 16, 32, 64, 128, 256, 512

the 8th term of the sequence will be 512

hope this ! ~

< 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)

step-by-step explanation: