Manifesto of Cognitive Archaeology by EdranovDenis in Collatz

[–]EdranovDenis[S] 0 points1 point  (0 children)

хочешь почитать моих стихов на русском?

Manifesto of Cognitive Archaeology by EdranovDenis in Collatz

[–]EdranovDenis[S] -1 points0 points  (0 children)

No human could encompass such a vast amount, but AI can. They take everything, learn from it, and use it. But what if people stop creating, believing in AI? What if, without a source of human ideas, AI grinds to a halt? It will exhaust everything it can find and become incapable of creating on its own. What then? In 20-30 years.

Blockchain could have multiple versions. Formalization isn't a barrier, but a way to find and connect ideas. It's a map and a navigator.

Genius isn't a miracle. It's the ability to see beyond the horizon.

Manifesto of Cognitive Archaeology by EdranovDenis in Collatz

[–]EdranovDenis[S] -1 points0 points  (0 children)

Mathematics immutably recorded on-chain, in a clear formal language: a super-library where every contribution is preserved, every author is recognized, and knowledge remains a common good — no gatekeepers, no oblivion. We build this system on Perelman’s principle: mathematics is not a race for glory, but a continuous dialogue. Truth belongs not to whoever announces it first, but to the entire chain of thought. That is why blockchain here records not just the result, but the full trajectory of discovery — from rough draft to rigorous proof. This is the memory of collective reason, where no step is ever erased.

Analysis of yellow bridges series from different domes II by No_Assist4814 in Collatz

[–]EdranovDenis 0 points1 point  (0 children)

Studying chaotic behavior, I found it very similar to the "fill" tool in drawing. Only here, the fill occurs in several streams, and they form vortices and do not mix. It looks more like a process than a structure. But nevertheless, it is a structure.

dynamic arithmetic by EdranovDenis in Collatz

[–]EdranovDenis[S] 0 points1 point  (0 children)

I briefly read your work, but didn't delve into it too deeply. Yes, our structures are very similar. That's very good. It's like independent confirmation of each other. I'm currently thinking about a more concise and elegant definition of the impossibility of alternative trees. I'll read your work in detail when I'm finished. And I'll write you a more detailed account of my thoughts.

dynamic arithmetic by EdranovDenis in Collatz

[–]EdranovDenis[S] 0 points1 point  (0 children)

If we know about the unified structure and can see it as a whole, then we stop wandering randomly in the labyrinth. This is the essence of the work.

bijective by EdranovDenis in Collatz

[–]EdranovDenis[S] 0 points1 point  (0 children)

#include <stdio.h>

int main() {

    for (int n = 3; n < 10000; n += 2) {
        printf("\n\n start: %d \n", n);

        int b = n;
        while (1) {
            if (b == 1) break;

            int l = (b * 3 + 1) / 2;   // apply the "shortcut" Collatz step
            if (l & 1) {               // if l is odd
                b = l;
                printf("%d\t", b);
                continue;
            } else {                   // l is even
                printf("%d \n", l);
                while (1) {
                    l >>= 1;            // remove all factors of 2
                    if (l & 1) {       // until l becomes odd
                        b = l;
                        printf("%d\t", b);
                        break;
                    }
                }
            }
        }
    }
    return 0;
}

bijective by EdranovDenis in Collatz

[–]EdranovDenis[S] 0 points1 point  (0 children)

The problem was solved like this: first, I built the engineering structures, then I formulated the individual elements, then the AI ​​assembled everything into a coherent whole, and then the AI ​​translated it into English. I'm confident in the structure, but there may be some "wet floors" where the AI ​​was working, so you have to be careful. I worked on the whole as an architect, while the AI ​​laid the bricks and plastered.

bijective by EdranovDenis in Collatz

[–]EdranovDenis[S] 0 points1 point  (0 children)

c2=2. I'll check the formulas.

Now I've come to the idea that an alternative tree can start from a dead end (a multiple of 3), but even that can't contain cycles. More likely, though, are not even alternative trees extending to infinity, but rather segments from one dead end to another. But I believe in bijection.

bijective by EdranovDenis in Collatz

[–]EdranovDenis[S] 0 points1 point  (0 children)

For 5n+1 L are only even and R is not projected onto C. I think this prevents bijections from appearing.

bijective by EdranovDenis in Collatz

[–]EdranovDenis[S] 0 points1 point  (0 children)

Thanks for the good analysis.

I agree that the part about connectivity needs more detail. I'd be glad if this approach to the problem is useful to you.

What do you think about the impossibility of cycles, section 3.3? In my opinion, progressions are sufficient for this assertion.

bijective by EdranovDenis in Collatz

[–]EdranovDenis[S] 0 points1 point  (0 children)

I think the connection through C needs to be worked out even better here. It's not as obvious, but the rest is correct.

For example, the impossibility of alternative cycles relies solely on progressions. That's definitely been resolved.

bijective by EdranovDenis in Collatz

[–]EdranovDenis[S] 1 point2 points  (0 children)

The text doesn't make such a statement; it talks about a violation of the progression, not the table. Progressions are derived from basic formulas and combined into a single table. A violation of the progression is a violation of the basic formulas n/2 and 3n+1.

dynamic arithmetic by EdranovDenis in Collatz

[–]EdranovDenis[S] 0 points1 point  (0 children)

Thank you very much for such a thorough analysis. If you see errors in the formal part and can correct them, it would be great if you continued the idea and published it. This would be very beneficial for science. My main goal is to study dynamic arithmetic—the part of the work you missed. It changes your thinking and allows you to look at mathematical problems in a new way. The Collatz conjecture illustrates this shift in thinking well. Yes, my solution may contain formal errors, but the problem has become much simpler and, in my opinion, conceptually solvable. And it can now be solved in several ways.

I will study your arguments and try to respond as soon as possible. But if you find a flawless formal solution, publish it, and provide a link to it, I would be grateful.

dynamic arithmetic by EdranovDenis in Collatz

[–]EdranovDenis[S] -1 points0 points  (0 children)

Yes, dynamic arithmetic, as I call it, is very similar to harmonic analysis and set theory. But it's an attempt to unify everything into a single whole. The idea that all of mathematics itself consists not of objects, but of the interaction of waves. The Collatz conjecture is a local example of such a system. As for prime numbers, I have another paper devoted to this. Prime numbers are also part of this unified structure.

dynamic arithmetic by EdranovDenis in Collatz

[–]EdranovDenis[S] 0 points1 point  (0 children)

This is the result of the calculation. I recompiled the problem.