{"id":26517183,"url":"https://github.com/ashwin2583/project-euler","last_synced_at":"2025-03-21T08:18:52.894Z","repository":{"id":279850637,"uuid":"940077881","full_name":"Ashwin2583/Project-Euler","owner":"Ashwin2583","description":"Computer based solution for the Euler problems.","archived":false,"fork":false,"pushed_at":"2025-03-16T18:27:00.000Z","size":33,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-16T19:38:09.667Z","etag":null,"topics":["euler-problems","euler-solutions","mathematical-modelling","mathematics","number-play"],"latest_commit_sha":null,"homepage":"https://projecteuler.net/about","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Ashwin2583.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2025-02-27T15:23:20.000Z","updated_at":"2025-03-16T18:27:03.000Z","dependencies_parsed_at":"2025-03-07T19:28:13.537Z","dependency_job_id":null,"html_url":"https://github.com/Ashwin2583/Project-Euler","commit_stats":null,"previous_names":["ashwin2583/project-euler"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ashwin2583%2FProject-Euler","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ashwin2583%2FProject-Euler/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ashwin2583%2FProject-Euler/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ashwin2583%2FProject-Euler/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Ashwin2583","download_url":"https://codeload.github.com/Ashwin2583/Project-Euler/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244759953,"owners_count":20505716,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["euler-problems","euler-solutions","mathematical-modelling","mathematics","number-play"],"created_at":"2025-03-21T08:18:52.236Z","updated_at":"2025-03-21T08:18:52.884Z","avatar_url":"https://github.com/Ashwin2583.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Euler Project\n\nComputational solutions for the problems in the **[Euler project](https://projecteuler.net/about)**. Search for the question in the above search bar for convenience. \n\n\u003e ## Multiples of 3 and 5\n\u003e\n\u003e ### Problem Statement\n\u003e\n\u003e If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3,5,6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000.\n\u003e\n\u003e ### Program script\n\u003e **[Multiples of 3 or 5.py](Multiples_of_3_or_5.py)**\n\n\n\u003e ## Even Fibonacci Numbers\n\u003e\n\u003e ### Problem Statement\n\u003e \n\u003e Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the 10 terms will be:\u003cbr\u003e\n\u003e 1,2,3,5,8,13,21,34,55,89,...\u003cbr\u003e\n\u003e By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-values terms.\n\u003e \n\u003e ### Program script\n\u003e **[Even fibonacci](even_fibonacci.py)**\n\n\n\u003e ## Largest Prime Factor\n\u003e\n\u003e ### Problem Statement\n\u003e\n\u003e The prime factors of 13195 are 5,7,13 and 29. Which is the largest prime factor of the number 600851475143 \n\u003e\n\u003e ### Program script\n\u003e **[Largest Prime Factor](largest_prime.py)**\n\n\n\u003e ## Largest Palindrome Product\n\u003e \n\u003e ### Problem Statement\n\u003e A palindrome number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 x 99. Find the largest palindrome made form the product of two 3-digit numbers.\n\u003e\n\u003e ### Program script\n\u003e **[Largest Palindrome](palindrome.py)**\n\n\n\u003e ## Smallest Multiple\n\u003e\n\u003e ### Problem Statement \n\u003e 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the samllest positive numebr that is evenly divisible by all the numbers from 1 to 20?\n\u003e\n\u003e ### Program script \n\u003e **[Smallest Multiple](smallest_multiple.py)**\n\n\n\u003e ## Sum Square Difference\n\u003e\n\u003e ### Problem Statement\n\u003e The sum of the square of the first ten natural number is, 385. The square of the sum of the first ten natural numbers is, 3025. Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 - 385 = 2640.\n\u003e Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.\n\u003e\n\u003e ### Program script\n\u003e **[Sum Square Difference](sum_square_difference.py)**\n\n\n\u003e ## 10,001st Prime\n\u003e\n\u003e ### Problem Statement\n\u003e BY listing the first six prime numbers: 2,3,5,7,11, and 13, we can see that the 6th prime is 13. What is the 10,001st prime number?\n\u003e\n\u003e ### Program script\n\u003e **[10,001st Prime](10001st_prime.py)**\n\n\n\u003e ## Largest Product in a Series\n\u003e\n\u003e ### Problem Statement\n\u003e The four adjacent digits in the 1000-digit number that have the greatest product are 9 x 9 x 8 x 9 = 5832. Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?\n\u003e\u003e \u003cdetails\u003e\n\u003e\u003e \u003csummary\u003e 1000-digit number \u003c/summary\u003e\n\u003e\u003e \u003cb\u003e\n\u003e\u003e73167176531330624919225119674426574742355349194934\n\u003e\u003e96983520312774506326239578318016984801869478851843\n\u003e\u003e85861560789112949495459501737958331952853208805511\n\u003e\u003e12540698747158523863050715693290963295227443043557\n\u003e\u003e66896648950445244523161731856403098711121722383113\n\u003e\u003e62229893423380308135336276614282806444486645238749\n\u003e\u003e30358907296290491560440772390713810515859307960866\n\u003e\u003e70172427121883998797908792274921901699720888093776\n\u003e\u003e65727333001053367881220235421809751254540594752243\n\u003e\u003e52584907711670556013604839586446706324415722155397\n\u003e\u003e53697817977846174064955149290862569321978468622482\n\u003e\u003e83972241375657056057490261407972968652414535100474\n\u003e\u003e82166370484403199890008895243450658541227588666881\n\u003e\u003e16427171479924442928230863465674813919123162824586\n\u003e\u003e17866458359124566529476545682848912883142607690042\n\u003e\u003e24219022671055626321111109370544217506941658960408\n\u003e\u003e07198403850962455444362981230987879927244284909188\n\u003e\u003e84580156166097919133875499200524063689912560717606\n\u003e\u003e05886116467109405077541002256983155200055935729725\n\u003e\u003e71636269561882670428252483600823257530420752963450\n\u003e\u003e \u003c/b\u003e\n\u003e\u003e \u003c/details\u003e\n\u003e\n\u003e ### Program Script\n\u003e **[Largest Product in a Series](Largest_product_in_a_series.py)**\n\n\n\u003e ## Special Pythagorean Triplet\n\u003e\n\u003e ### Problem Statement\n\u003e A Pythagorean triplet is a set of three natural numbers, $a \u003c b \u003c c$, for which, $a^2 + b^2 = c^2$. For example, $3^2 + 4^2 = 9 + 16 = 25 = 5^2$. There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product *abc*.\n\u003e\n\u003e ### Program Script\n\u003e **[Special Pythagorean Triplet](special_pythagorean_triplet.py)**\n\n\n\u003e ## Summation of Primes\n\u003e\n\u003e ### Problem Statement\n\u003e The sum of the primes below 10 is $2+3+5+7=17$. Find the sum of all the prime below two million.\n\u003e\n\u003e ### Program Script\n\u003e **[Summation of Primes](summation_of_primes.py)**\n\n\n\u003e ## Largest Product in a Grid\n\u003e\n\u003e ### Problem Statement\n\u003e In the 20 x 20 grid below, four numbers along a diagonal line have been marked in red. The product of these numbers is 26 x 63 x 78 x 14 = 1788696. What is the greates product of four adjacent numbers in the same direction (up,down,left,right or diagonallly) in the 20 x 20 grid?\n\u003e\u003e \n\u003e\u003e ### 20x20 Grid\n\u003e\u003e $$ \\begin{bmatrix}\n\u003e\u003e08\u002602\u002622\u002697\u002638\u002615\u002600\u002640\u002600\u002675\u002604\u002605\u002607\u002678\u002652\u002612\u002650\u002677\u002691\u002608 \\cr\n\u003e\u003e49\u002649\u002699\u002640\u002617\u002681\u002618\u002657\u002660\u002687\u002617\u002640\u002698\u002643\u002669\u002648\u002604\u002656\u002662\u002600 \\cr\n\u003e\u003e81\u002649\u002631\u002673\u002655\u002679\u002614\u002629\u002693\u002671\u002640\u002667\u002653\u002688\u002630\u002603\u002649\u002613\u002636\u002665 \\cr\n\u003e\u003e52\u002670\u002695\u002623\u002604\u002660\u002611\u002642\u002669\u002624\u002668\u002656\u002601\u002632\u002656\u002671\u002637\u002602\u002636\u002691 \\cr\n\u003e\u003e22\u002631\u002616\u002671\u002651\u002667\u002663\u002689\u002641\u002692\u002636\u002654\u002622\u002640\u002640\u002628\u002666\u002633\u002613\u002680 \\cr\n\u003e\u003e24\u002647\u002632\u002660\u002699\u002603\u002645\u002602\u002644\u002675\u002633\u002653\u002678\u002636\u002684\u002620\u002635\u002617\u002612\u002650 \\cr\n\u003e\u003e32\u002698\u002681\u002628\u002664\u002623\u002667\u002610\u002626\u002638\u002640\u002667\u002659\u002654\u002670\u002666\u002618\u002638\u002664\u002670 \\cr\n\u003e\u003e67\u002626\u002620\u002668\u002602\u002662\u002612\u002620\u002695\u002663\u002694\u002639\u002663\u002608\u002640\u002691\u002666\u002649\u002694\u002621 \\cr\n\u003e\u003e24\u002655\u002658\u002605\u002666\u002673\u002699\u002626\u002697\u002617\u002678\u002678\u002696\u002683\u002614\u002688\u002634\u002689\u002663\u002672 \\cr\n\u003e\u003e21\u002636\u002623\u002609\u002675\u002600\u002676\u002644\u002620\u002645\u002635\u002614\u002600\u002661\u002633\u002697\u002634\u002631\u002633\u002695 \\cr\n\u003e\u003e78\u002617\u002653\u002628\u002622\u002675\u002631\u002667\u002615\u002694\u002603\u002680\u002604\u002662\u002616\u002614\u002609\u002653\u002656\u002692 \\cr\n\u003e\u003e16\u002639\u002605\u002642\u002696\u002635\u002631\u002647\u002655\u002658\u002688\u002624\u002600\u002617\u002654\u002624\u002636\u002629\u002685\u002657 \\cr\n\u003e\u003e86\u002656\u002600\u002648\u002635\u002671\u002689\u002607\u002605\u002644\u002644\u002637\u002644\u002660\u002621\u002658\u002651\u002654\u002617\u002658 \\cr\n\u003e\u003e19\u002680\u002681\u002668\u002605\u002694\u002647\u002669\u002628\u002673\u002692\u002613\u002686\u002652\u002617\u002677\u002604\u002689\u002655\u002640 \\cr\n\u003e\u003e04\u002652\u002608\u002683\u002697\u002635\u002699\u002616\u002607\u002697\u002657\u002632\u002616\u002626\u002626\u002679\u002633\u002627\u002698\u002666 \\cr\n\u003e\u003e88\u002636\u002668\u002687\u002657\u002662\u002620\u002672\u002603\u002646\u002633\u002667\u002646\u002655\u002612\u002632\u002663\u002693\u002653\u002669 \\cr\n\u003e\u003e04\u002642\u002616\u002673\u002638\u002625\u002639\u002611\u002624\u002694\u002672\u002618\u002608\u002646\u002629\u002632\u002640\u002662\u002676\u002636 \\cr\n\u003e\u003e20\u002669\u002636\u002641\u002672\u002630\u002623\u002688\u002634\u002662\u002699\u002669\u002682\u002667\u002659\u002685\u002674\u002604\u002636\u002616 \\cr\n\u003e\u003e20\u002673\u002635\u002629\u002678\u002631\u002690\u002601\u002674\u002631\u002649\u002671\u002648\u002686\u002681\u002616\u002623\u002657\u002605\u002654 \\cr\n\u003e\u003e01\u002670\u002654\u002671\u002683\u002651\u002654\u002669\u002616\u002692\u002633\u002648\u002661\u002643\u002652\u002601\u002689\u002619\u002667\u002648 \\cr\n\u003e\u003e \\end{bmatrix} $$\n\u003e\n\u003e ### Program Script\n\u003e **[Largest Product in a Grid](Largest_Product_in_a_grid.py)**\n\n\n\u003e ## Highly Divisible Trinagular Number\n\u003e\n\u003e ### Problem Statement\n\u003e The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be $$ 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28$$\u003cbr\u003e The first ten terms would be: \u003cbr\u003e\n\u003e $ 1,3,6,10,15,21,28,36,45,55,\\dots$ \u003cbr\u003e\n\u003e Let us list the factors of the seven triangle numbers: \u003cbr\u003e\n\u003e \n\u003e **1**: 1 \u003cbr\u003e \n\u003e **3**: 1,3 \u003cbr\u003e \n\u003e **6**: 1,2,3,6 \u003cbr\u003e \n\u003e **10**: 1,2,5,10\u003cbr\u003e\n\u003e **15**: 1,3,5,15\u003cbr\u003e\n\u003e **21**: 1,3,7,21 \u003cbr\u003e\n\u003e **28**: 1,2,4,7,14,28 \u003cbr\u003e\n\u003e\n\u003e We can see that 28 is the first triangle number to have over five divisors. What is the value of the first triangle number to have over five hundred divisors?\n\u003e\n\u003e ### Program Script\n\u003e **[Highly Divisible Triangular Number](Highly_divisible_triangular_number.py)**\n\n\n\u003e ## Large Sum\n\u003e\n\u003e ### Problem Statement\n\u003e Work out the first ten digits of the sum of the following one-hundred 50-digit number.\n\u003e\u003e \u003cdetails\u003e\n\u003e\u003e \u003csummary\u003e one hundred 50-digit number \u003c/summary\u003e \n\u003e\u003e \u003cb\u003e\n\u003e\u003e 37107287533902102798797998220837590246510135740250\n\u003e\u003e 46376937677490009712648124896970078050417018260538\n\u003e\u003e 74324986199524741059474233309513058123726617309629\n\u003e\u003e 91942213363574161572522430563301811072406154908250\n\u003e\u003e 23067588207539346171171980310421047513778063246676\n\u003e\u003e 89261670696623633820136378418383684178734361726757\n\u003e\u003e 28112879812849979408065481931592621691275889832738\n\u003e\u003e 44274228917432520321923589422876796487670272189318\n\u003e\u003e 47451445736001306439091167216856844588711603153276\n\u003e\u003e 70386486105843025439939619828917593665686757934951\n\u003e\u003e 62176457141856560629502157223196586755079324193331\n\u003e\u003e 64906352462741904929101432445813822663347944758178\n\u003e\u003e 92575867718337217661963751590579239728245598838407\n\u003e\u003e 58203565325359399008402633568948830189458628227828\n\u003e\u003e 80181199384826282014278194139940567587151170094390\n\u003e\u003e 35398664372827112653829987240784473053190104293586\n\u003e\u003e 86515506006295864861532075273371959191420517255829\n\u003e\u003e 71693888707715466499115593487603532921714970056938\n\u003e\u003e 54370070576826684624621495650076471787294438377604\n\u003e\u003e 53282654108756828443191190634694037855217779295145\n\u003e\u003e 36123272525000296071075082563815656710885258350721\n\u003e\u003e 45876576172410976447339110607218265236877223636045\n\u003e\u003e 17423706905851860660448207621209813287860733969412\n\u003e\u003e 81142660418086830619328460811191061556940512689692\n\u003e\u003e 51934325451728388641918047049293215058642563049483\n\u003e\u003e 62467221648435076201727918039944693004732956340691\n\u003e\u003e 15732444386908125794514089057706229429197107928209\n\u003e\u003e 55037687525678773091862540744969844508330393682126\n\u003e\u003e 18336384825330154686196124348767681297534375946515\n\u003e\u003e 80386287592878490201521685554828717201219257766954\n\u003e\u003e 78182833757993103614740356856449095527097864797581\n\u003e\u003e 16726320100436897842553539920931837441497806860984\n\u003e\u003e 48403098129077791799088218795327364475675590848030\n\u003e\u003e 87086987551392711854517078544161852424320693150332\n\u003e\u003e 59959406895756536782107074926966537676326235447210\n\u003e\u003e 69793950679652694742597709739166693763042633987085\n\u003e\u003e 41052684708299085211399427365734116182760315001271\n\u003e\u003e 65378607361501080857009149939512557028198746004375\n\u003e\u003e 35829035317434717326932123578154982629742552737307\n\u003e\u003e 94953759765105305946966067683156574377167401875275\n\u003e\u003e 88902802571733229619176668713819931811048770190271\n\u003e\u003e 25267680276078003013678680992525463401061632866526\n\u003e\u003e 36270218540497705585629946580636237993140746255962\n\u003e\u003e 24074486908231174977792365466257246923322810917141\n\u003e\u003e 91430288197103288597806669760892938638285025333403\n\u003e\u003e 34413065578016127815921815005561868836468420090470\n\u003e\u003e 23053081172816430487623791969842487255036638784583\n\u003e\u003e 11487696932154902810424020138335124462181441773470\n\u003e\u003e 63783299490636259666498587618221225225512486764533\n\u003e\u003e 67720186971698544312419572409913959008952310058822\n\u003e\u003e 95548255300263520781532296796249481641953868218774\n\u003e\u003e 76085327132285723110424803456124867697064507995236\n\u003e\u003e 37774242535411291684276865538926205024910326572967\n\u003e\u003e 23701913275725675285653248258265463092207058596522\n\u003e\u003e 29798860272258331913126375147341994889534765745501\n\u003e\u003e 18495701454879288984856827726077713721403798879715\n\u003e\u003e 38298203783031473527721580348144513491373226651381\n\u003e\u003e 34829543829199918180278916522431027392251122869539\n\u003e\u003e 40957953066405232632538044100059654939159879593635\n\u003e\u003e 29746152185502371307642255121183693803580388584903\n\u003e\u003e 41698116222072977186158236678424689157993532961922\n\u003e\u003e 62467957194401269043877107275048102390895523597457\n\u003e\u003e 23189706772547915061505504953922979530901129967519\n\u003e\u003e 86188088225875314529584099251203829009407770775672\n\u003e\u003e 11306739708304724483816533873502340845647058077308\n\u003e\u003e 82959174767140363198008187129011875491310547126581\n\u003e\u003e 97623331044818386269515456334926366572897563400500\n\u003e\u003e 42846280183517070527831839425882145521227251250327\n\u003e\u003e 55121603546981200581762165212827652751691296897789\n\u003e\u003e 32238195734329339946437501907836945765883352399886\n\u003e\u003e 75506164965184775180738168837861091527357929701337\n\u003e\u003e 62177842752192623401942399639168044983993173312731\n\u003e\u003e 32924185707147349566916674687634660915035914677504\n\u003e\u003e 99518671430235219628894890102423325116913619626622\n\u003e\u003e 73267460800591547471830798392868535206946944540724\n\u003e\u003e 76841822524674417161514036427982273348055556214818\n\u003e\u003e 97142617910342598647204516893989422179826088076852\n\u003e\u003e 87783646182799346313767754307809363333018982642090\n\u003e\u003e 10848802521674670883215120185883543223812876952786\n\u003e\u003e 71329612474782464538636993009049310363619763878039\n\u003e\u003e 62184073572399794223406235393808339651327408011116\n\u003e\u003e 66627891981488087797941876876144230030984490851411\n\u003e\u003e 60661826293682836764744779239180335110989069790714\n\u003e\u003e 85786944089552990653640447425576083659976645795096\n\u003e\u003e 66024396409905389607120198219976047599490197230297\n\u003e\u003e 64913982680032973156037120041377903785566085089252\n\u003e\u003e 16730939319872750275468906903707539413042652315011\n\u003e\u003e 94809377245048795150954100921645863754710598436791\n\u003e\u003e 78639167021187492431995700641917969777599028300699\n\u003e\u003e 15368713711936614952811305876380278410754449733078\n\u003e\u003e 40789923115535562561142322423255033685442488917353\n\u003e\u003e 44889911501440648020369068063960672322193204149535\n\u003e\u003e 41503128880339536053299340368006977710650566631954\n\u003e\u003e 81234880673210146739058568557934581403627822703280\n\u003e\u003e 82616570773948327592232845941706525094512325230608\n\u003e\u003e 22918802058777319719839450180888072429661980811197\n\u003e\u003e 77158542502016545090413245809786882778948721859617\n\u003e\u003e 72107838435069186155435662884062257473692284509516\n\u003e\u003e 20849603980134001723930671666823555245252804609722\n\u003e\u003e 53503534226472524250874054075591789781264330331690 \u003c/b\u003e\n\u003e\u003e \u003c/details\u003e\n\u003e\n\u003e ### Program Script\n\u003e **[Large Sum](large_sum.py)**\n\n\n\u003e ## Longest Collatz Sequence\n\u003e\n\u003e ### Problem Statement\n\u003e The following iterative sequence is defined for the set of positive integers: \u003cbr\u003e\n\u003e *n* -\u003e *n*/2 (*n* is even) \u003cbr\u003e\n\u003e *n* -\u003e 3*n* + 1 (*n* is odd) \u003cbr\u003e\n\u003e\n\u003e Using the rule above and starting with 13, we generate the following sequence: \u003cbr\u003e\n\u003e 13 -\u003e 40 -\u003e 20 -\u003e 10 -\u003e 5 -\u003e 16 -\u003e 8 -\u003e 4 -\u003e 2 -\u003e 1. \u003cbr\u003e\n\u003e\n\u003e It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1. \u003cbr\u003e\n\u003e Which starting number, under one million, produces the longest chain? \u003cbr\u003e\n\u003e **Note**: Once the chain starts the terms are allowed to go above one million.\n\u003e\n\u003e ### Program Script\n\u003e **[Largest Collatz Sequence](longest_collatz_sequence.py)**\n\n\n\u003e ## Lattice Path\n\u003e\n\u003e ### Problem Statement\n\u003e Starting in the top left corner of a 2 x 2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.\n\u003e\n\u003e\u003e![2x2 grid lattice path](https://projecteuler.net/resources/images/0015.png?1678992052) \n\u003e\n\u003e How many such routes are there through a 20x20 grid?\n\u003e\n\u003e ### Program Script\n\u003e **[Lattice Paths](lattice_path.py)**\n\n\n\u003e ## Power Digital Sum\n\u003e\n\u003e ### Problem Statement\n\u003e $2^{15} = 32768$ and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of the digits of the number $2^{1000}$?\n\u003e\n\u003e ### Program Script\n\u003e **[Power Digits Sum](power_digit_sum.py)**\n\n\n\u003e ## Number Letter Counts\n\u003e\n\u003e ### Problem Statement\n\u003e If the numbers 1 to 5 are written out in words: one, two, three, four, five, the there are 3+3+5+4+4 = 19 letters used in total. \u003cbr\u003e\n\u003e If all the number from 1 to 1000 (one thousand) inclusive were written out in words, how many letters would be used?\n\u003e\n\u003e NOTE: Do not count spaces or hyphens. For example, 342 (three hundred and forty-two) countains 23 letters and 115 (one hundred and fifteen) contains 20 letters. The use of \"and\" when writing out numbers is in compliance with British usage.\n\u003e\n\u003e ### Program Script\n\u003e **[Number Letter Counts](number_letter_counts.py)**\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fashwin2583%2Fproject-euler","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fashwin2583%2Fproject-euler","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fashwin2583%2Fproject-euler/lists"}