Please start teaching FULL STACK DEVELOPMENT COURSE. I am learning now 😌. if you start it now , it will be helpful for many students who are preparing for placements.
Is there no shorter way to do it. What if I have a number 150? Will i make a table for all the numbers below it and find their GCD,?? There must be another way as well to calculate euler function for larger numbers
Assume the number to be N, now represent it's prime factorization N = a^x * b^y * c^z...... Phi(N) = N(1-1/a)(1-1/b)(1-1/c)....... this will give you a count of no. prime to N but are less than N. If N is prime Phi(N) = N-1
take an example of 7, Phi(N) = 6 1 and 7 are co prime, 2 and 7, 3 and 7, 4 and 7, 5 and 7, 6 and 7 Thus, total 6 numbers are co-prime to 7, means their HCF is 1 So, instead of doing this individually for bigger numbers, you can use the formulas I gave@@Lost-for-you
Thanks a lot sir... But there is a humble request that when you are teaching a topic ... don't suggest a part it in other video.... Eg. GCD you better should explain it atleast once ....
i love you, you have the best tutotials in this platform THANK YOUUUUUUUU!!!!!!!
thank you very much, i just researched 2 day long for understand totient function
and now you speak so well. Thank you sir!
Crystal clear.Thank so very much.....❤
It is really helpful for last moment😆
Very good explanation 🎉😊 tqq soo much
How would you find phi(1)?
since there are no integers less than 1 and one is not prime or composite?
Very nice Explanation
ThAnk you sir for amazing video . Concept crystal clear kar diye hain aapne.
this is really amazing! thanks a lot!
nice explanation sir
You are the best.
Gracias!
Thnx for this helpful video
Please start teaching FULL STACK DEVELOPMENT COURSE. I am learning now 😌. if you start it now , it will be helpful for many students who are preparing for placements.
In which mode you're learning? Online or Offline?
Thanks
Please Start Teaching Aptitude. 🙏
Tnk ku so much sir ❤️
Thnks❤❤❤
Thank You for this video
Yes right now
Sir kindly confirm me wheather 4 is a prime number or not?
How to find fi(100)
thank you :)
Is there no shorter way to do it. What if I have a number 150? Will i make a table for all the numbers below it and find their GCD,?? There must be another way as well to calculate euler function for larger numbers
Assume the number to be N, now represent it's prime factorization
N = a^x * b^y * c^z......
Phi(N) = N(1-1/a)(1-1/b)(1-1/c).......
this will give you a count of no. prime to N but are less than N.
If N is prime
Phi(N) = N-1
@@TheAnonidcan you give me in a example representation 😅
take an example of 7, Phi(N) = 6
1 and 7 are co prime, 2 and 7, 3 and 7, 4 and 7, 5 and 7, 6 and 7
Thus, total 6 numbers are co-prime to 7, means their HCF is 1
So, instead of doing this individually for bigger numbers, you can use the formulas I gave@@Lost-for-you
sir why are you do not include 0 in numbers less than 11
this doesn't actually cover the function, just what it represents...
What if the number is big like 240
Adakah cara cepat untuk mencari phi function (n) ?
Phi 1 should be 0 then??
Thanks a lot sir...
But there is a humble request that when you are teaching a topic ... don't suggest a part it in other video.... Eg. GCD you better should explain it atleast once ....
how will you find eular of 81
81 = 3^4
(There is a formula)
Totient(p^n) = (p^n) -(p^(n-1))
Totient(3^4) = (3^4) -(3^(4-1))
Totient(3^4) = (3^4) -(3^(3))
Totient(3^4) = (81) -(27)
Totient(3^4) = (81) -(27) = 54
Totient(3^4) = 54
Dr arora
What is phi of 25?
20
💙💙💙
THATS NOT OILER ITS JUST EULER
It's pronounced that way only
👍👍
🙏👍👍
Bullshit