| |
LU9DCE > ALL 20.02.18 20:14l 47 Lines 2605 Bytes #999 (0) @ WW
BID : 32379_LU9DCE
Read: GUEST
Subj: ANNOUNCE CLUSTER 20 15:00:02
Path: IW8PGT<IR2UBX<EA2RCF<LU9DCE
Sent: 180220/1801Z @:LU9DCE.TOR.BA.ARG.SOAM #:32379 [TORTUGUITAS] FBB7.07
From: LU9DCE@LU9DCE.TOR.BA.ARG.SOAM
To : ALL@WW
__ _ _ ___ ____ ___ ____ ____ ____ ____
( ) / )( \/ _ \( \ / __)( __) ( _ \( _ \/ ___)
/ (_/\) \/ (\__ )) D (( (__ ) _) ) _ ( ) _ (\___ \
\____/\____/(___/(____/ \___)(____) (____/(____/(____/
ESTACION DE PACKET RADIO - BUENOS AIRES (GF05OM)
BOLETINES INFORMATIVOS PROGRAMADOS (BIP)
LU9DCE@GMX.COM - RF 147070 @ 1200 BAUD
telnet lu9dce.dynu.com
BBS port 6300 / NODE port 3694 / DXCLUSTER port 9000
+------------------------------------------------------------------------------+
HA4RT: z60a 14005 .long way antenna .... only usa $$ shame
HS1NGR-9: TODAY THANK C5DX FOR LOTW.MANY THANK G4DJX ALAN
+------------------------------------------------------------------------------+
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.
////////////////////////////////////////////////////////////////////////////////
\\\ Eduardo Castillo - lu9dce@gmx.com -- https://lu9dce.wordpress.com/ \\\
/// Attribution - ShareAlike 4.0 International (CC BY-SA 4.0) ///
\\\ Esta obra esta bajo una Licencia Creative Commons \\\
/// Atribucion - Compartir Igual 4.0 Internacional ///
\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
Read previous mail | Read next mail
| |
