| TIP: Click on subject to list as thread! | ANSI |
| echo: | |
|---|---|
| to: | |
| from: | |
| date: | |
| subject: | re: Prime #`s |
From: jasonlee@yabbs To: Perspex@yabbs Subject: re: Prime #'s Date: Tue Oct 26 00:55:59 1993 You should be able to find them easy. I won't put up the code, but just try dividing a number n by every odd number (also 2) from 1 to n/2 (or (n-1)/2). If the result is an integer, then n is not prime. Easy. JasonLee |
|
| SOURCE: yabbs via textfiles.com | |
Email questions or comments to sysop@ipingthereforeiam.com
All parts of this website painstakingly hand-crafted in the U.S.A.!
IPTIA BBS/MUD/Terminal/Game Server List, © 2025 IPTIA Consulting™.