Chapter 3, Problem 2.2EYK

Write a function that returns the greatest common divisor of 2 integers.

Redo the program given where you have to define and use the following functions: (a) isTriangle - takes 3 sides of a triangle and returns true if they form a triangle, false otherwise. (b) isIsosceles - takes 3 sides of a triangle and returns true if they form an isosceles triangle, false otherwise. (c) isEquilateral - takes 3 sides of a triangle and returns true if they form anequilateral triangle, false otherwise. (d) isRight - takes 3 sides of a triangle and returns true if they form a right triangle, false otherwise. (e) your program should run continuous until the user wants to quit The given program: #include <iostream> #include <cmath> using namespace std; // Constant Declarations const double E = .0001; int main() { double side1, side2, side3; bool isTriangle, isRight, isEquilateral, isIsosceles; cout << "Enter the lengths of the 3 sides of a triangle -- "; cin >> side1 >> side2 >> side3; isTriangle = side1 + side2 > side3 &&side1…

a function should convert a from the function a Fahrenheit temperatures (F) to a Celsius temperatures . what should be the out put  from the function? F and C, F and 32 , F only, C only

A. The following code in the function "is_prime" attempts to examine a number and return whether the number is prime (i.e. it has no factors besides 1 and itself). It has a "Boolean Flag" called 'prime', however, the boolean logic is not implemented correctly, so the function won't always return the correct answer.    # This function determines whether an integer is prime.def is_prime(n):prime = Truefor i in range(2, n):       if n2 % i == 0:        prime = Falseelse:      prime = truereturn prime   In what cases does the function report an incorrect answer? How can the code be fixed for it to always report the correct answer? Write your answers as "comments" and the fixed code as a separate python file

In Kotlin, Write a function that uses you work from the last two questions to identify all the Pythagorean triples whose sides and hypotenuse lengths are all integers between 1 and 20.

Write a function find_words_with_zz(text) that uses a regex to find the words in a given text that contain double 'zz'. The double 'zz' cannot be in the start and end of the word. Examples: >> find_words_with_zz("""Suddenly in the night, John woke up craving pizza and a sizzling piece of bacon topped with a drizzle of bbq sauce!""") ['pizza', 'sizzling', 'drizzle']

uestion 42: Return whether a string consists of a single letter In the function below, return True if the input string parameter consists of a single uppercase letter; otherwise, return False. Most solutions would do this in two logical steps: first testing if the string consists of a single character and, second, testing whether that character is one of the uppercase letters (which can be done by seeing if it is alphabetically between A and Z, inclusive).

Let 1 represent true and 0 represent false. The function Conjunction(), whose incomplete code is given below, computes p∧q: def Conjunction(p,q):#FIX ME#return 1else:return 0 What should the line of code which contains the expression #FIX ME# be replaced with in order to complete the code?   Question 3 options:   if p != q:   if p == 0 and q == 0:   if p == q:   if p == 1 and q == 1:

Write a function that is given a phrase and returns the phrase we get if we take  out the first word from the input phrase.For example, given ‘hello how are you’, your function should return ‘how are you’ Here is an example call to the function Cout << remainingwords(“hello how are you”);