Write a Python program that asks the user for an integer n and then prints out all its prime factors. In your program, you have to create a function called isPrime that takes an integer as its parameter and returns a Boolean value (True/False). Hint:i is not a prime, if i has a divisor that is greater than 1 and less than or equal to sqrt(i). Sample program run 1: Enter an integer: 156 Prime factors: 2 2 3 13 Sample program run 2: Enter an integer: 150 Prime factors: 2 3 ыыш 5 5 Sample program run 3: Enter an integer: 11 Prime factors: 11

Write a Python program that asks the user for an integer n and then prints out all its prime factors. In your program, you have to create a function called isPrime that takes an integer as its parameter and returns a Boolean value (True/False). Hint:i is not a prime, if i has a divisor that is greater than 1 and less than or equal to sqrt(i). Sample program run 1: Enter an integer: 156 Prime factors: 2 2 3 13 Sample program run 2: Enter an integer: 150 Prime factors: 2 3 ыыш 5 5 Sample program run 3: Enter an integer: 11 Prime factors: 11

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 14PE

See similar textbooks

Similar questions

Write a program in Python with a function biggestBuried(s), which the parameter s is a string, and the function returns the largest integer buried in the string. If there is no integer inside the string, then return 0. For example, biggestBuried('abcd51kkk3kk19ghi') would return 51, and biggestBuried('kkk32abce@@-33bb14zzz') would return 33, since the '-' character is treated like any other non digit. print(biggestBuried('abcd51kkk3kk19ghi')) answer should be 51 print(biggestBuried('kkk32abce@@-33bb14zzz')) answer should be 33 print(biggestBuried('this15isast22ring-55')) answer should be 55
Write a program in Python with a function decimalToBinary(n) that converts a positive decimal integer n to a string representing the corresponding binary number. Do the conversion by repeatedly dividing the number n by 2 using integer division, keeping track of the remainders, until the number is reduced to 0. The remainders written in reverse order form the binary number string.
Write a program in Python with a function biggestOdd(), which reads in numbers from the user until the user enters 0. Then the function returns (not prints) the largest odd number that was entered. For example, if the integers were: 10, 9, 7, 12, 2, 5, 15, 100, 90, 60, 0, then the program would return 15 as the largest odd number. Similarly, if the integers were -55, -33, -10, 100, -5, 0, then the program would return -33 as the largest odd number. If there is no odd number, then the function should return 0.
Write a Python function round_up that, given an integer, rounds it up the next multiple of 100. If the given number is already a multiple of 100, it is just returned. For example, round_up(234) returns 300 round_up(465) returns 500 round_up(400) returns 400 The round_up function does not read input or print output.
Write a program in python with a function repeatPhrase(phrase, n), which prints the given phrase n times, alternating between lowercase and uppercase. For example, repeat('The sky is yellow', 5) would print: the sky is yellowTHE SKY IS YELLOW the sky is yellowTHE SKY IS YELLOW the sky is yellow
Write a program in Python with a function perfectcube(n), which returns True if n is a perfect cube and returns False otherwise. Notice that this function is not printing anything, but rather returning True or False. The function must use exhaustive enumeration to check if n is a perfect cube. Use the function in a program where you ask the user for n and you print a statement like "Yes, that is a perfect cube" or "No, that number is not a perfect cube".
Write a program in python with a function perfectcube(n), which returns True if n is a perfect cube and returns False otherwise. The function must use exhaustive enumeration to check if n is a perfect cube. Use the function in a program where you ask the user for n and you print a statement like "Yes, that is a perfect cube" or "No, that number is not a perfect cube", as appropriate.
Code in Python Write a function, print_integers_less_than(n), which takes an integer parameter n and prints each integer k which is at least 0 and is less than n, in ascending order. Hint: use a simple for loop. For example: Test Result print_integers_less_than(2) 0 1 print_integers_less_than(5) 0 1 2 3 4 print_integers_less_than(-3)
Write a Python function power(f,n) that takes a function f and an integer n, and returns a function that applies the function f to its argument n times. For example: power(f,0)(x) = x # apply f over x zero time = no application power(f,2)(x) = f(f(x)) # apply f over x twice, same as twice(f) power(f,5)(x) = f(f(f(f(f(x))))) # apply f over x five times If we have the function: def incr(x): return x+1, and x=5, then the above three calls would be, power(incr,0)(5) # => 5 power(incr,2)(5) # => 7 (apply incr over 5 twice) power(incr,5)(5) # => 10 (apply incr over 5 five times)
Write a function that keeps computing the sum of the digits of x^n, until there is only one digit left. For example, sumOfDigits(2,5) returns 5, because 2 ^ 5 = 32 = 3 + 2 = 5 Another example, sumOfDigits(2,8) returns 4, because 2 ^ 8 = 128 = 1 + 2 + 8 = 13 = 1 + 3 = 4
Write a PYTHON program that asks the user to input two positive integers (m, n) and determine the greatest common divisor or factor (gcd) of these two numbers. Write a python function that will work similarly to Python's built-in function gcd(). You may use it within your program so that you can check if the built-in function and your function will produce the same result. For example: 1. If m = 5 & n=10, their gcd = 5 2. If m = 11 & n = 7, their gcd = 1 3. If m = 15 & n = 10, their gcd = 5 (Note: Please provide comments that clearly explain what each main section of the code is accomplishing and how.)
Write program in python with a function occupy(n), which shows how birds are going to occupy n nests, assuming that each new bird will choose the nest in the middle of the largest unoccupied run of nests. For example, if there were 10 nests, occupy(10) would print out the following sequence, where underscore indicates an unoccupied nest, and X indicates an occupied nest. The first line of the printout is just 10 underscores showing that all the nests are unoccupied. The second line shows that a bird came to nest in position 5, since that is one the first middle positions of the unoccupied run from 0 to 9. In the third line a bird came to occupy the middle position for the longest open run of nests, from 0 to index 4.