[superprismatic]

The pattern of a word can be represented

by a sequence of numbers indicating

single and repeated letters. For

example, the pattern of BOYCOTT is

1234255 since the second letter is the

same as the fifth; the last two letters

are the same and the other letters are

all different. The patterns of two ten-

letter words each containing only seven

different letters, are added, treating

the pattern representations as ten-digit

numbers. The result is 2464870348.

What are the words?

The addition is done with carries, as usual.

Patterns always start with 1 and are created from left to right. The pattern digit for a letter that is not duplicated to its left is always 1 more than the largest digit in the pattern so far. If a letter has a duplicate to its left, then the pattern digit for the duplicate is used. So, for example, abracadabra would have pattern 12314151231.

This puzzle really has two parts. The first part is to come up with all possible pairs of patterns. The second part is trying to find pairs of words which fit those pairs of patterns. I consider the second part a bit of a drag and I don't suppose anyone would actually be able to do this without writing a program and using a large word list. Penney has a pair of words as an answer to this puzzle, but after programming and using a large word list, I discovered that they are by no means unique. So, if you can just short list the possible pairs of patterns, please post those as an answer. But some of you, like me, might actually go the full monty and write a program for the second part. I hope you have as much fun as I did in working this puzzle.

[bushindo]

The pattern of a word can be represented

by a sequence of numbers indicating

single and repeated letters. For

example, the pattern of BOYCOTT is

1234255 since the second letter is the

same as the fifth; the last two letters

are the same and the other letters are

all different. The patterns of two ten-

letter words each containing only seven

different letters, are added, treating

the pattern representations as ten-digit

numbers. The result is 2464870348.

What are the words?

The addition is done with carries, as usual.

Patterns always start with 1 and are created from left to right. The pattern digit for a letter that is not duplicated to its left is always 1 more than the largest digit in the pattern so far. If a letter has a duplicate to its left, then the pattern digit for the duplicate is used. So, for example, abracadabra would have pattern 12314151231.

This puzzle really has two parts. The first part is to come up with all possible pairs of patterns. The second part is trying to find pairs of words which fit those pairs of patterns. I consider the second part a bit of a drag and I don't suppose anyone would actually be able to do this without writing a program and using a large word list. Penney has a pair of words as an answer to this puzzle, but after programming and using a large word list, I discovered that they are by no means unique. So, if you can just short list the possible pairs of patterns, please post those as an answer. But some of you, like me, might actually go the full monty and write a program for the second part. I hope you have as much fun as I did in working this puzzle.

I need a tag team. I got this sucker within range, someone go for the knock-down

I got 3 possible pairs for the two words. I don't particularly relish the word matching part, so please help yourself to that part of the puzzle.

[1231415674, 1233454674]

[1231454674, 1233415674]

[1232415674, 1232454674]

Edited August 15, 2009 by bushindo

[superprismatic]

I need a tag team. I got this sucker within range, someone go for the knock-down

I got 3 possible pairs for the two words. I don't particularly relish the word matching part, so please help yourself to that part of the puzzle.

[1231415674, 1233454674]

[1231454674, 1233415674]

[1232415674, 1232454674]

Nice going! But how did you settle on the last digits of each pair?

[bushindo]

Nice going! But how did you settle on the last digits of each pair?

My bad, apparently I missed a '4' in my code, and that produced the result above

The pairs are now

[123141567a, 123345467b]

[123145467a, 123341567b]

[123241567a, 123245467b]

where a is in (1,2,3,...,7) and b= 7 - a. That makes 21 choices. I'm going back to the code to do a comprehensive checking.

[bushindo]

My bad, apparently I missed a '4' in my code, and that produced the result above

The pairs are now

[123141567a, 123345467b]

[123145467a, 123341567b]

[123241567a, 123245467b]

where a is in (1,2,3,...,7) and b= 7 - a. That makes 21 choices. I'm going back to the code to do a comprehensive checking.

Well, seems like nobody wants to tag team with me. I'll have to do it myself.

The patterns and their corresponding words are

['1231415674', 'euhemerism', 'invisibles']

['1233454674', 'difference']


['1231415675', 'athanasies', 'subsistent']

['1233454673', 'fossilizes']


['1231454674', 'propaganda']

['1233415674', 'collective', 'connective', 'corrective', 'rubberlike', 'suggestive']


['1231454675', 'subsidized']

['1233415673', 'preemptive', 'suggesting', 'tessituras']


['1232415676', 'tarantisms']

['1232454672', 'defeasance', 'repeatable']

Edited August 17, 2009 by bushindo

[bonanova]

Well, seems like nobody wants to tag team with me. I'll have to do it myself.

The patterns and their corresponding words are

['1231415674', 'euhemerism', 'invisibles']
['1233454674', 'difference']

['1231415675', 'athanasies', 'subsistent']
['1233454673', 'fossilizes']

['1231454674', 'propaganda']
['1233415674', 'collective', 'connective', 'corrective', 'rubberlike', 'suggestive']

['1231454675', 'subsidized']
['1233415673', 'preemptive', 'suggesting', 'tessituras']

['1232415676', 'tarantisms']
['1232454672', 'defeasance', 'repeatable']

Great job.

rubberlike propaganda

[superprismatic]

SUGGESTIVE PROPAGANDA