Question

Write these two functions in Scheme:

even1?

odd1?

Each accepts a number as input and returns #t or #f if the number meets the condition.

The functions are named with a trailing 1 as Scheme already defines even? and odd?.

You can check your answer with this simple test:

(equal? (even1? 2) #t)

(equal? (even1? 1) #f)

(equal? (odd1? 1) #t)

(equal? (odd1? 2) #f)

(equal (square 2) 4)

Answer 1

So I am writing the 'even1?' and 'odd1?' function.

I have written the code in the block below.

I have added the comments to explain the work of both the functions accurately.

In the fourth test case given above, the correct statement should be - (equal? (square 2) 4)

So the final test case is

(equal? (even1? 2) #t)

(equal? (even1? 1) #f)

(equal? (odd1? 1) #t)

(equal? (odd1? 2) #f)

(equal (square 2) 4)

And the results are

true

false

true

false

CODE

; This is the code to find if the number given in input is even of not. it displays 'true' if the number is even and 'false' if the number is odd (define (even1? n) (cond [(equal? (modulo n 2) 0) (display "true\n")]) (cond [(equal? (modulo n 2) 1) (display "false\n")]) ) ; This is the code to find if the number given in input is odd of not. it displays 'true' if the number is odd and 'false' if the number is even (define (odd1? n) (cond [(equal? (modulo n 2) 0) (display "false\n")]) (cond [(equal? (modulo n 2) 1) (display "true\n")]) ) (equal? (even1? 1) #f) (equal? (odd1? 1) #t) (equal? (odd1? 2) #f) (equal? (square 2) 4)