LispForum

thanx, i managed to solve it.

EVERY would be useful, however i need a recursive function

defun examine (list)
cond list empty return nil
if list element is a number go to next element, call examine again,
else return nil

?

hi all, i wanna examine the atoms in a nested list, if the list contains numbers only (return t), if there is a char or other symbol (return nil) (defun examine (lst) (cond ((null list) 0) ((atom list) 1) (if numberp lst (examine (car lst)) ???))) ) ) im stuck here.

Warren, is there a way to get decimals as a result instead of a fraction?

hi,im trying to get the following: the input is a list of numbers (integers eg. (1 2 3 4) (5 6 7 8)) and the expected output is ((1*5)+(2*6)+(3*7)+(4*8))/(the sum of the second list). is there a non-recursive way of solving it? > (mapcar #'list '(1 2 3 4) '(5 6 7 8)) ((1 5) (2 6) (3 7)(4 8)) i was t...

hi, trying to solve this problem: a function that adds up the numbers at the end of lists and then averages them. input is like (xxx 1) (yyy 2) (zzz 3)....(nnn n) =>6 ;(1+2+3+..+n)/n (defun averaging (lst) (if (null lst) 0 (+(setq(last lst)? how does it register the number of lists it has visited, w...

hi, whats the default working directory of clisp 2.48, where i can load my files from?
tried to run clisp with a batchfile to do my own dir, but it didn't work...

thanx

hmmmm, recursively....
pretty elegant!

ok, so dolist. it doesn't need anything (stop condition, etc) other than the (lst), right? and it will know when the list ends. where do i initialize the variable sum?right after the dolist? (dolist (sum (lst) (sum 0)) (if (t(oddp lst)) (setq sum (+ 1 sum) ( ) im not sure..

hi, trying to write a function that counts odd numbers in a list: so far (defun odd-count(lst) (do ((i 0 (+ i 1) (sum 0)) ((>(+ 1 i) (length lst) (if (oddp lst) (+ 1 sum) ??not sure what to do from this point?? could somebody help? [ed note: added " " tags - nuntius]