great video!

What will be the time complexity of this problem, and how much time would it take to calculate certain inputs in C?

Thanks very much. You haven't posted very many yet, but I really like the ones you've posted - nice work and very interesting!

What is this formula shittttt

Wow, this is the best lecture I've ever seen on p-adic integers and p-adic numbers, which is a very counterintuitive topic I never really got before, despite the fact that I have a PhD in algebraic number theory. Great job!

Feel like I need mushrooms to truly enjoy this unreal experience

Tetris

Pi is determined using an infinite series. Anything that uses pi will break down and stop working.

Its 2 am and you got my attention. Ima finish this video now

I'm sure prime numbers have a certain recursion pattern somehow Manny random thing can explain using recursion maybe prime number too prime number is so random

...9999999999 = -1 1+2+3+4+... = -1/12 I'm starting to feel that negative numbers are not finite. And if you are in Debt, great job, you just earned infinite bucks..

Never heard this in school. Were they keep it secret? 😂

My favorite theory ! 😊

This is precisely up my alley. I find using functions to produce formulas (no matter how silly they look or inefficient) in a way adjacent to that of coding wonderful. Excellent video!

This is how they store cocacola formula and some chemical formulas. Modern engineering is about the machine crunch of deep learning.

What if for each size, you take the least (according to real abs) number? You would get an incomplete line, that have some repredentation feature xd

Pee addict

Not efficient but brilliant formula anyway!

For natural numbers i, j and n>j there exist a product function from i=2 to i=n-1 [sin (pi*n/i)] which is different than 0 and it is a prime number. For such function there is also true that: P= sum j=3 to j=n from [product function from i=2 to i=n-1 psin (pi*n/i)]/product function from i=2 to i=n-1 [sin (pi*n/i)] where P+1 is the order of prime number (O.O.P.N.) which also can be written as O.O.P.N. =1 + sum j=3 to j=n from [product function from i=2 to i=n-1 psin (pi*n/i)]/product function from i=2 to i=n-1 [sin (pi*n/i)] We also must add number 2 as a 1st prime as an axiom to complete this formula.

The application at the end id is just mind-blowing!

10^n when n goes to infinity doesn't equal zero! 🤨 There will always be a one at the beginning of the number. It grows infinitely larger. The reciprocal of the number appears to go to zero, but even as it approaches infinity, there will still be a one at the end. Sure, after a certain point, we can call it "zero", but that's more of a convention that fact.

What’s the time complexity for the formula?

This is kind of tautology, like saying "the nth prime is the nth prime"

What is the practical point with any of this besides mental juggling? What are the examples in the real world and sciences where this does something significant, profound and exposes greater truths or accuracy in any tangible industry or empirical environment?

2:58 Ok so i saw 11, 23, 47 Then 233 and 467 Then 3779 and 7559 Ohh so its 2n+1 type thing, But pretty inconsistent because we have 47 then 101 So its not that good

Interesting stuff! Just one advice, know your audience. There will not be a viewer who makes it 5 minutes into the video and doesn't know what a logarithmic scale is.

Pure dope

huh?

10-adic numbers can be þought of as being in negadecimal (base -10)

this is the same channel that made the prime factory video! these videos are so high-quality and in-depth and easy to follow its crazy! thank you so much for making these!

Desmos: Nuh uh

Fantastic! thank you for sharing this video.

When will mathematicians admit that math notation is hot garbage and we should start over? The only reason any of you were remotely interested in this is that you think math notation is somehow indicative of 'solving' anything, and you think that the history of ignoring that information and processing, yes they're real, you can't just 'yadda yadda' infinite calculation no matter how many blackboards you scribble sideways 8s on... and then you realize that this 'formula' is just a ridiculous way to write a dumb prime checker.

When j is prime the output is also odd

How about going for asymptotic results of the given formula?

Now let's do FizzBuzz in this programming language.

Show this to the people who say "But 1 billion is a huge number"

change to C(n)=lcm(n,C(n-1)) is better. And you will find its obvious. This does not need not any provement. If lcm(n, product of 1 to n-1) is n itself, then n is not a prime. Otherwise, it must be a prime.

It looks like bulshit

Math is so cool

that was great! thank you :)

The joddest proof I have ever seen on prime numbers🗿🗿🗿🗿🖤

Damn such a cool formula , such a shame its too inefficient

So, class, have I convinced you of the practical value of table lookup yet? The smallest EEPROM chip on sale today can instantly return vastly more primes than this clever method can find one-at-a-time in a reasonable amount of time. (Of course MUCH larger tables are available for free online, but that depends on connectivity which is an imperfect technical situation.) [At one time I could buy such a table as a chip or a USB drive, but Amazon’s “service” makes searching for it basically impossible-great naming strategy there Bezos (I thought you were a trained engineer bro).]

useless... but better than all our non-existing formula :)

Wow, this is so cool to create primes, despite primes having no pattern

this is how i exactly planned to produce prime numbers before lol

This is purely evil.

Perhaps this one about the author can help you:[url]www.theoremoftheday.org/Resources/LinkNeeded.htm

60²=4160