If you say my name, I will no longer exist. What am I?

On my way to St. Ives I saw a man with 7 wives. Each wife had 7 sacks. Each sack had 7 cats. Each cat had 7 kittens. Kittens, cats, sacks, wives. How many were going to St. Ives?

A wooden log balances equally on the scales when weighed with three-quarters of a pound and three-quarters of a wooden log.

Can you calculate the weight of the entire wooden log?

A worker is to perform work for you for seven straight days. In return for his work, you will pay him 1/7th of a bar of gold per day. The worker requires a daily payment of 1/7th of the bar of gold. What and where are the fewest number of cuts to the bar of gold that will allow you to pay him 1/7th each day?

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?

Which word does the below Plexor means ?

John bought a new car. He has a habit of eating ice cream from a particular ice cream shop while returning home from office. Whenever, he eats strawberry ice cream, he faces no problem. But whenever, he eats chocolate ice cream, the car starts giving problem. At first, he thinks, it is just a co-incidence but when this awkward incident happens for 3-4 times, he reports this problem to the company.

The mechanic of the company checks but finds no problem at all. The next day, when he stops by to eat chocolate ice cream, the car again starts giving problem.

Can you find the possible reason?

Considering the below equation:

V + II - VI = 10
IV - X + VIII = 20
IV - VII + VI = 30

Then, I + II + III = ?

Find the combined weight of the Cat, Dog and Rabbit in the given picture.

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?