The following warnings occurred:
Warning [2] count(): Parameter must be an array or an object that implements Countable - Line: 795 - File: showthread.php PHP 7.4.33 (FreeBSD)
File Line Function
/showthread.php 795 errorHandler->error




HP Forums / HP Calculators (and very old HP Computers) / General Forum v / OEIS A212558: Proof of Unproven Conjecture? Proven!

Post Reply 
OEIS A212558: Proof of Unproven Conjecture? Proven!
12-18-2017, 08:23 AM (This post was last modified: 12-18-2017 04:41 PM by Gerald H.)
Post: #1
Gerald H Offline
Senior Member
 		Posts: 1,627
Joined: May 2014
OEIS A212558: Proof of Unproven Conjecture? Proven!
The sequence

https://oeis.org/A212558

defined as

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

has the value 0 for 2,999 < n < 20,000,000 & for random input 20,000,000 =< n < 10^94.

Can anyone suggest a proof of 0 value for all integer input > 2,999 ?
Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
OEIS A212558: Proof of Unproven Conjecture? Proven! - Gerald H - 12-18-2017 08:23 AM



User(s) browsing this thread: 1 Guest(s)

Contact Us | The Museum of HP Calculators | Return to Top | Return to Content | Lite (Archive) Mode | RSS Syndication