Anonymous user
Talk:Zumkeller numbers: Difference between revisions
m
corrected some typos.
m (corrected a typo.) |
m (corrected some typos.) |
||
Line 6:
if (n % 2 || d.size() >= 24)
return true;</pre>
99504 has 30 divisors and is not a
<lang go>func main() {
fmt.Println("The first 220 Zumkeller numbers are:")
Line 31:
99500 99504 99510 99512 99516 </pre>
Checked the first 100,000
First
<pre>
Div
Line 49:
I took a look and I'm not getting those numbers in the output. Can I see how you unit tested this? I'm not sure why that would matter though... my best guess is an OS dtype issue causing overflow but that seems unlikely. What IDE/OS did you run this on?--[[User:Mckann|Mckann]] ([[User talk:Mckann|talk]]) 03:35, 12 May 2021 (UTC)
: I think the overflow will happen with 32 Bit aka uint.<br>If you change d.size to >30-Bit it will take a while and find 99504 to be a non-
if (n % 2 || d.size() > 30)
return true;</lang>
Line 59:
:: There is no.<BR>In '[[oeis:A083207|OEIS:A083207 - Zumkeller numbers]] someone stated and checked <pre>All 205283 odd abundant numbers less than 10^8 that have even abundance are Zumkeller numbers. - T. D. Noe, Nov 14 2010</pre> something one can use.
Oh I see. It works, empirically, for N >> max
== Where to find count of
I have modified the program to run up to 1E9
<pre>Count of
count n
224 1000 time 0.004 s
| |||