Project Euler/55: Difference between revisions
From charlesreid1
(Created page with "==Problem Statement== ==Solution Technique== ==Code== ==Flags== {{ProjectEulerFlag}}") |
No edit summary |
||
| Line 1: | Line 1: | ||
==Problem Statement== | ==Problem Statement== | ||
Lychrel numbers are numbers that, when you repeatedly reverse and add to itself, ''never'' produces a palindrome. | |||
How many Lychrel numbers are there below ten-thousand? | |||
Link: https://projecteuler.net/problem=55 | |||
==Solution Technique== | ==Solution Technique== | ||
Our technique is to implement a maximum on the number of times we reverse a number and add it to itself - namely, 50. If a number reaches 50 iterations and still has not reached a palindrome, we declare it a Lychrel number. | |||
==Code== | ==Code== | ||
Link: https://charlesreid1.com:3000/cs/euler/src/master/scratch/Round2_050-070/055/Lychrel.java | |||
==Flags== | ==Flags== | ||
{{ProjectEulerFlag}} | {{ProjectEulerFlag}} | ||
Revision as of 09:55, 8 January 2018
Problem Statement
Lychrel numbers are numbers that, when you repeatedly reverse and add to itself, never produces a palindrome.
How many Lychrel numbers are there below ten-thousand?
Link: https://projecteuler.net/problem=55
Solution Technique
Our technique is to implement a maximum on the number of times we reverse a number and add it to itself - namely, 50. If a number reaches 50 iterations and still has not reached a palindrome, we declare it a Lychrel number.
Code
Link: https://charlesreid1.com:3000/cs/euler/src/master/scratch/Round2_050-070/055/Lychrel.java
Flags
