O. The grand hunt

Level 2

Hello everyone! This is the final problem of this trollathon. We decided to make a treasure hunt to hunt for the answer to this problem. This hunt is not for the faint of heart! The clues are all on texpaste , which is where you should go for all the clues. The final answer will be there as well. Good luck finding the answer! Here's the first link :

http://www.texpaste.com/n/oxuzfuhr

Note that all links are in the form :

http://www.texpaste.com/n/<code here>

P.S. The answer might NOT be an integer. Given that your answer can be written as a b \frac{a}{b} where a a and b b are relatively prime positive integers, find the maximum value among a a and b b . Sorry for any inconvenience caused.


The answer is 1.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Zi Song Yeoh
Nov 11, 2014

Go to the first leg.

First leg solution :

1 & 2) u, r

3) p

4) w

5 & 6) l, l

7) e

8) z

Putting this together gives the link for the second leg, which is this .

Second leg solution :

Change all the numbers to their corresponding letters with them as ASCII code. This immediately gives this .

Third leg solution :

Now, most of you will guess 54 right? NO! It is well-known that 6 × 9 = 42 6 \times 9 = 42 . So, our answer is 1 \boxed{1} . (See here if you're in doubt, the second comment. )

Code for deriving this fact (credits to the link above) :

#include <stdio.h>
#define six  1+5
#define nine 8+1

int main()
{
    printf("what do you get when you multiply six by nine?\n");
    printf("%i x %i = %i\n", six, nine, six*nine);
}

written in C. Masterpiece.

I assumed, because it was the Trollathon, it would have a troll answer and I guessed 1.

Sharky Kesa - 6 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...