Freebsd Fortunes 4: 2126 of 2327 |
Learn to pause -- or nothing worthwhile can catch up to you.
|
|
|
Freebsd Fortunes 4: 2127 of 2327 |
Learned men are the cisterns of knowledge, not the fountainheads.
|
|
|
Freebsd Fortunes 4: 2128 of 2327 |
Learning at some schools is like drinking from a firehose.
|
|
|
Freebsd Fortunes 4: 2129 of 2327 |
LEARNING CURVE:
An astonishing new theory, discovered by management consultants
in the 1970's, asserting that the more you do something the
quicker you can do it.
|
|
|
Freebsd Fortunes 4: 2130 of 2327 |
Learning without thought is labor lost;
thought without learning is perilous.
-- Confucius
|
|
|
Freebsd Fortunes 4: 2131 of 2327 |
Leave no stone unturned.
-- Euripides
|
|
|
Freebsd Fortunes 4: 2132 of 2327 |
Lee's Law:
Mother said there would be days like this,
but she never said that there'd be so many!
|
|
|
Freebsd Fortunes 4: 2133 of 2327 |
Left to themselves, things tend to go from bad to worse.
|
|
|
Freebsd Fortunes 4: 2134 of 2327 |
Leibowitz's Rule:
When hammering a nail, you will never hit your
finger if you hold the hammer with both hands.
|
|
|
Freebsd Fortunes 4: 2135 of 2327 |
Lemma: All horses are the same color.
Proof (by induction):
Case n = 1: In a set with only one horse, 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. Pull one of these
horses out of the set, so that you have k horses. Suppose that all
of these horses are the same color. Now put back the horse that you
took out, and pull out a different one. Suppose that all of the k
horses now in the set are the same color. Then the set of k+1 horses
are all the same color. We have k true => k+1 true; therefore all
horses are the same color.
Theorem: All horses have an infinite number of legs.
Proof (by intimidation):
Everyone would agree that all horses have an even number of legs. It
is also well-known that horses have forelegs in front and two legs in
back. 4 + 2 = 6 legs, which is certainly an odd number of legs for a
horse to have! Now the only number that is both even and odd is
infinity; therefore all horses have an infinite number of legs.
However, suppose that there is a horse somewhere that does not have an
infinite number of legs. Well, that would be a horse of a different
color; and by the Lemma, it doesn't exist.
|
|