text: what is the euclidean algorithm? what is a "constructible" number? what can you tell me about diophantine equations? the eulidean algorithym is series of math equasions involved in the most indepth complext orginized problems, code like in a way usually only the inventor understands. a constructiible number is one that can always be added on to the series of other multipals, finding this one number can only be done by reducing the total number to the lowest terms and re adding it with one number until you reach the end but only by the means of using this one number.