Can you find the thief by just looking at the picture below?

Find the mistake in the below maths equations

A = 2
A(A-1) = 2(A-1)
A2-A = 2A-2
A2-2A = A-2
A(A-2) = A-2
A = 1

A sea diver is a real show-off. He showed everyone that he can hold his breath underwater for 15 minutes.

I went to the diver and told him that I can be underwater for double the time i.e 30 minutes.
He responded that he will give me 100$ if I would be able to do it. I won 100$.

What did I do?

Replace the question mark with the number below given a simple math problem.

Birbal was jester, counsellor, and fool to the great Moghul emperor, Akbar.
The villagers loved to talk of Birbal's wisdom and cleverness,
and the emperor loved to try to outsmart him.
One day Akbar (emperor) drew a line across the floor.
"Birbal," he ordered, "you must make this line shorter, but you cannot erase any bit of it."
Everyone present thought the emperor had finally outsmarted Birbal.
It was clearly an impossible task.
Yet within moments the emperor and everyone else present had to agree that Birbal had made the line shorter without erasing any of it.
How could this be?

Client Dempsey living in one of the East Coast states of the U.S. was talking to Landon Donovan, who was living in the West Coast state of the U.S.

Dempsey: What time is it?
Donovan: Wow, It is the same time here.

How is this possible?

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.

0 0 0 = 6
1 1 1 = 6
2 + 2 + 2 = 6
3 3 3 = 6
4 4 4 = 6
5 5 5 = 6
6 6 6 = 6
7 7 7 = 6
8 8 8 = 6
9 9 9 = 6

Can you find a seven digit number which describes itself. The first digit is the number of zeros in the number. The second digit is the number of ones in the number, etc. For example, in the number 21200, there are 2 zeros, 1 one, 2 twos, 0 threes and 0 fours.

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?

You have two jars of chocolates labelled as P and Q. If you move one chocolate from P to Q, the number of chocolates on B will become twice the number of chocolates in A. If you move one chocolate from Q to P, the number of chocolates in both the jars will become equal.

Can you find out how many chocolates are there in P and Q respectively?