Prime Function without Conditionals or Iteration

I have to construct a code that inputs a positive integer N and outputs a vector of the prime numbers up to that positive integer N. I know you have to eliminate the multiples of 2, then then the multiples of 3, and so on until you get to floor(sqrt(N)). However, I'm having trouble in translating this into code. The following functions are banned:

      primes(), isPrime(), ismember(), setdiff(), factor()

function [out] = sieve(N)

limit =  floor(sqrt(N));

vec = 1:limit

mask =

I'm stuck trying to make a mask for the vector.

Answer 1

[Walter Roberson]

You can use ndgrid to construct matrices of values, and mod() to test whether one value divides another. The results that are 0 are the places where one value divides another. But watch out for the fact that a value divides itself.

Answer 2

[KSSV]

clc; clear all ;
N = 10 ;
p = primes(N) ;
c = 0 ;
for n = 2:N
    m = 2; % initialise factor to test
    t=floor(sqrt(n));count=0;
    for m = 2:t
        if mod(n,m) == 0 %m is a factor of n
            fprintf('%d is not prime \n',n)
            primalitytest=0;
        else
            count=count+1;
        end
    end;
    if count==t-1
        fprintf(' %d is prime\n',n);
        primalitytest=1;
        c = c+1 ;
        iwant(c) = n ;
    end
end

See the link: https://in.mathworks.com/matlabcentral/newsreader/view_thread/301672

[Eduardo Alfaro]

I'm not allowed to use any iteration or conditionals.