The answer is a
hope this helps
Answer with Step-by-step explanation:
Since we have given that
a + b = c
and a|c
i.e. a divides c.
We need to prove that a|b.
⇒ a = mb for some integer m
Since a|c,
So, mathematically, it is expressed as
c= ka
Now, we put the above value in a + b = c.
So, it becomes,
a=mb, here, m = k-1
Hence, proved.
Answer: Hello mate!
The partition of a set is defined as a partition of the set into a nonempty subset, where the set itself is a subset of himself, then the set is a partition of himself.
a) in this we have a set of two objects; A = (1,2) the partitions of this set are: (∅), (1), (2) and (1,2). Where (∅) is the null set.
b) Now we have a set of three objects; B = (a,b,c) the partitions of this set are: (∅), (a), (b), (c), (a,b), (a,c), (b,c), (a,b,c)
Answer:
1716 ways
Step-by-step explanation:
Given that :
Number of entrants = 13
The number of ways of attaining first, second and third position :
The number of ways of attaining first ; only 1 person can be first ;
Using permutation :
nPr = n! ÷(n-r)!
13P1 = 13! ÷ 12! = 13
Second position :
We have 12 entrants left :
nPr = n! ÷(n-r)!
12P1 = 12! ÷ 11! = 12
Third position :
We have 11 entrants left :
nPr = n! ÷(n-r)!
11P1 = 11! ÷ 10! = 11
Hence, Number of ways = (13 * 12 * 11) = 1716 ways
Answer:
334 in^2.
Step-by-step explanation:
The surface area = area of the top prism + area of the bottom - 2 * area of the base of the top smaller prism
= 2(5*3 + 5*3 + 3*3) + 2(9*7 + 9*5 + 7*5) - 2* 3*5
= 2* 39 + 2*143 - 30
= 334
