Click here to Skip to main content
Click here to Skip to main content

Finding prime numbers

, 13 Sep 2012 CPOL
This is an alternative for "Finding prime numbers"

Alternatives

Members may post updates or alternatives to this current article in order to show different approaches or add new features.

14 Mar 2013
Kenneth Haugland
2 alternatives  
Different schemas for finding prime numbers explained with code
14 Sep 2012
Clifford Nelson
This is an alternative for "Finding prime numbers".

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

Matt T Heffron
Software Developer (Senior) AB Sciex
United States United States
I started programming in Basic on a DECSystem-10 as a Freshman at Caltech in 1974. I quickly transitioned to assembly language, Fortran, and Pascal. As a summer job at JPL, I did analysis of fuel consumption for the Viking Mars Orbiter attitude control system. I also spent a summer doing O/S maintenance at Digital Equipment Corporation.
After graduation, I started developing microprocessor development tools (e.g., cross-compiler, debugger) for Beckman Instruments, a scientific instrument company.
I've worked on custom file-systems, a real-time O/S for Z8000, Expert Systems (SpinPro & PepPro), and internal and external networking support (I was their first webmaster).
I've worked on the DNA analysis system.
I was the console/UI software architect for Ultracentrifuges and protein Capillary Electrophoresis systems.
After 35 years, Danaher having acquired Beckman (now Beckman Coulter), transferred the CE group to become part of AB Sciex (2014).

| | Privacy | Terms of Use | Mobile
Web01 | 2.8.141223.1 | Last Updated 14 Sep 2012
Article Copyright 2012 by Matt T Heffron
Everything else Copyright © CodeProject, 1999-2014
Layout: fixed | fluid