Haskell Quiz/Goedel

From HaskellWiki
< Haskell Quiz
Revision as of 22:44, 11 February 2008 by Dolio (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search


This quiz involved a sort of encryption via Goedel numbering. A message is encoded by finding the product of all p_n^m_n, where p_n is the nth prime, and m_n is the ascii value of the nth character in the message. The task was to create a program to both encode and decode messages for this format.

The Problem

Solutions