Re: question about Diophantine equations
- From: alvarez.torres1@xxxxxxxxx
- Date: Mon, 20 Oct 2008 04:01:35 -0700 (PDT)
Ummm, you are aware that (15+30*k)^4-1 = -1 mod 5, aren't you?
de Pumpster
Yes, but I only specified all constraints that I have deduced from my
equation.
So, I need to solve p^100+q^100+r^100=t^4, where p,q are even, r odd.
It can be led to the problem of finding solutions of
p^100+q^100=c*r^100, p,q are even, r odd. And c=k^4-1, k=3,5,7,9....
(odd)
Also p,q are divisible by 10, r last digit is 1 or 5. - this I've
deduced.
This is the full problem I need to solve
.
- References:
- question about Diophantine equations
- From: alvarez . torres1
- Re: question about Diophantine equations
- From: Pumpledumplekins
- Re: question about Diophantine equations
- From: alvarez . torres1
- Re: question about Diophantine equations
- From: Pumpledumplekins
- Re: question about Diophantine equations
- From: James Waldby
- Re: question about Diophantine equations
- From: Pumpledumplekins
- question about Diophantine equations
- Prev by Date: Re: Prove a limit
- Next by Date: Re: the universal covering group
- Previous by thread: Re: question about Diophantine equations
- Next by thread: Combinatorics isn't necessarily a piece of cake
- Index(es):
Relevant Pages
|