How To Quickly Factor a Number: Pollard's Rho Algorithm

Поделиться
HTML-код
  • Опубликовано: 26 янв 2025

Комментарии • 12

  • @kaiyueguo1624
    @kaiyueguo1624 5 месяцев назад

    Really good illustration, appreciate a lot❤❤❤

  • @kephalopod3054
    @kephalopod3054 2 месяца назад

    It's good that the turtle does not have a headstart, otherwise the hare could never catch the turtle.

  • @HoSza1
    @HoSza1 Год назад +6

    ok, now let's do 2048 bits 😂

  • @mburu.mwangi
    @mburu.mwangi Год назад +3

    Where can I get the code?

    • @ilovee271
      @ilovee271 2 месяца назад

      Chat gpt
      JK, i guess I'm still right though...

  • @xinzhouping
    @xinzhouping 2 года назад +1

    is gcd(T-H, n) = d always true when T-H > 0? or are there edge cases where this is not necessarily correct?

    • @tariqalr
      @tariqalr 2 месяца назад

      no. assume d|n, gcd(|T-H|,n) = d iff d| |T-H|

  • @tododiaissobicho
    @tododiaissobicho 8 месяцев назад +1

    The explanation was good enough until you brough the tortoise and the hare. Then I had to sub.

  • @LakieshaKuzyk-h7l
    @LakieshaKuzyk-h7l 3 месяца назад

    Damon Landing

  • @runnybabbittutuyt6393
    @runnybabbittutuyt6393 2 года назад

    nice

  • @askforinfo
    @askforinfo 6 месяцев назад

    Which software you has been used for this presentation?