I am a Computer Science student reading for a degree at the University of Malta. Since discovering the Collatz conjecture about a year ago, I've been fascinated by it. Since no one has been able to prove it true for quite a while now, I wanted to try something completely new when tackling the problem.
Only last week, did I happen to notice a very interesting pattern in the Collatz problem and thus, I came up with a new way to express odd numbers which I have called the Collatz Normal Form. I use this Normal Form to form relations from any odd number down to 1 (unlike attempts where people start from 1 and fan out).
This is my attempt at proving the Collatz conjecture. I've never done this and I wish to hear all the feedback you can give me even with regards to proof-writing. Also, I skip covering related work and recent attempts at the problem and delve straight into the unique aspects of the proof to keep everything short.