The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: How hard is this?
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  

Posts: 14
Registered: 12/12/04
How hard is this?
Posted: Jun 13, 1996 11:09 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Hello all,

Here is a decision problem:

Given a (large) natural number N, a (small) natural number d
and bounds C and M, are there natural numbers m<M and c_i<C
(for each 0 \le i \le d) such that

N = c_d m^d + c_(d-1) m^(d-1) + ... + c_0 ?

In other words, is there a polynomial of degree d with co-
efficients less than C that takes value N at a point less
than M ?

(For example one might take M = C = O( N^(1/(d+1)) )

Does anyone know anything about the complexity of this or any
even vaguely similar problems?



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.