Question

PLEASE HELP! python code

Problem 4. Define the function pythagorian_coprimes (n=100) that prints all pairs of positive integer numbers (a, b) such that c = a + b is also a whole number and 1 <c<n. Include only those triples that are co-prime (do not have any common divisors other than 1). For example, (3, 4, 5) is okay but (30, 40, 50) should be skipped. Help: As a starting example, examine the function pythagorian_triples that yields all triples. Modify it to retain only those triplets that are co-prime, i.e. whose gcd is 1. Ndef pythagorian_triples (n=100): Generate pythagorean triples: integers a, b, c such that a^2 + b^2 = (^2 and < <= n for a in range(2, n): for bin range(2, a): C = (a a + b*b)**0.5 if c>n: break if c == round(c): yield a, b, int(c) for a, b, c in pythagorian_triples (20): print(a, b, c) Problem 5. Acronyms Define the function acronym that returns a string containing the first letters of each word in its input, capitalized. def acronym(string): assert acronym("University of Saint Thomas") == "UOST" assert acronym("The Museum of Fine Arts") == "TMOFA"

Answer 1

Here is the completed code for this problem. Comments are included, go through it, learn how things work and let me know if you have any doubts or if you need anything to change. If you are satisfied with the solution, please rate the answer. If not, PLEASE let me know before you rate, I’ll help you fix whatever issues. Thanks

Note: Please maintain proper code spacing (indentation), just copy the code part and paste it in your compiler/IDE directly, no modifications required.

Note: Please read the comments attached very carefully, because there could be different variations of the method (especially pythagorian_coprimes) according to different translations of the question, and if the code I attached did not perform what you expect it to perform, let me know first, I’ll update the code quickly.

#code

# problem 4
def pythagorian_coprimes(n=100):
    for a in range(2, n):
        for b in range(2, a):
            c = (a * a + b * b) ** 0.5
            if c > n:
                break
            if c == round(c):
                # storing values of a and b in two variables, to find gcd
                # note: if you are allowed to use math library, you can
                # just simply call gcd=math.gcd(a,b) and remove below 5 lines (not comments)
                x = a
                y = b
                # looping until y is 0
                while y > 0:
                    # using euclidian algorithm to find gcd of x and y
                    x, y = y, x % y
                # at the end, value of x will be the gcd
                gcd = x
                # checking if gcd is 1
                if gcd == 1:
                    # printing a and b. if you want to yield values instead, change print to yield
                    # you may also include c if you want, but the question demands "prints all pairs
                    # of positive integer numbers (a,b)" which is why I wrote the below line.
                    print (a, b)


# problem 5
def acronym(string):
    # creating an empty string
    s = ''
    # looping through each word in string
    for word in string.split():
        # converting first letter to upper case and appending to s
        s += word[0].upper()
    # returning s
    return s


# testing problem4
# note: if you used yield instead of print inside pythagorian_coprimes, you will need to use a loop
# like -> for a,b in pythagorian_coprimes(): print(a,b)
pythagorian_coprimes()

# similarly call acronym method with test input if you want to.

#code screenshot

1 2 3 4 5 6 # problem 4 def pythagorian_coprimes (n=100): for a in range(2, n): for b in range(2, a): C = (a * a + b* b) ** 0.5 if c>n: break round(C): # storing values of a and b in two variables, to find god # note: if you are allowed to use math Library, you can # just simply call gcd=math.gcd(a,b) and remove below 5 Lines (not comments) 7 8 if c D D TH X = a y = b 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 # Looping until y is a while y > @: # using euclidian algorithm to find god of x and y X, y - y, x % y # at the end, value of x will be the god gcd = x # checking if god is 1 if gcd == 1: # printing a and b. if you want to yield values instead, change print to yield # you may also include c if you want, but the question demands "prints all pairs # of positive integer numbers (a,b)" which is why I wrote the below Line. print (a, b) 32 # problem 5 def acronym(string): # creating an empty string S = # Looping through each word in string for word in string.split(): # converting first letter to upper case and appending to s s += word[@].upper() # returning s returns 33 34 35 36 37 38 39 40 41 # testing problem4 # note: if you used yield instead of print inside pythagorian_coprimes, you will need to use a Loop # Like -> for a,b in pythagorian_coprimes(): print(a,b) pythagorian_coprimes() 42 43 44 45 46 # similarly call acronym method with test input if you want to.

#output

43 125 158 21 28 247 35 12 48 9 45 28 55 488 63 68 11 316 72 65 77 36 8日 9 84 13