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
188 Commits 19 Branches 0 Tags
412ce4fd50118e849dc2471c35a7d7b09ecc0d8a
Commit Graph
6 Commits
Author SHA1 Message Date
Marek Lemańczyk 412ce4fd50 % 10 operations replaces with UInt128/ulong.Mod10 methods 2025-09-21 07:42:25 +02:00
Marek Lemańczyk 1499f6abe1 Benchmarks extended. Small optimizations. 2025-09-21 06:15:14 +02:00
Marek Lemańczyk 72d66e293d Optimize simultaneous remainder calculation 2025-09-21 04:12:34 +02:00
Marek Lemańczyk 01277832e6 Implement UInt128 exponentiation and apply in Mersenne scan 2025-09-10 01:51:37 +02:00
Marek Lemańczyk 2be49020a9 Small primes array type changed to uint[] to avoid excessive memory use, especially on GPU 2025-09-09 23:58:09 +02:00
Marek Lemańczyk 9f35f6c558 Initial commit. 2025-09-09 21:15:57 +02:00
Powered by Gitea Version: 28.2.0 Page: 22ms Template: 5ms
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