IntegerMath.Factorize Method

[ObsoleteAttribute("Use the factor method instead.")]
public static int[] Factorize(
	int n
)

<ObsoleteAttribute("Use the factor method instead.")>
Public Shared Function Factorize ( 
	n As Integer
) As Integer()

public:
[ObsoleteAttribute(L"Use the factor method instead.")]
static array<int>^ Factorize(
	int n
)

[<ObsoleteAttribute("Use the factor method instead.")>]
static member Factorize : 
        n : int -> int[] 

Parameters

n  Int32

An integer greater than zero.

Return Value

This method uses a simple trial divide algorithm to look for small prime factors. It then switches to Pollard's Rho algorithm to find any large prime factors of n with the known factors divided out. If this number is prime, the algorithm may take a long term to finish.

[ObsoleteAttribute("Use the factor method instead.")]
public static long[] Factorize(
	long n
)

<ObsoleteAttribute("Use the factor method instead.")>
Public Shared Function Factorize ( 
	n As Long
) As Long()

public:
[ObsoleteAttribute(L"Use the factor method instead.")]
static array<long long>^ Factorize(
	long long n
)

[<ObsoleteAttribute("Use the factor method instead.")>]
static member Factorize : 
        n : int64 -> int64[] 

Parameters

n  Int64

A 64-bit integer greater than zero.

Return Value

This method uses a simple trial divide algorithm to look for small prime factors. It then switches to Pollard's Rho algorithm to find any large prime factors of n with the known factors divided out. If this number is prime, the algorithm may take a long term to finish.

This method breaks down when the Rho algorithm is invoked for values larger than 2⁴⁸. No further decomposition is attempted. Instead, this number is returned as the last factor.

Reference