Freebsd Fortunes: 2379 of 3566 |
Pretend to spank me -- I'm a pseudo-masochist!
|
|
|
Freebsd Fortunes: 2380 of 3566 |
Preudhomme's Law of Window Cleaning:
It's on the other side.
|
|
|
Freebsd Fortunes: 2381 of 3566 |
[Prime Minister Joseph] Chamberlain loves the working man -- he loves
to see him work.
-- Winston Churchill
|
|
|
Freebsd Fortunes: 2382 of 3566 |
Pro is to con as progress is to Congress.
|
|
|
Freebsd Fortunes: 2383 of 3566 |
Probable-Possible, my black hen,
She lays eggs in the Relative When.
She doesn't lay eggs in the Positive Now
Because she's unable to postulate how.
-- Frederick Winsor
|
|
|
Freebsd Fortunes: 2384 of 3566 |
Probably the question asked most often is: Do one-celled animals have
orgasms? The answer is yes, they have orgasms almost constantly, which
is why they don't mind living in pools of warm slime.
-- Dave Barry, "Sex and the Single Amoeba: What Every
Teen Should Know"
|
|
|
Freebsd Fortunes: 2385 of 3566 |
Prof: So the American government went to IBM to come up with a data
encryption standard and they came up with ...
Student: EBCDIC!
|
|
|
Freebsd Fortunes: 2386 of 3566 |
Professor Gorden Newell threw another shutout in last week's Chem.
Eng. 130 midterm. Once again no student received a single point on
his exam. Newell has now tossed five shutouts this quarter. Newell's
earned exam average has now dropped to a phenomenal 30 |
|
|
Freebsd Fortunes: 2387 of 3566 |
Programming today is a race between software engineers striving to
build bigger and better idiot-proof programs, and the Universe trying
to produce bigger and better idiots. So far, the Universe is winning.
-- Rich Cook
|
|
|
Freebsd Fortunes: 2388 of 3566 |
Proof techniques #1: Proof by Induction.
This technique is used on equations with "n" in them. Induction
techniques are very popular, even the military used them.
SAMPLE: Proof of induction without proof of induction.
We know it's true for n equal to 1. Now assume that it's true
for every natural number less than n. N is arbitrary, so we can take n
as large as we want. If n is sufficiently large, the case of n+1 is
trivially equivalent, so the only important n are n less than n. We
can take n = n (from above), so it's true for n+1 because it's just
about n.
QED. (QED translates from the Latin as "So what?")
|
|