The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right and remain prime at each stage: 3797, 797, 97, and 7. Similarly, we can work from right to left: 3797, 379, 37, and 3.
The aim is to find the sum of only n (8 <= n <=11) primes that are both truncatable from left to right and right to left.
NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes.
Information at Project Euler 037
Getting Started
Enter a whole number between 8 and 11 and click on the Submit Button. You will see the sum of the primes that are truncatable from left to right and from right to left, unless you have made an invalid input. For example, if you entered 8, you would expect to get 1986. Click on the Reset Button to clear the information or to start again.
User Stories
As a user, I expect to get an error message, if I do any of:
- Not enter anything in the input field
- Entering text other than a number
- Entering a number less than 8 or greater than 11
- Entering a number that is not an integer
As a user, I expect the function truncatablePrimes(8) to return a number.
As a user, I expect the function truncatablePrimes(8) to return 1986.
As a user, I expect the function truncatablePrimes(9) to return 5123.
As a user, I expect the function truncatablePrimes(10) to return 8920.
As a user, I expect the function truncatablePrimes(11) to return 748317.
User Stories on function truncatablePrimes(n) taken from FreeCodeCamp - Coding Interview Prep - Project Euler 037
Information Architecture
The function truncatablePrimes(n) returns a number, where n is a number between 8 and 11.
Allows the user to enter the number of truncatable primes as well as getting the sum of the first number of truncatable primes. Performs checks on valid user input. If the input is not valid, an error message is displayed.
Uses HTML5, CSS3, JavaScript, Bootstrap 5.2.0 and Google Fonts.
Ensure all user stories have been met.
Deployed on GitHub Pages at the main branch.
Written by me.