There are several sets of different numbers which can be chosen from {0,1,2,3,4,5,6,7,8,9}. How many of these sets contain any 5 numbers?

252 sets

Step-by-step explanation:

The set given to us is:

{0,1,2,3,4,5,6,7,8,9}

Total number of elements in set = n = 10

Number of elements to be included in seach set = r = 5

As the order doesn't matter, we can use the combination formula to find number of different combinations if we choose 5 numbers from the given 10 numbers with no repetition:

C(10,5) = 10!/(5!)(10-5)!

C(10,5) = 10!/(5!)(5!)

C(10,5) = 10·9·8·7·6/ 5·4·3·2·1

C(10,5) = 252

Thus 252 sets can be formed which contains any of the 5 numbers from the sets

the polynomial is a perfect square trinomial of the form a^2-2ab+b^2:

option a. true

step-by-step explanation:

9x^2-12x+4

comparing with the form a^2-2ab+b^2

1.) a^2=9x^2

solving for a: square root both sides of the equation:

sqrt(a^2)=sqrt(9x^2)

a=sqrt(9) sqrt(x^2)

a=3x

2.) b^2=4

solving for b: square root both sides of the equation:

sqrt(b^2)=sqrt(4)

b=2

to be a perfet square trinomial 2ab must be equal to 12x. let's check:

2ab = 2 (3x) (2)

2ab = 12x

correct

you can use a^2+ b^2=c^2