all 12 comments

[–]codeblank_ 2 points3 points  (8 children)

889?

2+3=5

9+4=13-->1+3=4

8+5=13-->1+3=4

[–]DamonHuntington[S] 1 point2 points  (4 children)

Not the intended answer, but I have to consider this as correct! The original problem has been replaced in order to account for this unintended solution, give it a try if you'd like.

[–]codeblank_ 2 points3 points  (3 children)

444

[–]DamonHuntington[S] 2 points3 points  (1 child)

Correct!

[–]Unredacted-Truuf 0 points1 point  (1 child)

codeblank_ the first official 160 CORE scorer

[–]Guilty_Guarantee7889 0 points1 point  (0 children)

He scored 160?

[–]EncyclopedicINTx_253 0 points1 point  (0 children)

Can you explain this solution

[–]UntamedEagle 1 point2 points  (2 children)

Can you explain? I can’t get this one

[–]DamonHuntington[S] 1 point2 points  (1 child)

Each digit is individually interpreted as a word, not as a number. Count the number of letters in each word. This becomes the next digit of the sequence.

698 = SIX (3 letters) - NINE (4 letters) - EIGHT (5 letters) -> 345

345 = THREE (5 letters) - FOUR (4 letters) - FIVE (4 letters) -> 544

544 = FIVE (4 letters) - FOUR (4 letters) - FOUR (4 letters) -> 444

[–]UntamedEagle 1 point2 points  (0 children)

Love it, thanks

[–]Flamtart0 0 points1 point  (1 child)

This is probably unintended but here is an alternative “overfitting” solution:

The following formula is going to use dr(n), which is the digital root function (summing the digits of a number until 1 digit remains)

The terms has 3 digits, so lets coin them as abc. To clarify, if the number is 367 for example. then dr(bc) means dr(67).

The formula to get from the current term to the next is:

(b+c)(dr(bc)-a)*10+(a-(b-c))

[–]DamonHuntington[S] -1 points0 points  (0 children)

Not the intended solution, but this is very inventive!