Recent content by oszust001

  1. O

    Is This the Correct Identity for Natural Numbers?

    Version of AtomSeven is good. How can I show that \sum_{i=0}^{n}2^{n-i} {n+i \choose i}=2^{2 n} is good for every natural numbers
  2. O

    Is This the Correct Identity for Natural Numbers?

    ok my foult. so how can i solve that equation?
  3. O

    How to Prove a^m ≡ a^{m-φ(m)} mod m?

    Ok but what can I say for nonprincipal numers? how can I show that the equation has sens for every numbers not only for principal
  4. O

    Is This the Correct Identity for Natural Numbers?

    How can I show that: \sum_{i=0}^{n}2^{n-i} {n+i \choose i}=2^{2^{n}} for every natural numbers
  5. O

    Finding Solutions in Natural Numbers for x^2+y^2=4z^2 and x^2+3y^2=4z^2

    How can I solve that type of equation: x^2+y^2=4z^2 or x^2+3y^2=4z^2
  6. O

    Can this equation be solved using integer numbers?

    Ok, but how can I show that this equation can be saying like that you wrote? If I place for 3^x=1(mod 4) to top equation and from Fermat's little theorem I have x=3 than I have equation with one variable? That you thought about?
  7. O

    Can this equation be solved using integer numbers?

    How to solve that eqation? 3^x=4y+5
  8. O

    Proof That 1979 Divides p in Math Series

    Let p,q is natural. p/q=1-1/2+1/3-1/4+...-1/1318+1/1319. How can I proof that 1979|p.
  9. O

    How to Solve Quadratic Diophantine Equations in Natural Numbers?

    How can i solve that equation: x^2 + y^2 = z^2-1 or x^2 + 3y^2 = z^2?
  10. O

    How to Prove a^m ≡ a^{m-φ(m)} mod m?

    How to proof that equation? a^m \equiv a^{m-\phi(m)} mod m ?
Back
Top