felixm/euler
1
0
Fork 0
Code Pull Requests Releases Activity

Added 24 and 25 to ipython.

Browse Source
This commit is contained in:
Felix Martin
2018-02-06 22:22:00 +01:00
parent b7e7314e99
commit ee6e6e6445
8 changed files with 948 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
ipython/EulerProblem021.html
View File

@@ -645,6 +645,7 @@ If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and e
<div class="inner_cell">
<div class="text_cell_render border-box-sizing rendered_html">
<p>This is actually really embarrassing. Especially I was aware of the sqrt trick all the way but did not manage to put it into use properly. Another example where greate engineer will leave you far behind compared to great thinking.</p>
<p><strong>Supplement:</strong> Also I have discovered that my sum of proper divisors function has a bug when n is a square, because in that case <em>i == (n // 1)</em> which adds this value two times. So there is no amicable number under 10000 which is also a square because otherwise we would have failed.</p>
</div>
</div>