This is again a nice programming practice and it should only take some minutes to solve (not like the last one, which I under-estimated. Sorry!).
We could solve it in different ways:
1. With string functions, which should be simple.
2. Without string functions. The digits have to be extracted with functions on real numbers (like LN, EXP, ...).
Please try the first method!
>> Problem 4 from Project Euler <<
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers.
Problem 4, Project Euler
This is where most of us started. Classic Spectrum basic.
Moderator: Programming Moderators
1 post • Page 1 of 1