A game is being played where eight players can last for thirty-five minutes. Six substitutes alternate with each player in this game. Thus, all players are on the pitch for the same amount of time including the substitutes.

For how long is each player on the pitch?

If 2 workers can complete painting 2 walls in exactly 2 hours.

How many workers would be needed to paint 18 walls in 6 hours?

Solve below popular number sequence
314 159 265 358 979 323 846 ?

A network of 20 x 10 squares is given to you.

Can you calculate how many unique squares and rectangles can be formed combining two or more individual squares ?

A thief is convicted in Mexico. He gets the death penalty. The judge allows him to say the last sentence to determine how the penalty will be carried out. If the thief lies, he will be hanged, if he speaks the truth he will be beheaded. The thief tells the last sentence and to everybody's surprise some minutes later he is set free because the judge cannot determine his penalty. What did the thief say?

Two friends decide to get together; so they start riding bikes towards each other. They plan to meet halfway. Each is riding at 6 MPH. They live 36 miles apart. One of them has a pet carrier pigeon and it starts flying the instant the friends start traveling. The pigeon flies back and forth at 18 MPH between the 2 friends until the friends meet.

How many miles does the pigeon travel?

Can you find out which number multiplied by itself will give the output as 12345678987654321?

Use the numbers 2, 3, 4 and 5 and the symbols + and = to make a true equation. Conditions: Each must be used exactly once and no other numbers or symbols can be used.

If a zookeeper had 100 pairs of animals in her zoo, and two pairs of babies are born for each one of the original animals, then (sadly) 23 animals don’t survive, how many animals do you have left in total?

See the given image carefully. What you have to do is move the blue checkers in the position of the black checkers and vice versa. You are only allowed to move the checker to an adjacent empty space. Do it in the least possible moves.