Magic Maths

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.




Similar Riddles

what does this below rebus represent identXQQQQQME

Rebus representation

Asked by Neha on 29 Jan 2025


What is common among 11, 69, and 88?

What is common here

Asked by Neha on 15 Sep 2023

There is a square of a particular number which when doubled, becomes 7 more than its quarter.

Can you find the number?

Asked by Neha on 17 Jul 2023


A brand new Mobile Phone was on sale at 20% as a promotional offer. By what per cent must the Mobile price be increased to sell it at the original price again?

Asked by Neha on 26 Oct 2023

Name a key which is hardest to turn.

Asked by Neha on 28 Apr 2024

It comprises roots which nobody sees,
Much taller than those trees,
Up and up it goes,
Still it never grows?

Asked by Neha on 02 Jan 2025


A container contains 100 eggs. They can be either fresh or rotten. What is sure is the fact that there is at least one fresh egg in that container.

If you are asked to pick two eggs randomly from the container, at least one of them will be rotten.

Can you calculate how many eggs in that container are fresh?

Asked by Neha on 19 Nov 2023

John is selling fruits.
He sells grapes at $30, Dates $25, and a Wolfberry $45.
At what price does he sell fig?

PS: Logical Thinking

Asked by Neha on 01 Jul 2023

Using the clues below, what four numbers am I thinking of?

The sum of all the numbers is 31.
One number is odd.
The highest number minus the lowest number is 7.
If you subtract the middle two numbers, it equals two.
There are no duplicate numbers.

Asked by Neha on 06 Jan 2025


Can you make numbers like 24, using numbers 3,3,7 & 7 with any arithmetic operator?

Asked by Neha on 25 Feb 2023

Hot Articles

Amazing Facts

No Solution

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