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
|
|||
|
|||
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 ? |
|||
12-18-2017, 08:26 AM
Post: #2
|
|||
|
|||
RE: OEIS A212558: Proof of Unproven Conjecture?
interesting!
Wikis are great, Contribute :) |
|||
12-18-2017, 10:21 AM
Post: #3
|
|||
|
|||
RE: OEIS A212558: Proof of Unproven Conjecture?
(n - s)^2 = (n + s)^2 - 4 n s = (n + s)^2 - 4 s (n + s) + 4 s^2
(n + s)^2 = (n - s)^2 + 4 n s = (n - s)^2 + 4 s (n - s) + 4 s^2 Then source problem is equivalent 4 s^2 mod (n+s) = 4 s^2 mod (n-s) This is true for all s, that 4 s^2 < n-s. |
|||
12-18-2017, 10:27 AM
Post: #4
|
|||
|
|||
RE: OEIS A212558: Proof of Unproven Conjecture?
The same property seems to hold for other bases apart from 10:
Code:
BS is the base, MAXn is the largest n for which a(n) is non-zero. Native is n presented in the specified base rather than base 10. Some observations:
It is interesting to note that the final number always ends with a run of the largest digit permitted by the base. |
|||
12-18-2017, 12:00 PM
Post: #5
|
|||
|
|||
RE: OEIS A212558: Proof of Unproven Conjecture?
(12-18-2017 10:21 AM)stored Wrote: (n - s)^2 = (n + s)^2 - 4 n s = (n + s)^2 - 4 s (n + s) + 4 s^2 Bravo, stored! A short study in algebra - I hope you enjoyed resolving the question as much as I enjoyed reading your analysis. |
|||
12-18-2017, 01:29 PM
Post: #6
|
|||
|
|||
RE: OEIS A212558: Proof of Unproven Conjecture?
Here a complete list of the 905 n for which a(n) is not zero:
Code: 1 11 |
|||
12-18-2017, 10:22 PM
Post: #7
|
|||
|
|||
RE: OEIS A212558: Proof of Unproven Conjecture? Proven!
Time to update the OEIS details?
Pauli |
|||
12-19-2017, 05:39 AM
Post: #8
|
|||
|
|||
RE: OEIS A212558: Proof of Unproven Conjecture? Proven! | |||
12-19-2017, 06:21 AM
Post: #9
|
|||
|
|||
RE: OEIS A212558: Proof of Unproven Conjecture? Proven!
Gerald, thanks you for the interesting quiz!
Small addendum about sum of the decimal digits of n. Let s(n) is the sum of the decimal digits of n. Consider condition 4*s(n)^2 < n-s(n), (*) 4*s(n)^2 + s(n) < n Function in left is monotonically increasing function, then in respect that s(n) <= 9*log10(n+1) we get estimation 4*s(n)^2 + s(n) <= 4 * (9 * log10(n+1))^2 + 9*log10(n+1) = 324 * log10(n+1)^2 + 9*log10(n+1) Maximal solution of the equation 324 * log10(n+1)^2 + 9*log10(n+1) = n is n0 ~ 4313.68. (I use Wolfram Alpha for getting this value.) Hence, condition (*) is true for all n > n0. For n from 2999 to 4313 source statement may be checked by direct computations. |
|||
12-19-2017, 08:10 AM
Post: #10
|
|||
|
|||
RE: OEIS A212558: Proof of Unproven Conjecture? Proven!
& a programme for the 49G:
Code: :: |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 2 Guest(s)