32 Km/hr
d
1km = 1000m
Xkm = 300m
X=0.30km
1hr = 3,600s
X = 40.5s
0.01125hr
Therefore; 0.3km/0.1125hr= 26.6666=26.67km/hr
w(drown)
7days
The answer cannot be determined as there is a particular formula where the consecutive numbers start.
Total distance to cover = 132 +110 = 242m
Speed = 72kn/hr = 20m/s
time = 242/20 = 12.1 sec.
Maximum number of edges = 9. Start from one corner. Select any face including that corner. Complete a square (4 edges) around the face to reach at the starting corner point . Now, move to the opposite face through the edge joining them and passing through the starting point(1 edge). Now, complete the square of edges around this face(4 edges). Total = 4+1+4 = 9 edges
The formula to find number of diagonals (D) given total number of vertices or sides (N) is
N * (N – 3)
D = ———–
2
Using the formula, we get
1325 * 2 = N * (N – 3)
N2 – 3N – 2650 = 0
Solving the quadratic equation, we get N = 53 or -50
It is obvious that answer is 53 as number of vertices can not be negative.
Alternatively, you can derive the formula as triange has 0 diagonals, quadrangel has 2, pentagon has 5, hexagon has 9 and so on……
Hence the series is 0, 0, 0, 2, 5, 9, 14, …….. (as diagram with 1,2 or 3 vertices will have 0 diagonals).
Using the series one can arrive to the formula given above.
Ratio of diameters=1:2
Ratio of radius=1:2
Ratio of volumes=(4/3*3.14*r1^3)/(4/3*3.14*r2^3)
=r1^3/r2^3=1^3/2^3=1/8
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
(p*r*t)/100 = I ………………..(p*3*10)/100 = 840 …..p = 84000/30 = 2800
bank of calcutta originated in 1806
there is another answer such as
bank of hindustan