From rob@twcny.rr.com Fri Jul 07 21:54:43 2000 Return-Path: Received: (qmail 29401 invoked from network); 8 Jul 2000 04:54:42 -0000 Received: from unknown (10.1.10.27) by m4.onelist.org with QMQP; 8 Jul 2000 04:54:42 -0000 Received: from unknown (HELO telenet.net) (204.97.152.225) by mta1 with SMTP; 8 Jul 2000 04:54:42 -0000 Received: from les27 (dialup88-106.telenet.net [208.20.88.106]) by telenet.net (8.9.3/8.9.3) with SMTP id AAA14550 for ; Sat, 8 Jul 2000 00:54:40 -0400 Message-ID: <010701bfe898$95cd5c80$5408fd80@resnet.cornell.edu> To: References: Subject: Re: [lojban] 2 maths questions Date: Sat, 8 Jul 2000 00:54:22 -0400 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2615.200 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200 From: "Rob Speer" X-Yahoo-Message-Num: 3483 John Cowan wrote: > What I don't know is whether this notion of "thickness" can be > extrapolated beyond the sets which are multiples of some integer. > How "thick" is the set of primes relative to the set of integers, > for example? me'o de'o ny. jibni leni denmi be lei ralnamcu poi jibni me'o ny. The density of the prime numbers near n is approximately log(n). -- I'm surprised there isn't already a lujvo for "prime number". How about: ralnamcu (ralju+namcu) x1 is a prime number of mathematical field x2 by convention x3 -- Rob Speer