look i may be wrong too par mera logic kya tha toh for phi(n)/n to be min phi(n) min and n max ( but it should be a small number as well so we kno phi(prime) = prime-1. Now find two small enough prime numbers whose euler should be small.. 2,3 i.e E(6)=2 E(10)=4 E(14)=6 E(22)=11 E(26)=12. if you observe min value E(10)/10 hi dega.. as the prime number increases its Euler increases. like for E(35)=24 E(77)=60 so dono E(n) and n should be small enough so that the difference between the two has an effect on minimizing the value.
There are 5 red, 2 green and 2 blue flags. Make a signal of 5 flags using them noting that repeating a colour is allowed.What will be the total number of possible flags if different arrangements are different signals? OPTIONS
There are 5 red, 2 green and 2 blue flags. Make a signal of 5 flags using them noting that repeating a colour is allowed.What will be the total number of possible flags if different arrangements are different signals?OPTIONS1) 141 2) 121 3) 127 4) 240 pls explain me..i dont understand dis solution
when all the 5 are red you have 5!/5!=1 arranement when 4 are red and remaining one is either green or blue you have 5!/4!*2=10 when 3 are red 2 are same (either green or blue) = (5!/3!*2!)*2!=20 when 3 are red and 2 are different 5!/3!=20 when 2 are red other 2 of one kind and 1 of the remaining kind (5!/2!*2!)*2=60 when 1 red and 2 each of the remaining kind 5!/2!*2!=30
look i may be wrong too par mera logic kya tha toh for phi(n)/n to be min phi(n) min and n max ( but it should be a small number as well so we kno phi(prime) = prime-1. Now find two small enough prime numbers whose euler should be small.. 2,3 i.e E(6)=2 E(10)=4 E(14)=6 E(22)=11 E(26)=12. if you observe min value E(10)/10 hi dega.. as the prime number increases its Euler increases. like for E(35)=24 E(77)=60 so dono E(n) and n should be small enough so that the difference between the two has an effect on minimizing the value.Hope samajh aaya
let n = 9. Then gcd(9, 3) = gcd(9, 6) = 3 and gcd(9, 9) = 9. The other six numbers in the range 1 ≤ k ≤ 9, that is, 1, 2, 4, 5, 7 and 8, are relatively prime to 9. Therefore, φ(9) = 6. As another example, φ(1) = 1 since gcd(1, 1) = 1. http://en.wikipedia.org/wiki/Euler%27s_totient_function
look i may be wrong too par mera logic kya tha toh for phi(n)/n to be min phi(n) min and n max ( but it should be a small number as well so we kno phi(prime) = prime-1. Now find two small enough prime numbers whose euler should be small.. 2,3 i.e E(6)=2 E(10)=4 E(14)=6 E(22)=11 E(26)=12. if you observe min value E(10)/10 hi dega.. as the prime number increases its Euler increases. like for E(35)=24 E(77)=60 so dono E(n) and n should be small enough so that the difference between the two has an effect on minimizing the value.Hope samajh aaya
its 210
E(n) = n*(1 - 1/a)*(1 - 1/b)........
"a" and "b" are prime factors of "n"
we will get minimum of E(n) when we would have n = a*b*c......
i mean we should not have any extra power of any prime factor