Problem 50948. Identify prime words

• Created by ChrisR
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Prime Numbers II

• 19 Problems
• 7 Finishers

YouTube-inspired

• 15 Problems
• 2 Finishers

Like (2)

Difficulty:

(135)

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

57.58% Correct | 42.42% Incorrect

• 33 Solutions
• 16 Solvers

Last Solution submitted on Sep 13, 2024

Last 200 Solutions

Solution Comments

Problem Recent Solvers16

Suggested Problems

• Increment a number, given its digits

  667 Solvers

• Similar Triangles - find the height of the tree

  448 Solvers

• Set a diagonal

  306 Solvers

• Two-output anonymous function?

  79 Solvers

• Dimensions of a rectangle

  5481 Solvers

More from this Author298

• Find primes and integers that solve an equation

  7 Solvers

• Count the square-full divisors of a number

  7 Solvers

• Describe n from right to left

  7 Solvers

• Convert a number from factorial notation to base 10

  10 Solvers

• Find the nth term in the digit inventory sequence

  18 Solvers