There is an infinite amount of 10 digits numbers with at leas two 1s in it.
Answer:

Step-by-step explanation:
Given

Required
The difference quotient for h
The difference quotient is calculated as:

Calculate f(x + h)



The numerator of
is:


Collect like terms


So, we have:

Rewrite as:


Answer:
y^35
Step-by-step explanation:
I got 70
Combination=n!/((n-r)!r!)
=8!/((8-4)!*4!)
=8*7*6*5*4!/(4!*4!)
=8*7*6*5/(4*3*2)
=70 ways