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

Eliminate ++lent call.

Browse Source
This commit is contained in:
Sigilante 2022-12-01 14:38:13 -06:00 committed by GitHub
parent fcb8137238
commit 0dc52a8296
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

@ -226,7 +226,7 @@ Now that we can find factors, it should be straightforward to find primes. In t
=/ prm *(list @ud)
|- ^- (list @ud)
?: =(1 ctr) prm
?: =(0 (lent (factors ctr)))
?: =(~ (factors ctr))
$(ctr (sub ctr 1), prm [ctr prm])
$(ctr (sub ctr 1))
--