<script src="https://getfirebug.com/firebug-lite-debug.js"></script>
<!--don't edit this file-->
<div id=question>
<span style="font-weight:bold">Question 1:</span> Generate all prime numbers between two given numbers. The two numbers are parameters that can be passed into the function. A prime number is one that is only divisible by 1 and itself. Output the results into the results element below.
<p>
Example:
<br/> Primes between 1 and 10
<br/> Output:
<br/> 2
<br/> 3
<br/> 5
<br/> 7
<br/>
</p>
</div>
<br/>
<p>Your Results:</p>
<div id="results1"></div>
<br/>
<div id=question>
<span style="font-weight:bold">Question 2:</span> A positive integer is called a palindrome if its representation in the decimal system is the same when read from left to right and from right to left. For a given positive integer K of not more than 1000000 digits, write the value of the smallest
palindrome larger than K to output. Numbers are always displayed without leading zeros.
<P>
Example:
<br/> Number Given: 808
<br/> Output: 818
<br/> Number Given: 2133
<br/> Output: 2222
<br/>
</P>
</div>
<br/>
<p>Your Results:</p>
<div id="results2"></div>
<br/>
<div id="question">
<span style="font-weight:bold">Question 3:</span> Write a simple string compression algorithm. If a character [ch] occurs n>1 times in a row, then it will be represented by [ch][n].
<P>
Example:
<br/> String Given: aaaa
<br/> Output: a4
<br/>
<br/> String Given: aaabaaaaccaaaaba
<br/> Output: a3ba4c2a4ba
<br/>
<br/> String Given: abcd
<br/> Output: abcd
<br/>
</P>
</div>
<br/>
<p>Your Results:</p>
<div id="results3"></div>
<br/>