Well to solve this, lets plug in some numbers. Lets assume that for now, the starting number is 2. If it increases by 100%, bringing it up to 4, then decreases 100%, it is brought down to zero. Now one thing to note is that any number decrease by 100% is automatically zero. Watch, we start with two, it is then increased by 150%, bringing it up to 5, then decreased by 100%, bringing it back down to zero. In conclusion, 100% cannot be specified as a value, but rather a relation. 100% represents the entire number, meaning that if you are decreasing a number by 100%, you are basically subtracting the number by itself!
105/2^9
Step-by-step explanation:
The probability of getting a head in a single toss
p=12
The probability of not getting a head in a single toss
q=1−12=12
Now, using Binomial theorem of probability,
The probability of getting exactly r=4 heads in total n=10 tosses
=10C4(1/2)4(1/2)10−4
=10×9×8×7/4! 1/2^4 1/2^6
=2^44⋅9⋅35/24(2^10)
=105/2^9
Answer:
V = 32
Step-by-step explanation:
Comment
I think you should try this one yourself after I post my answer. Estimation is a very valuable tool -- the more you use it, the handier it gets.
Formulas
pi = 3
V = 4/3 * pi * r^3
Givens
r = 2
pi = 3
Solution
V = 4/3 * pi * r^3 Substitute values for symbols
V = 4/3 * 3 * 2^3 Cancel the 3s
V = 4 * 2^3 Expand the 2s
V = 4 * 2 * 2 * 2 Find V
V = 32
The mileage is the independent variable. You can control it. The gasoline remaining DEPENDS ON the number of miles different. That's why it's called the dependent variable. It's change depends on the change in the independent variable
Answer: 27434
Step-by-step explanation:
Given : Total number of vials = 56
Number of vials that do not have hairline cracks = 13
Then, Number of vials that have hairline cracks =56-13=43
Since , order of selection is not mattering here , so we combinations to find the number of ways.
The number of combinations of m thing r things at a time is given by :-
Now, the number of ways to select at least one out of 3 vials have a hairline crack will be :-
Hence, the required number of ways =27434
