.

Printable View

- Feb 17th 2010, 01:58 AMwatzerProve by induction
.

- Feb 17th 2010, 02:13 PMtonio
- Feb 17th 2010, 02:18 PMwatzer
Yes true, diden't want to post my equation. But what if a equation have atleast one solution positive when n > 5(random number)

How to prove it ?

Prove the basestep: n = 6

Prove n = p + 1

Can u help me please, sorry for the lack of information on this. - Feb 17th 2010, 07:57 PMtonio

I can't help since I don't understand what you want...you must try harder to write your questions in a clear way.

For example, if it MUST be that , then the two-inknown equation has at least a positive solution (meaning that both x,y are positive) iff ...but I'm not sure this is what you want.

Tonio - Feb 18th 2010, 03:44 AMwatzer
I want to prove for a diofantic equation (x + y = n, n > value) that there is always a value of K where x and y are non-negative. (>= 0)

is it posible to prove that ?

x: 5p+12k

Y: -2p-5k

will always have atleast a nonnegative solution when p > 43

Do you have msn messenger ? So i can show you my calculations, PM me your messenger, i cant PM yet. - Feb 18th 2010, 08:18 AMwatzer
Thanks for the help, think i have solved it.