Sequence: nth number with exactly n divisors: Difference between revisions

Content added Content deleted
No edit summary
Line 451:
k = 0
for j in 1:100000000000
if isodd(iseven(i) &&|| Int(floor(sqrt(j)))^2 !== j) &&
continuei == countdivisors(j) && (k += 1) == i
elseif i == countdivisors(j) && (k += 1) == i
println("$i : $j")
break
Line 501 ⟶ 500:
35 : 446265625
</pre>
 
 
=={{header|Kotlin}}==
Retrieved from "https://rosettacode.org/wiki/Sequence:_nth_number_with_exactly_n_divisors"