N-smooth numbers: Difference between revisions
m
→{{header|jq}}
m (→{{header|jq}}) |
|||
Line 1,930:
The output shown below is from a run of gojq, which has unbounded-precision arithmetic.
The C implementation of jq produces the same results for the first task (namely showing the first 125 n-smooth numbers for n <= 29), but not for the subsequent task.
<syntaxhighlight lang=jq>
def select_while(s; cond):
| |||