A9464. On Sum of Fractions
编程题
普及/提高-
知识点
题目描述
Let's assume that
- $v(n)$ is the largest prime number, that does not exceed $n$ ;
- $u(n)$ is the smallest prime number strictly greater than $n$ .
Find .
- $v(n)$ is the largest prime number, that does not exceed $n$ ;
- $u(n)$ is the smallest prime number strictly greater than $n$ .
Find .
输入格式
The first line contains integer $t (1<=t<=500)$ — the number of testscases.
Each of the following $t$ lines of the input contains integer $n$ ( $2<=n<=10^{9}$ ).
Each of the following $t$ lines of the input contains integer $n$ ( $2<=n<=10^{9}$ ).
输出格式
Print $t$ lines: the $i$ -th of them must contain the answer to the $i$ -th test as an irreducible fraction " $p$ / $q$ ", where $p,q$ are integers, $q>0$ .
输入输出样例
输入 #1
2 2 3
输出 #1
1/6 7/30