Easy Java Solution 🔥 Beats 94 % of Java Users .
\n# gcd(A,B,C) = GCD( GCD(A,B) , C ) = GCD(A,GCD(B,C))\n\n## If gcd(a,b,c...d) = 1 , According to the Bezout lemma :\n ### Sum( a , b , c , ...  , d ) = 1 \n###
\n# gcd(A,B,C) = GCD( GCD(A,B) , C ) = GCD(A,GCD(B,C))\n\n## If gcd(a,b,c...d) = 1 , According to the Bezout lemma :\n ### Sum( a , b , c , ...  , d ) = 1 \n### That\'s The Response . \n\n\n# Code\n```java []\nclass Solution {\n    public int pgcd( int a , int b ){\n            while( b!=0 ){\n                int temp = a ; \n                a = b ; \n                b = temp%b ; \n            }\n            return a ; \n    }\n    public boolean isGoodArray(int[] nums) {\n        int n = nums.length ; \n        if( n==1){\n            return nums[0] == 1  ;  \n        }\n        int curr = pgcd( nums[0] , nums[1] ) ; \n        if( curr == 1 ) return true ; \n        for(int i=2 ; i<n ; ++i){\n            curr = pgcd( nums[i] , curr  ) ; \n            if( curr == 1 ) return true ;\n        }\n        return false ; \n    }\n}\n```
['Array', 'Math', 'Number Theory', 'Java']