Linux Definitions
fortune: 535 - 544 of 1105 from linux definitions
Motd - Message of the Day
Humor, Quotes, Proverbs, Aphorisms...
Daily Fortunes Feed Subscribe - Daily Fortunes - motd.ambians.com
Daily fortunes for your site
Dec 4, 2024
Motd Home     Daily Fortunes     Best of Fortunes     Worst of Fortunes

Linux Definitions

Fortune: 535 - 544 of 1105 from Linux Definitions

Linux Definitions:  535 of 1105

lawsuit, n.:
        A machine which you go into as a pig and come out as a sausage.
                -- Ambrose Bierce
 
Linux Definitions:  536 of 1105

Lawyer's Rule:
        When the law is against you, argue the facts.
        When the facts are against you, argue the law.
        When both are against you, call the other lawyer names.
 
Linux Definitions:  537 of 1105

Lazlo's Chinese Relativity Axiom:
        No matter how great your triumphs or how tragic your defeats --
        approximately one billion Chinese couldn't care less.
 
Linux Definitions:  538 of 1105

learning curve, n.:
        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.
 
Linux Definitions:  539 of 1105

Lee's Law:
        Mother said there would be days like this,
        but she never said that there'd be so many!
 
Linux Definitions:  540 of 1105

Leibowitz's Rule:
        When hammering a nail, you will never hit your
        finger if you hold the hammer with both hands.
 
Linux Definitions:  541 of 1105

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.
 
Linux Definitions:  542 of 1105

leverage, n.:
        Even if someone doesn't care what the world thinks
        about them, they always hope their mother doesn't find out.
 
Linux Definitions:  543 of 1105

Lewis's Law of Travel:
        The first piece of luggage out of the chute doesn't belong to anyone,
        ever.
 
Linux Definitions:  544 of 1105

Liar, n.:
        A lawyer with a roving commission.
                -- Ambrose Bierce, "The Devil's Dictionary"
« Prev Random Linux Definitions   Next »
« Prev  1  2  3  4  5  6  7  8  9  10  11  12  13  14  15  16  17  18  19  20  21  22  23  24  25  26  27  28  29  30  31  32  33  34  35  36  37  38  39  40  41  42  43  44  45  46  47  48  49  50  51  52  53  54  55  56  57  58  59  60  61  62  63  64  65  66  67  68  69  70  71  72  73  74  75  76  77  78  79  80  81  82  83  84  85  86  87  88  89  90  91  92  93  94  95  96  97  98  99  100  101  102  103  104  105  106  107  108  109  110  111  Next »
Search [help]

About  |  Contact Us  |  Terms of Use  |  Privacy & Disclosure
FreeBsd Quotes  |  Linux Quotes