Question

These are exercises in myprogramminglab for python and I think the simpler the code the better:

1.An arithmetic progression is a sequence of numbers in which the distance (or difference) between any two successive numbers is the same. This in the sequence 1, 3, 5, 7, ..., the distance is 2 while in the sequence 6, 12, 18, 24, ..., the distance is 6.

Given the positive integer distance and the non-negative integer n, create a list consisting of the arithmetic progression between (and including) 1 and n with a distance of distance. For example, if distance is 2 and n is 8, the list would be [1, 3, 5, 7].

Associate the list with the variable arith_prog.

2. A geometric progression is a sequence of numbers in which each value (after the first) is obtained by multiplying the previous value in the sequence by a fixed value called the common ratio. For example the sequence 3, 12, 48, 192, ... is a geometric progression in which the common ratio is 4.

Given the positive integer ratio greater than 1, and the non-negative integer n, create a list consisting of the geometric progression of numbers between (and including) 1 and n with a common ratio of ratio. For example, if ratio is 2 and n is 8, the list would be [1, 2, 4, 8].

Associate the list with the variable geom_prog.

3.In the following sequence, each number (except the first two) is the sum of the previous two number: 0, 1, 1, 2, 3, 5, 8, 13, .... This sequence is known as the Fibonacci sequence.

Given the positive integer n create a list consisting of the portion of the Fibonacci sequence less than or equal to n. For example, if n is 6, then the list would be [0, 1, 1, 2, 3, 5] and if n is 1, then the list would be [0, 1, 1].

Associate the list with the variable fib.

Answer 1

1. Program for Arthimetic Progression

# Read a positive integer for distance
distance = int(input("Enter a postive integer for distance: "))
# Read a positive integer for n
n = int(input("Enter a positive integer n: "))
count = 1
# Create a new list variable
arith_prog = [count]
# Using a while loop add the numbers in the arthimetic progression to the list
while count+distance <= n:
count = count + distance
arith_prog.append(count)
# Print the list
print ("The arthimetic progression is: " + str(arith_prog))

Output

В Python 3.6.4 Shell File Edit She Debug Options Window Help Python 3.6.4 (v3.6.4:d48eceb, Dec 19 2017, 06:04:45) [MSC v.1900 32 bit (Intel) on win32 Type "copyright", "credits" or "license"for more information. RESTART: E:/Python/ArthimeticProgression.py Enter a postive integer for distance: 2 Enter a positive integer n: 8 The arthimetic progression is: , 3, 5, 71

Program Screenshot

ArthimeticProgression.py - E:/Python/ArthimeticProgression.py (3.64) File Edit Format Run Options Window Help # Read a positive integer for distance distanceint (input ("Enter a postive integer for distance: ")) # Read a positive integer for n n - int (input ("Enter a positive integer n: ")) count1 t Create a new list variable arith _prog [count] # Using a while loop add the numbers in the arth!metic progression to the list while count +distance<-n: count = count + distance arith_prog.append (count) # Print the list print ("The arthimetic progression is: "tstr (arith _prog)) Ln: 13 Col: 59

2. Program for Geometric Progression

# Read a positive integer ratio
ratio = int(input("Enter a postive integer ratio greater than 1: "))
# Read a positive integer for n
n = int(input("Enter a positive integer n: "))
count = 1
# Create a new list variable
geom_prog = [count]
# Using a while loop add the numbers in the geometric progression to the list
while count + ratio <= n:
count = count * ratio
geom_prog.append(count)
# Print the list
print ("The geometric progression is: " + str(geom_prog))

Output

В Python 3.6.4 Shell File Edit She Debug Options Window Help Python 3.6.4 (v3.6.4:d48eceb, Dec 19 2017, 06:04:45) [MSC v.1900 32 bit (Intel) on win32 Type "copyright", "credits" or "license"for more information. -RESTART : E:/Python/GeometricProgression.py-ะ-ะะะ-ะะะ-- Enter a postive integer ratio greater than 1: 2 Enter a positive integer n: 8 The geometric progression is: [, 2, 4, 81 Ln: 8 Col: 4

Program Screenshot

GeometricProgression.py - E:/Python/GeometricProgression.py (3.6.4) File Edit Format Run Options Window Help # Read a positive integer ratio ratio - int (input ("Enter a postive integer ratio greater than 1: ") # Read a positive integer for n nint (input ("Enter a positive integer n: ")) count 1 # Create a new list variable geom progcount] # Using a while loop add the numbers in the geometric progression to the list while : count + ratio <= n count- count * ratio geom _prog.append (count) # Print the list print ("The geometric progression is: " + str (ge㎝ prog))「 Ln: 13 Col: 57

3. Program for Fibonacci series

# Read a positive integer for n
n = int(input("Enter a positive integer n: "))
# Assign the first two terms
term1 = 0
term2 = 1
# Create a new list variable and add the first two terms
fib = [term1]
fib.append(term2)
# Using a while loop add the fibonacci terms into the list
while term1 + term2 <= n:
term3 = term1 + term2
term1 = term2
term2 = term3
fib.append(term3)
# Print the list
print ("The Fibonacci sequence is is: " + str(fib))

Output

В Python 3.6.4 Shell File Edit She Debug Options Window Help Python 3.6.4 (v3.6.4:d48eceb, Dec 19 2017, 06:04:45) [MSC v.1900 32 bit (Intel) on win32 Type "copyright", "credits" or "license"for more information. RESTART: E:/Python/Fibonacci.py Enter a positive integer n: 6 The Fibonacci sequence is is: [O, 1, 1, 2, 3, 5]

Program Screenshot

Fibonacci.py-Ε:/Python/Fibonacci.py (3.6.4) File Edit Format Run Options Window Help # Read a positive integer for n n - int (input ("Enter a positive integer n: ")) # Assign the first two terms terml0 term21 # Create a new list variable and add the first two terms fib.append (term2) # Using a while loop add the fibonacci terms into the list while term1 + term2 <= n: term3 = term1 + term2 terml - term2 term2 -term3 fib.append (term3) # Print the list print ("The Fibonacci sequence is is:str (fib)) Ln: 16 Col: 51