  Showing: Handle Score
@Ibrahim Nash 6560
@mb1973 5777
@Quandray 5271
@akhayrutdinov 5111
@saiujwal13083 5074
@kirtidee18 4356
@sanjay05 3762
@mantu_singh 3638
@gfgaccount 3601
@marius_valentin_dragoi 3525
Pairs of prime number
Basic Accuracy: 51.67% Submissions: 926 Points: 1

Find all pairs (sets) of prime numbers (p,q) such that p*q <= n, where n is given number.

Example 1:

Input: n = 4
Output: 2 2
Explanation: Pair (2, 2) which has both prime
numbers as well as satisfying the condition
2*2 <= 4.


Example 2:

Input: n = 8
Output: 2 2 2 3 3 2
Explanation: Pairs(2, 2), (2, 3) and (3, 2)
which has both prime numbers and satisfying
the given condition.


You don't need to read or print anything. Your task is to complete the function prime_pairs() which takes n as input parameter and returns a list of pairs in ascending order.

Expected Time Complexity: O(n2* sqrt(n))
Expected Space Complexity: O(1)

Constraints:
1 <= n <= 400

### Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

#### My Submissions:  