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

- 141.1K All Categories
- 103.8K Programming Languages
- 6.5K Assembler Developer
- 1.9K Basic
- 40K C and C++
- 2.9K C#
- 7.9K Delphi and Kylix
- 4 Haskell
- 9.7K Java
- 4.1K Pascal
- 1.3K Perl
- 2K PHP
- 551 Python
- 37 Ruby
- 4.4K VB.NET
- 1.6K VBA
- 20.9K Visual Basic
- 2.6K Game programming
- 317 Console programming
- 93 DirectX Game dev
- 1 Minecraft
- 112 Newbie Game Programmers
- 2 Oculus Rift
- 9K Applications
- 1.8K Computer Graphics
- 745 Computer Hardware
- 3.5K Database & SQL
- 535 Electronics development
- 1.6K Matlab
- 628 Sound & Music
- 258 XML Development
- 3.3K Classifieds
- 199 Co-operative Projects
- 199 For sale
- 190 FreeLance Software City
- 1.9K Jobs Available
- 604 Jobs Wanted
- 211 Wanted
- 2.9K Microsoft .NET
- 1.8K ASP.NET
- 1.1K .NET General
- 3.4K Miscellaneous
- 7 Join the Team
- 355 Comments on this site
- 70 Computer Emulators
- 2.1K General programming
- 187 New programming languages
- 637 Off topic board
- 220 Mobile & Wireless
- 92 Android
- 126 Palm Pilot
- 340 Multimedia
- 156 Demo programming
- 184 MP3 programming
- Bash scripts
- 27 Cloud Computing
- 53 FreeBSD
- 1.7K LINUX programming
- 371 MS-DOS
- Shell scripting
- 321 Windows CE & Pocket PC
- 4.1K Windows programming
- 943 Software Development
- 417 Algorithms
- 68 Object Orientation
- 92 Project Management
- 95 Quality & Testing
- 270 Security
- 7.7K WEB-Development
- 1.8K Active Server Pages
- 62 AJAX
- 6 Bootstrap Themes
- 55 CGI Development
- 28 ColdFusion
- 224 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 37 JQuery
- 309 WEB Servers
- 155 WEB-Services / SOAP

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

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

## Comments

404:

:

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]

4: :

: :

: 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

748: : 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.

4: : : 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

748: : : : 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.