{VERSION 6 0 "IBM INTEL NT" "6.0" }
{USTYLETAB {CSTYLE "2D Math" -1 2 "Times" 0 1 0 0 0 0 0 0 2 0 0 0 0 0 
0 1 }{CSTYLE "2D Comment" 2 18 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 }
{CSTYLE "" -1 256 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 
261 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 262 "" 0 1 0 0 
0 0 0 1 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 263 "" 0 1 0 0 0 0 0 1 0 0 0 0 
0 0 0 0 }{CSTYLE "" -1 264 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }
{CSTYLE "" -1 265 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 
266 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 267 "" 0 1 0 0 
0 0 0 1 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 268 "" 0 1 0 0 0 0 0 1 0 0 0 0 
0 0 0 0 }{CSTYLE "" -1 269 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }
{CSTYLE "" -1 270 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 
277 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 278 "" 0 1 0 0 
0 0 0 1 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 279 "" 0 1 0 0 0 0 0 1 0 0 0 0 
0 0 0 0 }{CSTYLE "" -1 281 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }
{CSTYLE "" -1 282 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 
283 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }{PSTYLE "Normal" -1 0 1 
{CSTYLE "" -1 -1 "Times" 1 12 0 0 0 1 2 2 2 2 2 2 1 1 1 1 }1 1 0 0 0 
0 1 0 1 0 2 2 0 1 }{PSTYLE "Normal" -1 256 1 {CSTYLE "" -1 -1 "Times" 
1 12 0 0 0 1 2 2 2 2 2 2 1 1 1 1 }3 1 0 0 0 0 1 0 1 0 2 2 0 1 }
{PSTYLE "Normal" -1 257 1 {CSTYLE "" -1 -1 "Times" 1 12 0 0 0 1 2 1 2 
2 2 2 1 1 1 1 }1 1 0 0 0 0 1 0 1 0 2 2 0 1 }{PSTYLE "Heading 1" -1 
258 1 {CSTYLE "" -1 -1 "Times" 1 18 0 0 0 1 2 1 2 2 2 2 1 1 1 1 }3 1 
0 0 8 4 1 0 1 0 2 2 0 1 }}
{SECT 0 {EXCHG {PARA 258 "" 0 "" {TEXT -1 14 "Assignment 4  " }}{PARA 
0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }{TEXT 256 9 "
Prolem 1." }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 
82 "Make a list of all of the prime numbers up to 50.  Then convert th
at list to a set" }}}{EXCHG {PARA 257 "" 0 "" {TEXT -1 0 "" }}{PARA 
257 "" 0 "" {TEXT -1 13 "Problem 2.   " }}{PARA 0 "" 0 "" {TEXT -1 0 "
" }}{PARA 0 "" 0 "" {TEXT -1 78 "Write a procedure whose input is a po
sitive integer n and whose output is the " }{TEXT 283 4 "set " }{TEXT 
-1 104 "of all squares of positive integers less than or equal to n.  \+
Write it in two different ways: (i) using " }{TEXT 281 3 "seq" }{TEXT 
-1 18 " and (ii) using a " }{TEXT 282 7 "do loop" }{TEXT -1 43 ". Show
 output for n = 5, 50, 100,  and 150." }}{PARA 0 "" 0 "" {TEXT -1 0 "
" }}{PARA 0 "" 0 "" {TEXT 261 11 "Problem 3.\n" }{TEXT -1 98 "\nWrite \+
a program that generates all of the numbers n between 0 and 100 that s
atisfy the condition " }{XPPEDIT 18 0 "n = `mod`(2,5);" "6#/%\"nG-%$mo
dG6$\"\"#\"\"&" }{TEXT -1 64 " .  Have your program generate this as a
 list, set and sequence." }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "
" 0 "" {TEXT 262 13 "Extra Credit:" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}
{PARA 0 "" 0 "" {TEXT -1 18 "Write a procedure " }{TEXT 265 10 "enumdi
gits" }{TEXT -1 61 " to compute the number of times each digit appears
 in first n" }{TEXT 277 1 " " }{TEXT -1 10 "digits of " }{TEXT 263 2 "
e " }{TEXT -1 7 "in base" }{TEXT 264 1 " " }{TEXT -1 1 "m" }{TEXT 278 
2 ", " }{TEXT -1 6 "where " }{TEXT 270 1 "e" }{TEXT -1 37 " is the bas
e of the natural logarithm" }{TEXT 269 2 ". " }{TEXT -1 5 "Test " }
{TEXT 268 16 "enumdigits(n,m) " }{TEXT -1 3 "for" }{TEXT 267 1 " " }
{TEXT -1 19 "n=10,100,1000,10000" }{TEXT 279 1 " " }{TEXT -1 3 "and" }
{TEXT 266 1 " " }{TEXT -1 8 "m=2,3,4." }}}{EXCHG {PARA 256 "" 0 "" 
{TEXT -1 7 "- End -" }}}{PARA 0 "" 0 "" {TEXT -1 0 "" }}}{MARK "0 4 0
" 82 }{VIEWOPTS 0 0 0 1 1 1803 1 1 1 1 }{PAGENUMBERS 0 1 2 33 1 1 }