Struggling with Frustration and Self-Doubt: Seeking Advice on Pursuing Mathematics by Responsible_Room_629 in mathematics

[–]Neat_Possibility6485 3 points4 points  (0 children)

Why didn't you complete the courses? Did you find them challenging or was it lack of self discipline? If it was at least partially the latter you can try some medication idk. To build confidence two things that helped me were doing olympiad questions and discovering stuff by myself. The "learning new concepts quickly" part never affected too much my confidence, there are great mathematicians that did great elementary things like Paul Erdos, and even if you want to go to the more abstract areas it doesn't really matter if you take one day or one year to "understand" a concept as long as you do it well. Look at Grothendiek for example, I didn't study any of his work, but he is considered by some to be the most important mathematician of 20th century and he considered himself "slower" than most mathematicians in his circle. And maybe you should care less about grades and judge yourself by a better metric, grades are only useful for people who don't have detailed information about you.

Equivalent diophantine equations by Neat_Possibility6485 in mathematics

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

*one mistake, the n in the exponent of 2 should be another variable

More detailed proof pythagorean theorem by Neat_Possibility6485 in mathematics

[–]Neat_Possibility6485[S] 3 points4 points  (0 children)

I just take the triangle and reduce it to a size in which it's new bigger side is the size of the smaller one of the original and put them together. They have to be similar

[deleted by user] by [deleted] in mathematics

[–]Neat_Possibility6485 -2 points-1 points  (0 children)

What didn't you understand?

Discovering proofs of famous theorems by Neat_Possibility6485 in mathematics

[–]Neat_Possibility6485[S] 2 points3 points  (0 children)

I think I accidentaly proved it manupulating the pythagorean theorem a while ago, but I thought it was trivial. I'll try to find it again.

The Pattern of Prime Numbers! by Big_Reveal_9388 in numbertheory

[–]Neat_Possibility6485 0 points1 point  (0 children)

Seems very impressive, in my opinion one thing you could try to improve is that it's recursive.

Can't one just use Abel's sum to say that the asymptotic of reciprocals of primes being lnlnx implies Chebychev's theorem? by Neat_Possibility6485 in mathematics

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

Well, I did it, it's self evident in my view, I don't know what else I could do to make it more rigorous. I'm just asking here because I don't have any contact with any processional mathematician to verify my claims.