mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-04-08 23:05:54 +00:00
[pre-commit.ci] auto fixes from pre-commit.com hooks
for more information, see https://pre-commit.ci
This commit is contained in:
parent
78849a7437
commit
ee5dbdda82
@ -1,13 +1,14 @@
|
||||
"""
|
||||
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
|
||||
without the need for iteration.
|
||||
|
||||
https://www.cuemath.com/algebra/sum-of-squares/
|
||||
"""
|
||||
|
||||
|
||||
def sum_of_squares(n: int) -> int:
|
||||
"""
|
||||
Implements the sum of squares formula for the first n natural numbers.
|
||||
@ -25,9 +26,10 @@ def sum_of_squares(n: int) -> int:
|
||||
>>> sum_of_squares(10)
|
||||
385
|
||||
"""
|
||||
return n * (n + 1) * (2*n + 1) // 6
|
||||
return n * (n + 1) * (2 * n + 1) // 6
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
import doctest
|
||||
|
||||
doctest.testmod()
|
||||
|
Loading…
x
Reference in New Issue
Block a user