urbit/developers.urbit.org
1
1
Fork 0
mirror of https://github.com/urbit/developers.urbit.org.git synced 2024-09-11 13:55:59 +03:00
Code Issues Packages Projects Releases Wiki Activity

Update competitive.md

Browse Source
This commit is contained in:
Sigilante 2022-12-01 15:05:31 -06:00 committed by GitHub
parent 0dc52a8296
commit 85a897c693
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
content/guides/additional/workbook/competitive.md
View File

@ -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