Waste less time on Facebook — follow Brilliant.
×

Sequence Generalization Proof

I have recently, been experimenting with numerical sequences, one of which were inspired by t​his problem. Please view the following work which I have conducted to arrive at my proof. Images are attached.

Note by Refath Bari
2 months, 3 weeks ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

Nice Observation and theorem. You can establish if no has yet and you should try to have a proof and try it with large numbers because maybe they can act as counter examples. Achal Jain · 2 months, 3 weeks ago

Log in to reply

@Achal Jain Thank you for the kind reply! Unfortunately, I'm not quite sure the process of a formal proof, or how to establish. It would be great if you could elaborate. Thanks! Refath Bari · 2 months, 3 weeks ago

Log in to reply

@Refath Bari Well i am sorry to say that what your trying to prove is not a theorem but just common properties. This is because your stating that n^2-k=n+k which can be written as n^2-n=2k or n(n-1)/2=k. Which is nothing but mere division and nothin else. Achal Jain · 2 months, 3 weeks ago

Log in to reply

@Achal Jain Haha, yes. I was aware of that. Take a look at the "UPDATE" Refath Bari · 2 months, 3 weeks ago

Log in to reply

@Refath Bari I knew Refath. I commented because if someone is wrong it's our responsibility to correct him/her. Note-Please Remove this bullshit or someone else will. Achal Jain · 2 months, 3 weeks ago

Log in to reply

@Achal Jain Haha, Alright. Cheers (?). Refath Bari · 2 months, 3 weeks ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...