def test_sequencetools_divide_sequence_elements_by_greatest_common_divisor_01():
r'''Divide sequence elements by greatest common divisor.
'''
result = sequencetools.divide_sequence_elements_by_greatest_common_divisor([2, 2, -4, -16])
assert result == [1, 1, -2, -8]
result = sequencetools.divide_sequence_elements_by_greatest_common_divisor([-1, -1, 4, 16])
assert result == [-1, -1, 4, 16]
result = sequencetools.divide_sequence_elements_by_greatest_common_divisor([2, 2, 4, 17])
assert result == [2, 2, 4, 17]
def __new__(cls, *args):
from abjad.tools import sequencetools
if len(args) == 1 and isinstance(args[0], (list, tuple)):
args = args[0]
assert args, repr(args)
assert all(x != 0 for x in args), repr(args)
args = sequencetools.divide_sequence_elements_by_greatest_common_divisor(args)
self = NonreducedRatio.__new__(cls, args)
return self
