greatest common divisor - How to change prime factorization back into original numbers? -


i need find gratest common divisor of prime factorization of 2 numbers (apfz) , b (bpfz). idea transform prime factorization original number , use euclidean algorithm find gcd. got euclidean, no idea how change factorization original numbers. has @ above while loop.

public static long gcd(long[][] apfz, long[][] bpfz) {          long = 0;          long = b;           while (a != b)         {             if (a > b) -= b;             else b -= a;         }         return a;     } 

can help?


Comments

Popular posts from this blog

sql server - Cannot query correctly (MSSQL - PHP - JSON) -

php - trouble displaying mysqli database results in correct order -

C++ Linked List -