Well if you get back to the definition of a division, diving X by Y is finding out how many Ys you can have in a X.
It is clear that you will have more than X times Y if Y is less than 1 since dividing X by 1 is exactly X.
If you think of 10 and 1, you can divide 10 in exactly 10 portions of 1.
But you can divide it into 100 portions of 0,1.
And 100 is bigger than 10 of course.
Hope this helps.
Answer:
Step-by-step explanation:
The problem relates to filling 8 vacant positions by either 0 or 1
each position can be filled by 2 ways so no of permutation
= 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2
= 256
b )
Probability of opening of lock in first arbitrary attempt
= 1 / 256
c ) If first fails , there are remaining 255 permutations , so
probability of opening the lock in second arbitrary attempt
= 1 / 255 .
Answer:
c = 34/d
d = 1/2
Step-by-step explanation:
Part A
Basic Formula
c = k/d
17 = k/2 Multiply both sides by 2
17*2 = k*2/2 Combine
34 = k
So the equation is c = 34/d
Part B
c = 68
k = 34
d = ?
68 = 34/d Multiply both sides by d
68*d = 34 * d/d Simplify.
68 d = 34 Divide by 68
d = 34/68 Simplify
d = 1/2
n(A-B) denotes elements which are in A but not in B
n(Au B) denotes elements in A and B
n(AnB) denotes elements that are common in A and B
Now I will add one more set
n(B-A) which denotes elements in B but not in A
So, n(AuB) = n(A-B) + n( B-A) +n(AnB)
70 = 18 +n(B-A) + 25
70 = 43 + n(B-A)
n(B-A) = 70-43
n(B-A) = 27
So, n(B) = n( B-A) + n( AnB)
= 27+25
= 52
