- 2003 Holiday Anacrostic Directions: Read the clues and fill in the blanks at right. After you have a few words, transfer
- J. Symbolic Computation (2000) 11, 1000 Computing subgroups by exhibition in finite solvable
- available on-line at www.uoregon.edu/~wright FOURTH ANNUAL CHRISTMAS CRYPTOGRAMS
- available on-line at www.uoregon.edu/~wright EIGHTH ANNUAL CHRISTMAS CRYPTOGRAMS
- 2004 HOLIDAY ANACROSTIC DIRECTIONS: Solve the CLUES to fill in the WORDS. Transfer letters from WORDS (G-189)
- A. Made speechless P. Try 184 153 162 108 115 38 67 140 179 173 72 204 99 183 121 119
- A. January 5 holy night ___ ___ ___ ___ ___ ___ ___ -___ ___ ___ ___ ___ 4 46 211 26 182 152 205 179 62 172 99 113
- A GAP4 Package On Formations
- 2002 Christmas cryptograms --answers from wright@uoregon.edu FIRST ANNUAL CHRISTMAS CRYPTOGRAMS
- A. 1/5 ___ ___ ___ ___ ___ ___ ___ -___ ___ ___ ___ ___ 4 46 211 26 182 152 205 179 62 172 99 113
- J. Symbolic Computation (1996) 11, 1--20 Some Algorithms for
- available on-line at www.uoregon.edu/~wright SEVENTH ANNUAL CHRISTMAS CRYPTOGRAMS
- J. Symbolic Computation (2001) 11, 1{000 Computing subgroups by exhibition in nite solvable
- A GAP4 Package On Formations
- available on-line at www.uoregon.edu/~wright THIRD ANNUAL CHRISTMAS CRYPTOGRAMS
- available on-line at www.uoregon.edu/~wright FIFTH ANNUAL CHRISTMAS CRYPTOGRAMS
- available on-line at www.uoregon.edu/~wright SIXTH ANNUAL CHRISTMAS CRYPTOGRAMS
- At rest --a coaster with strings In ACTION --a SWINGER!
- 2004 HOLIDAY ANACROSTIC DIRECTIONS: Solve the CLUES to fill in the WORDS. Transfer letters from WORDS (G-189)
- Complete the quotation. Solve CLUES (A through CC) to fill in letter blanks, then transfer letters (e.g., A-105) to matching squares in the GRID (105-A). Work both directions, using "guessed" words in the grid to fill in blanks for clues. Bonus prize: Whe
- Season's Greetings 2007 Solve the CLUES (A through Z on page 2) to fill in the letter-blanks, then transfer each letter (e.g., A-65)
- J. Symbolic Computation (2001) 11, 1-000 Computing subgroups by exhibition in finite solvable
- A. Astonished P. Try 184 153 162 108 115 38 67 140 179 173 72 204 99 183 121 119
- 1M 2Z 3BB 4EE 5U 6J 7EE 8X 9DD 10CC 11R 12N 13Y 14J 15U 16I 17AA 18G 19M 20E 21W 22CC 23Y 24AA 25DD 26L 27EE 28K 29N 30N 31DD 32A 33W 34J 35BB 36A 37D 38S 39D 40G 41C
- J. Symbolic Computation (1996) 11, 1-20 Some Algorithms for
- FORMAT A GAP4 Package
- 1W 2D 3A 4H 5R 6P 7K 8X 9I 10D 11J 12K 13Y 14F 15CC 16I 17C 18K 19Z 20F 21S 22U 23E 24R 25Q 26S 27R 28G 29AA 30J 31E 32F
- 1W 2D 3A 4H 5R 6P 7K 8X 9I 10D 11J 12K 13Y 14F 15CC 16I 17C 18K 19Z 20F 21S 22U 23E 24R 25Q 26S 27R 28G 29AA 30J 31E 32F
