C# easy
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: O(nlogn)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```csharp []\npublic class Solution {\n    public bool IsPrimeNumber(int n)\n    {\n        if(n < 2) return false;\n        for(int i = 2; i * i <= n; i++)\n        {\n            if(n%i == 0) return false;\n        }\n        return true;\n    }\n    public IList<IList<int>> FindPrimePairs(int n) {\n        IList<IList<int>> result = new List<IList<int>>();\n        List<int> list = new List<int>();\n        bool[] IsPrime = new bool[n];\n        for(int i = 2; i < n; i++)\n        {\n            IsPrime[i] = true;\n        }\n        for(int i = 2; i * i < n; i++)\n        {\n            if(IsPrime[i])\n            {\n                for(int j = i*i; j < n; j+=i)\n                {\n                    IsPrime[j] = false;\n                }\n            }\n        }\n        for(int i = 2; i < IsPrime.Length; i++)\n        {\n            if(IsPrime[i])\n            {\n                if(IsPrimeNumber(n - i))\n                {\n                    result.Add(new List<int> {i, n - i});\n                    IsPrime[n - i] = false;\n                }\n            }\n        }\n        return result;\n    }\n}\n```
['C#']