Revisions to Double Prime Words

Tweeted twitter.com/StackCodeGolf/status/1330888910805852160

occurred Nov 23, 2020 at 15:00

added 23 characters in body

edited Sep 11, 2020 at 15:41

1.9k
10
20

Consider a word/string of length \$n\$, only including the letters A-Z, a-z. A word/string is a double prime word if and only if n is prime and the sum of the letters, s, is also prime, using their numeric position in the alphabet (a=1, B=2, c=3, etc.).

Input can be any combination of upper or lower case alphabetic characters, as there is no numeric difference between a or A.

Output is any appropriate logical format related to your language. i.e. True or False, T or F, 1 or 0, etc. Specifying what format your output will appear is highly appreciated, but not required. (Output need not include n, s, but I include them below as demonstration and example)

Winning condition is shortest code in bytes able to detect if a string is a double prime, fitting both conditions for n and s to be prime. (I've now included cases from all 4 possible situations of n, s.)

Examples

Input -> Output (n, s) Prime -> True (5, 61) han -> True (3, 23) ASK -> True (3, 31) pOpCoRn -> True (7, 97) DiningTable -> True (11, 97) METER -> True (5, 61) Hello -> False (5, 52) SMILE -> False (5, 58) frown -> False (5, 76) HelpMe -> False (6, 59) John -> False (4, 47) TwEnTy -> False (6, 107) HelloWorld -> False (10, 124) Donald -> False (6, 50) telePHONES -> False (10, 119) A -> False (1, 1) C -> False (1, 3) {1 is not prime} d -> False (1, 4)

Consider a word/string of length \$n\$, only including the letters A-Z, a-z. A word/string is a double prime word if and only if n is prime and the sum of the letters, s, is also prime, using their numeric position in the alphabet (a=1, B=2, c=3, etc.).

Input can be any combination of upper or lower case alphabetic characters, as there is no numeric difference between a or A.

Output is any appropriate logical format related to your language. i.e. True or False, T or F, 1 or 0, etc. Specifying what format your output will appear is highly appreciated, but not required. (Output need not include n, s, but I include them below as demonstration and example)

Winning condition is shortest code in bytes able to detect if a string is a double prime, fitting both conditions for n and s to be prime. (I've now included cases from all 4 possible situations of n, s.)

Examples

Input -> Output (n, s) Prime -> True (5, 61) han -> True (3, 23) ASK -> True (3, 31) pOpCoRn -> True (7, 97) DiningTable -> True (11, 97) METER -> True (5, 61) Hello -> False (5, 52) SMILE -> False (5, 58) frown -> False (5, 76) HelpMe -> False (6, 59) John -> False (4, 47) TwEnTy -> False (6, 107) HelloWorld -> False (10, 124) Donald -> False (6, 50) telePHONES -> False (10, 119) A -> False (1, 1) C -> False (1, 3) {1 is not prime}

Consider a word/string of length \$n\$, only including the letters A-Z, a-z. A word/string is a double prime word if and only if n is prime and the sum of the letters, s, is also prime, using their numeric position in the alphabet (a=1, B=2, c=3, etc.).

Input can be any combination of upper or lower case alphabetic characters, as there is no numeric difference between a or A.

Output is any appropriate logical format related to your language. i.e. True or False, T or F, 1 or 0, etc. Specifying what format your output will appear is highly appreciated, but not required. (Output need not include n, s, but I include them below as demonstration and example)

Winning condition is shortest code in bytes able to detect if a string is a double prime, fitting both conditions for n and s to be prime. (I've now included cases from all 4 possible situations of n, s.)

Examples

Input -> Output (n, s) Prime -> True (5, 61) han -> True (3, 23) ASK -> True (3, 31) pOpCoRn -> True (7, 97) DiningTable -> True (11, 97) METER -> True (5, 61) Hello -> False (5, 52) SMILE -> False (5, 58) frown -> False (5, 76) HelpMe -> False (6, 59) John -> False (4, 47) TwEnTy -> False (6, 107) HelloWorld -> False (10, 124) Donald -> False (6, 50) telePHONES -> False (10, 119) A -> False (1, 1) C -> False (1, 3) {1 is not prime} d -> False (1, 4)

added 18 characters in body

Source Link

edited Sep 9, 2020 at 15:57

Sumner18

1.9k
10
20

Consider a word/string of length \$n\$, only including the letters A-Z, a-z. A word/string is a double prime word if and only if n is prime and the sum of the letters, s, is also prime, using their numeric position in the alphabet (a=1, B=2, c=3, etc.).

Input can be any combination of upper or lower case alphabetic characters, as there is no numeric difference between a or A.

Output is any appropriate logical format related to your language. i.e. True or False, T or F, 1 or 0, etc. Specifying what format your output will appear is highly appreciated, but not required. (Output need not include n, s, but I include them below as demonstration and example)

Winning condition is shortest code in bytes able to detect if a string is a double prime, fitting both conditions for n and s to be prime. (I've now included cases from all 4 possible situations of n, s.)

Examples

Input -> Output (n, s) Prime -> True (5, 61) han -> True (3, 23) ASK -> True (3, 31) pOpCoRn -> True (7, 97) DiningTable -> True (11, 97) METER -> True (5, 61) Hello -> False (5, 52) SMILE -> False (5, 58) frown -> False (5, 76) HelpMe -> False (6, 59) John -> False (4, 47) TwEnTy -> False (6, 107) HelloWorld -> False (10, 124) Donald -> False (6, 50) telePHONES -> False (10, 119) A -> False (1, 1)  C -> False (1, 3) {1 is not prime}

Consider a word/string of length \$n\$, only including the letters A-Z, a-z. A word/string is a double prime word if and only if n is prime and the sum of the letters, s, is also prime, using their numeric position in the alphabet (a=1, B=2, c=3, etc.).

Input can be any combination of upper or lower case alphabetic characters, as there is no numeric difference between a or A.

Output is any appropriate logical format related to your language. i.e. True or False, T or F, 1 or 0, etc. Specifying what format your output will appear is highly appreciated, but not required. (Output need not include n, s, but I include them below as demonstration and example)

Winning condition is shortest code in bytes able to detect if a string is a double prime, fitting both conditions for n and s to be prime. (I've now included cases from all 4 possible situations of n, s.)

Examples

Input -> Output (n, s) Prime -> True (5, 61) han -> True (3, 23) ASK -> True (3, 31) pOpCoRn -> True (7, 97) DiningTable -> True (11, 97) METER -> True (5, 61) Hello -> False (5, 52) SMILE -> False (5, 58) frown -> False (5, 76) HelpMe -> False (6, 59) John -> False (4, 47) TwEnTy -> False (6, 107) HelloWorld -> False (10, 124) Donald -> False (6, 50) telePHONES -> False (10, 119) A -> False (1, 1) C -> False (1, 3)

Consider a word/string of length \$n\$, only including the letters A-Z, a-z. A word/string is a double prime word if and only if n is prime and the sum of the letters, s, is also prime, using their numeric position in the alphabet (a=1, B=2, c=3, etc.).

Input can be any combination of upper or lower case alphabetic characters, as there is no numeric difference between a or A.

Output is any appropriate logical format related to your language. i.e. True or False, T or F, 1 or 0, etc. Specifying what format your output will appear is highly appreciated, but not required. (Output need not include n, s, but I include them below as demonstration and example)

Winning condition is shortest code in bytes able to detect if a string is a double prime, fitting both conditions for n and s to be prime. (I've now included cases from all 4 possible situations of n, s.)

Examples

Input -> Output (n, s) Prime -> True (5, 61) han -> True (3, 23) ASK -> True (3, 31) pOpCoRn -> True (7, 97) DiningTable -> True (11, 97) METER -> True (5, 61) Hello -> False (5, 52) SMILE -> False (5, 58) frown -> False (5, 76) HelpMe -> False (6, 59) John -> False (4, 47) TwEnTy -> False (6, 107) HelloWorld -> False (10, 124) Donald -> False (6, 50) telePHONES -> False (10, 119) A -> False (1, 1)  C -> False (1, 3) {1 is not prime}

added 48 characters in body

Source Link

edited Sep 9, 2020 at 15:42

Sumner18

1.9k
10
20

Consider a word/string of length \$n\$, only including the letters A-Z, a-z. A word/string is a double prime word if and only if n is prime and the sum of the letters, s, is also prime, using their numeric position in the alphabet (a=1, B=2, c=3, etc.).

Input can be any combination of upper or lower case alphabetic characters, as there is no numeric difference between a or A.

Output is any appropriate logical format related to your language. i.e. True or False, T or F, 1 or 0, etc. Specifying what format your output will appear is highly appreciated, but not required. (Output need not include n, s, but I include them below as demonstration and example)

Winning condition is shortest code in bytes able to detect if a string is a double prime, fitting both conditions for n and s to be prime. (I've now included cases from all 4 possible situations of n, s.)

Examples

Input -> Output (n, s) Prime -> True (5, 61) han -> True (3, 23) ASK -> True (3, 31) pOpCoRn -> True (7, 97) DiningTable -> True (11, 97) METER -> True (5, 61) Hello -> False (5, 52) SMILE -> False (5, 58) frown -> False (5, 76) HelpMe -> False (6, 59) John -> False (4, 47) TwEnTy -> False (6, 107) HelloWorld -> False (10, 124) Donald -> False (6, 50) telePHONES -> False (10, 119)   A -> False (1, 1) C -> False (1, 3)

Consider a word/string of length \$n\$, only including the letters A-Z, a-z. A word/string is a double prime word if and only if n is prime and the sum of the letters, s, is also prime, using their numeric position in the alphabet (a=1, B=2, c=3, etc.).

Input can be any combination of upper or lower case alphabetic characters, as there is no numeric difference between a or A.

Output is any appropriate logical format related to your language. i.e. True or False, T or F, 1 or 0, etc. Specifying what format your output will appear is highly appreciated, but not required. (Output need not include n, s, but I include them below as demonstration and example)

Winning condition is shortest code in bytes able to detect if a string is a double prime, fitting both conditions for n and s to be prime. (I've now included cases from all 4 possible situations of n, s.)

Examples

Input -> Output (n, s) Prime -> True (5, 61) han -> True (3, 23) ASK -> True (3, 31) pOpCoRn -> True (7, 97) DiningTable -> True (11, 97) METER -> True (5, 61) Hello -> False (5, 52) SMILE -> False (5, 58) frown -> False (5, 76) HelpMe -> False (6, 59) John -> False (4, 47) TwEnTy -> False (6, 107) HelloWorld -> False (10, 124) Donald -> False (6, 50) telePHONES -> False (10, 119)

Consider a word/string of length \$n\$, only including the letters A-Z, a-z. A word/string is a double prime word if and only if n is prime and the sum of the letters, s, is also prime, using their numeric position in the alphabet (a=1, B=2, c=3, etc.).

Input can be any combination of upper or lower case alphabetic characters, as there is no numeric difference between a or A.

Output is any appropriate logical format related to your language. i.e. True or False, T or F, 1 or 0, etc. Specifying what format your output will appear is highly appreciated, but not required. (Output need not include n, s, but I include them below as demonstration and example)

Winning condition is shortest code in bytes able to detect if a string is a double prime, fitting both conditions for n and s to be prime. (I've now included cases from all 4 possible situations of n, s.)

Examples

Input -> Output (n, s) Prime -> True (5, 61) han -> True (3, 23) ASK -> True (3, 31) pOpCoRn -> True (7, 97) DiningTable -> True (11, 97) METER -> True (5, 61) Hello -> False (5, 52) SMILE -> False (5, 58) frown -> False (5, 76) HelpMe -> False (6, 59) John -> False (4, 47) TwEnTy -> False (6, 107) HelloWorld -> False (10, 124) Donald -> False (6, 50) telePHONES -> False (10, 119)   A -> False (1, 1) C -> False (1, 3)