3.3 popcorn and hw hacks

3.3 Popcorn hack 1

y=9(x+2)-66

x=int(input())
print(9 * (x + 2) - 66)

15

3.3 popcorn hack 2

Code will print: 86

number1 = 8
number2 = 3
number3 = number1 % number2
number4 = number3 * number1 + 70
print(number4)

86

3.3 popcorn hack 3

numbers = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]

for number in numbers:
    if number % 3 == 0:
        print(f"{number} is divisible by 3")
    else:
        remainder = number % 3
        print(f"{number} has a remainder of {remainder} when divided by 3")

1 has a remainder of 1 when divided by 3
2 has a remainder of 2 when divided by 3
3 is divisible by 3
4 has a remainder of 1 when divided by 3
5 has a remainder of 2 when divided by 3
6 is divisible by 3
7 has a remainder of 1 when divided by 3
8 has a remainder of 2 when divided by 3
9 is divisible by 3
10 has a remainder of 1 when divided by 3

3.3 hw hack

n = int(input("Enter a term number for the Fibonacci sequence: "))

def fibonacci(n):
    if n <= 0:
        return "Input must be a positive integer."
    elif n == 1:
        return 0
    elif n == 2:
        return 1
    else:
        a, b = 0, 1
        for _ in range(2, n):
            a, b = b, a + b
        return b
print(f"The {n}th term in the Fibonacci sequence is: {fibonacci(n)}")

The 12th term in the Fibonacci sequence is: 89