Magnus Interview Questions, Process, and Tips

122

0,8x= y
y – 0,7y = 270

y= 270 / 0,3
y=900

0,8x=900
x=1125

CASE 1: First we should take six balls divided equally and
then it is placed on the two pans.three on one and three on
other..
if the two pans are balanced then the defective ball is not
in the six..then we should the two and keep them one ball
on each.
CASE2: Again We should take any of the six balls and
divided equally and then it is placed on the two pans.. if
any of the pan weighs less than the other.. We should take
the three balls seperately..Now from that three we should
take any two and placed one on each.. fi both the pan
balances the ball which is left over is the defective.. if
one ball weighes less than the other,while keeping one on
each,then it is the defective one….

Let’s say, length of train = x metres
Speed at pole = Speed at platform
x/15 = 100+x / 25
5x = 300 + 3x
2x = 300
x = 150m
So, train is 150 metres long.

16

9 its just like popcorn box in cineme everyone take large leaving medium
aside

Answer: 3121 gold coins
Let total no of coins be M
Let the disbursement D to each son:

D1 = 1 + (M – 1)/5 = (M + 4)/5
D2 = 1 + ( M – D1 -1)/5 = (D1) * 4/5
D3= (D2) * 4/5
D4= (D3) * 4/5
D5= (D4) * 4/5
Total disbursements to sons=
= ∑D= (M+4)*1/5[ 1+4/5+(4/5)(4/5)+ (4/5)(4/5)(4/5)+(4/5)(4/5)(4/5)(4/5) ]
= (2101/3125)*(M+4)
Thus balance left for daughters =M-{(2101/3125)*(M+4)}
=(1024M-8404)/3125
This balance should be a positive integer ( assuming M and all disbursements are full coins )
Thus 1024M-8404 should be a multiple of 3125….so….
1024M – 8404 = N*3125 where N is an integer
Using Python code:
n=int(input(“Enter num n: “))
X=int()
a=int()
a=0
X=’ ‘
for a in range(0,n+1):
a=a+1
X= (3125*a + 8404)/1024
if (3125*a + 8404)% 1024== 0:
print(X,a)
Enter num n: 10000
3121.0 1020
6246.0 2044
9371.0 3068
12496.0 4092
15621.0 5116
18746.0 6140
21871.0 7164
24996.0 8188
28121.0 9212
We get minimum value of N = 1021 and M = 3121 gold coins

Tree

Rs.265.80

Mother