Rare numbers: Difference between revisions

Line 3,896:
It could look something like the following (ignoring whatever optimizations the other examples are using), if it was fast enough. I did not have the time/processor to test finding the first 5. The .israre() function appears to return the right answer, tested with individual numbers.
 
<syntaxhighlight lang="langur">val .perfectsquare = f isIntegerfn(.n) (.n ^/ 2) div 1
 
val .israre = ffn(.n) {
val .r = reverse(.n)
if .n == .r: return false
Line 3,906:
}
 
val .findfirst = ffn(.max) {
for[=[]] .i = 0; len(_for) < .max; .i += 1 {
if .israre(.i) {
885

edits