Problem 1084. Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)

Created by @bmtran (Bryant Tran)

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Given a number</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>n</w:t></w:r><w:r><w:t>, return the terminal value of the number chain formed by summing the square of the digits. According to the Project Euler problem, this number chain always terminates with either 1 or 89.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Project Euler Problem 92:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://projecteuler.net/problem=92\"><w:r><w:t>Link</w:t></w:r></w:hyperlink></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

399 Solutions
196 Solvers

Last Solution submitted on Aug 04, 2022

Last 200 Solutions

Problem Comments

3 Comments

3 Comments

M on 31 Oct 2017

Let consider the case x=954

954 -> 122 -> 9 -> 81 -> 65 -> 61 -> 37 -> 58 -> 89 -> 145 -> 42 -> 20 -> 4 -> 16 -> 37

So 37 is seen twice, it should end up with 37, no ?

Eric Lee on 9 Dec 2017

No, 89 shows up before 37 does

David Verrelli on 13 Mar 2018

By the description at ProjectEuler.net, it seems M is correct in their statement. The description there reads: "continuously [...] form a new number until it [that number just formed] has been seen before." That is exactly what M has done. Project Euler says furthermore: "[...] EVERY starting number will eventually arrive at 1 or 89." That is _not_ the same as stating: "this number chain always terminates with either 1 or 89". The key difference is in "arrives at" (the number appears) versus "terminates with" (the number is the first to appear twice in the sequence). In M's example, the sequence truly 'terminates with' 37 (as M said), but before it terminates the sequence had 'arrived at' 89.

Solution Comments

Solution 173121

1 Comment

1 Comment

Aurelien Queffurust on 17 Dec 2012

This solution requires Neural Network Toolbox

Problem Recent Solvers196

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1084. Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers196

Suggested Problems

More from this Author56

Problem Tags

Community Treasure Hunt

Problem 1084. Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers196

Suggested Problems

More from this Author56

Problem Tags

Community Treasure Hunt

Players