| untitled.gif welcome towards my cool internet house site: posting |
welcome to my cool internet home sit
is prosecǖtedt to a jam
Hair Cares Product!!!!!
| dear prof tobot |
| [29708] by "max home made"
(207-237-165-97.s351.tnt1.nywct.ny.dialup.rcn.com) on Tue 09 Dec 2003 17:08:12
[
reply ]
|
ps so far i made a function to make a list of all integers from 2 to x (probbly important for a prime list1!!)
fun makelist 0 = []
|makelist 1 = []
|makelist 2 = [2]
|makelist x = x::[makelist (x-1)];
I think that is correct but I cant test it because i am on a CRAP COMPUTER THAT DOESNT RUN SML
i am trying 2 make a function that takes list of integers ls and integer x and returns true if a list member divides x and returns false otherwise. surrounded by **** r things that i tried but realize r PROBABLY COMPLETELY AND TOTALY DUMB but i am trying 2 say if a member this list divides x with no remainder then return true otherwise false but i dont no how 2 work with lists cause I NEVER PRGORAMED EVER
fun trydiv [] x = false
| trydiv [a::l] x = ****if [a::l] mod x = 0 then “true” else “false”**** |
: post your reply here :
|
