# Créé par shemon, le 09/02/2023 en Python 3.7
from math import*
S=0
for k in range(2022):
    S=S+k
print(S)
n=2021
print("verif=",n*(n+1)/2)

T=0
for k in range(203):
    T=T+k**2
print("T=",T)

def verifcarre(n):
    s=n*(n+1)*(2*n+1)/6
    return(s)



V=0
for k in range(21):
    V=V+(2*k-1)**2
F=0
for k in range(4):
    F=F+(2*k-1)**2
V=V-F
print("V=",V)

def B(n):
    b=0
    for k in range(n+1):
        b=b+(2*(-1)**k+1)
    return(b)

def H(n):
    h=0
    for k in range(n):
        h=h+(1/(k+1))
    return(b)

def S(n):
    s=0
    for k in range(n+1):
        s=s+abs(15-k)
    return(b)
import numpy as np
BB=np.zeros(21)
for k in range(21):
    BB[k]=B(k)
print("BB=",BB)

def facto(n):
    if n==0:
        f=1
    else:
        if n>0 and n==floor(n):
            f=1
            for k in range(n):
                f=f*(k+1)
        else:
            print("factorielle undef")
        return(f)