PYTHON  QUESTION :  The Syracuse sequence of an integer N is the sequence of integers starting with the term N, where each following term is half of the preceding term if it is even, and one plus three times the preceding term if it is odd. The sequence ends when it reaches the integer 1. The maximum of the Syracuse sequence of an integer N is the highest number reached by this sequence. This maximum can sometimes be very high compared to the starting integer N. What is the maximum of the Syracuse sequence of 3428767? To answer this question it is useful to modify the code given in demonstration which calculates the Syracuse sequence. The code given in the demo :  n = 27 print(n) while n != 1:      if n%2 == 0:           n = n // 2   # where n //= 2 or n >>= 1      else: n = 1 + 3*n      print(n

In c++, Write a function that returns the greatest common divisor of 2 integers.

Common Time Zones Function Name: commonTimeZones() Parameters: code1( str ), code2( str) Returns: list of common time zones ( list ) Description: You and your friend live in different countries, but you figure there's a chance that both of you might be in the same time zone. Thus, you want to find out the list of possible time zones that you and your friend could both be in. Given two country codes, write a function that returns a list of the time zones the two countries have in common. Be sure not to include any duplicate time zones. If the two country codes do not have any common time zones, return the string 'No Common Time Zones' instead. Note: You can assume that the codes will always be valid. example test cases: >>> commonTimeZones('can', 'usa') [UTC-08:00', 'UTC-07:00', 'UTC-06:00', 'UTC-05:00', 'UTC-04:00] >>> commonTimeZones('rus', 'chn') [UTC+08:00] For this assignment, use the REST countries API (https://restcountries.com/#api-endpoints-v2). For all of your requests, make…

Mailings Review View Help AaBbC AaBbCcD AaBbCcD AaBbCc Aa Heading 1 T Normal 1No Spac. Heading 2 Hea Paragraph Styles 8. Consider the following equation for the sum of a finite arithmetic series: S, = n(a, ta where n is the number of elements in the series, a is the first element of the series, and a, is the last element of the series. Write a method that returns the sum of the elements stored in the array in 8 above. The array must be passed to the method as an argument. Your solution should implement the equation for the sum S.