If all the below statements are true

1. Gianni was either in Italy or France in 1997.
2. If Gianni did not kill Versace, Hilton must have killed him.
3. If Versace died of suffocation, then either Gianni killed him or Versace committed suicide.
4. If Gianni was in Italy in 1997, then Gianni did not kill Versace.
5. Versace died of suffocation, but he did not kill himself.

Who killed Versace and where was Gianni in 1997?

Queen Elizabeth organised a royal party.

To Avoid uninvited guest royal family set a password.
Jack (an uninvited person) plan to enter the party. He stand nearby the door.

First guest comes, the security person said 'twelve' and guest replied with six.
Second guest comes , the security person said 'six' and guest replied with 'three'.

Jack thought is enough and he walked to the entry point. The security person said 'eight' , Jack replied smilingly 'four'.
He was immediately thrown out of the party. why ?

I am thinking of a five-digit number such that:
The first and last digits are the same, their submission is an even number and multiplication is an odd number and is equal to the fourth number. Subtract five from it and we obtain the second number. Then divide into exact halves and we get the 3rd number.

What number I am thinking of?

The day after tomorrow will be three days before Tuesday. Can you find out what is today?

What is the probability of getting five Mondays in a 31-day month?

What animal walks on four legs in the morning, two legs during the day, and three legs in the evening?

Oedipus, the king of Thebes, figured out the answer to the riddle:

How will you measure 15 minutes using two hourglasses of 7 minutes and 11 minutes respectively?

The owner of a popular clothing store comes up with his own method of pricing items. A vest costs $8, socks cost $10, a tie costs $6, and a blouse costs $12. Using the owner’s method, how much would a pair of underwear cost?

What is the next number in this series?

4,12,84,3612....

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?