mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-27 23:11:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

Coding style with default argument for project_euler problem 27 (#3020)

Browse Source 
* add default arguments and problem url

* Update and rename problem_27_sol1.py to sol1.py

Co-authored-by: Dhruv <dhruvmanila@gmail.com>
This commit is contained in:
Nelson Stoik 2020-10-08 05:23:00 -06:00 committed by GitHub
parent 899870be4c
commit e24248524a
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 6 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
project_euler/problem_27/problem_27_sol1.py → project_euler/problem_27/sol1.py
View File

@ -1,4 +1,9 @@
""" """
Project Euler Problem 27
https://projecteuler.net/problem=27
Problem Statement:
Euler discovered the remarkable quadratic formula: Euler discovered the remarkable quadratic formula:
n2 + n + 41 n2 + n + 41
It turns out that the formula will produce 40 primes for the consecutive values It turns out that the formula will produce 40 primes for the consecutive values
@ -37,7 +42,7 @@ def is_prime(k: int) -> bool:
return True return True
def solution(a_limit: int, b_limit: int) -> int: def solution(a_limit: int = 1000, b_limit: int = 1000) -> int:
""" """
>>> solution(1000, 1000) >>> solution(1000, 1000)
-59231 -59231