roles) || in_array('administrator', $user->roles) || in_array('admin', $user->roles ) ) { ?>
probname); ?>
Topic Classification: nid, "Topic Classification"); ?> Tags: nid, "Problem Tag");?>
Topics: nid, "Topics"); ?> Prerequisites: nid, "Prerequisites"); ?>
Supplies: nid, "Supplies"); ?> Pedagogy: nid, "Pedagogy"); ?>
Grade Vs Difficulty:
  EasyModerateChallengingPerplexing
1-2
3-4
5-6
 
 
7-8
 
 
9-10
 
 
11-12
 
13-14
Solution: nid, "Solution"); ?>
Problem

A cryptographic code is designed as follows. The first time a letter appears in a given message it is replaced by the letter that is 1 place to its right in the alphabet (assuming that the letter A is one place to the right of the letter Z). The second time this same letter appears in the given message, it is replaced by the letter that is $1+2$ places to the right, the third time it is replaced by the letter that is $1+2+3$ places to the right, and so on. For example, with this code the word ``banana'' becomes ``cbodqg''. What letter will replace the last letter s in the message \[\text{``Lee's sis is a Mississippi miss, Chriss!''?} \]

Details
Source Title: AMC 10 Problem Collection 2007
Authors
nid); while ($data = db_fetch_object($authorresult)) { $authorfirstname = $data->firstname; $authorlastname = $data->lastname; $authors = $authorfirstname . ' ' . $authorlastname; print $authors; ?>
References
nid); if (mysql_num_rows($refresult) > 0 ) { ?> nmcreferenceid; $referenceauthor = $data->author; $referencetitle = $data->title; $referenceurl = $data->url; ?> 0 ) { print '
Reference Author Reference Title Reference URL
'; } ?>
nid); $totalSets = mysql_num_rows($setsResult); if ($totalSets > 0) { ?>
Problem Sets This Problem Belongs to:
parent_nid; ?> Set:
VARIABLES
nid, 1); while ($data = db_fetch_object($variablesresult)) { $variable = $data->elementdata; ?> •


DEFINITIONS
nid); while ($data = db_fetch_object($defresult)) { $definitionid = $data->nmcdefinitionid; $definition = $data->definition; $definitionname = $data->definitionname; ?> •