DrRacket procedure body help (boolean-odd? x)

by

A number is even if two divides it evenly, and odd if there if there is a remainder of one. In general, when you divide a number k by a number n, the remainder is one element of the set {0,1,…n-1}. You can generalize your question by asking whether, when k is divided by n, the remainder is in some privileged set of remainder values. Since this is almost certainly homework, I do not want to provide a direct answer to your question, but I’ll answer this more general version, without sticking to the constraints of using only and and or.

(define (special-remainder? k n special-remainders)
  (if (< k n)
      (member k special-remainders)
      (special-remainder? (- k n) special-remainders)))

This special-remainder? recursively divides k by n until a remainder less than n is found. Then n is tested for its specialness. In the case that you’re considering, you’ll be able to eliminate special-remainders, because you don’t need (member k special-remainders). Since you only have one special remainder, you can just check whether k is that special remainder.

More Related Contents:

  1. What is the difference between quote and list?
  2. How to do a powerset in DrRacket?
  3. My code signals the error “application: not a procedure” or “call to non procedure”
  4. Unexpected persistence of data [duplicate]
  5. “application: not a procedure” in binary arithmetic procedures
  6. Which lang packet is proper for SICP in Dr.Racket?
  7. Dot notation in scheme
  8. Count occurrence of element in a list in Scheme?
  9. Confused by the difference between let and let* in Scheme
  10. tail-recursive function appending element to list
  11. Y combinator discussion in “The Little Schemer”
  12. Use of lambda for cons/car/cdr definition in SICP
  13. I got “scheme application not a procedure” in the last recursive calling of a function
  14. Flatten a list using only the forms in “The Little Schemer”
  15. How does the named let in the form of a loop work?
  16. What exactly is a symbol in lisp/scheme?
  17. Using AND with the apply function in Scheme
  18. Why exactly is eval evil?
  19. What is the difference between eq?, eqv?, equal?, and = in Scheme?
  20. SICP example: Counting change, cannot understand
  21. conda, condi, conde, condu
  22. Recursive range in Lisp adds a period?
  23. Functional Programming: what is an “improper list”?
  24. What is “point free” style (in Functional Programming)?
  25. How to recursively reverse a list using only basic operations?
  26. How many primitives does it take to build a LISP machine? Ten, seven or five?
  27. Cons element to list vs cons list to element in Scheme
  28. What’s the best way to learn LISP? [closed]

Leave a Comment