Simple Solution Using Mathematics
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```\nclass Solution {\npublic:\n    bool isprime(int n)\n    {\n        int y = sqrt(n);\n        int i=2;\n        while(i<=y)\n        {\n            if(n%i==0)return false;\n            i++;\n        }\n        return true;\n    }\n    vector<vector<int>> findPrimePairs(int n) {\n        vector<vector<int>> ans;\n        if(n<=2)\n        return ans;\n\n        for(int i=2;i<=n/2;i++)\n        {\n            if(isprime(i) && isprime(n-i))\n            ans.push_back({i,n-i});\n        }\n        return ans;\n    }\n};\n```
['C++']