Want to solve this problem? Login now to get access to solve the problems

Problem

Submissions

Solution

Leaderboard

Coming soon

0

Difficulty: EASY

Avg. time to solve

15 min

Success Rate

90%

Problem Statement

Suggest Edit

```
Two numbers are coprime if their greatest common divisor(GCD) is 1.
Here, 1 is considered to be coprime to any number.
```

```
If the given integer is 9, then the answer would be 6 Because there are six numbers between 1 and 9 both inclusive which are coprime to 9 i.e 1, 2, 4, 5, 7, and 8.
```

```
The first line of input contains an integer 'T' representing the number of test cases or queries to be processed.
Then the test case follows.
The only line of each test case contains an integer N.
```

```
1 <= T <= 100
1 <= N <= 10^9
Time Limit: 1 sec
```

```
For each test case, print a single integer denoting the total numbers of integers between 1 and N(both inclusive) which are coprime to N, in a single line.
```

```
2
1
4
```

```
1
2
```

```
For the first test case, there is only one number which is coprime to 1 i.e 1 itself.
For the second test case, there are only two numbers between 1 and 4(both inclusive) which are coprime to 4 i.e 1 and 3.
```

```
2
12
21
```

```
4
12
```

```
For the first test case, there are four numbers between 1 and 12(both inclusive) which are coprime to 12 i.e 1, 5, 7,11.
```

Want to solve this problem? Login now to get access to solve the problems