Reduction of 40% or 4/10th in price of bananas will lead to an increase of 4/(10 – 4) = 2/3rd part in quantity if expenditure is constant.
If original quantity is q, then :
2q/3 = 64
=> q = 64 x 3/2 = 96 = 8 dozens.
=> Original price per dozen = 40/8 = Rs 5
0.18
The batsman on 98 is on strike. He hits the ball and they run 3. UNFORTUNATELY one of the batsmen doesn`t turn correctly for one of the runs and the umpire calls ONE SHORT and awards only two runs. Therefore the first batsman has his century. There is now 1 ball remaining and one run is required to win. The batsman on strike, however is now the one on 97 runs. He now either hits a 4 or a 6. They win the game and both batsmen scored centuries.
Read more: 3 runs required in 3 balls to win with only a wicket left. The batsmen is on 98 and the runner is on 97. How will both the batsmen score centuries … – 3 runs required in 3 balls to win with only a wicket left. The batsmen is on 98 and the runner is on 97. How will both the batsmen score centuries as well win the match ?
exactly
Reliance
2 and half day.
sample space=36
prob of one of the dice getting face 6
i.e n={(1,6)(2,6)(3,6)(4,6)(5,6)(6,1)(6,2)(6,3)(6,4)
(6,5)(6,6)}=11
p=n/s
p=11/36
ans:11/36
Error is at 48. Correct once is 58
s1(1+x/100)+s2(1+x/100)+s3(1+x/100)
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
1>=y>x => y belongs to (-infinity,1]
x belongs to (-infinity,y)
if both x and y are negitive z can be greater than zero and
can be greater than y(1 and 4 are true)
if y equals 1 then x can be equal to z(2 is true)
therefore y=z is not true for any value of x and y
72
1 through 24, divisible by 2 in descending order.
That leaves you with:
24, 22, 20, 18, 16, 14, 12, 10, 8, 6, 4, 2
8th place FROM the bottom means your answer will be 16.