WHOA!! A%Golden ratio = prime? That means we could work backward from d to find a and x? Nice find on the crumb!!
Thanks for understanding my idea, Baker. It's so nice to be with your minds who can do the things I like to do. Most people around me can't even begin to understand how excellent this forum is.
Just doing Math(s) is/are? improving my life.
The relationship between d, x, and a is amazing. I'm wondering if there's a pattern between [delta]t for (1,c) and t for (Prime Solution). Can we run those numbers, programAnons? Let's take known c's from the basic grid so everyone can follow. Let's do the (1,c) and (Prime) for each c value. If willing, PMA, would you please pick some c values starting at c=145 and greater? Just a few examples needed to examine this [delta]t idea between na=a for (1,e) and (e,n). Thoughts welcome.
>>3563 Factor Trees Crumb
>>3565 (N-1)a and na combined with Factor trees crumb? How to combine?
Thanks Baker for crunching the numbers for [delta]t. Seeing some very interesting patterns. You're right about the distance from T and t being too large in the RSA setting. Good progress on the (N-1)a and na ideas tho, and how they combine with the factor tree crumbs.
Great find on this crumb!
All right! Just saw this, VQC is back! Good to see you.
I see where you're going Baker. Sum of (1,c) factors can be used to create all the remaining factors? However, checking your math wouldn't it be 12/2 = 2 and 6. Then 6 = 3 and 2? So the termination points would be 1, 2, 2, 3? Could be wrong here, just trying to make sure I understand what you're hinting at. Can you elaborate on your idea?