#P7985. Pty loves lcm
Pty loves lcm
Pty loves lcm
题目描述
Let denote the least common multiple and let Euler's totient be
For positive integers , define
Given , compute
$$\sum_{x=1}^{\infty}\sum_{y=x+1}^{\infty}\varphi(f(x,y))[L\le f(x,y)\le R]\pmod {2^{32}}.$$The brackets are the indicator of the enclosed condition. Each interval has at least two integers. Different intervals are counted separately even when their least common multiples coincide.
输入格式
The first line contains (). Each case contains ().
输出格式
For each case print the answer modulo as a nonnegative integer on one line.
样例输入1
5
1 10
1 20
20 60
60 100
123456 1234567
样例输出1
5
25
164
160
158548536