skip to content
The Chinese Remainder Problem and Polynomial Interpolation. Preview this item
ClosePreview this item
Checking...

The Chinese Remainder Problem and Polynomial Interpolation.

Author: I J Schoenberg; WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER.
Publisher: Ft. Belvoir Defense Technical Information Center NOV 1985.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
The Chinese Remainder Problem (Ch. R.P) is to find an integer x such that x = a sub i(mod m sub i) (i=1, ..., n), where mi are pairwise relatively prime moduli and a sub i are given integers. In the 1950's I learnt orally from Marcel Riesz that the CH. R.P. is an analogue of the polynomial interpolation problem P(x sub i) = Y sub i(i=1, ..., n), P(x) is a subset of pi sub n-1, and that the Ch. R.P. can be solved by  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: I J Schoenberg; WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER.
OCLC Number: 227666912
Description: 10 p.

Abstract:

The Chinese Remainder Problem (Ch. R.P) is to find an integer x such that x = a sub i(mod m sub i) (i=1, ..., n), where mi are pairwise relatively prime moduli and a sub i are given integers. In the 1950's I learnt orally from Marcel Riesz that the CH. R.P. is an analogue of the polynomial interpolation problem P(x sub i) = Y sub i(i=1, ..., n), P(x) is a subset of pi sub n-1, and that the Ch. R.P. can be solved by an analogue of Lagrange's interpolation formula. The author now adds the remark that the Ch. R.P. can be solved, even more economically, by an analogue of Newton formula using successive divided differences.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227666912>
library:oclcnum"227666912"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227666912>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:datePublished"NOV 1985"
schema:datePublished"1985"
schema:description"The Chinese Remainder Problem (Ch. R.P) is to find an integer x such that x = a sub i(mod m sub i) (i=1, ..., n), where mi are pairwise relatively prime moduli and a sub i are given integers. In the 1950's I learnt orally from Marcel Riesz that the CH. R.P. is an analogue of the polynomial interpolation problem P(x sub i) = Y sub i(i=1, ..., n), P(x) is a subset of pi sub n-1, and that the Ch. R.P. can be solved by an analogue of Lagrange's interpolation formula. The author now adds the remark that the Ch. R.P. can be solved, even more economically, by an analogue of Newton formula using successive divided differences."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1862841766>
schema:inLanguage"en"
schema:name"The Chinese Remainder Problem and Polynomial Interpolation."@en
schema:numberOfPages"10"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.