Why Does This Recurrence Generate Primes?

[@RSLT]

Nice to see a new video after quite some time.

[@EricRowland]

Thanks! This one almost killed me 😂

[@tcaDNAp]

I'm sure it's equally cathartic for the viewers and Eric to end without a cliffhanger this time! I never would've learned the meaning of this paper without the animations and explanation 👏

[@tcaDNAp]

One of the only math research papers I have read was in the back of the Prime Suspects graphic novel, so thank you to all artists connecting math and media!

[@_Wombat]

This style of video and explanation is really good. I appreciate how you constantly pause to run an example rather than always talking in terms of n, p and i. My brain needs examples to understand the algebra.

[@EricRowland]

Thanks! I agree… Examples are essential!

[@gabitheancient7664]

oh my god I love how elementary this all is, must have been really satisfying to figure this all out

[@lynxfl]

He's back!

[@achrafidou537]

It's how unlikely that i rewatched the first part yesterday and now i find this

[@mjorozco3786]

Exactly

[@geoff_at_work]

Me too

[@emanuellandeholm5657]

You made me wait an entire year. Totally worth it!

[@mebamme]

Dangit, right before I meant to call it a day. :D This will be the first video I'll watch tomorrow!

[@simlee6177]

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

[@EricRowland]

Thank you! More to come!

[@idlegameplayer3756]

⁠@@EricRowlandthat's very nice to know, these are some of the best math videos i have ever watched. amazing to watch casually and sleep to, you have a very soothing voice lol

[@burnstjamp]

Mind-boggling. The information here is presented beautifully!

[@firozabegum4373]

Primes are my favourite. This video is really really great, I like it! Waiting for the next one.

[@johnchessant3012]

Great proof!

[@gabitheancient7664]

oh damn I need to rewatch the previous video but damn great this video came out

[@Ryloon]

Im so happy! Thank you for uploading

[@DOTvCROSS]

@11:49 the reason for 'circular logic' 2n-1=2n-1 2n-1=(3-1)n-1+(i-i) 2n-1=3n-n-1+i-i 2n-1=3n+i-1-n-i 2n-1=(3n+i-1)-(n+i) Basic Algebra trick of adding and subtracting. Then put LHS and RHS into the same function, of course it is equal. Don't get lost in basic algebra. i is an ~'eigenvalue'~ on a 2n-1 plane maybe 'parameter' is a better word.

[@johndoyle2347]

Willans' Formula for primes: 2 to the n part = vertical asymptote and p-adic numbers. 1/n part = vertical tangent. Factorial part = vertical line. These tensors from differential calculus determine singularities in stable matter as represented as primes.

[@drdca8263]

Sorry? This isn’t particularly clear

[@johndoyle2347]

@@drdca8263 Yes. I am referring to "functions" in differential calculus that are continuous, yet not differentiable at points. There are 5 cases: a corner/cusp, which fits with dark matter singularities. A ring/cylinder/horn, which fits with singularities in baryonic matter. A vertical asymptote, a vertical tangent, and a vertical line, which are tensors that are involved in both keeping matter stable and are involved in Big Bounce events.

[@drdca8263]

@@johndoyle2347 Vertical asymptotes aren’t continuous (unless, I guess, if you compactify the codomain?). They also are not tensors.

[@debmalyalodh1]

Welcome back

[@raresaturn]

Try this variation: if GCD = 1: n=n-CGD else: n=n+GCD This produces different primes to your sequence,

[@sccur]

I am probably not understanding something, but it seems obvious to me that this sequence would generate primes in this manner having GCD as one of the operations and the rest basic arithmetic. And you can probably make a million different formulas with GCD that will have patterns generating primes. I am sure I just don't understand because I'm just finishing calculus, but what makes this interesting?

[@mebamme]

You can sometimes get composite numbers if you start the sequence with a number other than 7. (the previous video explains it a little more.)

[@isobarkley]

ngl this video was very interesting and you did a decent job of making it easy to follow, but regardless it was at times a bit dense for me.... that said, i usually watch most videos on 1.5x speed while im doing something else :P i'll give it another go when i have the energy to give it some focus!!!!

[@hichemkoubaa9598]

You set 2 conditions in one : gcd≠1 and R(n)=3n in the same time And that depends proving that gcd≠1 so R(n)=3n or the opposite Also in the end you set another not necessary condition which is i=d-1/2

[@Stuff447]

Manim! (Or whatever it's called)!

[@DeathSugar]

I wonder if this could be displayed as some kind of L function

[@kaininjago6161]

YAY!

[@familychannel3826]

Hello, Thank you for responding to my question. I have discovered a mathematical formula that allows determining all non-prime numbers, and therefore deducing all prime numbers. Does this discovery have scientific value?

[@hthefzhjglubpjjn]

no

[@pizzarickk333]

Finally

[@_eagle_299]

DAMN THIS MUSIC IS SO FIREEEE

[@hylen26]

Did I miss it? Why does the sequence start with 7?

[@EricRowland]

No great reason to start with 7, other than it's not too small. If you start with a number other than 7, you get similar behavior. I explored this a little in my other video on the topic: kzbin.info/www/bejne/haHEfKOwgquCpsk

[@hylen26]

Thank you!@@EricRowland

[@kristofferpaulssonmisc2195]

Could you write an example program in Java using normal integers and BigInteger class?

[@Jonathan-ij2ky]

g

[@marti7716]

*promosm*

[@j.21]

a