Orig Description
Euler's Phi Function
For given integer n, count the totatives of n, that is, the positive integers less than or equal to n that are relatively prime to n.
Input
n
An integer n (1 ≤ n ≤ 1000000000).
Output
The number of totatives in a line.
Sample Input 1
6
Sample Output 1
2
Sample Input 2
1000000
Sample Output 2
400000
Extracted Specification
An integer X (1 ≤ X ≤ 10^9), representing some quantity or size.
### Example Input:
```
6
```
### Function Signature:
Write a function f(X) that takes in the input.
def f(X: int):
'''
X: an integer
'''
Test Case Generator
Sure! To generate test cases for the given problem regarding Euler's Phi Function, we need to come up with a variety of values for \( n \) within the specified range. Here's a test case generator for this problem:
```python
import random
def tcgen():
n = random.randint(1, 1000000000)
return n
# Example usage:
for _ in range(5): # Generate 5 test cases
print(tcgen())
```
This generator will produce random values for \( n \) within the range from 1 to 1,000,000,000, which should be suitable for testing the problem's constraints. Each call to `tcgen()` will yield a new random integer \( n \) to use as a test case. You can generate as many test cases as needed by calling the function multiple times.
Extract Arguments
def extract_arguments(fh):
n = int(fh.readline().strip())
return (n,)