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

- 140.3K All Categories
- 104.2K Programming Languages
- 6.3K Assembler Developer
- 1.8K Basic
- 39.7K C and C++
- 4.2K C#
- 7.9K Delphi and Kylix
- 3 Haskell
- 9.6K Java
- 4.1K Pascal
- 1.3K Perl
- 1.9K PHP
- 502 Python
- 47 Ruby
- 4.3K VB.NET
- 1.6K VBA
- 20.8K Visual Basic
- 2.6K Game programming
- 308 Console programming
- 88 DirectX Game dev
- 1 Minecraft
- 108 Newbie Game Programmers
- 2 Oculus Rift
- 8.9K Applications
- 1.8K Computer Graphics
- 726 Computer Hardware
- 3.4K Database & SQL
- 519 Electronics development
- 1.6K Matlab
- 627 Sound & Music
- 253 XML Development
- 3.2K Classifieds
- 189 Co-operative Projects
- 169 For sale
- 189 FreeLance Software City
- 1.9K Jobs Available
- 598 Jobs Wanted
- 196 Wanted
- 2.9K Microsoft .NET
- 1.7K ASP.NET
- 1.1K .NET General
- 2.9K Miscellaneous
- 3 Join the Team
- 2 User Profiles
- 352 Comments on this site
- 56 Computer Emulators
- 1.7K General programming
- 136 New programming languages
- 598 Off topic board
- 156 Mobile & Wireless
- 30 Android
- 124 Palm Pilot
- 334 Multimedia
- 151 Demo programming
- 183 MP3 programming
- 0 Bash scripts
- 15 Cloud Computing
- 52 FreeBSD
- 1.7K LINUX programming
- 363 MS-DOS
- 0 Shell scripting
- 318 Windows CE & Pocket PC
- 4.1K Windows programming
- 876 Software Development
- 401 Algorithms
- 67 Object Orientation
- 81 Project Management
- 88 Quality & Testing
- 232 Security
- 7.5K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 2 Bootstrap Themes
- 55 CGI Development
- 19 ColdFusion
- 221 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 33 JQuery
- 282 WEB Servers
- 107 WEB-Services / SOAP

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.

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

404Member:

:

Hi,

how sophisticated is your algorithm supposed to be?

The easiest (and stupidest) way could look like this:

[code]Dim Primes As String = Nothing

For i As Integer = 1 To 1000

If IsPrime(i) Then Primes &= i & ", "

Next

MsgBox(Primes)

...

Private Function IsPrime(ByVal N As Integer) As Boolean

For i As Integer = 2 To N - 1

If N Mod i = 0 Then Return False

Next

Return True

End Function[/code]This has asymptotic complexity N*N but who cares with N=1000..

You can make few optimalisations here (to divide by only previously found prime numbers to decrease number of dividing etc), or other more complicated algorithms up to Eucleid's one..

[blue][b][italic][size=4]P[/size]avlin [size=4]II[/italic][/size][/b][/blue]

[purple]Don't take life too seriously anyway you won't escape alive from it![/purple]

- Spam

0 · Vote Down Vote Up · Share on Facebook4Member: :

: :

: Hi,

: how sophisticated is your algorithm supposed to be?

: The easiest (and stupidest) way could look like this:

: [code]Dim Primes As String = Nothing

: For i As Integer = 1 To 1000

: If IsPrime(i) Then Primes &= i & ", "

: Next

: MsgBox(Primes)

:

: ...

:

: Private Function IsPrime(ByVal N As Integer) As Boolean

: For i As Integer = 2 To N - 1

: If N Mod i = 0 Then Return False

: Next

: Return True

: End Function[/code]This has asymptotic complexity N*N but who cares with N=1000..

: You can make few optimalisations here (to divide by only previously found prime numbers to decrease number of dividing etc), or other more complicated algorithms up to Eucleid's one..

:

: [blue][b][italic][size=4]P[/size]avlin [size=4]II[/italic][/size][/b][/blue]

:

: [purple]Don't take life too seriously anyway you won't escape alive from it![/purple]

:

:

: hey thanks man lol you had the one piece i was missing. you saved my grade haha

- Spam

0 · Vote Down Vote Up · Share on Facebook748Member: : hey i learnd vb 2 years ago and i kinda forgot how to use it but im trying to make a program that creates all the prime numbers up to 1000 so if anyone has any help or ideas on what to do it would be great

: :

: :

: Hi,

: how sophisticated is your algorithm supposed to be?

: The easiest (and stupidest) way could look like this:

[code]Dim Primes As String = Nothing

'Step 2 added as a PRIME can only be an odd number.

For i As Integer = 1 To 1000 Step 2

If IsPrime(i) Then Primes &= i & ", "

Next

MsgBox(Primes)

Private Function IsPrime(ByVal N As Integer) As Boolean

For i As Integer = 2 To N - 1

If N Mod i = 0 Then Return False

Next

Return True

End Function

[/code]

This has asymptotic complexity N*N but who cares with N=1000..

: You can make few optimalisations here (to divide by only previously found prime numbers to decrease number of dividing etc), or other more complicated algorithms up to Eucleid's one..

:

: [blue][b][italic][size=4]P[/size]avlin [size=4]II[/italic][/size][/b][/blue]

: [purple]Don't take life too seriously anyway you won't escape alive from it![/purple]

[b][blue]Step 2 would speed things up a bit if you went up to say 100,000. :-)

[/blue][/b]

There are other rules to find a PRIME number of course.

Simpler ones include;

i) It has to be an odd number.

ii) Any number ending in a five doesn't count.

iii) If you add all the digits are added and the result divides by 9 like in the number.>>

123456789 like 1+2+3+4+5+6+7+8+9=45 >> 4+5=9

Then as 45 is 5 times 9 then the bigger number divides exactly by 9.

[b][blue]This rule works for any number of any length!![/blue][/b]

So this rule is obviously true for the number.>>

112233445566778899

And the numbers in the next applicable date of;

09-10-2006 ( 9th Oct,2006 ).

Regards,

Dr M.

- Spam

0 · Vote Down Vote Up · Share on Facebook4Member: : : hey i learnd vb 2 years ago and i kinda forgot how to use it but im trying to make a program that creates all the prime numbers up to 1000 so if anyone has any help or ideas on what to do it would be great

: : :

: : :

: : Hi,

: : how sophisticated is your algorithm supposed to be?

: : The easiest (and stupidest) way could look like this:

: [code]Dim Primes As String = Nothing

: 'Step 2 added as a PRIME can only be an odd number.

: For i As Integer = 1 To 1000 Step 2

: If IsPrime(i) Then Primes &= i & ", "

: Next

: MsgBox(Primes)

:

: Private Function IsPrime(ByVal N As Integer) As Boolean

:

: For i As Integer = 2 To N - 1

: If N Mod i = 0 Then Return False

: Next

:

: Return True

:

: End Function

: [/code]

: This has asymptotic complexity N*N but who cares with N=1000..

: : You can make few optimalisations here (to divide by only previously found prime numbers to decrease number of dividing etc), or other more complicated algorithms up to Eucleid's one..

: :

: : [blue][b][italic][size=4]P[/size]avlin [size=4]II[/italic][/size][/b][/blue]

:

: : [purple]Don't take life too seriously anyway you won't escape alive from it![/purple]

:

: [b][blue]Step 2 would speed things up a bit if you went up to say 100,000. :-)

: [/blue][/b]

:

: There are other rules to find a PRIME number of course.

: Simpler ones include;

:

: i) It has to be an odd number.

: ii) Any number ending in a five doesn't count.

: iii) If you add all the digits are added and the result divides by 9 like in the number.>>

:

: 123456789 like 1+2+3+4+5+6+7+8+9=45 >> 4+5=9

:

: Then as 45 is 5 times 9 then the bigger number divides exactly by 9.

:

: [b][blue]This rule works for any number of any length!![/blue][/b]

:

: So this rule is obviously true for the number.>>

:

: 112233445566778899

:

: And the numbers in the next applicable date of;

:

: 09-10-2006 ( 9th Oct,2006 ).

:

:

: Regards,

:

: Dr M.

:

:

haha thanks youv really been a help right now im working on this one project that is pretty fun but really had to do. its a program that generates all the vampire numbers(a vampire number is a two two digit number that equal a four digit number and all the numbers in the two two digit numbers have to be in that four digit number)i mean im sure you could do it but dont be supprised if later on i come to you asking for advice lol and again thanks youv been a great help

sencerly

2nd LT. Nester

- Spam

0 · Vote Down Vote Up · Share on Facebook748Member: : : : hey i learnd vb 2 years ago and i kinda forgot how to use it but im trying to make a program that creates all the prime numbers up to 1000 so if anyone has any help or ideas on what to do it would be great

: : : :

: : : :

: : : Hi,

: : : how sophisticated is your algorithm supposed to be?

: : : The easiest (and stupidest) way could look like this:

: : [code]Dim Primes As String = Nothing

: : 'Step 2 added as a PRIME can only be an odd number.

: : For i As Integer = 1 To 1000 Step 2

: : If IsPrime(i) Then Primes &= i & ", "

: : Next

: : MsgBox(Primes)

: :

: : Private Function IsPrime(ByVal N As Integer) As Boolean

: :

: : For i As Integer = 2 To N - 1

: : If N Mod i = 0 Then Return False

: : Next

: :

: : Return True

: :

: : End Function

: : [/code]

: : This has asymptotic complexity N*N but who cares with N=1000..

: : : You can make few optimalisations here (to divide by only previously found prime numbers to decrease number of dividing etc), or other more complicated algorithms up to Eucleid's one..

: : :

: : : [blue][b][italic][size=4]P[/size]avlin [size=4]II[/italic][/size][/b][/blue]

: :

: : : [purple]Don't take life too seriously anyway you won't escape alive from it![/purple]

: :

: : [b][blue]Step 2 would speed things up a bit if you went up to say 100,000. :-)

: : [/blue][/b]

: :

: : There are other rules to find a PRIME number of course.

: : Simpler ones include;

: :

: : i) It has to be an odd number.

: : ii) Any number ending in a five doesn't count.

: : iii) If you add all the digits are added and the result divides by 9 like in the number.>>

: :

: : 123456789 like 1+2+3+4+5+6+7+8+9=45 >> 4+5=9

: :

: : Then as 45 is 5 times 9 then the bigger number divides exactly by 9.

: :

: : [b][blue]This rule works for any number of any length!![/blue][/b]

: :

: : So this rule is obviously true for the number.>>

: :

: : 112233445566778899

: :

: : And the numbers in the next applicable date of;

: :

: : 09-10-2006 ( 9th Oct,2006 ).

: :

: :

: : Regards,

: :

: : Dr M.

: :

: :

: haha thanks youv really been a help right now im working on this one project that is pretty fun but really had to do. its a program that generates all the vampire numbers(a vampire number is a two two digit number that equal a four digit number and all the numbers in the two two digit numbers have to be in that four digit number)i mean im sure you could do it but dont be supprised if later on i come to you asking for advice lol and again thanks youv been a great help

:

: sencerly

:

: 2nd LT. Nester

====================================================================

Hi do you mean like 12 and 34 giving.>>

1234 or

1243 or

1324 or

1342 or

2134 or

2143 or

2314 or

2341 or

and the remaining 8 numbers?

In which case there will always be 16 results.

They are PERMUTATIONS.

abc giving

ab

ac

bc

with one function which is COMBINATION (3 C 2)

ab, ba

ac, ca

bc, ca

when you take 2 letter permutations (3 P 2) from the 1st three letters.

See these links.>>

http://mathforum.org/dr.math/faq/faq.comb.perm.html

http://www.google.co.uk/search?hl=en&ie=ISO-8859-1&q=permutations+formula&meta=

and the following two pages for formulas involving factorials> :-|

http://www.mathwords.com/p/permutation_formula.htm

where order matters, see.>>

http://www.mathwords.com/p/permutation.htm

http://www.mathwords.com/c/combination_formula.htm

where order doesn't matter see.>>

http://www.mathwords.com/c/combination.htm

Regards,

Dr M.

- Spam

0 · Vote Down Vote Up · Share on Facebook