Answered: Write a function(define) the_divisor(n,…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Write a function(define) the_divisor(n, bound), that takes in two int values. N is the number you search for a divisor and bound will also be an integer. The function the_divisor should return the smallest divisor which is greater than bound. If no such integers exists, return -1. You cannot assume that the first argument will be larger than the second. In python >>> the_divisor(25,3) 5 >>>the_divisor(5,25) -1

Expert Solution

Step 1 Algorithm to print smallest divisor greater than bound

Algorithm to print smallest divisor greater than bound

Check if the given number n is divisible by 2 or not.
Iterate from i = 3 to sqrt(n) and making a jump of 2.
If any of the numbers divide n then it is the smallest prime divisor.
If none of them divide, then n is the answer.
If smallest divisor is smaller than bound then print the smallest divisor else print -1.
Stop.

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions