IntegerMath.Factor Method

public static IEnumerable<(int , int )> Factor(
	int n
)

Public Shared Function Factor ( 
	n As Integer
) As IEnumerable(Of ( As Integer,  As Integer))

public:
static IEnumerable<ValueTuple<int, int>>^ Factor(
	int n
)

static member Factor : 
        n : int -> IEnumerable<ValueTuple<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.

public static IEnumerable<(long , int )> Factor(
	long n
)

Public Shared Function Factor ( 
	n As Long
) As IEnumerable(Of ( As Long,  As Integer))

public:
static IEnumerable<ValueTuple<long long, int>>^ Factor(
	long long n
)

static member Factor : 
        n : int64 -> IEnumerable<ValueTuple<int64, int>> 

Parameters

n  Int64

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.

Reference