simple solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```java []\nclass Solution {\n    static int gcd(int n,int m){\n        if(m==0)\n            return n;\n        else\n            return gcd(m,n%m);\n    }\n    public boolean isGoodArray(int[] nums) {\n        int res=nums[0];\n        for(int i=1;i<nums.length;i++)\n            res=gcd(res,nums[i]);\n        return res==1;\n    }\n}\n```
['Array', 'Math', 'Number Theory', 'Java']