10. Write a function, 1s práme, which takes a single integer argument and returns Irue when the argument is a prime number and False otherwise. Add tests for cases like this: test (is pn e (11)) test (net: me (35)). The last case Could represent your birth date. Were you born on a prime day? In a class. of 100 students how many do you think would have prime birth dates?

10. Write a function, 1s práme, which takes a single integer argument and returns Irue when the argument is a prime number and False otherwise. Add tests for cases like this: test (is pn e (11)) test (net: me (35)). The last case Could represent your birth date. Were you born on a prime day? In a class. of 100 students how many do you think would have prime birth dates?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 12PE

See similar textbooks

Similar questions

***in python only*** use turtle function Define the concentricCircles function such that: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the largest (i.e., outermost) circle, and then every other circle out to the edge alternates between that color and the 'other' color. The difference between the radii of subsequent circles is always the same, and this difference is also equal to the radius of the smallest circle. Put another way: the distance between the inside and outside of each ring is the same. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters Use any kind of loop Within the definition of concentricCircles with 4 parameters, use any kind of loop in at least one place. Call…
Write and test the “digit” function: Function Prototype: int digit(int n,int k)This function returns the kth digit of the positive integer n. For example, if n is the integer 29,415 that is entered by user , then the call digit(n,0) would return the digit 2, and the call digit(n,2) would returnthe digit 4. do this only by using functions and loops. arrays are not allowed. example :Input: n = 29415 , k = 1 output: 9 Input: n = 2 , k = 1 output: index out of bound (return -1)
What is wrong with the following function? int 3integer_add(int x,int y,int x)
Assignment Write a program to calculate n! for a given number n and perform the simple calculator operations. The valid operations of the calculator are: + add - sub * mul I div The program must contain a function fact with one input parameter that returns the factorial of a number, a function add that performs the addition of two numbers, a function sub that performs the subtraction of two numbers, a function mul that performs the multiplication of two numbers, a function div that performs the division of two numbers. The program must also check for bad input data. Make sure when you pass parameters you pass the addresses (not the value). • All function return type must be of type void. • Take inputs in main function. • Pass the addresses of the operands and the address of the result to each function. Output must be displayed as follows: 1: Addition 2: Subtraction 3: Multiplication 4: Division 5: Factorial 6: Quit Enter the choice => 1 Enter two numbers => 2, 3 Sum => 5
Fix an error and show it please? And here are the information about the homework and for the error too. def kwargs_to_args_decorator(*args, **kwargs): This question is meant to test your knowledge of creating a decorator that accepts an arbitrary number of positional and keyword arguments, to decorate a function that accepts an arbitrary number of positional and keyword arguments, and alters the arguments before passing them to the decorated function. When the decorated function is invoked, this decorator should modify the arguments the decorated function receives. This decorator should filter out all positional arguments passed to the decorated function, which are found in the positional arguments passed to the decorator when the decorator was initialized. It should also filter out all keyword arguments with keys that are found in the keyword arguments given to the decorator when the decorator was initialized. After performing the modifications to the arguments, the decorator should…
Complete the get_sum_of_evens (lower_bound, upper_bound) function that takes two integer parameters, lower bound and upper bound. The function returns the sum of all the even numbers between the two bounds, both included, passed to the function. You can assume that lower bound will always be smaller than or equal to upper_bound. For example: Test result get sum_of_evens (2, 4) print("The sum of all even numbers are:", result) print (get_sum_of_evens (9, 17)) Result The sum of all even numbers are: 6 52
Write and test the “digit” function:Function Prototype: int digit(int n,int k)This function returns the kth digit of the positive integer n. For example, if n is the integer 29,415, then the call digit(n,0) would return the digit 2, and the call digit(n,2) would return the digit 4.
Q2: In this question, you will write a Python function to compute the Hadamard product of two matrices. The Hadamard product is the "component-wise" product of two matrices. That is, each entry of the product matrix is equal to the product of its corresponding entries of the input matrices. Here is an example: a11 a12 a21 a22 a23 a31 a13 SH a32 033 A b11 b12 b13 b21 b22 b23 b31 b32 b33. B = [an bu a21 b21 a31 b31 a12 b12 a22 b22 a32 b32 a13 b13 a23 b23 a33 b33. Hadamard product of A and B Write a Python function to compute the Hadamard product of two matrices as follows. a) The inputs to the function are two matrices. b) The function should check whether the two matrices have the same size. If not, it should print "The input matrices are not of the same size". c) If two matrices are of the same size, the function computes the Hadamard product and returns the answer. Use for loops to compute the Hadamard product.
(Learning Objective: students will be able to apply their knowledge of the built-in random package to generate simulations of simple phenomena.) Write a function: • dicesim(D1,D2,trials) that takes as input the number of sides on die 1 (D1) and die2 (D2) and the number of trials. Your function should repeatedly sum pairs of random numbers between 1 and D1 and 1 and D2 and keep track of how many times each sum occurs. The function returns a numpy array with the fraction each sum of rolls occured. Since the numbers are chosen at random, the fractions will differ some from run to run. One run of the function print(p22.dicesim(6,6,10000)) resulted in: [0. 0. 0.0259 0.0615 0.0791 0.1086 0.139 0.1633 0.1385 0.114 0.0833 0.0587 0.0281] or displayed using the code from Section 16.1.1.: PMF of X Note: you should submit a file with only the standard comments at the top and the function. The grading scripts will then import the file for testing.
- Q3: Write the following functions: void print_factors (int x), that print the prime factors of x's. int sum (int x, int y), that find the summation of odd numbers ending with 7 between x & y. void print_prime (int n),that generates n numbers any print any prime number between them. void fact (int n, ref int f),that find the fact number of n( f = n!).
3. Find Relatively Prime Write a function to return a number that is relatively prime with the given number. /* return an integer that is relatively prime with n, and greater than 1i.e., the gcd of the returned int and n is 1 Note: Although gcd(n,n-1)=1, we don't want to return n-1*/int RelativelyPrime (int n) 4. Find Inverse Then implement the following function, which returns the inverse modulo, and test it.Note that you need to check whether a and n are relative prime before calling thisfunction. Recall that a and n are relatively prime means that gcd(a,n)=1, i.e., theirgreatest common divisor is 1. Also recall that the extended Euclidean Algorithm canfind the integer s and t for a and n such that as+nt=gcd(a,n), where s is the inverseof a modulo n. /* n>1, a is nonnegative *//* a<=n *//* a and n are relative prime to each other *//* return s such that a*s mod n is 1 */int inverse (int a, int n){int s, t;int d = ExtednedEuclidAlgGCD (n, a, s, t);if (d==1){return (mod (t,…
Which of the following statements are true?■ Any recursive function can be converted into a nonrecursive function.■ Recursive functions take more time and memory to execute than nonrecursive functions.■ Recursive functions are always simpler than nonrecursive functions.■ There is always a selection statement in a recursive function to check whether a base case is reached.