Last person to post loses

Post Reply New Topic

So none of us are wise.... since we keep posting here with no apparent hope of losing...

Which reminds me - what does this mean?

YYY MEN

Hrrmm...

I do not know.

Is it a complex acronym?

Not exactly. Think out of the box...

What are those yellow lines on your "black box" avatar?

They are part of a simple encoding for my birthdate. It is also supposed to be a simple version of the Discworld clacks tower, inspired by real-life light telegraphs.

Y³ men -> Ye men?*

* In this case, thinking outside the box is interpreted to mean thinking about the cube

Hi Kevin, the answer is Three Wise Men...

What about this one?

POT OOOOOOOO.

Three Y's men!

Pot8oś -> potatoes!

Very good!!

______________
CCCC

Any more puzzles to devour?

Oh really? Hm. Though it still doesn't sit well with me because it doesn't make sense

What I was taught about apostrophes for pluralization is that they serve to prevent ambiguity between the plural of the letter, "i," and the auxiliary verb, "is," or other similar situations where ambiguity may be created, although it does seem to be as mildly irritating as having to place punctuation within quotes. In the case of numbers, the rule seems to be even worse with regards to ambiguity, but is probably in place to keep consistency.

2, 5
1 * 2, 1 * 5
1 * 1, 1 * 2, 1 * 1, 1 * 5
3 * 1, 1 * 2, 3 * 1, 1 * 5
1 * 3, 2 * 1, 1 * 2, 1 * 3, 2 * 1, 1 * 5
1 * 1, 1 * 3, 1 * 2, 2 * 1, 1 * 2, 1 * 1, 1 * 3, 1 * 2, 2 * 1, 1 * 5
11131221121113122115

That's what I learned, Kevin.

Oh, and by the way, 311311222112311311222115

1321132132211213211321322115

Next puzzle:

Proof that all prime numbers greater than 3 mod 6 equal 1 or 5.
(or (= (mod (n>3) 6)) 1) (= (mod (n>3) 6)) 5))

Well, we can easily eliminate 0, 2, or 4 since that would imply that x is even - a contradiction if we also assume x is prime.

So, just have to show it can't be equivalent to 3 mod 6 for any number greater than 3. So, we assume it is.

So, x= 6k + 3, where k is an integer greater than 0
-->x = 3(2k+1)
But then, x has a divisor, 3, which cannot be equal to x.
i.e. x has at least one divisor other than 1 or x, a contradiction since x is prime.

Therefore, x has to be equal to 1 or 5 mod 6. QED.