RosettaCodeData/Task/Ascending-primes/MATLAB/ascending-primes.m
2023-07-01 13:44:08 -04:00

14 lines
210 B
Matlab

queue = 1:9;
j = 1;
while j < length(queue)
n = queue(j);
j = j + 1;
a = n * 10 + mod(n, 10) + 1;
b = n * 10 + 9;
if a <= b
queue = [queue, a:b];
end
end
queue(isprime(queue))