Step-by-step explanation:
Top answer · 0 votes
f(g(x))=362−x−2k f(g(x))=x→362−x−2k=x→x2−2x(1−k)−4(k−9)=0 Solution for x are equal if and only if discriminant Δ=0 4(1−k)2+16(k−9)=0 ... More
Answer:
D[3, 3], C[1, 4], B[0, 1], A[4, -1]
Step-by-step explanation:
Whenever you are doing a 90° clockwise rotation ABOUT THE ORIGIN, it is in the form of [<em>y</em><em>,</em><em> </em><em>-</em><em>x</em>], meaning you take the <em>y</em><em> </em>and make it your <em>x</em><em>,</em><em> </em>then take your original <em>x</em><em> </em>and put its OPPOSITE.
90° counterclockwise rotation → [<em>-y, x</em>]
90° clockwise rotation → [<em>y, -x</em>]
I hope this helps, and as always, I am joyous to assist anyone at any time.
Answer:
7 / 36
Step-by-step explanation:
Using the sample space attached,
Required outcome = multiple of 5 from the sun of two rolled dice = 7
Total possible outcomes =(number of faces)² = 6² = 36
Therefore, the probability of obtaining a sum which is a multiple of 5 is :
P(sum which is a multiple of 5) :
Required outcome / Total possible outcomes
= 7 / 36
There are 2001 items in that set.
So n(A) = 2001
We can individually count them all out, which is very slow and tedious, or we can use the formula
n-m+1
where,
m = starting value
n = ending value
In this case,
m = 0
n = 2000
So,
n-m+1 = 2000-0+1 = 2001
This formula only works if we increase the number by 1 each time (eg: 6, 7, 8, etc)
2 * M = X
M = to minutes
x = to how many tables washes