PRIME NUMBERS📝 Crash Course✅ | Sieve of Eratosthenes | Segmented Sieve | Prime Factorization

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

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

  • @shashanksahu9230
    @shashanksahu9230 10 месяцев назад +19

    A video no one asked, but everyone needed!

  • @abhimanyuambastha2595
    @abhimanyuambastha2595 7 дней назад +1

    For time complexity root(n), we need the condition to be i * i

  • @charlesk6378
    @charlesk6378 10 месяцев назад +6

    THE best video ❤‍🔥🔥🔥🔥

  • @AshishKumar-us7rw
    @AshishKumar-us7rw 6 месяцев назад +3

    sir... Genuinely request to make a series on maths for Competitive programming, please.

  • @vinsin4619
    @vinsin4619 10 месяцев назад +1

    Your videos have really helped me a lot

  • @aviralyadav8798
    @aviralyadav8798 10 месяцев назад +3

    please make a playljst for competitive programming for maths, these videos are really helpful ❤

  • @bngdtutorial2947
    @bngdtutorial2947 10 месяцев назад +1

    Bhai permutations wala bhi video bana do

  • @giridharanpasupathi
    @giridharanpasupathi 10 месяцев назад +2

    Bro please drop the permutation and combination master-class

    • @randomlad9312
      @randomlad9312 10 месяцев назад +1

      True, PnC with modular arithmetic

  • @dakshsharma8006
    @dakshsharma8006 9 месяцев назад +2

    can anyone explain the long long j= max () line how (L+i-1)/i*i gives first num>=l which is divisible by i*i

  • @amanpatel8575
    @amanpatel8575 25 дней назад

    Ye kis line me aa gye aap bhaiya , 14:50

  • @ShaikUmar-lo2fv
    @ShaikUmar-lo2fv 6 месяцев назад +1

    bhayya prime function mein i*i

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

    Bhaiya agar 1 to 10^9 ki range ke biche me prime number nikalne ho toh kya use kare sieve ya segmented sieve

  • @mayankkumar6628
    @mayankkumar6628 8 месяцев назад

    nice one buddy keep growing might subscribe you if i will need to watch another video from your channel doing good job brother

  • @shalinijha7359
    @shalinijha7359 10 месяцев назад +1

    are you not coming live for contest discussion?

    • @ARYANMITTAL
      @ARYANMITTAL  10 месяцев назад +8

      This Master Lecture, took 5 hours to make, thus i am completely exhausted 🥵, taking a small nap & will get back on today Contest Lecture & solutions will br available by night of all 4 problems 🫡

    • @rajrajesh1669
      @rajrajesh1669 10 месяцев назад +1

      ​@@ARYANMITTAL
      Man, How are you able to do this lol?

    • @shashanksahu9230
      @shashanksahu9230 10 месяцев назад

      @@ARYANMITTAL

    • @shalinijha7359
      @shalinijha7359 9 месяцев назад

      @@ARYANMITTAL really appreciate your efforts and watched the vid of the contest solution 👍

  • @ChiragWadwa
    @ChiragWadwa 9 месяцев назад +1

    bro 🐔🐔 14:50

  • @ChiragWadwa
    @ChiragWadwa 9 месяцев назад +1

    i*i

  • @hyperme1831
    @hyperme1831 7 месяцев назад

    Can anyone tell why only prime numbers will be factors when we are finding it by n%i ==0 and doing count.
    For example:for n =40
    Ans would be (2,3)
    (4,1)
    (5,1)
    I dont understand how we are getting prime factors and here the count 2×3+4×1+5×1 is also not 40. And all are not prine numbers as well 4 is not prime number how its factor of 40.

    • @ChethanV-gi8io
      @ChethanV-gi8io 7 месяцев назад

      As per definition, prime numbers are those which can be divided by itself or 1.
      You'll not get any non prime number as factors because when we start with i=2 till n, first all the multiples of 2 cannot be part of the result, then all multiples of 3 cannot be part of the result, then all multiples of 5 and so on. 4 cannot be a factor because it's already divisible by 2.
      for n=40, factors should be 2*2*2*5. i.e (2,3) (5,1)