Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Stack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Explore Stack Internal
r=i=1:2e3 for(a in r)for(b in a+r)i[(b+r)*(a+b)+a*b]=F;which(!!i)+a*b]=F;r[i[r]] Outputs all idoneal numbers in ascending order.
The TIO link will time-out, since r is needlessly set to 1...2000 to save bytes; herehere is a link to a version with r initialized to 1...99 instead, which doesn't time-out (and still gives the right output).
r=i=1:2e3 for(a in r)for(b in a+r)i[(b+r)*(a+b)+a*b]=F;which(!!i) Outputs all idoneal numbers in ascending order.
The TIO link will time-out, since r is needlessly set to 1...2000 to save bytes; here is a link to a version with r initialized to 1...99 instead, which doesn't time-out (and still gives the right output).
r=i=1:2e3 for(a in r)for(b in a+r)i[(b+r)*(a+b)+a*b]=F;r[i[r]] Outputs all idoneal numbers in ascending order.
The TIO link will time-out, since r is needlessly set to 1...2000 to save bytes; here is a link to a version with r initialized to 1...99 instead, which doesn't time-out (and still gives the right output).
r=i=1:2e3 f=`for` ffor(a, in r,f)for(b, in a+r,f)i[(c,b+r,(i[a*b+b*c+c*a]=F)))*(a+b);which+a*b]=F;which(!!i) Try it online! (but times-out: see below)Try it online!
Outputs all idoneal numbers in ascending order.
The TIO link will time-out, since r is needlessly set to 1...2000 to save bytes; herehere is a link to a version with r initialized to 1...99 instead, which doesn't time-out (and still gives the right output).
r=i=1:2e3 f=`for` f(a,r,f(b,a+r,f(c,b+r,(i[a*b+b*c+c*a]=F))));which(!!i) Try it online! (but times-out: see below)
Outputs all idoneal numbers in ascending order.
The TIO link will time-out, since r is needlessly set to 1...2000 to save bytes; here is a link to a version with r initialized to 1...99 instead, which doesn't time-out (and still gives the right output).
r=i=1:2e3 for(a in r)for(b in a+r)i[(b+r)*(a+b)+a*b]=F;which(!!i) Outputs all idoneal numbers in ascending order.
The TIO link will time-out, since r is needlessly set to 1...2000 to save bytes; here is a link to a version with r initialized to 1...99 instead, which doesn't time-out (and still gives the right output).
r=i=1:2e3 f=`for` f(a,r,f(b,a+r,f(c,b+r,(i[a*b+b*c+c*a]=F))));which(!!i) Try it online! (but times-out: see below)
Outputs all idoneal numbers in ascending order.
The TIO link will time-out, since r is needlessly set to 1...2000 to save bytes; here is a link to a version with r initialized to 1...99 instead, which doesn't time-out (and still gives the right output).