The set of numbers M={4k−3∣k∈N} is considered. A number of of this set is called “simple” if it is impossible to put in the form of a product of numbers from M other than 1. Show that in this set, the decomposition of numbers in the product of "simple" factors is ambiguous. number theoryProductfactorizationfactors