|
Title
|
|
|
|
An extension of the perplexing polynomial puzzle
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| Originally published as a puzzle in 2005, the Perplexing Polynomial Puzzle indeed is perplexing: any given polynomial p(x) with nonnegative integer coefficients can be completely determined by just two evaluations. In this article, an extension is made to polynomials with arbitrary integer coefficients, by considering a simple translation x↦x+k with k∈N such that the result is a new polynomial with only nonnegative integer coefficients on which the original solution can be used. A proof is given that this is indeed always possible, and a method is constructed to determine a suitable k to do so. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
The college mathematics journal. - Washington, D.C.
|
|
|
Publication
|
|
|
|
Washington, D.C.
:
2023
|
|
|
ISSN
|
|
|
|
0746-8342
|
|
|
DOI
|
|
|
|
10.1080/07468342.2023.2225391
|
|
|
Volume/pages
|
|
|
|
54
:4
(2023)
, p. 299-307
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (open access)
|
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|