this number is "super divisible"

Support the channel🌟
Patreon: / michaelpennmath
Channel Membership: / @michaelpennmath
Merch: teespring.com/...
My amazon shop: www.amazon.com...
🟢 Discord: / discord
🌟my other channels🌟
mathmajor: / @mathmajor
pennpav podcast: / @thepennpavpodcast7878
🌟My Links🌟
Personal Website: www.michael-pen...
Instagram: / melp2718
Twitter: / michaelpennmath
Randolph College Math: www.randolphcol...
Research Gate profile: www.researchga...
Google Scholar profile: scholar.google...
🌟How I make Thumbnails🌟
Canva: partner.canva....
Color Pallet: coolors.co/?re...
🌟Suggest a problem🌟
forms.gle/ea7P...

[@prometheus3375]

8:49 but the lcm(2, 6) is 6.

[@wolffang21burgers]

Which is funny because his example was exactly LCM(2,6) at 3:30

[@rainerzufall42]

@@wolffang21burgers I think, he does this intentionally.

[@Neodynium.the_permanent_magnet]

​@rainerzufall42 Mistake-bait! So that you (and I) add comments to the video ...

[@demenion3521]

just a minute into the video and i'm confused by the definition of λ. after a short google search, it turns out that the definition is just wrong, it's supposed to be the minimal value of m s.t. a^m=1 (mod n), not a^λ(m)

[@aleksapupovac]

That was what my guess had been

[@epic_win]

I got to admit, definition from the video made me immediately respect Carmichael. Shame it's not correct.

[@GreenMeansGOF]

I was confused but I just assumed that it was a recursive definition where you need smaller values of lambda to calculate higher values. Good catch though.

[@ericslavich4297]

Thank you.

[@leif1075]

​@@epic_winwhy did it make you respect if it's confusing shiuldnt that make youbrespect him less..and if this is confusing shouldnt it be banished .at least til it's clarified .math has enough of thia stuoid bullshit confusion alreadybthat is not smart or clear or useful or logical..you can marrly dolve this by saying ok this is clearly divisible by 7 so the smallest natural number that doesnt divide this nust be between 2 and 6 obviously..didnt amyone else do this..and since two odds aubtracted give am even itbia divisible by 2..so isnt the answer 1? Since wven if its nkt divislbe by 3 3 is bigge rthan 2

[@Bodyknock]

6:45 Once you’ve determined that λ₄ is at least 4 then you can, instead of trying n’s one by one, try to reverse engineer n that satisfies the condition using the properties of λ mentioned earlier in the video. For λ₄ = 4, we want m such that λ(m) = 4. Per the video, For all odd primes p λ(p) = p-1, so λ(5) = 4. However we need this to be even (because λ is always even except for λ(2) = λ(1) = 1), so 5 won’t work. But 5*2 does work since lcm(λ(2), λ(5)) = lcm(1,4) = 4, so we can use λ₃ = 10. For λ₃ = 10, similar to above note that λ(11) = 10. But we can’t use 11, so we’ll instead use 2*11 and get λ(22) = 10, so we’ll set λ₂ = 22. And again, like above, λ(23) = 22, but since we’ll need an even value, we can use 23*2 =46 for λ. And finally, λ(47) = 46. This time however, since we’re at last “at the bottom of the tower”, we can actually use an odd number here since we don’t need to worry about finding a new λ(n) = 47. So the bottom number is 47. And there you go, we reduce the exponents mods 4, 10, 22, 46, and 47 just like in the video. And since at each stage we selected the smallest value which produced the desired λ it’s also going to be the minimum one.

[@curtiswfranks]

Is this guaranteed to be minimal? Or does it mean that we must check primes up to and including, but not beyond, 47?

[@안태영-g8w]

Related fact: 47 is a safe prime. If a prime number p=2q+1 is a 「safe prime」 so that q is also prime, then λ(p)=p-1=2q and λ_2(p)=λ(2q)=q-1. That is, λ_2(p) is almost half of p. If p is not safe, on the other hand, λ_2(p) is smaller than a quarter of p, which implies that the value decreases faster. 47 is the strong case that the value decreases slowly as being applied by λ multiple times. (47=23·2+1, 23=11·2+1, 11=5·2+1, 5=2·2+1)

[@s4623]

You heard it here first! "9 is power of a prime, it is 3 cubed" 🤣

[@stickfiftyfive]

minor correction, 3^2 = 9 ≠ 3^3

[@deinauge7894]

7:00 that's wrong? eg. the smallest natural number not deviding 6 is 4. Not a prime, but a prime power.

[@robertveith6383]

* *dividing*

[@Czeckie]

7:05 shouldn't we care about congruency mod a power of prime also? The lambda4 should be computed for 32, 27 and 25 too. We were 'a bit' lucky, since they are not congruent modulo 3^5, but this technique checking just primes wouldn't find it.

[@robshaw2639]

Is this a fluke or do power tower differences tend to have many small divisors?

[@wesleydeng71]

It is not a fluke. Because of the way how lambda function works, it usually reduces a number very quickly when repeatedly applying it.

[@GreenMeansGOF]

Could Euler’s Totient function also be used to solve this problem?

[@charleyhoward4594]

I sure wish I knew what he was talking about

[@1.4142]

tower of power

[@shtfeu]

In the slot

[@jimiwills]

That's really cool 😊

[@marcushletko8258]

Cool video… but did you try plugging it into a calculator? I feel like that would be easier

[@barutjeh]

Try it!

[@jplikesmaths]

@@barutjehproof by calculator

[@sarthak2143]

good problem!

[@life42theuniverse]

Umm the only prime divisor is 7…7^x-7^y 0 mod 7

[@life42theuniverse]

2^a*3^b*5^c*prime(n)^xn…is higher?

[@gp-ht7ug]

I have got lost….

[@MrRyanroberson1]

Yeah he made so many errors this time around.

[@diniaadil6154]

First

[@AndyBaiduc-iloveu]

Bot

[@Kurobi黒日]

KZbin comments used to be full of "power towers" 😉