Write an alternative gcd function based on the following observations (arrange so that a > b):  a. gcd(a, b) = 2gcd(a/2, b/2) if a and b are both even.  b. gcd(a, b) = gcd(a/2, b) if a is even and b is odd.  c. gcd(a, b) = gcd(a, b/2) if a is odd and b is even.  d. gcd(a, b) = gcd((a + b)/2, (a − b)/2) if a and b are both odd. Write a main function to test your gcd function.

Write an alternative gcd function based on the following observations (arrange so that a > b):  a. gcd(a, b) = 2gcd(a/2, b/2) if a and b are both even.  b. gcd(a, b) = gcd(a/2, b) if a is even and b is odd.  c. gcd(a, b) = gcd(a, b/2) if a is odd and b is even.  d. gcd(a, b) = gcd((a + b)/2, (a − b)/2) if a and b are both odd. Write a main function to test your gcd function.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter6: Modularity Using Functions

Section6.4: A Case Study: Rectangular To Polar Coordinate Conversion

Problem 9E: (Numerical) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

C Program: An integer number is said to be a perfect number if its factors, including 1 (but not the number itself), sum to the number. For example, 6 is a perfect number because 6 = 1 + 2 + 3. I have written a function called isPerfect (see below), that determines whether parameter passed to the function is a perfect number. Use this function in a C program that determines and prints all the perfect numbers between 1 and 1000. Print the factors of each perfect number to confirm that the number is indeed perfect. // isPerfect returns true if value is perfect integer, // i.e., if value is equal to sum of its factors int isPerfect(int value) { int factorSum = 1; // current sum of factors // loop through possible factor values for (int i = 2; i <= value / 2; ++i) { // if i is factor if (value % i == 0) { factorSum += i; // add to sum } } // return true if value is equal to sum of factors if (factorSum == value) { return…
Code the function multiplier(). /***** *** //The multiplier function takes 2 integer // parameters n1 and n2 and displays the result // of n1 times n2 //*** *******
Program in C++ only: Mahesh is very good at his analytical skills so his teacher Ramanujan wants to test his skills so he gives him a condition let's consider a rectangular R table containing N rows and M columns. Rows are numbered 1 to N from top to bottom. Columns are calculated from 1 to M from left to right. Each element of R is a non-negative number. R is pronounced steadily if the total number of elements in the ith line is not less and then the total number of elements in the i-line (1) th for each i lapho is 2 Kanye N and the total element in the Nth line is less than or equal to M. Your job is to find the number of fixed tables of different sizes N x M modulo 1 000 000 000 000. Input: 1 11 Output: 2
4- The function F(A,B,C,D) = A can be represented as: a) F=1 b) F=0 c) F= AB + AC + AD d) F=E(8,9,10,11,12,13,14,15)
Complete the following function using pass-by-reference: void findMax(int &max, int a) which assigns value ‘a’ to ‘max’ if a > max. Write a pseudo-code then implement a program in C language to find the maximum in a sequence of numbers using this function.
2.a Σ : {c,A,G,T}, L = { w : w = CAG™T™C, m = j + n }. For example, CAGTTC E L; CTAGTC ¢ L because the symbols are not in the order specified by the characteristic function; CAGTT ¢ L because it does not end with c; and CAGGTTC € L because the number of T's do not equal the number of A's plus the number of G's. Prove that L¢ RLs using the RL pumping theorem.
Programming Language :- C 7. A function is defined for a positive integer n as follows: 3n + 1, if n is odd f(n) = { n if n is even 2 We consider the repeated application of the function starting with a given integer n, as follows: f(n), f(f(n)), f(f(f(n))), It is conjectured that no matter which positive integer n you start from; this sequence eventually will reach to 1. If n = 13, the sequence will be 13, 40, 20, 10, 5, 16, 8, 4, 2, 1. Thus if you start from n = 13, you need to apply function 10 times to reach 1. Write a recursive function that takes n as an input number and returns how many times function f has to be applied repeatedly to reach 1.
Part (a) Write a python function that computes the binomial coefficient ("). The function should return the correct answer for any positive integer n and k where k=m pass Part (c) Suppose that the number of people in the trial is 100. Then: • Plot a curve that shows how the probability of type 1 error changes with the choice of m, for m = 1,...n assuming that the null hypothesis holds (in red), • On the same picture, plot the probability of type 2 error vs the value of m in the case in which the new drug is effective with proability 0.68 (in blue). You can plot the two curves using matplotlib.pyplot. You can select the color by passing color='r' or color='b' to the plt.plot() function. [4]: n - 100 # your code here def plot_curve (): pass [5]: plot_curve() Part (d) Based on the picture above, what value of m do you think would be suitable to keep both type 1 and type 2 error small at the same time? (You may assume that the company claims the new drug has 68% accuracy) [6]: # your…
F(?,?,?)=?′?′?+?′??+??′?′+??′?can you simplify this and draw the diagram of the simplified function
Write a recursive function definition for the following function: int squares(int n); //Precondition: n >= 1 //Returns the sum of the squares of numbers 1 through n. For example, squares(3) returns 14 because 12 + 22 + 32 is 14.
In C programing Write a recursive function that returns the product of the digits of its integer input parameter, n. You may assume that n is non-negative. For example, productDigits(243) should return 24, since 2 x 4 x 3 = 24.int productDigits (int n) {
Write a c++ program: Write a function named convertToLowestTerms that inputs two integer parameters by reference named numerator and denominator. The function should treat these variables as a fraction and reduce them to lowest terms. For example, if numerator is 20 and denominator is 60, then the function should change the variables to 1 and 3, respectively. This will require finding the greatest common divisor for the numerator and denominator then dividing both variables by that number. If the denominator is zero, the function should return false, otherwise the function should return true. Write a driver program that uses convertToLowestTerms to reduce and output several fractions.