Chapter 2: Being sent to Coventry

• I returned to Coventry this week.
• I may never see some people ever again.
• I am too sad to write in paragraphs.

Exercise 2.1:

i) How should one attempt to unpack the contents of a full (university) bedroom into another already full (home) bedroom?
ii) Upon returning home from University, how much money, (mainly in coppers), would be a surprising amount to find at the back of a bedroom cupboard that has remained undisturbed for a number of years?
iii) How many times does the earth rotate about its axis in 365 days?
iv) Boozy promised me that she'd write a blog last Saturday, four days have passed and she still hasn't, why not?
v) Why is it that every time I turn my computer on, the house Internet connection turns off, and every time that I turn my PC off, we regain Internet access... regardless of whether or not I have an Ethernet cable or wireless network card connected to my computer?

Solutions:

i) Don't bother, the problem is clearly impossible.
ii) £55.41
iii) approx. 366. Note that other sources e.g. Number Six, claim that the answer is 365. Note further, that these sources are wrong.
iv) Because she's a liar.
v) My best guess is radio interference with our router, but I've no idea what would cause this - any guesses would be welcomed.

Brutal Snake's crew have the greatest cox

Just thought that I'd post a quick note to congratulate Brutal Snake on his victory today... Well done!

Also, I've been hearing rumours from Number Six that Chuck has turned to the darkside, and purchased an inferior computer. I am disappointed.

Chapter 1: Introduction

Definition 1.1:
i) Let Armstrong be me.
ii) Let {Armstrong} be the set containing me.

Proposition 1.2:
P({Armstrong})={{},{Armstrong}}

Remark: I like to think of myself as an element of my own power set... It's less lonely with the empty set for company.

Definition 1.3:
i) Let Eden be Eden.
ii) Let Chuck be Chuck.
iii) Let Brutal Snake be Brutal Snake.
iv) Let Boozy be Boozy.
v) Let Sparky be Sparky.
vi) Let Number Six be Number Six.

Lemma 1.4:
Number Six is not a number.

Proof: c.f. The Prisoner.

Proposition 1.5:
The integers do not exist.

Proof: Assume that there is an integer with the existence property, (i.e. the integer exists), let's call this integer x. Either x=6 or x is greater than 6 or x is less than 6.
In the first case we immediately have a contradiction, since x is not a number, (Lemma 1.4).
Consider the case that x is greater than 6, we show first that 7 is not an integer, for if it were, then 7 - 1 would also be an integer, yet we have already demonstrated that this is not the case.
Furthermore, we observe that if k is not an integer then neither is k+1, and we invoke the principal of mathematical induction to show that no integers greater than 6 can exist.
The case of x less than 6 is left as an exercise

Remark: If the integers do not exist, then my degree may prove to be pretty worthless. We must therefore conclude that our definitions are not self-consistent, and reluctantly abandon all rigour in future blogs.