This does not hold true because the GCD (11,33) does not equal 1 but equals 11. To prove this, we first find the Phi value of 33, but the distinct prime numbers of 33 are 3 and 11, hence to find the Phi value, (3 - 1) * (11 - 1) = 20. Therefore, 11^20 Congruence 1 mod 33. This becomes 22 congruence 1 mod 33, and since 22 does not equal 1, this proves that Euler's theorem does not hold true here.
11 is not relatively prime to 33 since the GCD = 11, not 1. a = 11, n = 33. We need Phi(n) or Phi(33). The two primes composing 33 = 3, 11. 3-1=2, 11-1=10, 2*10 = 20 = Phi(33). 11^20 ≡ 1 (mod 33) is false. 11^20 = a 21 digit number ending in 1, but subtracting 1 and dividing by 33 doesn't give 0, so it is false.
You are swapping a and n values. You got up till the 2*10=20. The next phase should be 11^20 Congruence to 1 mod 33, and 11^20 is still a giant number. I don't know if it's right though, that's my suggestion.
@@agbaiobasi7390 we just had to prove whether 11 is relatively prime to 33, which they aren't. I'll relook at the #s and return, I do make mistakes every year or so. You were correct, thx, I fixed the post which should read correctly now.
Both are not relatively prime numbers because 33 is divisible by 11
Last question is not relatively prime no. Because gcd is not getting as 1
This does not hold true because the GCD (11,33) does not equal 1 but equals 11. To prove this, we first find the Phi value of 33, but the distinct prime numbers of 33 are 3 and 11, hence to find the Phi value, (3 - 1) * (11 - 1) = 20. Therefore, 11^20 Congruence 1 mod 33. This becomes 22 congruence 1 mod 33, and since 22 does not equal 1, this proves that Euler's theorem does not hold true here.
11 is not relatively prime to 33 since the GCD = 11, not 1. a = 11, n = 33. We need Phi(n) or Phi(33). The two primes composing 33 = 3, 11. 3-1=2, 11-1=10, 2*10 = 20 = Phi(33). 11^20 ≡ 1 (mod 33) is false. 11^20 = a 21 digit number ending in 1, but subtracting 1 and dividing by 33 doesn't give 0, so it is false.
You are swapping a and n values. You got up till the 2*10=20. The next phase should be 11^20 Congruence to 1 mod 33, and 11^20 is still a giant number. I don't know if it's right though, that's my suggestion.
@@agbaiobasi7390 we just had to prove whether 11 is relatively prime to 33, which they aren't. I'll relook at the #s and return, I do make mistakes every year or so. You were correct, thx, I fixed the post which should read correctly now.
Please explain the homework question.
Good explanation
Answer to H.W.
Euler Theorem does not hold true for a=10 and n=11.
It does. 10^(10)=-1^(10)=1 mod 11
@@leomoe433 I think he means to say a=11 , n = 33.
Great video, Thanks!
Please answer the hw problem
They are not relatively prime..but the case still satisfy the congruence
euler ❌
oiler ✅
jokes aside thanks a lot sir for such good resources
🤣😂
So Eulers theorem is the remainder
Sir a=11 ,n=33 are not relatively prime
please start Database management systems fastly
-1=1 mod 33 it doesnot hold true
I couldn't do the homework I'm stuck ...
2 and 10 are not relatively prime
5:40 Wrong no son co primos 16=1mod(10) …? No aplica ! 16=6mod(10)
22 so it does not hold
Was Euler a human?
Good question
No, Euler was an alien.
Euler 👽👽👽
Human or not...but he was not smarter than Adrian Viedt, Reed Richards and Bruce Wayne 😎😅😅
A.I
Bro Euler's theorem was in mathematics. How it come here?
22
gcd of 11 and 33 is 11 so it doesnt hold true
GCD of 11 and 33 is 11 not 3 ....but it won't hold anyways
@@embellishvibez4894 11 sorry
No bcz remainder is 4
22 and Eulers theorem does not hold true.