Project Euler problem148#8662

algorithms-keeper · 2023-04-30T16:17:32Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

@saitejamanchi add doctests.

@rohan472000 Sure, will add.
Thanks a lot for the help!!

algorithms-keeper · 2023-04-30T16:20:26Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

rohan472000 · 2023-04-24T18:26:31Z

use below codes for better efficiency which will solve the timeout issue:-
def solution(pascal_row_count: int = 10**9) -> int: """ To evaluate the solution, use solution() >>> solution(3) 6 >>> solution(10) 40 >>> solution(100) 2361 """ # Helper function to compute the number of odd binomial coefficients in a row def odd_binomials(n: int) -> int: res = 0 while n > 0: res += n % 2 n //= 2 return res # Compute the sum of odd binomial coefficients modulo 7 for each row up to pascal_row_count result = 0 for k in range(pascal_row_count): result += odd_binomials(k) % 7 return result

also add docs in odd_binomials, you can put above comment of that function inside as a doc.

algorithms-keeper · 2023-04-30T16:17:32Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

@saitejamanchi add doctests.

@rohan472000 Sure, will add.
Thanks a lot for the help!!

algorithms-keeper · 2023-04-30T16:20:26Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

rohan472000 · 2023-04-24T18:26:31Z

use below codes for better efficiency which will solve the timeout issue:-
def solution(pascal_row_count: int = 10**9) -> int: """ To evaluate the solution, use solution() >>> solution(3) 6 >>> solution(10) 40 >>> solution(100) 2361 """ # Helper function to compute the number of odd binomial coefficients in a row def odd_binomials(n: int) -> int: res = 0 while n > 0: res += n % 2 n //= 2 return res # Compute the sum of odd binomial coefficients modulo 7 for each row up to pascal_row_count result = 0 for k in range(pascal_row_count): result += odd_binomials(k) % 7 return result

also add docs in odd_binomials, you can put above comment of that function inside as a doc.

algorithms-keeper · 2023-04-30T16:17:32Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

@saitejamanchi add doctests.

@rohan472000 Sure, will add.
Thanks a lot for the help!!

algorithms-keeper · 2023-04-30T16:20:26Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

rohan472000 · 2023-04-24T18:26:31Z

use below codes for better efficiency which will solve the timeout issue:-
def solution(pascal_row_count: int = 10**9) -> int: """ To evaluate the solution, use solution() >>> solution(3) 6 >>> solution(10) 40 >>> solution(100) 2361 """ # Helper function to compute the number of odd binomial coefficients in a row def odd_binomials(n: int) -> int: res = 0 while n > 0: res += n % 2 n //= 2 return res # Compute the sum of odd binomial coefficients modulo 7 for each row up to pascal_row_count result = 0 for k in range(pascal_row_count): result += odd_binomials(k) % 7 return result

also add docs in odd_binomials, you can put above comment of that function inside as a doc.

algorithms-keeper · 2023-04-30T16:17:32Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

@saitejamanchi add doctests.

@rohan472000 Sure, will add.
Thanks a lot for the help!!

algorithms-keeper · 2023-04-30T16:20:26Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

rohan472000 · 2023-04-24T18:26:31Z

use below codes for better efficiency which will solve the timeout issue:-
def solution(pascal_row_count: int = 10**9) -> int: """ To evaluate the solution, use solution() >>> solution(3) 6 >>> solution(10) 40 >>> solution(100) 2361 """ # Helper function to compute the number of odd binomial coefficients in a row def odd_binomials(n: int) -> int: res = 0 while n > 0: res += n % 2 n //= 2 return res # Compute the sum of odd binomial coefficients modulo 7 for each row up to pascal_row_count result = 0 for k in range(pascal_row_count): result += odd_binomials(k) % 7 return result

also add docs in odd_binomials, you can put above comment of that function inside as a doc.

algorithms-keeper · 2023-04-30T16:17:32Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

@saitejamanchi add doctests.

@rohan472000 Sure, will add.
Thanks a lot for the help!!

algorithms-keeper · 2023-04-30T16:20:26Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

rohan472000 · 2023-04-24T18:26:31Z

use below codes for better efficiency which will solve the timeout issue:-
def solution(pascal_row_count: int = 10**9) -> int: """ To evaluate the solution, use solution() >>> solution(3) 6 >>> solution(10) 40 >>> solution(100) 2361 """ # Helper function to compute the number of odd binomial coefficients in a row def odd_binomials(n: int) -> int: res = 0 while n > 0: res += n % 2 n //= 2 return res # Compute the sum of odd binomial coefficients modulo 7 for each row up to pascal_row_count result = 0 for k in range(pascal_row_count): result += odd_binomials(k) % 7 return result

also add docs in odd_binomials, you can put above comment of that function inside as a doc.

algorithms-keeper · 2023-04-30T16:17:32Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

@saitejamanchi add doctests.

@rohan472000 Sure, will add.
Thanks a lot for the help!!

algorithms-keeper · 2023-04-30T16:20:26Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

rohan472000 · 2023-04-24T18:26:31Z

use below codes for better efficiency which will solve the timeout issue:-
def solution(pascal_row_count: int = 10**9) -> int: """ To evaluate the solution, use solution() >>> solution(3) 6 >>> solution(10) 40 >>> solution(100) 2361 """ # Helper function to compute the number of odd binomial coefficients in a row def odd_binomials(n: int) -> int: res = 0 while n > 0: res += n % 2 n //= 2 return res # Compute the sum of odd binomial coefficients modulo 7 for each row up to pascal_row_count result = 0 for k in range(pascal_row_count): result += odd_binomials(k) % 7 return result

also add docs in odd_binomials, you can put above comment of that function inside as a doc.

algorithms-keeper · 2023-04-30T16:17:32Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

@saitejamanchi add doctests.

@rohan472000 Sure, will add.
Thanks a lot for the help!!

algorithms-keeper · 2023-04-30T16:20:26Z

As there is no test file in this pull request nor any test function or class in the file project_euler/problem_148/sol1.py, please provide doctest for the function get_num_binomials

rohan472000 · 2023-04-24T18:26:31Z

use below codes for better efficiency which will solve the timeout issue:-
def solution(pascal_row_count: int = 10**9) -> int: """ To evaluate the solution, use solution() >>> solution(3) 6 >>> solution(10) 40 >>> solution(100) 2361 """ # Helper function to compute the number of odd binomial coefficients in a row def odd_binomials(n: int) -> int: res = 0 while n > 0: res += n % 2 n //= 2 return res # Compute the sum of odd binomial coefficients modulo 7 for each row up to pascal_row_count result = 0 for k in range(pascal_row_count): result += odd_binomials(k) % 7 return result

also add docs in odd_binomials, you can put above comment of that function inside as a doc.

-Original file line number
+Diff line change
@@ -0,0 +1,58 @@
+"""
+Project Euler Problem 148 : https://projecteuler.net/problem=148
+Author:	Sai Teja Manchi
+Problem Statement:
+We can easily verify that none of the entries in the
+first seven rows of Pascal's triangle are divisible by 7:
+1
+2 1
+3 3 1
+4 6 4 1
+5 10 10 5 1
+6 15 20 15 6 1
+However, if we check the first one hundred rows, we will find that
+only 2361 of the 5050 entries are not divisible by 7.
+Find the number of entries which are not divisible by 7
+in the first one billion (109) rows of Pascal's triangle.
+"""
+def get_num_binomials(row_num: int) -> int:
+ """
+ To compute the number of entries in the nth row of
+ pascal triangle that are not divisble by 7.
+ To compute the number of entries in the nth row of
+ pascal triangle that are not divisble by 7.
+ Based on Lucas Theroem it is the product of (each digit in the base 7 n + 1)
+ Reference: https://brilliant.org/wiki/lucas-theorem/
+ >>> get_num_binomials(3)
+ >>> get_num_binomials(6)
+ >>> get_num_binomials(10)
+ """
+ cnt = 1
+ while row_num > 0:
+ cnt *= (row_num % 7) + 1
+ row_num //= 7
+ return cnt
+def solution(pascal_row_count: int = 10**9) -> int:
+ """
+ To evaluate the solution, use solution()
+ >>> solution(3)
+ >>> solution(10)
+ >>> solution(100)
+ """
+ result = 0
+ for i in range(pascal_row_count):
+ result += get_num_binomials(i)
+ return result

-Original file line number
+Diff line change
@@ -0,0 +1,58 @@
+"""
+Project Euler Problem 148 : https://projecteuler.net/problem=148
+Author:	Sai Teja Manchi
+Problem Statement:
+We can easily verify that none of the entries in the
+first seven rows of Pascal's triangle are divisible by 7:
+1
+2 1
+3 3 1
+4 6 4 1
+5 10 10 5 1
+6 15 20 15 6 1
+However, if we check the first one hundred rows, we will find that
+only 2361 of the 5050 entries are not divisible by 7.
+Find the number of entries which are not divisible by 7
+in the first one billion (109) rows of Pascal's triangle.
+"""
+def get_num_binomials(row_num: int) -> int:
+ """
+ To compute the number of entries in the nth row of
+ pascal triangle that are not divisble by 7.
+ To compute the number of entries in the nth row of
+ pascal triangle that are not divisble by 7.
+ Based on Lucas Theroem it is the product of (each digit in the base 7 n + 1)
+ Reference: https://brilliant.org/wiki/lucas-theorem/
+ >>> get_num_binomials(3)
+ >>> get_num_binomials(6)
+ >>> get_num_binomials(10)
+ """
+ cnt = 1
+ while row_num > 0:
+ cnt *= (row_num % 7) + 1
+ row_num //= 7
+ return cnt
+def solution(pascal_row_count: int = 10**9) -> int:
+ """
+ To evaluate the solution, use solution()
+ >>> solution(3)
+ >>> solution(10)
+ >>> solution(100)
+ """
+ result = 0
+ for i in range(pascal_row_count):
+ result += get_num_binomials(i)
+ return result

-Original file line number
+Diff line change
@@ -0,0 +1,58 @@
+"""
+Project Euler Problem 148 : https://projecteuler.net/problem=148
+Author:	Sai Teja Manchi
+Problem Statement:
+We can easily verify that none of the entries in the
+first seven rows of Pascal's triangle are divisible by 7:
+1
+2 1
+3 3 1
+4 6 4 1
+5 10 10 5 1
+6 15 20 15 6 1
+However, if we check the first one hundred rows, we will find that
+only 2361 of the 5050 entries are not divisible by 7.
+Find the number of entries which are not divisible by 7
+in the first one billion (109) rows of Pascal's triangle.
+"""
+def get_num_binomials(row_num: int) -> int:
+ """
+ To compute the number of entries in the nth row of
+ pascal triangle that are not divisble by 7.
+ To compute the number of entries in the nth row of
+ pascal triangle that are not divisble by 7.
+ Based on Lucas Theroem it is the product of (each digit in the base 7 n + 1)
+ Reference: https://brilliant.org/wiki/lucas-theorem/
+ >>> get_num_binomials(3)
+ >>> get_num_binomials(6)
+ >>> get_num_binomials(10)
+ """
+ cnt = 1
+ while row_num > 0:
+ cnt *= (row_num % 7) + 1
+ row_num //= 7
+ return cnt
+def solution(pascal_row_count: int = 10**9) -> int:
+ """
+ To evaluate the solution, use solution()
+ >>> solution(3)
+ >>> solution(10)
+ >>> solution(100)
+ """
+ result = 0
+ for i in range(pascal_row_count):
+ result += get_num_binomials(i)
+ return result

-Original file line number
+Diff line change
@@ -0,0 +1,58 @@
+"""
+Project Euler Problem 148 : https://projecteuler.net/problem=148
+Author:	Sai Teja Manchi
+Problem Statement:
+We can easily verify that none of the entries in the
+first seven rows of Pascal's triangle are divisible by 7:
+1
+2 1
+3 3 1
+4 6 4 1
+5 10 10 5 1
+6 15 20 15 6 1
+However, if we check the first one hundred rows, we will find that
+only 2361 of the 5050 entries are not divisible by 7.
+Find the number of entries which are not divisible by 7
+in the first one billion (109) rows of Pascal's triangle.
+"""
+def get_num_binomials(row_num: int) -> int:
+ """
+ To compute the number of entries in the nth row of
+ pascal triangle that are not divisble by 7.
+ To compute the number of entries in the nth row of
+ pascal triangle that are not divisble by 7.
+ Based on Lucas Theroem it is the product of (each digit in the base 7 n + 1)
+ Reference: https://brilliant.org/wiki/lucas-theorem/
+ >>> get_num_binomials(3)
+ >>> get_num_binomials(6)
+ >>> get_num_binomials(10)
+ """
+ cnt = 1
+ while row_num > 0:
+ cnt *= (row_num % 7) + 1
+ row_num //= 7
+ return cnt
+def solution(pascal_row_count: int = 10**9) -> int:
+ """
+ To evaluate the solution, use solution()
+ >>> solution(3)
+ >>> solution(10)
+ >>> solution(100)
+ """
+ result = 0
+ for i in range(pascal_row_count):
+ result += get_num_binomials(i)
+ return result

-Original file line number
+Diff line change
@@ -0,0 +1,58 @@
+"""
+Project Euler Problem 148 : https://projecteuler.net/problem=148
+Author:	Sai Teja Manchi
+Problem Statement:
+We can easily verify that none of the entries in the
+first seven rows of Pascal's triangle are divisible by 7:
+1
+2 1
+3 3 1
+4 6 4 1
+5 10 10 5 1
+6 15 20 15 6 1
+However, if we check the first one hundred rows, we will find that
+only 2361 of the 5050 entries are not divisible by 7.
+Find the number of entries which are not divisible by 7
+in the first one billion (109) rows of Pascal's triangle.
+"""
+def get_num_binomials(row_num: int) -> int:
+ """
+ To compute the number of entries in the nth row of
+ pascal triangle that are not divisble by 7.
+ To compute the number of entries in the nth row of
+ pascal triangle that are not divisble by 7.
+ Based on Lucas Theroem it is the product of (each digit in the base 7 n + 1)
+ Reference: https://brilliant.org/wiki/lucas-theorem/
+ >>> get_num_binomials(3)
+ >>> get_num_binomials(6)
+ >>> get_num_binomials(10)
+ """
+ cnt = 1
+ while row_num > 0:
+ cnt *= (row_num % 7) + 1
+ row_num //= 7
+ return cnt
+def solution(pascal_row_count: int = 10**9) -> int:
+ """
+ To evaluate the solution, use solution()
+ >>> solution(3)
+ >>> solution(10)
+ >>> solution(100)
+ """
+ result = 0
+ for i in range(pascal_row_count):
+ result += get_num_binomials(i)
+ return result

Uh oh!

Uh oh!

Project Euler problem148#8662

Uh oh!

Project Euler problem148 #8662

Uh oh!

Uh oh!

Diff view

Diff view

There are no files selected for viewing

algorithms-keeperBotApr 30, 2023

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

algorithms-keeperBotApr 30, 2023

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Uh oh!

Uh oh!

Project Euler problem148#8662

Uh oh!

Project Euler problem148 #8662

Uh oh!

Uh oh!

Diff view

Diff view

There are no files selected for viewing

algorithms-keeperBotApr 30, 2023

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

algorithms-keeperBotApr 30, 2023

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Uh oh!

Uh oh!

Project Euler problem148#8662

Uh oh!

Project Euler problem148 #8662

Uh oh!

Uh oh!

Diff view

Diff view

There are no files selected for viewing

algorithms-keeperBotApr 30, 2023

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

algorithms-keeperBotApr 30, 2023

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Uh oh!

Uh oh!

Project Euler problem148#8662

Uh oh!

Project Euler problem148 #8662

Uh oh!

Uh oh!

Diff view