Number System

[junoonmba]

Originally Posted by rahulworld

We need to consider here the cycles for all the three words where cycle represent on+off period.

For I -> 7 5/6 + 3 = 65/6 sec
For II -> 4/3 + 3 = 13/3 sec
For III -> 11/3 + 3 = 20/3 sec

Now we need to find the time at which all these 3 ll converge which is nothing but the LCM = 260/3 sec

so, Ans = 260/3 - 3 = 251/3 sec.

Why u subtracted three.............

[Obsessed_bout_mba]

Originally Posted by junoonmba

Why u subtracted three.............

since they are glowing for 3 seconds initially and then they start goin off we need to subtract 3...correct me if i m wrong..

the answer is rite...thanks

[Obsessed_bout_mba]

can someone upload some pdf material for numbers...?
a doc that has all the basics of numbers../

or any website to get it....jus to go thro during office hrs

[rahulworld]

Originally Posted by Obsessed_bout_mba

since they are glowing for 3 seconds initially and then they start goin off we need to subtract 3...correct me if i m wrong..

the answer is rite...thanks

To add more to this, 3 has to be subtracted as in the Q it's asked when is the next time (after initial glowing together) they will again glow togther, i.e., starting time is asked whereas our LCM includes both on+off period.

[rahul_85]

Originally Posted by krsh.vik

number of ways of selecting four out of 9 places in a circular table so that none of them are adjacent
select one place in 9 ways
out of the remaining 6 select three such dat none of them are adjacent in four ways
total 36 ways

sorry krsh.vik u r answer is wrong..........the correct answer given is 9..........however i dont know the explaination...if u can now solve it pls proceed

[krsh.vik]

Originally Posted by rahul_85

sorry krsh.vik u r answer is wrong..........the correct answer given is 9..........however i dont know the explaination...if u can now solve it pls proceed

well yes it will contain repetitions ...
infact the answer is 9 only ....
I listed out all the possibilities ...

Now solve this

There is a 15 sided regular polygon. How many 7 sided polygons can be formed by joining the vertices of the 15 sided polygon with no sides common between both of them

[harish3687]

Hi
plz help me to solve dis..

A+B+C+D=D+E+F+G=G+H+I=17 where each letter represent a nuber from 1 to 9.Find out letter D and G if letter A=4.

[krsh.vik]

Originally Posted by harish3687

Hi
plz help me to solve dis..

A+B+C+D=D+E+F+G=G+H+I=17 where each letter represent a nuber from 1 to 9.Find out letter D and G if letter A=4.

D = 5 G = 1

[nishant_rungta]

Originally Posted by krsh.vik

D = 5 G = 1

Krish Bhai... Thanks for giving out the answer.. But we wud really appreciate it if u cud also provide the approach and d solution.. The approach holds a greater significance than the answer.. Harish requested for the method to solve it and not jus the answer. Hats off to u for solving the most intricate problems but it wud be gr8 if u cud give out the method. That wud indeed help us all tremendously.. Thank u..

Regards,
Nishant..

[harish3687]

tq krsh.vik..but can u specify the approach