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

Project Euler Solution Added

Browse Source
This commit is contained in:
Thejus-Paul 2017-11-12 23:56:18 +05:30
parent 3fae059b61
commit 0f78cd6a55
2 changed files with 27 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
Project Euler/Problem 14/sol1.py Normal file
View File

@ -0,0 +1,20 @@
largest_number = 0
pre_counter = 0
for input1 in range(750000,1000000):
counter = 1
number = input1
while number > 1:
if number % 2 == 0:
number /=2
counter += 1
else:
number = (3*number)+1
counter += 1
if counter > pre_counter:
largest_number = input1
pre_counter = counter
print('Largest Number:',largest_number,'->',pre_counter,'digits')

7
Project Euler/README.md
View File

@ -42,3 +42,10 @@ PROBLEMS:
a^2 + b^2 = c^2 a^2 + b^2 = c^2
There exists exactly one Pythagorean triplet for which a + b + c = 1000. There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product abc. Find the product abc.
14. The following iterative sequence is defined for the set of positive integers:
n → n/2 (n is even)
n → 3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following sequence:
13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1
Which starting number, under one million, produces the longest chain?