-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patheuler_55.rb
More file actions
33 lines (22 loc) · 1.2 KB
/
euler_55.rb
File metadata and controls
33 lines (22 loc) · 1.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
require_relative 'lib/lychrel'
# http://projecteuler.net/problem=55
# If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.
# Not all numbers produce palindromes so quickly. For example,
# 349 + 943 = 1292,
# 1292 + 2921 = 4213
# 4213 + 3124 = 7337
# That is, 349 took three iterations to arrive at a palindrome.
# # Although no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome.
# A number that never forms a palindrome through the reverse and add process is called a Lychrel number.
# Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a
# number is Lychrel until proven otherwise. In addition you are given that for
# every number below ten-thousand, it will either (i) become a palindrome in less than
# fifty iterations, or, (ii) no one, with all the computing power that exists,
# has managed so far to map it to a palindrome.
# Surprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.
# How many Lychrel numbers are there below ten-thousand?
count = 0
(1..10000).each do |number|
count += 1 if Lychrel.is_lychrel(number)
end
puts count