Caturday comes early this week:

Courtesy of Blue Gal and the Professional Left! Thanks, you commies.

Advertisements

Solve one problem. Then the next. You solve enough problems, you succeed.

Caturday comes early this week:

Courtesy of Blue Gal and the Professional Left! Thanks, you commies.

Advertisements

Comments

%d bloggers like this:

And that old time feelin’ goes sneakin’ down the hall,

Like an old gray cat in winter, keepin’ close to the wall…

–Guy Clark

IZZAT SPOSED TO CALM ME DOWN!?!

Cuz

piddies!!! Ohhhhh.Badgers beat a terrible team, while successfully letting up in the fourth. Yay.

Packers play a not-godawful Miami Mahi-Mahi team. Certainly better than the ‘Queens.

Rest of earth? Going to hell, but I’m with sweetie. Ok.

Did I ever tell you about the time I got scabies?

‘Cause it’s a pretty good story. Even better than the time I got crabs from a Nurse named Louisa…

Mrs Spat and Siamese Doodmeister are cuter.

Oh, I am sure.

How much a pound?

Meant for Mikey. FYWP

I too am curious as to how much mikey is per pound…

hey, just watched the Rush biopic AGAIN, and so I will be Bob Noxious about listening to Rush for the immediate future…

Lemma: All

~~horses~~catsare the same color.Proof (by induction):

Case n = 1: In a set with only one

~~horse~~cat, it is obvious that all~~horses~~in that set are the same color.Case n = k: Suppose you have a set of k+1

~~horses~~cats. Pull one of these~~horses~~catsout of the set, so that you have k~~horses</strike~~cats. Suppose that all of these~~horses~~catsare the same color. Now put back the~~horse~~catthat you took out, and pull out a different one. Suppose that all of the k~~horses~~catsnow in the set are the same color. Then the set of k+1~~horses~~catsare all the same color. We have k true => k+1 true; therefore all~~horses~~catsare the same color.FYWP I WASN’T DONE!Lemma: All

~~horses~~catsare the same color.Proof (by induction):

Case n = 1: In a set with only one

~~horse~~cat, it is obvious that all~~horses~~catsin that set are the same color.Case n = k: Suppose you have a set of k+1

~~horses~~cats. Pull one of these~~horses~~catsout of the set, so that you have k~~horses~~cats. Suppose that all of these~~horses~~catsare the same color. Now put back the~~horse~~catthat you took out, and pull out a different one. Suppose that all of the k~~horses~~catsnow in the set are the same color. Then the set of k+1~~horses~~catsare all the same color. We have k true => k+1 true; therefore all~~horses~~catsare the same color.I don’t see how anyone can argue with that…

Lemme find some booze and try…

“Howard Johnson is right!”

I was told there’d be booze…

I had no idea that cats eat exactly the same way snakes do.

If I had another cat, I would make a Cat Centipede…