According to question ,
It can be seen that every city is connected to all the other cities (i.e. 3 other cities).
Step 1: Let starting point is A, there are 3 ways in which we could proceed, viz. AB, AD or AC.
Step 2: Once we are at any of these cities (B, D or C), each one of them is connected to 3 other cities. But since we cannot go back to A the originating city, there are only 2 ways in which we could proceed from here.
Step 3: let us assume that we are at B, we can only go to D or C by taking BD or BC respectively. From this point we a choice of either directly going back to A (thus skipping 4th city or go to 4th city and come back to A. )
Step 4:- Now if we are at D, we can either take DA or DCA. So there are 2 more ways to go from here.
So , total number of ways = 3 x 2 x 2 = 12 ways.
Binary system is what the representation uses only two digits 0 & 1.
It uses only the powers of 2.
The nine pieces consist of 8 smaller equal pieces and one half cake piece.
Weight of each small piece = 15 g.
So, total weight of the cake = [2 x (15 x 8)]g = 240 g.
Frequency is what means how many times the event occurs in the same period.
Arithmatic mean = sum/members
=> (1x1 + 2x2 + 3x3 + 4x4 + 5x5 + 6x6 + 7x7) / (1 + 2 + 3 + 4 + 5 + 6 + 7)
=> 140/28 = 5
Let x be number of houses and y be colors.
on the basis of question
x = 4y+1
x = 5(y-1)
on solving these 2 equations x = 25
We know that in A.P series
18th term = a + 17d
29th term = a + 28d
But given
a + 17d = 29..........(i)
a + 28d = 18......... (ii)
Solving equation (i) and (ii), we get
d = -1
put d = -1 in any of the above equations and we get,
a = 46
Now, we know 49th term can be written as, a + 48d
putting the value of a and d in the above equation,
a + 48d = 46 + 48(-1)
= 46 - 48
= -2
Hence, the 49th term is -2.
Comments
There are no comments.Copyright ©CuriousTab. All rights reserved.