gaoming094
Last Activity: Apr 24 '26, 07:17 AM
Joined: Feb 24 '25
Location:
-
This paper has not been rigorous peer reviewed. Several local mathematicians have briefly reviewed it, but none of them found any obvious flaws in the paper. Given the potentially significant impact of the conclusions claimed in the paper, none of them were able to provide any substantial suggestions.... -
I think you have misunderstood the meaning. In fact, when K>6, the system of equations has only one solution. In the paper, the meaning of "at least one unknown number is unsolvable" is that the structure of the equation's constraints leads to the inevitable conclusion that one unknown variable cannot be solved from the equations and can only be obtained through exhaustive enumeration....Leave a comment:
-
Eagle encryption algorithm: A new approach to proving P≠NP
Firstly, we introduce a common proposition "the existence of one-way functions =>P≠NP", which is considered a fundamental theorem in general cryptography or computational complexity theory. one-way functions have two conditions:
1) calculating f(x) can be completed in polynomial time.
2) Calculating the inverse function f^{-1}(x) cannot be completed in polynomial time. If we find a one-way function, it means that...
No activity results to display
Leave a comment: