CoCoA:GCDFreeBasis

GCDFreeBasis

determine (minimal) GCD free basis of a set of integers

Description

This function returns a GCD free basis of a set of integers; you can

think of this as the set of all numbers (except 1) obtainable by performing GCD

and exact division operations.

Given a set <formula>N = [ N_1,...N_k ]</formula> we seek a basis <formula>G = [ G_1,...,G_s ]</formula> such that

each <formula>N_i</formula> is a product of powers of the <formula>G_j</formula>, and the <formula>G_j</formula> are pairwise

coprime; the set <formula>G</formula> is called a GCD free basis for <formula>N</formula>. In general the set <formula>G</formula> is not uniquely defined.

Example

  GCDFreeBasis([Fact(20),Fact(10)]);
[46189, 4, 14175]
-------------------------------

Syntax

GCDFreeBasis(L:LIST of INT):LIST of INT

GCD

   <type>integer</type>