Seventeen lines and one-hundred-and-one points
Woeginger, Gerhard J. (2004) Seventeen lines and one-hundred-and-one points. Theoretical Computer Science, 321 (2-3). pp. 415-421. ISSN 0304-3975
Restricted to UT campus only: Request a copy
|Abstract:||We investigate a curious problem from additive number theory: Given two positive integers S and Q, does there exist a sequence of positive integers that add up to S and whose squares add up to Q? We show that this problem can be solved in time polynomially bounded in the logarithms of S and Q.
As a consequence, also the following question can be answered in polynomial time: For given numbers n and m, do there exist n lines in the Euclidean plane with exactly m points of intersection?
|Copyright:||© 2004 Elsevier|
Electrical Engineering, Mathematics and Computer Science (EEMCS)
|Link to this item:||http://purl.utwente.nl/publications/76359|
|Export this item as:||BibTeX|
Daily downloads in the past month
Monthly downloads in the past 12 months
Repository Staff Only: item control page
Metis ID: 219741