Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

I am recently learning scheme and trying to define a recursive function of log. so the output will look like (log 5 100) => 2,

I am recently learning scheme and trying to define a recursive function of log. so the output will look like (log 5 100) => 2, (log 3 4782968) => 13.

(define (log m n) (if (> m n) 0 (+ 1 (log (* m m) n )))) 

The function I wrote is not correct because of the m is keep changing. Is that any way that I can keep using the first m to do the recursive?

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Principles Programming And Performance

Authors: Patrick O'Neil

1st Edition

1558603921, 978-1558603929

More Books

Students also viewed these Databases questions

Question

here) and other areas you consider relevant.

Answered: 1 week ago