a nice one to prove.......

prove that (k-1)²=(n-1)²+(m-1)²+(f-1)² have infinitely many solutions when all the variables are natural numbers[1]

hey forgot one constraint they r distinct for obvious reasons.....[1][1]

1 Answers

341

Hari Shankar ·2010-03-24 09:20:26

The identity n²+(n+1)² + (n(n+1))² = (n²+n+1)² says it all

√ √ || {} [] () → ~ ^ x x x → → ln log lg lim lim cos sin tan cot arcsin arccos arctan

∫ ∫ ∫ ∫ ∫ ∬ ∬ ∬ ∬ ∬ ∭ ∭ ∭ ∭ ∭ ⨌ ⨌ ⨌ ⨌ ⨌

∑ ∑ ∑ ∑ ∑ ∮ ∮ ∮ ∮ ∮ ∏ ∏ ∏ ∏ ∏ ∐ ∐ ∐ ∐ ∐

+ - × ÷ ± ∓ = ∪ ∩ ≠ ∼ ≈ ∅ ∀ ∃ ∈ ∋ ∝ ≤ ≥ ≃ ≅ ≡ < > ≪ ≫ ⊂ ∉ ⊃ ⊆ ⊇ ⇒ ⇐ ⇔ ⇒ ⇐ ⇔ ⇑ ⇓ ⇕ → ← ↔ → ← ↔ ↑ ↓ ↕ ↖ ↗ ↘ ↙ ↪ ↩ ⇀ ↼ ⇁ ↽

° ∂ ∞ α β γ δ θ λ μ ν ξ π ρ σ φ ω ε ƒ κ τ υ Γ Δ Λ Σ Π Ω