delirium happy

Just keep on trying till you run out of cake

Previous Entry Share Next Entry
Semi-obscure mathematical humour
SHM
rho
I decided last night that if I ever teach mathematics at an appropriate level (which is very unlikely), I want to set the following question on an assignment:

"Using Euclid's algorithm or otherwise, find the highest common factor of Graham's number and a googolplex."

Purely to see what portion of the people are dumb enough to ignore the "or otherwise" in the question.

  • 1
What's the answer? 1?

As far as I can tell, Graham's number is a power of 3, so it only has one prime factor, while googolplex has only the prime factors 2 and 5, so the two numbers are relatively prime.

Oh, and you might want to consider posting this in math_jokes; they might appreciate it there.

Cute. If you read the definition of Graham's number, they're obviously coprime.

  • 1
?

Log in

No account? Create an account