OEIS A212558: Proof of Unproven Conjecture? Proven!

12182017, 08:23 AM
(This post was last modified: 12182017 04:41 PM by Gerald H.)
Post: #1




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 ? 

« Next Oldest  Next Newest »

Messages In This Thread 
OEIS A212558: Proof of Unproven Conjecture? Proven!  Gerald H  12182017 08:23 AM
RE: OEIS A212558: Proof of Unproven Conjecture?  pier4r  12182017, 08:26 AM
RE: OEIS A212558: Proof of Unproven Conjecture?  stored  12182017, 10:21 AM
RE: OEIS A212558: Proof of Unproven Conjecture?  Gerald H  12182017, 12:00 PM
RE: OEIS A212558: Proof of Unproven Conjecture?  Paul Dale  12182017, 10:27 AM
RE: OEIS A212558: Proof of Unproven Conjecture?  Gerald H  12182017, 01:29 PM
RE: OEIS A212558: Proof of Unproven Conjecture? Proven!  Paul Dale  12182017, 10:22 PM
RE: OEIS A212558: Proof of Unproven Conjecture? Proven!  Gerald H  12192017, 05:39 AM
RE: OEIS A212558: Proof of Unproven Conjecture? Proven!  stored  12192017, 06:21 AM
RE: OEIS A212558: Proof of Unproven Conjecture? Proven!  Gerald H  12192017, 08:10 AM

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