21 years, 5 months ago
Highlights
This is a modified version of jwalsh's code:dt15 = 1.5f*dt;for( int i = 0; i < Num_Stars; i++ ){ for( int j = i + 1; j < Num_Stars; j++ ) { Diff = Star[j].Pos - Star.Pos;…
21 years, 5 months ago
21 years, 5 months ago
21 years, 5 months ago
Quote:Original post by MickePickeYou mean Prime Numbers, not perfect numbers?Just google for it and you wil find endless resources. They don't have much use in games or apps exc…
21 years, 5 months ago
well - you can always see what MathWorld has to tell (http://mathworld.wolfram.com/PerfectNumber.html). Google will also help.As for numbers larger than long ints you are going…
21 years, 5 months ago
Latest Activity
See all in DiscussionsThis is a modified version of jwalsh's code:dt15 = 1.5f*dt;for( int i = 0; i < Num_Stars; i++ ){ for( …
21 years, 5 months ago
Quote:Original post by MickePickeYou mean Prime Numbers, not perfect numbers?Just google for it and you wil find endless resources. They …
21 years, 5 months ago
well - you can always see what MathWorld has to tell (http://mathworld.wolfram.com/PerfectNumber.html). Google will also help.As for numbers larger than …
21 years, 5 months ago