So uh.... does anyone know if this is true?

Define a n-Rock to be a positive integer with only prime divisors <= n.

Define a twin n-Rock to be a pair of two consecutive n-Rocks.

Prove that there are finitely many twin n-Rocks.

OK, according to someone's post in the problem thread, very few people had full solutions... is this problem actually that hard?

Since its not that hard at all to think of induction and its fairly obvious to consider the last one... its fairly straightforward and alex zhai said it was pretty easy compared to most #6s...

Uh... easier than normal. A lot easier than normal. But apparently it's a lot harder when you actually take it officially.

#1: Uh easy
#2: I bashed this with slopes (which works) but apparently the synthetic solution is really short... apparently this one was really easy though.
#3: Hmm, this apparently isn't that hard, but my solution only takes 1 page to write up, and I was expecting the solution to be a lot longer, so my solution might be wrong...

Outline

Note: Chinese government censors facebook and other stuff

Currently in china.

Random problem (you might know the inspiration for this problem if you were at mop):

Let p be a prime that is 1 mod 10.

If is congruent to modulo p, then these numbers are also congruent to -1 times

Also, how do you use linear algebra to solve differential equations?

Yay 60 apm...

Hmm, mop is over...

Also I can't figure out how to get mathematica using that letter from mop. Help?

is essentially over.

Staying up whole night doing a certain thing with initials sc.

Hmm I got a coloring book from mop yay.

ArE wE aLlOwEd To PoSt FrOm MoP?

What is it? Google/Search function doesn't return anything.

Ceremony is tomorrow. Is there internet access at mop?

Sat is tomorrow