Table Of Contents

factor

Version:
    Last Modified: January 9, 2017

    Computes the prime factorization of a given number. A number is prime if and only if the number is a positive integer with exactly one positive divisor other than 1.

    Syntax

    c = factor(a)

    Inputs

    a

    Number you want to factor. a is a positive integer. a has an upper limit of 232-1.

    Outputs

    c

    Set of prime numbers whose product equals a. c is a row vector of primes. The factors in c might repeat. For example, factor(16) returns the vector [2, 2, 2, 2].

    C = factor(1000001)

    Where This Node Can Run:

    Desktop OS: Windows

    FPGA: Not supported


    Recently Viewed Topics