How to resolve the algorithm Lychrel numbers step by step in the Prolog programming language
How to resolve the algorithm Lychrel numbers step by step in the Prolog programming language
Table of Contents
Problem Statement
The above recurrence relation when applied to most starting numbers n = 1, 2, ... terminates in a palindrome quite quickly.
If n0 = 12 we get And if n0 = 55 we get Notice that the check for a palindrome happens after an addition.
Some starting numbers seem to go on forever; the recurrence relation for 196 has been calculated for millions of repetitions forming numbers with millions of digits, without forming a palindrome. These numbers that do not end in a palindrome are called Lychrel numbers. For the purposes of this task a Lychrel number is any starting number that does not form a palindrome within 500 (or more) iterations.
Any integer produced in the sequence of a Lychrel number is also a Lychrel number. In general, any sequence from one Lychrel number might converge to join the sequence from a prior Lychrel number candidate; for example the sequences for the numbers 196 and then 689 begin: So we see that the sequence starting with 689 converges to, and continues with the same numbers as that for 196. Because of this we can further split the Lychrel numbers into true Seed Lychrel number candidates, and Related numbers that produce no palindromes but have integers in their sequence seen as part of the sequence generated from a lower Lychrel number.
Show all output here.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Lychrel numbers step by step in the Prolog programming language
Source code in the prolog programming language
reverse_number(Number, Rev):-
reverse_number(Number, 0, Rev).
reverse_number(0, Rev, Rev):-!.
reverse_number(N, R, Rev):-
R1 is R * 10 + N mod 10,
N1 is N // 10,
reverse_number(N1, R1, Rev).
lychrel(N, M, _, [], [], []):-
M > N,
!.
lychrel(N, M, Cache, Seeds, Related, Palindromes):-
reverse_number(M, R),
lychrel_sequence(M, 0, M, R, Cache, Sequence, Result),
update_cache(Cache, Sequence, Result, Cache1),
M1 is M + 1,
(Result == 0 ->
S = Seeds, Rel = Related, P = Palindromes
;
(R == M ->
Palindromes = [M|P]
;
Palindromes = P),
(Result == M ->
Seeds = [M|S], Related = Rel
;
Seeds = S, Related = [M|Rel])),
lychrel(N, M1, Cache1, S, Rel, P).
update_cache(Cache, [], _, Cache):-!.
update_cache(Cache, [S|Seq], Result, Cache2):-
put_assoc(S, Cache, Result, Cache1),
update_cache(Cache1, Seq, Result, Cache2).
lychrel_sequence(N, 500, _, _, _, [], N):-!.
lychrel_sequence(N, I, Sum, Rev, Cache, [Sum1|Sequence], Result):-
I1 is I + 1,
Sum1 is Sum + Rev,
reverse_number(Sum1, Rev1),
(((Rev1 == Sum1, Result = 0) ; get_assoc(Sum1, Cache, Result)) ->
Sequence = []
;
lychrel_sequence(N, I1, Sum1, Rev1, Cache, Sequence, Result)).
lychrel(N):-
empty_assoc(Cache),
lychrel(N, 1, Cache, Seeds, Related, Palindromes),
length(Seeds, Num_seeds),
length(Related, Num_related),
writef('number of seeds: %w\n', [Num_seeds]),
writef('seeds: %w\n', [Seeds]),
writef('number of related: %w\n', [Num_related]),
writef('palindromes: %w\n', [Palindromes]).
main:-
lychrel(10000).
You may also check:How to resolve the algorithm Empty program step by step in the PureBasic programming language
You may also check:How to resolve the algorithm Map range step by step in the Rust programming language
You may also check:How to resolve the algorithm Sorting algorithms/Merge sort step by step in the Io programming language
You may also check:How to resolve the algorithm First-class functions step by step in the C programming language
You may also check:How to resolve the algorithm Bitwise operations step by step in the ALGOL 68 programming language