Canadian Computing Competition: 2019 Stage 1, Senior #2
For various given positive integers , find two primes, and such that is the average (mean) of and . That is, should be equal to .
Recall that a prime number is an integer which is only divisible by and . For example, , , , , are the first few primes, and , , , are not prime numbers.
The first line of input is the number , which is the number of test cases. Each of the next lines contain one integer .
For 6 of the available 15 marks, all .
The output will consist of lines. The line of output will contain two integers, and , separated by one space. It should be the case that and that and are prime numbers.
If there are more than one possible and for a particular , output any such pair. The order of the pair and does not matter.
It will be the case that there will always be at least one set of values and for any given .
4 8 4 7 21
3 13 5 3 7 7 13 29
Explanation of Possible Output for Sample Input
It is interesting to note, that we can also write
and so any of these pairs could have also been used in output. There is no pairs of primes other than and which average to the value of .
You may have heard about Goldbach's conjecture, which states that every even integer greater than 2 can be expressed as the sum of two prime numbers. There is no known proof, yet, so if you want to be famous, prove that conjecture (after you finish the CCC).
This problem can be used to help verify that conjecture, since every even integer can be written as , and your task is to find two primes and such that .