It looks like you're new here. If you want to get involved, click one of these buttons!

- All Categories 139.8K
- Programming Languages 104K
- Assembler Developer 6.2K
- Basic 1.8K
- C and C++ 39.7K
- C# 4.2K
- Delphi and Kylix 7.9K
- Haskell 3
- Java 9.5K
- Pascal 4.1K
- Perl 1.3K
- PHP 1.9K
- Python 501
- Ruby 47
- VB.NET 4.3K
- VBA 1.6K
- Visual Basic 20.8K
- Game programming 2.6K
- Console programming 308
- DirectX Game dev 87
- Minecraft 1
- Newbie Game Programmers 107
- Oculus Rift 2
- Applications 8.8K
- Computer Graphics 1.8K
- Computer Hardware 721
- Database & SQL 3.4K
- Electronics development 517
- Matlab 1.6K
- Sound & Music 625
- XML Development 253
- Classifieds 3.2K
- Co-operative Projects 184
- For sale 161
- FreeLance Software City 188
- Jobs Available 1.9K
- Jobs Wanted 597
- Wanted 192
- Microsoft .NET 2.8K
- ASP.NET 1.7K
- .NET General 1.1K
- Miscellaneous 2.8K
- Join the Team 2
- User Profiles 1
- Comments on this site 351
- Computer Emulators 54
- General programming 1.7K
- New programming languages 114
- Off topic board 591
- Mobile & Wireless 146
- Android 20
- Palm Pilot 124
- Multimedia 334
- Demo programming 151
- MP3 programming 183
- Bash scripts 0
- Cloud Computing 10
- FreeBSD 52
- LINUX programming 1.7K
- MS-DOS 361
- Shell scripting 0
- Windows CE & Pocket PC 317
- Windows programming 4.1K
- Software Development 870
- Algorithms 400
- Object Orientation 67
- Project Management 80
- Quality & Testing 87
- Security 230
- WEB-Development 7.3K
- Active Server Pages 1.8K
- AJAX 61
- Bootstrap Themes 1
- CGI Development 55
- ColdFusion 19
- Flash development 221
- HTML & WEB-Design 1.4K
- Internet Development 1.3K
- JavaScript 2.2K
- JQuery 33
- WEB Servers 275
- WEB-Services / SOAP 100

We have migrated to a new platform! Please note that you will need to reset your password to log in (your credentials are still in-tact though). Please contact lee@programmersheaven.com if you have questions.

Tweets by @pheaven
Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

I can do it all easily enough, except for finding prime numbers.. I suspect it's something to do with the modulas (remainder) operator but not real sure how to lay it out, any help is appreciated guys & gals. ^^

About & Contact / Terms of use / Privacy statement / Publisher: Lars Hagelin

Programmers Heaven articles / Programmers Heaven files / Programmers Heaven uploaded content / Programmers Heaven C Sharp ebook / Operated by CommunityHeaven LLC

© 1997-2013 Programmersheaven.com - All rights reserved.

## Comments

149Member:

:

: I can do it all easily enough, except for finding prime numbers.. I suspect it's something to do with the modulas (remainder) operator but not real sure how to lay it out, any help is appreciated guys & gals. ^^

:

Here's an easy (and fast) algorithm (pen and paper implementation;) for finding primes up to a certian number:

[code]

// I don't know if 1 is a prime number, so we'll skip it ;)

write down the numbers from 2 to lets say 100.

put a circle around 2 and cross out all higher multiples of 2 (4, 6, 8 etc)

while there are numbers without a circle or a cross:

{

find the next noncrossed number and put a circle around it, and cross out all higher multiples of this number

}

all numbers with circles around them are prime

[/code]

good luck,

Pruyque

- Spam

0 · Vote Down Vote Up ·7Member: : Hey all, I'm on an assignment and a bit lost. I'm supposed to write a program that finds the average of all prime numbers between 1 and 100 and prints this average to screen:

: :

: :

: : I can do it all easily enough, except for finding prime numbers.. I suspect it's something to do with the modulas (remainder) operator but not real sure how to lay it out, any help is appreciated guys & gals. ^^

: :

:

: Here's an easy (and fast) algorithm (pen and paper implementation;) for finding primes up to a certian number:

:

: [code]

: // I don't know if 1 is a prime number, so we'll skip it ;)

: write down the numbers from 2 to lets say 100.

: put a circle around 2 and cross out all higher multiples of 2 (4, 6, 8 etc)

: while there are numbers without a circle or a cross:

: {

: find the next noncrossed number and put a circle around it, and cross out all higher multiples of this number

: }

: all numbers with circles around them are prime

: [/code]

:

: good luck,

: Pruyque

:

- Spam

0 · Vote Down Vote Up ·67Member ✭Read here prime numbers

- Spam

0 · Vote Down Vote Up ·