Problem 1084. Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
Given a number n, 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.
Project Euler Problem 92: Link
Solution Stats
Problem Comments
-
3 Comments
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 ?
No, 89 shows up before 37 does
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
Show commentsGroup

Cody Problems in Japanese
- 16 Problems
- 273 Finishers
- ベクトルのスケーリング
- 二つのベクトルの要素ごとの積の平均を計算しよう
- 2倍してみよう - ここからスタート!
- ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
- サイコロを作ろう
- チェッカーボードを作ろう
- ベクトルの値が増加しているかを調べよう
- 二乗になっている数を見つけよう
- 二つのベクトルの要素ごとの積の平均を計算しよう
- 行列内の素数の平均をとろう
- ゼロでない要素が一番多い行を探そう
- 特定の値がベクトル内に含まれているかを確認するコードを書こう
- NaN (欠損値) が含まれている行を削除しよう
- テレビのサイズを求めてみよう
- 英語の文章内の母音を取り除くコードを書きましょう。
- 対称で、n*2n のサイズの行列を作成しましょう
- 文字列の最初と最後の文字だけ抜き出しましょう。
Problem Recent Solvers235
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!