Sierpinski's Conjecture

Discussion in 'Math Research' started by blang blang, Aug 12, 2011.

  1. blang blang

    blang blang Guest

    Hi !

    The Sierpinski's conjecture states that for all integer n>1, we have 5/
    n=1/a+1/b+1/c with integers a>0, b>0, c>0.

    But is it easier to prove that 5/n=1/a+1/b+1/c+1/d ?

    Thanks,

    B.L.
     
    blang blang, Aug 12, 2011
    #1
    1. Advertisements

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments (here). After that, you can post your question and our members will help you out.