Prime Number in Octave

Welcome to the Prime Number in Octave page! Here, you'll find the source code for this program as well as a description of how the program works.

Current Solution

function prime_number()
    usage = 'Usage: please input a non-negative integer';
    arg_list = argv();
    nargin = length(arg_list);
    if nargin == 0
        disp(usage);
        return;
    end

    n = str2num(arg_list{1});
    if length(n) ~= 1 || mod(n, 1) ~= 0 || n < 0
        disp(usage);
        return;
    end

    isprime = 0;
    if n == 2
        isprime = 1;
    elseif n < 2 || rem(n, 2) == 0
        isprime = 0;
    else
        isprime = 1;
        q = sqrt(n);
        m = 3;
        while m <= q
            if rem(n, m) == 0
                isprime = 0;
                break;
            end
            m = m + 2;
        end
    end

    if isprime == 1
        disp('prime');
    else
        disp('composite');
    end
end

Prime Number in Octave was written by:

• rzuckerm

If you see anything you'd like to change or update, please consider contributing.

How to Implement the Solution

No 'How to Implement the Solution' section available. Please consider contributing.

How to Run the Solution

No 'How to Run the Solution' section available. Please consider contributing.