You will test an inverse function, build a composite, and find where a composite exists.
Your tasks.
f_inverse, return the inverse of , which is .compose, return a function that does inner first and then outer.least to the smallest whole number from to for which is allowed in , so that exists.Have you tried it?
Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.
Log in to join the discussion.
Loading…