## Armored but not a knight

Armored but not a knight, snapping but not a twig, and always at home, even on the move. What am I?

A turtle.

Armored but not a knight, snapping but not a twig, and always at home, even on the move. What am I?

A turtle.

The digits 0-9(0,1,2,3,4,5,6,7,8,9) can be rearranged into 3628800 distinct 10 digits numbers.
How many of these numbers are prime?

None. The sum of numbers from 0-9(0,1,2,3,4,5,6,7,8,9) is 45 and therefore can be divisible by 3 and 9.

What has a foot but no legs?

A snail.

Shadow drove into the Speedy Service Station and pulled up to the pumps. "Fill it up, please," said Shadow. "
This may sound strange," said the owner, "but I'd rather fill two cars from out of town than one car from this town."
Shadow looked across the small town and replied, "I know just what you mean."
Why would the owner feel this way?

The owner would rather fill two cars from anywhere than one car from town because he would make twice the amount of money.

This is a newspaper headline:
Workers Strike - Want to Make Less Money!
What is going on?

The workers work at the mint and are tired of being overworked. They want to work less, which is making less money, since money is made at the mind!

A man was driving a truck at 60 mph. He did not have his headlights on and the moon was not up. Yet he did not hit the woman who crossed the road. How?

He was driving the truck during daytime.

You have 25 horses. When they race, each horse runs at a different, constant pace. A horse will always run at the same pace no matter how many times it races.
You want to figure out which are your 3 fastest horses. You are allowed to race at most 5 horses against each other at a time. You don't have a stopwatch so all you can learn from each race is which order the horses finish in.
What is the least number of races you can conduct to figure out which 3 horses are fastest?

You need to conduct 7 races.
First, separate the horses into 5 groups of 5 horses each, and race the horses in each of these groups. Let's call these groups A, B, C, D and E, and within each group let's label them in the order they finished. So for example, in group A, A1 finished 1st, A2 finished 2nd, A3 finished 3rd, and so on.
We can rule out the bottom two finishers in each race (A4 and A5, B4 and B5, C4 and C5, D4 and D5, and E4 and E5), since we know of at least 3 horses that are faster than them (specifically, the horses that beat them in their respective races).
This table shows our remaining horses:
A1 B1 C1 D1 E1
A2 B2 C2 D2 E2
A3 B3 C3 D3 E3
For our 6th race, let's race the top finishers in each group: A1, B1, C1, D1 and E1. Let's assume that the order of finishers is: A1, B1, C1, D1, E1 (so A1 finished first, E1 finished last).
We now know that horse D1 cannot be in the top 3, because it is slower than C1, B1 and A1 (it lost to them in the 6th race). Thus, D2 and D3 can also not be in the to 3 (since they are slower than D1).
Similarly, E1, E2 and E3 cannot be in the top 3 because they are all slower than D1 (which we already know isn't in the top 3).
Let's look at our updated table, having removed these horses that can't be in the top 3:
A1 B1 C1
A2 B2 C2
A3 B3 C3
We can actually rule out a few more horses. C2 and C3 cannot be in the top 3 because they are both slower than C1 (and thus are also slower than B1 and A1). And B3 also can't be in the top 3 because it is slower than B2 and B1 (and thus is also slower than A1). So let's further update our table:
A1 B1 C1
A2 B2
A3
We actually already know that A1 is our fastest horse (since it directly or indirectly beat all the remaining horses). So now we just need to find the other two fastest horses out of A2, A3, B1, B2 and C1. So for our 7th race, we simply race these 5 horses, and the top two finishers, plus A1, are our 3 fastest horses.

What is red but it smells like a blue paint?

Red paint.

A horse is tied to a fifteen-foot rope and there is a bale of hay 25 feet away from him. The horse however is still able to eat from the hay. How is this possible?

The rope wasn't tied to anything.

Justin Case and Auntie Bellum are fellow con artists who deliver coded messages to each other to communicate. Recently Auntie Bellum was put in jail for stealing a rare and expensive diamond. Only a few days after this, Justin Case sent her a friendly letter asking her how she was. On the inside of the envelope of the letter, he hid a code. Yesterday, Auntie Bellum escaped and left the envelope and the letter inside the jail cell. The police did some research and found the code on the inside of the envelope, but they haven't been able to crack it. Could you help the police find out what the message is?
This is the code:
llwatchawtfeclocklnisksundialcirbetimersool

The message was "loose bricks in left wall." The message was put backward with words related to time in between. This is how the message looks when separated:
ll watch awtfe clock Inisk sundial cirbe timer sool
If you take out watch, clock, sundial, and timer, this is what is left:
llawtfelniskcirbesool
Look at this backwards and this is what you have:
loose bricks in left wall
Auntie Bellum took out the bricks and escaped in the night. Then, she put the bricks back where they were.