FiSGO.OrderSearch.prime_bound_compatiblity

prime_bound_compatiblity(order, bound)

Given the partial factorization of a number and a bound to the factorized part, the function checks if the given factorization satisfies the bound.

A partial factorization refers to a number given in the format of PrimesHandler.prime_scanner.

Caution

the length of order[0] is expected to be the same as bound, we are checking one factorization against the other

Example:

>>> prime_bound_compatiblity(([1,2],1), [3,3])
True

>>> prime_bound_compatiblity(([1,2],7), [3,3])
False

>>> prime_bound_compatiblity(([2,6],1), [3,3])
False

Parameters:

• order (tuple[list[int], int]) – Tuple with a list of integers and an integer.

• bound (list[int]) – List of integers.

Return type:

bool

Returns:

True if order is bounded by bound, False otherwise.