In the city of Brain Teasers, 5% of people do not list their phone numbers. Now if we select random 100 people from the phone directory, then how many people selected will have unlisted phone numbers?

Without looking at a calendar, within a minute name, a boy's name using 5 consecutive 1st letters of 5 consecutive months

We can be boring,Or interesting.
We can be long,Or short.
We can have pictures,Or just words.
Many love us,But many also hate us.
What are we?

A father's child, a mother's child, yet no one's son.

Who am I?

In front of you, there are 9 coins. They all look absolutely identical, but one of the coins is fake. However, you know that the fake coin is lighter than the rest, and in front of you is a balance scale. What is the least number of weightings you can use to find the counterfeit coin?

I have eight fingers and two thumbs but I do not live. What Am I?

John Went to the nearby store in a Mall to buy something for her home. Below is the conversation between the two:

John: How much for the one?
Shopkeeper: It is $2
John: How much for the Eleven?
Shopkeeper: It is $4
John: How much for the Hundred?
Shopkeeper: It is $6.

What is John buying?

There is a circular car race track of 10km. There are two cars, Car A and Car B. And they are at the exact opposite end to each other. At Time T(0), Both cars move toward each other at a constant speed of 100 m/seconds. As we know both cars are at the same speed they will always be the exact opposite to each other.
Note, at the center, there is a bug which starts flying towards Car A at time T(0). When the bug reaches car B, it turns back and starts moving towards the car A. The speed of bug is 1m/second. After 5 hours all three stop moving.
What is the total distance covered by the bug?

In a secret society, a buried chamber can be accessed only via a secret password. The password is seven characters long and comprises of just letters and numbers.

You find a code that can help you in cracking the password. The code says "You force heaven to be empty".

Can you deduce the password from that?

You stand in front of two doors. A guard stands next to each door. You know the following things: one path leads to paradise, the other leads to death. You cannot distinguish between the two doors. You also know that one of the two guards always tells the truth and the other always lies. You have permission to ask one guard one question to discover which door leads to paradise. What one question would you ask to guarantee you enter the door to paradise?