Unproven Theorem A212558 |
| Description: | Calculates sequence OEIS A212558, which is a(n) = ((n - s)^2 mod (n + s)) - ((n + s)^2 mod (n - s)), where s is the sum of the decimal digits of n, and includes a proof of it. |
| Filename: | unproven.zip |
| ID: | 8756 |
| Author: | Gerald Hillier |
| Downloaded file size: | 1,963 bytes |
| Size on calculator: | 1 KB |
| Platforms: | 49/50 |
| User rating: | Not yet rated (you must be logged in to vote) |
| Primary category: | Math/Misc |
| Languages: | ENG |
| File date: | 2017-12-28 22:13:09 |
| Creation date: | 2017-12-19 |
| Source code: | Included |
| Download count: | 280 |
| Version history: | 2017-12-28: Added to site
|
| Archive contents: | Length Date Time Name
--------- ---------- ----- ----
117 2017-12-28 22:12 UNPROVEN.HP
5517 2017-12-28 22:10 unproven.html
--------- -------
5634 2 files |
|
| User comments: | No comments at this time. |
| You must be logged in to add your own comment. |