1 chocolate cost is Rs.1 & if we return 3 wrapers(covers) of
chocolate we get 1 more chocolate. If u have Rs.15 how many
chocolates do u get...?
Answers were Sorted based on User's Feedback
Answer / kasthuri n
for rs 15 =15 chocolates.
so now 15 wrappers will be there.
given is for 3 wrappers they will give 1 chocolate so , for 15 wrappes 15/3=5chocolates
now for 3 from 5 will have 1 more chocolate
2 from 5 plus the chocolate given for the above step make us to get 1 chocolate
totaly =15+5+1+1=22
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / shivesh dwivedi
15 rs =15 chocolate & 15 wraper
15 wraper=5 chocolate
5 chocolate=5 wraper
5 wraper=1chocolate & 2wraper
1chocolate=1 wraper
now total 3 wraper left=1chocolate
so total chocolate=15+5+1+1=22
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / ashwaq
1.Rs.1.00 = 1 Chock.
2.3 wrappers = 1 chock.
3.Rs.15.00 = ? chocks
Ans:
Rs.15.00 = 15 chocks,then 15 chocks = 15 wrappers,15 wrapp = 5 chocklates (in return). so total chockalates = 15 + 5
= 20 chockalates.
| Is This Answer Correct ? | 0 Yes | 3 No |
rita bought dress at 3000 sold it to sita for 25 % profit, sita didnt like it sold it back to rita for 10 % loss. wat % of profit rita got during the transaction ?
please i need help on getting hevron nigeria aptitude test questions.
Two planes take off at the same exact moment. They are flying across the Atlantic Ocean. One leaves New York and is flying to Paris at 800 km/hr. The other leaves Paris and is flying to New York at only 750 km/hr ( because of a strong head wind ). Which one will be closer to Paris when they meet?
3 Answers Wipro, Zarca Interactive,
pls send me model question question and answer paper of 5 years. my email add:goutamda126@rediff.com pls send me as early as poissible ..........
6 Answers Bank of Baroda, Tata Steel Limited,
the minimum of (2x+1)**2 + (x+2) is at x =
5625 ÷ 75 + √¯x = x (a) 441 (b) 400 (c) 361 (d) 484 (e) None of these
How many branches have?
what is the probability that 4 numbers selected from 1 to 40 are not consecutive.
what ia tha c++ code to find the position of prime numbers in prime number series??
Find the smallest number which leaves 22,35, 48 and 61 as remainders when divided by 26, 39, 52 and 65 respectively.
At six o'clock the wall clock struck 6 times . Checking with my watch , I noticed that the time between the first & last strokes was 30 seconds . How long will the clock take to stike 12 at mid night
Which number does not belong to this series 1,1,2,3,4,5,8,13,21?