At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
1^2 = 1 2^2 = 4 3^2 = 9 The third perfect number is 9? Did you mean perfect SQUARES?
ohh, no, ummm, like the first number is 6, the second is 28, and idk what the third is...plus idk how to get the number
Aperfect number is a positive integer that is equal to the sum of its proper positive divisors. Mathematically, \( \sigma_1(N)=2N \) \(\sigma_1() \) is the divisor function (http://en.wikipedia.org/wiki/Divisor_function) Here is the list of perfect numbers in OEIS: http://oeis.org/A000396
Never heard of it
And fool clearly wiki'd it
A year back I wrote a very optimized perfect number generator.
whoa, did you code it all?
Unfortunately it's a part of an algorithm contest, so I can't share the code here. But I can give some hints if you want :)
Hero, I don't really need to wike perfect numbers :)
Yes please, any that are available :) I just started coding a few days ago and I'm working through the Python textbook. Just started my first more complex code (finding slope and y-intercept)still very simple, but I'd appreciate it
Okay first there are no odd perfect numbers (this is not proven yet) so you can clearly ignore the odd numbers.
Why am I just now hearing about perfect numbers? In what course do you usually learn about them?
14yamaka, what course are you currently taking?
Now, you need to have a very fast \( \sigma_1(N) \) for that you need to have a fast optimized prime generator. This is actually deep I have used Miller Rabin algorithm.
@Hero: Elementary Number theory.
14yamaka, I would probably advice you to be satisfied with typical brute-force at this stage :)
*This is actually deep, I have used Miller Rabin algorithm + sieve.
wow, ok, I gotta read up on this Miller Rabin algorithm. and sieve. Thanks for the explanation. Both of you :)
Fain I help :)
I didn't provide anything, lol FFM provided everything