{"id":21407299,"url":"https://github.com/mkst/euler","last_synced_at":"2026-01-03T22:04:55.557Z","repository":{"id":114862561,"uuid":"101320955","full_name":"mkst/euler","owner":"mkst","description":"My attempts to solve the Project Euler problems","archived":false,"fork":false,"pushed_at":"2019-08-18T14:13:00.000Z","size":63,"stargazers_count":5,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-01-23T04:13:17.582Z","etag":null,"topics":["euler-solutions","kdb"],"latest_commit_sha":null,"homepage":null,"language":"q","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/mkst.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":"2017-08-24T17:29:45.000Z","updated_at":"2024-05-24T08:03:40.000Z","dependencies_parsed_at":null,"dependency_job_id":"b3403120-3cad-40eb-8042-d3a6a9cd3c14","html_url":"https://github.com/mkst/euler","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mkst%2Feuler","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mkst%2Feuler/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mkst%2Feuler/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mkst%2Feuler/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mkst","download_url":"https://codeload.github.com/mkst/euler/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243902321,"owners_count":20366262,"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-solutions","kdb"],"created_at":"2024-11-22T16:46:01.963Z","updated_at":"2026-01-03T22:04:55.478Z","avatar_url":"https://github.com/mkst.png","language":"q","funding_links":[],"categories":[],"sub_categories":[],"readme":"# euler\n\nMy attempt to solve the Project Euler problems using Q/kdb+.\n\n - [x] 00001 [Multiples of 3 and 5](q/00001.q)\n - [x] 00002 [Even Fibonacci numbers](q/00002.q)\n - [x] 00003 [Largest prime factor](q/00003.q)\n - [x] 00004 [Largest palindrome product](q/00004.q)\n - [x] 00005 [Smallest multiple](q/00005.q)\n - [x] 00006 [Sum square difference](q/00006.q)\n - [x] 00007 [10001st prime](q/00007.q)\n - [x] 00008 [Largest product in a series](q/00008.q)\n - [x] 00009 [Special Pythagorean triplet](q/00009.q)\n - [x] 00010 [Summation of primes](q/00010.q)\n - [x] 00011 [Largest product in a grid](q/00011.q)\n - [x] 00012 [Highly divisible triangular number](q/00012.q)\n - [x] 00013 [Large sum](q/00013.q)\n - [x] 00014 [Longest Collatz sequence](q/00014.q)\n - [x] 00015 [Lattice paths](q/00015.q)\n - [x] 00016 [Power digit sum](q/00016.q)\n - [x] 00017 [Number letter counts](q/00017.q)\n - [x] 00018 [Maximum path sum I](q/00018.q)\n - [x] 00019 [Counting Sundays](q/00019.q)\n - [x] 00020 [Factorial digit sum](q/00020.q)\n - [x] 00021 [Amicable numbers](q/00021.q)\n - [x] 00022 [Names scores](q/00022.q)\n - [x] 00023 [Non-abundant sums](q/00023.q)\n - [x] 00024 [Lexicographic permutations](q/00024.q)\n - [x] 00025 [1000-digit Fibonacci number](q/00025.q)\n - [x] 00026 [Reciprocal cycles](q/00026.q)\n - [X] 00027 [Quadratic primes](q/00027.q)\n - [x] 00028 [Number spiral diagonals](q/00028.q)\n - [x] 00029 [Distinct powers](q/00029.q)\n - [x] 00030 [Digit fifth powers](q/00030.q)\n - [x] 00031 [Coin sums](q/00031.q)\n - [x] 00032 [Pandigital products](q/00032.q)\n - [x] 00033 [Digit cancelling fractions](q/00033.q)\n - [x] 00034 [Digit factorials](q/00034.q)\n - [x] 00035 [Circular primes](q/00035.q)\n - [x] 00036 [Double-base palindromes](q/00036.q)\n - [x] 00037 [Truncatable primes](q/00037.q)\n - [x] 00038 [Pandigital multiples](q/00038.q)\n - [x] 00039 [Integer right triangles](q/00039.q)\n - [x] 00040 [Champernowne's constant](q/00040.q)\n - [x] 00041 [Pandigital prime](q/00041.q)\n - [x] 00042 [Coded triangle numbers](q/00042.q)\n - [x] 00043 [Sub-string divisibility](q/00043.q)\n - ... lots of gaps from here on in\n - [x] 00045 [Triangular, pentagonal, and hexagonal](q/00045.q)\n - [x] 00048 [Self powers](q/00048.q)\n - [x] 00049 [Prime permutations](q/00049.q)\n - [x] 00050 [Consecutive prime sum](q/00050.q)\n - [x] 00052 [Permuted multiples](q/00052.q)\n - [x] 00055 [Lychrel numbers](q/00055.q)\n - [x] 00056 [Powerful digit sum](q/00056.q)\n - [x] 00059 [XOR decryption](q/00059.q)\n - [x] 00062 [Cubic permutations](q/00062.q)\n - [x] 00092 [Square digit chains](q/00092.q)\n - [x] 00145 [How many reversible numbers are there below one-billion?](q/00145.q)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmkst%2Feuler","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmkst%2Feuler","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmkst%2Feuler/lists"}