Re: OEIS A004664 related conjecture: n! + n^2 != m^2 for n>=1, m>= 0
- From: Maria Povolotsky <apovolot@xxxxxxxxx>
- Date: Tue, 30 Sep 2008 13:30:02 +0000 (UTC)
Hi,
It appears that some responders misunderstood my conjecture ...
Let me reiterate my conjecture once more:
The sum
n! + n^2
for n >=1
doesn't yield the perfect square
I also was advised for the additional clarity to present above in the
TEX format as:
$n! + n^2 \ne m^2$
Also any one could check the OEIS's A004664 to see what is involved
there.
Thanks,
Best Regards,
Alexander R. Povolotsky
=========================================================
In addition to previously posted conjecture
(unfortunately I have not seen any responses yet ;-) )
I came up with OEIS A004664 related conjecture:
n! + n^2 != m^2 for n>=1, m>= 0
I checked using PARI that indeed n! +n^2 doesn't yield perfect square
up to n=30,000
Is this conjecture known (could one on this list point me to the
source
where it is posted/published ?)
If it is indeed known, was it proved then ?
Thanks,
Best Regards,
Alexander R. Povolotsky
.
- References:
- OEIS A004664 related conjecture: n! + n^2 != m^2 for n>=1, m>= 0
- From: Maria Povolotsky
- OEIS A004664 related conjecture: n! + n^2 != m^2 for n>=1, m>= 0
- Prev by Date: Re: arbitrary factorization as a difference of cubes?
- Previous by thread: Re: OEIS A004664 related conjecture: n! + n^2 != m^2 for n>=1, m>= 0
- Next by thread: K-dimensional subspaces of GF(p)^{2k} with zero intersection
- Index(es):
Relevant Pages
|
Loading