Is this too easy? I don't really have a good sense of it.

[chuckro]

1. Each letter from A-Z maps to one number. No two letters map to the same number.
2. All vowels, including Y, map to prime numbers. No consonants map to prime numbers.
3. B = 1
4. C x H x U x C x K > 10,000,000
5. What is the lowest possible sum of all 26 of the mapped numbers?

Comments

[edgehopper.livejournal.com]

I get 379. B=1 is an unnecessary add-on rule.

Since CHUCK needs to be large, U should be the largest of the small primes, and C should be the largest consonant, H and U being next smallest.

I get the following mapping (initially C is 30, but that's too small so it goes up to 32.)

A 2
B 1
C 32
D 4
E 3
F 6
G 8
H 27
I 5
J 9
K 28
L 10
M 12
N 14
O 7
P 15
Q 16
R 18
S 20
T 21
U 13
V 22
W 24
X 25
Y 11
Z 26

[chuckro.livejournal.com]

Ah, you and I set up the problem the same way. Do you think the solution was easy or obvious, though?

[(Anonymous)]

Dear God, how did I give birth to a child who actually enjoys this? Well, at least he loves to cook and clean and socialize.

Guess who