Super Easy solution C# | Math | GCD | O(N)
\n# Complexity\n- Time complexity: O(N)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(n) \n\n
\n# Complexity\n- Time complexity: O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```csharp []\npublic class Solution {\n    public bool IsGoodArray(int[] nums) {\n        int num = nums[0];\n        for(int i = 1; i < nums.Length; i++)\n        {\n            num = GCD(nums[i], num);\n        }\n        if(num == 1)\n        {\n            return true;\n        }\n        return false;\n    }\n    public int GCD(int a, int b)\n    {\n        if(a % b == 0)\n        {\n            return b;\n        }\n        return GCD(b, a % b);\n    }\n}\n```\n![89f26eaf70fa927a79d4793441425859.jpg](https://assets.leetcode.com/users/images/63f77649-eecd-479a-bd52-4d954e8b6172_1733046866.4636714.jpeg)\n
['Array', 'Math', 'C#']