We have arranged an array of numbers below. What you have to do is use any kind of mathematical symbol you know excluding any symbol that contains a number like cube root. You can use any amount of symbols but you have to come up with a valid equation for all of them.
Use the numbers 2, 3, 4 and 5 and the symbols + and = to make a true equation. Conditions: Each must be used exactly once and no other numbers or symbols can be used.
You have $100 with you and you have to buy 100 balls with it. 100 is the exact figure and you can't go below or above the numbers and you have to use the entire $100. If there is no kind of tax applied how many of each of the following balls will you be able to buy:
Green Balls costing $6
Yellow Balls costing $3
Black Balls costing $0.10
Now, how many of each must you buy to fulfil the condition given?
Find three numbers such that When we multiply three numbers, we will get the prime numbers. The difference between the second and the first number is equal to the third and second.
The Puzzle: Here is a famous prize problem that Sam Loyd issued in 1882, offering $1000 as a prize for the best answer showing how to arrange the seven figures and the eight 'dots' .4.5.6.7.8.9.0. which would add up to 82
Find out a multi-digit number that if multiplied by the number 9 or any of its multiplications products (i.e. 18, 27, 36, 45,..) will result in the multiplication factor repeated (n) number of times.
There are two insects on a tile. Insect X is sitting on one side of the tile (point A) and Insect Y is sitting opposite on the other side of the tile (point B). Now both of them decide to change their position and thus X starts crawling to point B and Y starts crawling to point A. When they meet and pass each other in between, X takes 20 seconds to reach B and Y takes just 5 seconds to reach A.
Can you calculate the total time each of the insects took to change their positions?
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
