PROJECT EULER · #0387
Harshad Numbers
A Harshad or Niven number is a number that is divisible by the sum of its digits.
When we truncate the last digit from
When we truncate the last digit from
Let's call a Harshad number that, while recursively truncating the last digit, always results in a Harshad number a right truncatable Harshad number.
Also:
Let's call a Harshad number that, when divided by the sum of its digits, results in a prime a strong Harshad number.
Now take the number
When we truncate the last digit from it we get
Let's call such primes strong, right truncatable Harshad primes.
You are given that the sum of the strong, right truncatable Harshad primes less than
Find the sum of the strong, right truncatable Harshad primes less than
Write-up coming later
The complete problem is available here. An approach, code, and answer will be added later.