def fibonacci_generator(limit):
    """Generates Fibonacci numbers up to a specified limit."""
    a, b = 0, 1
    count = 0
    while count < limit:
        yield a
        a, b = b, a + b
        count += 1

# Iterating through the generator
# This uses very little memory, even if the limit was 1,000,000
for number in fibonacci_generator …

print("Welocome to Pynotes")

numbers = [1, 2, 3, 4, 5, 6]

# Use lambda with filter to keep even numbers
evens = list(filter(lambda n: n % 2 == 0, numbers))

# Use lambda with map to square each even number
squared_evens = list(map(lambda n: n ** 2, evens))

print("Even numbers:", evens)
print("Squared evens:", squared_evens)

a = 7
b = 3
c = a * b

c

21

class Temperature:
    def __init__(self, celsius):
        # We use an underscore to indicate this is an internal variable
        self._celsius = celsius

    @property
    def celsius(self):
        """The getter method."""
        return self._celsius

    @celsius.setter
    def celsius(self, value):
        """The setter method, allowing for validation."""
        if value < -273.15:
            raise ValueError("Temperature cannot …

from typing import List

def sum_of_integers(numbers: List[int]) -> int:
    return sum(numbers)

print(sum_of_integers([1, 2, 3]))  # Output: 6

6

from typing import Optional

def greet(name: Optional[str] = None) -> str:
    if name:
        return f"Hello, {name}!"
    return "Hello, Guest!"

print(greet())           # Output: Hello, Guest!
print(greet("Alice"))    # Output …

def factorial(n):
    if n < 0:
        raise ValueError("n must be a non-negative integer")
    if n in (0, 1):
        return 1
    return n * factorial(n - 1)

for value in range(6):
    print(f"factorial({value}) = {factorial(value)}")