Oxford Professor Sets Interview Maths Problem

Поділитися
Вставка
  • Опубліковано 24 гру 2024

КОМЕНТАРІ • 3

  • @henryginn7490
    @henryginn7490 16 днів тому +3

    Would have been nice to include what happens as n gets large. That series is going to be about log(sqrt(n)) which means the ratio of the number of loops to number of initial strands goes to 0 pretty fast. I think that is correct anyway, certainly the conclusion

    • @voicutudor7331
      @voicutudor7331 9 днів тому +1

      yes, the actual answer is ln2 + c/2 + ln(sqrt(n)) which is almost 1 + ln(sqrt(n)), where c = euler's constant

  • @thatonecuber9266
    @thatonecuber9266 16 днів тому

    This is also a STEP 3 question! It'd be good to also look at that one because there's also a bit more to it.