Update sum_of_squares.py

This commit is contained in:
Byte Bender 2024-10-10 10:39:51 +05:30 committed by GitHub
parent ee5dbdda82
commit 7e51932ece
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194

@ -1,8 +1,11 @@
""" """
This script demonstrates the implementation of the sum of squares of the first n natural numbers. This script demonstrates the implementation of the
sum of squares of the first n natural numbers.
The function takes an integer n as input and returns the sum of squares The function takes an integer n as input and returns the sum of squares
from 1 to n using the formula n(n + 1)(2n + 1) / 6. This formula computes the sum efficiently from 1 to n using the formula n(n + 1)(2n + 1) / 6.
This formula computes the sum efficiently
without the need for iteration. without the need for iteration.
https://www.cuemath.com/algebra/sum-of-squares/ https://www.cuemath.com/algebra/sum-of-squares/
@ -11,7 +14,7 @@ https://www.cuemath.com/algebra/sum-of-squares/
def sum_of_squares(n: int) -> int: def sum_of_squares(n: int) -> int:
""" """
Implements the sum of squares formula for the first n natural numbers. Implements the sum of squares formulafor the first n natural numbers.
Parameters: Parameters:
n (int): A positive integer representing the limit of the series n (int): A positive integer representing the limit of the series