mirror of
https://github.com/urbit/developers.urbit.org.git
synced 2024-09-11 13:55:59 +03:00
Update competitive.md
This commit is contained in:
parent
0dc52a8296
commit
85a897c693
@ -217,7 +217,7 @@ Now that we can find factors, it should be straightforward to find primes. In t
|
||||
=/ fxr *(list @ud)
|
||||
|- ^- (list @ud)
|
||||
?: =(1 ctr) fxr
|
||||
?: =(0 +:(dvr n ctr))
|
||||
?: =(0 (mod n ctr))
|
||||
$(ctr (sub ctr 1), fxr [ctr fxr])
|
||||
$(ctr (sub ctr 1))
|
||||
++ primes
|
||||
|
Loading…
Reference in New Issue
Block a user