Logo
Explore Help
Sign In
mlemanczyk/even-perfect-numbers-scanner
Watch 1
Star 0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
250 Commits 19 Branches 0 Tags
615ae29fd61bda91c070bb98cc4e760ec5186976
Commit Graph
7 Commits
Author SHA1 Message Date
Marek Lemańczyk 6e99ee39e3 Extension methods benchmarked. Slower alternatives replaced. 2025-09-23 22:01:09 +02:00
Marek Lemańczyk 7d112c347f Accelerate Mersenne modular multiplication paths 2025-09-22 23:24:19 +02:00
Marek Lemańczyk 762d205e86 Reuse local variables across modulo helpers 2025-09-22 19:54:59 +02:00
Marek Lemańczyk 3b8a10a20b Inline single-use modulo helpers 2025-09-22 19:54:54 +02:00
Marek Lemańczyk ca866ffc5b Reapply modulo helpers and inline fast remainders 2025-09-22 19:26:07 +02:00
Marek Lemańczyk ace3fcbf34 Rescope loop variables for divisor workflows 2025-09-22 15:11:44 +02:00
Marek Lemańczyk 95a0b030f6 Add optimized modulo helpers for unsigned integers 2025-09-21 10:14:26 +02:00
Powered by Gitea Version: 28.2.0 Page: 73ms Template: 16ms
Auto
English
Bahasa Indonesia Deutsch English Español Français Gaeilge Italiano Latviešu Magyar nyelv Nederlands Polski Português de Portugal Português do Brasil Suomi Svenska Türkçe Čeština Ελληνικά Български Русский Українська فارسی മലയാളം 日本語 简体中文 繁體中文(台灣) 繁體中文(香港) 한국어
Licenses API