New update is available. Click here to update.

Last Updated: 26 Oct, 2020

Difficulty: Easy

```
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'.
```

```
For each test case, print a single line containing a single integer denoting the total numbers of integers between 1 and 'N'(both inclusive) which are coprime to 'N', in a single line.
The output of each test case will be printed in a separate line.
```

```
You don't have to print anything. It has already been taken care of. Just implement the function.
```

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

SIMILAR PROBLEMS

Merge Two Sorted Arrays Without Extra Space

Posted: 19 Nov, 2022

Difficulty: Moderate

Ninja And The Strictly Increasing Array

Posted: 27 Nov, 2022

Difficulty: Moderate

Maximum GCD

Posted: 8 Dec, 2022

Difficulty: Hard

Prime?

Posted: 9 Dec, 2022

Difficulty: Easy

Co-Prime

Posted: 14 Dec, 2022

Difficulty: Hard

Popular Interview Problems: