Or, very simply stated, given the finite set $S$ S = {$a_1, ... \{a_1, \dots , a_k$}a_k\}$, consider the diophantine equation: $$(n-a_1)...(n-a_n)=0$$. $(n-a_1)\dots(n-a_k)=0.$$ EDIT: Then we can write S as {$\{ \ n \ | \ \exists x : (n-a_1)...(n-a_k)=0$ }. n-a_1)\dots(n-a_k)=0\ \}$. (Thanks David)
|
3 | fix markup and a typo | ||
|
|
||||
|
|
2 | added 79 characters in body; added 15 characters in body | ||
|
Or, very simply stated, given the finite set $S$ = {$a_1, ... , a_n$}a_k$}, consider the diophantine equation: $$(x-a_1)...(x-a_n)=0$$.$(n-a_1)...(n-a_n)=0$$. EDIT: Then we can write S as {$ \ n \ | \ \exists x : (n-a_1)...(n-a_k)=0$ }. (Thanks David) |
||||
|
|
1 |
|
||
|
Or, very simply stated, given the finite set $S$ = {$a_1, ... , a_n$}, consider the diophantine equation: $$(x-a_1)...(x-a_n)=0$$. |
||||
