On the existence of polynomial-time algorithms to the subset sum problem

This paper proves that there does not exist a polynomial-time algorithm to the the subset sum problem. As this problem is in NP, the result implies that the class P of problems admitting polynomial-time algorithms does not equal the class NP of problems admitting nondeterministic polynomial-time algorithms.

On the zeros of the Riemann zeta function

In 2008 I thought I found a proof of the Riemann Hypothesis, but there was an error. In the Spring 2020 I believed to have fixed the error, but it cannot be fixed. I describe here where the error was. It took me several days to find the error in a careful checking before a possible submission to a payable review offered by one leading journal. There were three simple lemmas and one simple theorem, all were correct, yet there was an error: what Lemma 2 proved was not exactly what Lemma 3 needed. So, it was the connection of the lemmas. This paper came out empty, but I have found a different proof of the Riemann Hypothesis and it seems so far correct. In the discussion at the end of this paper I raise a matter that I think is of importance to the review process in mathematics.

On the rank of elliptic curves

The paper proves that the Birch and Swinnerton-Dyer conjecture is false.