# Improving performance in checking prime numbers

**URL:** https://discourse.julialang.org/t/improving-performance-in-checking-prime-numbers/56365
**Category:** General Usage
**Created:** [March 2, 2021, 8:56pm UTC](https://discourse.julialang.org/t/improving-performance-in-checking-prime-numbers/56365 "2021-03-02T20:56:01Z")
**Posts on this page:** 1
**Showing post:** 11

<div class="post-metadata">

### Author: ![Oscar\_Smith](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/oscar_smith/32/25343_2.png) [@Oscar\_Smith](https://discourse.julialang.org/u/Oscar_Smith)
#### Post date: [March 2, 2021, 10:10pm UTC](https://discourse.julialang.org/t/improving-performance-in-checking-prime-numbers/56365/11 "2021-03-02T22:10:59Z")

</div>

For problems like factoring primes, it’s probably worth pursuing algorithmic improvements before micro-optimizations. The best system will probably be some combination of trial division by small factors in tandem with a probabilistic prime test

---

_[View the full topic](https://discourse.julialang.org/t/improving-performance-in-checking-prime-numbers/56365)._