Problem 50948. Identify prime words

Created by ChrisR
Appears in Prime Numbers II

Difficulty:Rate

Solve Later
Add To GroupÃ‚

In a Numberphile video on evil primes, Tony Padilla introduced the “Jesus prime” 105,192,119, which is formed by concatenating the positions of the letters of ‘Jesus’ in the English alphabet: 10, 5, 19, 21, 19. In general, a prime word could be defined as a word such that the number formed by concatenating the positions of the letters in the alphabet is prime. 
Write a function that takes a string and identifies prime words. It should delete apostrophes and hyphens (e.g. “don’t” = “dont”, “un-ionized” = “unionized”) and treat other punctuation as spaces. The function should return an array of 0’s and 1’s.

Solve

Solution Stats

33 Solutions
16 Solvers

Last Solution submitted on Sep 13, 2024

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

William on 14 Mar 2021

Chris,
In test suite problem 25, there seems to be an issue with the question mark after 'Africa'. The word Africa itself is a prime word, but the solution marks it as non-prime. Since the question mark is usually considered punctuation, I treated it as a space.

ChrisR on 14 Mar 2021

Thanks William. I fixed the test (and my own code).