A9464 | $On Sum of Fractions$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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 ![](/uploads/acgo/image/629c6e90d7a7e932_c72116a26c06.jpeg).

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}$ ).

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

C++ 编辑器

输入

输出