Re: ranges of integer polynomials
- From: quasi <quasi@xxxxxxxx>
- Date: Sat, 06 Oct 2007 19:46:15 -0400
On Sat, 06 Oct 2007 15:23:03 -0700, adler.math@xxxxxxxxx wrote:
quasi wrote:
problem (8):
If range(f) is a subset of N, must range(f) be recursive?
The answer is no, even if the range of a polynomial with integer
coefficients contains only positive integers, the range need not be
recursive.
I expect you will have no trouble finding a proof, the tools are by
now familiar. However, a preliminary transformation along the
following lines might be useful, it was for me:
If n is a positive integer, let g(n) be the n-th prime, or the n-th
square-free number, or the n-th power of 2 (there are a lot of choices
that work). Note that if A is a set of positive integers, then A is
recursive if and only if g(A) is.
I don't quite see it from the hint you gave above -- please show it.
However here's an argument that should work ...
Let P be an integer polynomial such that it's undecidable whether or
not the diophantine equation P = 0 has integer solutions. Such a
polynomial must exist by the results of Matiyasevich.
Then, letting
f = 1 + P^2
it must be undecidable whether or not 1 is in range(f), hence range(f)
is a subset of N, but not recursive.
quasi
.
- Follow-Ups:
- Re: ranges of integer polynomials
- From: adler . math
- Re: ranges of integer polynomials
- From: galathaea
- Re: ranges of integer polynomials
- References:
- ranges of integer polynomials
- From: quasi
- Re: ranges of integer polynomials
- From: galathaea
- Re: ranges of integer polynomials
- From: quasi
- Re: ranges of integer polynomials
- From: adler . math
- ranges of integer polynomials
- Prev by Date: Re: ramble (a morality tale)
- Next by Date: Re: PROVE sqrt(2)+sqrt(3) is a irrational number!!!
- Previous by thread: Re: ranges of integer polynomials
- Next by thread: Re: ranges of integer polynomials
- Index(es):
Relevant Pages
|