In a classic wine shop, the list of three most popular wines are:
- The cost of 1 French wine bottle: 500$
- The cost of 1 German wine bottle: 100$
- The cost of 20 Dutch wine bottles: 100$
John entered the wine shop and he needs to buy
- All three types of wine bottles.
- Needs to buy Dutch wine bottles in multiples of 20.
- Need to buy 100 wine bottles in total.
John has only 10000$. How many wine bottles of each type, John must buy?
Three cars are driving on a track that forms a perfect circle and is wide enough that multiple cars can pass anytime. The car that is leading in the race right now is driving at 55 MPH and the car that is trailing at the last is going at 45 MPH. The car that is in the middle is somewhere between these two speeds.
Right now, you can assume that there is a distance of x miles between the leading car and the middle car and x miles between the middle car and the last car and also, x is not equal to 0 or 1.
The cars maintain their speed till the leading car catches up with the last car and then every car stops. In this scenario, do you think of any point when the distance between any two pairs will again be x miles i.e. the pairs will be x distance apart at the same time ?
A man desired to get into his work building, however he had forgotten his code.
However, he did recollect five pieces of information
* Fifth number + Third number = 14
* The fourth number is one more than the second number.
* The first number is one less than twice the second number.
* The second number and the third number equals 10.
* The sum of all five numbers is 30.
Five lovely ladies(Sophia, Isabella, Madison, Emma and Olivia) planned a picnic.
They each buy one thing each for the picnic.
Sophia, Emma and Olivia got a drink : orange-Juice, apple-juice, and mango-juice.
Olivia got the drink with the same letter as the one in her first name.
Emma loves mango-juice.
The other two bring some food : chocolates and pizza.
Also Madison is allergic to cheese.
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki