Hopefully this one has not appeared before...

**Suppose 27 identical cubical chunks of cheese are piled together to form a cubical stack, as illustrated below. What is the maximum number of these cheese chunks through which a mouse of negligible size could munch before exiting the stack, assuming that the mouse always travels along the grid of 27 straight lines that pass through the centers of the chunks parallel or perpendicular to their sides, always makes a 90 degree turn at the center of each chunk it enters, and never enters any chunk more than once?**

Luckily, the five other prisoners each have phones (no speakerphones) and you have a list of three phone numbers. Two of them call US bases who know the name of the traitor. The other calls a former US base that was infiltrated by the Taliban who could say anything (even changing what they say).

You have enough time to make two rounds of calls, and have enough batteries (that can be passed between the cells) to make six total calls. How can you pull it off?

]]>What are the lateral, and longitudal forces exerted on each tire, in frame 2?

Not even the best scientists or physicists in the world could solve this.

If you solve this...you are the smartest person in the world.

]]>

These 3 sentences encode a word:

All arguments could belong just here

Playing with cool HTMLviews, enjoy refreshing without building

Look, debugging tool Python makes use of

Go to

176, 184, 186, 190, 192, 194, 198, 200, ?, ?

]]>Does anyone know the answer to this one? If so please explain why

]]>]]>

This is an easy one... how many can get it first time?

]]>place the digits 1-n where n is 4 such that no consecutive digit of any step value, starting at step value, repeats.

here's an example where n is 2.

0 1 0 2 1 0 2 1 2 0 1 ?

1 2 3 4 5 6 7 8 9 10 11 12

here starting from 1 and going a step of 1, there are no repeats. starting from 2 and going a step of 2, no repeats, and so on. However there is no way to get 12 without repeating.

your task is to find the max value for 4.

]]>High resolution image download hosted at https://decred.org/januspuzzle/

The high resolution image contains secret information.

There are others attempting to solve the puzzle on the Decred Slack, on the #puzzles channel.

This text was included in the announcement tweet:

"A tree that does not bend will inevitably break. The repository unit is corrupt. Begin." https://twitter.com/decredproject/status/839204577920565248

Current Prize Value: $1500

]]>***

I've checked for all numbers up to 162, it's true:

81* 12345679= 999999999

172839506*162=27999999972

Is there any simple proof for any integer?

]]>If each of wxy + z^2, wxz + y^2, wyz + x^2, xyz + w^2 is divisible by 4, show that

w^3 + x^3 + y^3 + z^3 is divisible by 4.

]]>

If each of wxy + z^2, wxz + y^2, wyz + x^2, xyz + w^2 is divisible by 4, show that

w^3 + x^3 + y^3 + z^3 is divisible by 4.

]]>

Person 1 has sword with which he kills person 2 gives the sword to person 3.

Person 3 kills person 4 and passes the sword to person 5.

Every time the person who has the sword kills the next person in the circle and passes the sword.

This is continued till there is only one person alive.

Who is the Last Man Standing?

]]>SpoilerPerson : 977

Can you derive a general formula and also a general method for any value of initial number of person.

What is the length of the shortest cut that divides the triangle into two pieces that have equal areas?

]]>There were five service breaks (games in which the serving player lost.)

Who served the first game?

]]>

]]>There is a subtraction sign.

]]>

not what you see.

If ALPHA equals 1 6 6 4 1 1 3 1,

And OMEGA equals 1 5 8 4 1 2 5 1,

Half of their sum

will lead you to me.

]]>

I bought a bunch of factory reject dice the other day, he said.

They're OK except the numbers are all wrong. Mostly they have

extra two's and three's, but **this** one [he held one up, far enough

away so the numbers could not be read] has all different numbers.

Still, the numbers aren't 1-6.

I have a wager for anyone here who thinks he's a genius.

I'll roll the thing three times against that wall over there.

The bottom and back die faces won't be visible, but I'll give

you the sum of the four faces that are visible.

As a bonus, I'll give you the sum of the top and front faces.

I'll buy a pint for anyone who can tell me all six numbers on the die.

If you try and can't figure it out, you'll buy me a pint.

He rolled the die three times and called out the numbers:

Roll #1 = 28 and 18

Roll #2 = 18 and 7

Roll #3 = 22 and 6

Jim thought for a while, then said, no way. There's too many possibilities.

So did Ian and Jamie.

Davey paused to scratch his beard and said, I'll try.

Would you have taken the bet?

]]>