# Optimal Mersenne Primes Search Using Modular Groups (in Julia?)

**URL:** <https://discourse.julialang.org/t/optimal-mersenne-primes-search-using-modular-groups-in-julia/139960>\
**Category:** General Usage\
**Created:** [October 12, 2026, 3:19am UTC](https://discourse.julialang.org/t/optimal-mersenne-primes-search-using-modular-groups-in-julia/139960 "2026-10-12T03:19:32Z")\
**Posts on this page:** 1\
**Showing post:** 2

<div class="post-metadata">

**Author:** ![yolhan\_mannes](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/yolhan_mannes/32/220485_2.png) [@yolhan\_mannes](https://discourse.julialang.org/u/yolhan_mannes)\
**Post date:** [October 12, 2026, 5:09am UTC](https://discourse.julialang.org/t/optimal-mersenne-primes-search-using-modular-groups-in-julia/139960/2 "2026-10-12T05:09:23Z")

</div>

I don’t think we have a wrapper but consider looking around Nemo.jl maybe.  
Not sure related but this discussion was cool [Self-Initializing Quadratic Sieve in Julia - #26 by technocrat](https://discourse.julialang.org/t/self-initializing-quadratic-sieve-in-julia/139826/26)

---

_[View the full topic](https://discourse.julialang.org/t/optimal-mersenne-primes-search-using-modular-groups-in-julia/139960)._