HaskellWiki

Haskell | Wiki community | Recent changes
Random page | Special pages

 

Not logged in
Log in | Help

Haskell Quiz/Goedel

< Haskell Quiz

Categories: Haskell Quiz


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.

1 The Problem

2 Solutions

Retrieved from "http://haskell.org/haskellwiki/Haskell_Quiz/Goedel"

This page has been accessed 355 times. This page was last modified 22:44, 11 February 2008. Recent content is available under a simple permissive license.