Totatives of 3600

Find the number of positive integers \leq 3600 that are co prime to 3600


The answer is 960.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Melissa Quail
Jan 4, 2015

To compute the number of totatives of n, you can use the formula:

ϕ ( n ) = n p n ( 1 1 p ) \phi(n) = n \prod\limits_{p|n} (1-\frac{1}{p})

in which the product is over the distinct prime numbers dividing n.

The prime factorisation of 3600 is 2 4 × 3 2 × 5 2 2^{4} \times 3^{2} \times 5^{2} so the distinct primes dividing 3600 are 2, 3 and 5. Therefore:

ϕ ( 3600 ) = n p 3600 ( 1 1 p ) \phi(3600) = n \prod\limits_{p|3600} (1-\frac{1}{p}) = 3600 × ( 1 1 2 ) × ( 1 1 3 ) × ( 1 1 5 ) 3600 \times (1-\frac{1}{2}) \times (1-\frac{1}{3}) \times (1-\frac{1}{5})

= 960 \boxed{960}

Can't I subtract the total no. of divisors + 1 from 3600 to get the answer. I did so because the numbers other than divisors will be co- prime other than 1.

Ankit Kumar Jain - 6 years, 3 months ago

Log in to reply

@Ankit Kumar Jain , That is not true.

A number m will only be coprime to another number n when gcd ( m , n ) = 1 \gcd(m,n)=1

For example, Take the numbers 3500 and 3600.

3500 is not a factor of 3600, yet, Both these numbers are not coprime :)

Mehul Arora - 5 years, 11 months ago

Log in to reply

Ya actually I understood just then after I replied earlier. I now know Euler's Phi Function.

Ankit Kumar Jain - 5 years, 11 months ago

Log in to reply

@Ankit Kumar Jain Good to know :)

Mehul Arora - 5 years, 11 months ago
Devin Ky
Apr 10, 2015

3600 = 2^5 . 3^2 . 5^2. Thus, any number not greater than 3600 that is not coprime to it is divisible by at least one of 2, 3 or 5.

Using the addition rule for 3 set, where: Set A: numbers divisible by 2 and not greater than 3600, n(A) = 1800 Set B: numbers divisible by 3 and not greater than 3600, n (B) = 1200 Set C: numbers divisible by 5 and not greater than 3600, n(C) = 720

To use the addition rule, we first find A intersect B = multiples of 6 not greater than 3600, n(A intersect B) = 600 A intersect C = multiples of 10 not greater than 3600, n(A intersect C) = 360 B intersect C = multiples of 15 not greater than 3600, n(B intersect C) = 240 A intersect B intersect C = multiples of 30 not greater than 3600, n(A intersect B intersect C) = 120

Thus, numbers coprime to 3600 and not greater than 3600 = n(A U B U C) = n(A) + n(B) + n (C) - n (A intersect B) - n (A intersect C) - n(B intersect C) + n( A intersect B intersect C) = 1800 + 1200 + 720 - 600 - 360 - 240 + 120 = 2640

Hence, the answer we want is 3600 - 2640 = 960

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...