title: Writing a proof for an algorithm
body: <p>I am trying to compare 2 algorithms. I thought I may try and write a proof for them. (My math sucks, so hence the question.)</p>
  <p>Normally in our math lesson last year we would be given a question like &lt;can't use symbols in here so left them out&gt;.</p>
  <p>Prove: (2r + 3) = n (n + 4)</p>
  <p>Then I would do the needed 4 stages and get the answer at the end.</p>
  <p>Where I am stuck is proving prims and Kruskals - how can I get these algorithms in to a form like the mathmatical one above, so I can proceed to prove?</p>
  <p>Note: I am not asking people to answer it for me - just help me get it in to a form where I can have a go myself.</p>