How Many Pluses

How many pluses should we put between the digits of 987654321 to get a total of 99, and where?




Similar Riddles

Can you write down eight eights so that they add up to one thousand?

Asked by Neha on 29 Sep 2021


You are in a room that has three switches and a closed door. The switches control three light bulbs on the other side of the door. Once you open the door, you may never touch the switches again. How can you definitively tell which switch is connected to each of the light bulbs?

Asked by Neha on 02 Jul 2025

When I get multiplied by any number, the sum of the figures in the product is always me. What am I?

Asked by Neha on 10 Oct 2021


There is something which is always coming but never arrives?

Asked by Neha on 08 Mar 2024

There are a hundred statements.

First person says: At least one of the statements is false.

Second person says: At least two of the statements is false.

Third person says: At least three of the statements are false.

Fourth person says: At least four of the statements are false.

..

..

..

Hundredth person says: At least a hundred of the statements are false.

Analysing it, how many statements do you think are false and how many are true?

Asked by Neha on 18 Feb 2021

You bought me for dinner but never eat me. What am I?

Asked by Neha on 31 Aug 2025


On a special event at the prison, 5 prisoners John, Jacob, Krist, Tang, and Dang given a chance to go to a sauna and can bring one thing with them.

Following are the things that the prisoners bring with them.
John: A soda
Jacob: Thermos
Krist: Book named "How to kill"
Tang: A Walkman
Dang: Harmonica

Since it is a Sauna, no one can see each other. After a while When the steam is switched, Tang was found dead and there was blood all around.
J Bond was called and he instantly come to know who can be the murderer. How?

Asked by Neha on 07 Jul 2024

You along with your friend are standing in front of two houses. Each of those houses inhabits a family with two children.

Your friend tells you the below two facts:
1) On your left is a family that has a boy who likes accounts but the other child loves science.
2) On the right is a family with a seven-year-old boy and a newborn baby.

You ask him, "Does either of the family have a girl?"

To this, he replies, "I am not quite sure. But can you guess that? If you are right, I will give you $500."

Which family do you think is likely to have a girl?

Asked by Neha on 30 Nov 2024

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?

Nodes Connectivity Riddle

Asked by Neha on 20 Dec 2020


There are four people in a house. A fireman, an athlete, an old woman, and a drunk guy. The house catches fire and before the fact is known, it is too late. All they know is that the entire house is in flames and it will collapse exactly after twelve minutes. Now they can move out of the house but for that, they will have to pass the hallway which is entirely blazing with flames. Thus to move, one must carry a fire extinguisher to keep the flames away. Seeking the burnt wooden floor, only two people can run through that hallway at one time. But for others to go, one must return back with the fire extinguisher. The fireman is trained for such tasks and can run through the hallway in a minute. The athlete can make it in a couple of minutes. The old woman can run slowly and will cover the hallway in four minutes. The drunk guy will take five minutes to run through it. If all of them can make it through the hallway in twelve minutes, all of them will be saved. When two move together, they will run at the speed of the slower ones.

How will all four of them manage to run to safety?

Asked by Neha on 02 Jun 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