Integer relation algorithm
An integer relation between a set of real numbers x1, x2, ..., xn is a set of integers a1, a2, ..., an, not all 0, such that An integer relation algorithm is an algorithm for finding integer relations. Specifically, given a set of real numbers known to a given precision, an integer relation algorithm will either find an integer relation between them, or will determine that no integer relation exists with coefficients whose magnitudes are less than a certain upper bound.
- Comment
- enAn integer relation between a set of real numbers x1, x2, ..., xn is a set of integers a1, a2, ..., an, not all 0, such that An integer relation algorithm is an algorithm for finding integer relations. Specifically, given a set of real numbers known to a given precision, an integer relation algorithm will either find an integer relation between them, or will determine that no integer relation exists with coefficients whose magnitudes are less than a certain upper bound.
- Has abstract
- enAn integer relation between a set of real numbers x1, x2, ..., xn is a set of integers a1, a2, ..., an, not all 0, such that An integer relation algorithm is an algorithm for finding integer relations. Specifically, given a set of real numbers known to a given precision, an integer relation algorithm will either find an integer relation between them, or will determine that no integer relation exists with coefficients whose magnitudes are less than a certain upper bound.
- Is primary topic of
- Integer relation algorithm
- Label
- enInteger relation algorithm
- Link from a Wikipage to an external page
- web.archive.org/web/20080422084455/http:/oldweb.cecm.sfu.ca/organics/papers/bailey/paper/html/paper.html
- crd.lbl.gov/~dhbailey/dhbpapers/tenproblems.pdf
- Link from a Wikipage to another Wikipage
- Algebraic number
- Algorithm
- Almost integer
- Arbitrary precision arithmetic
- Arjen Lenstra
- Bailey–Borwein–Plouffe formula
- Category:Number theoretic algorithms
- Claus P. Schnorr
- Closed-form expression
- Continued fraction
- David H. Bailey (mathematician)
- Eric W. Weisstein
- Euclidean algorithm
- Experimental mathematics
- Factorization of polynomials
- Helaman Ferguson
- Hendrik Lenstra
- Infinite product
- Integral
- Inverse Symbolic Calculator
- Jack Dongarra
- Jeffrey Lagarias
- Johan Håstad
- Jonathan Borwein
- László Lovász
- Lenstra–Lenstra–Lovász lattice basis reduction algorithm
- Logistic map
- Multiple zeta function
- Numerical method
- Pi
- Plouffe's Inverter
- Quantum field theory
- R.W. Forcade
- Series (mathematics)
- Simon Plouffe
- Upper bound
- SameAs
- 4nTvE
- Integer relation algorithm
- m.03ccvkj
- Q6042598
- Алгоритм поиска целочисленных соотношений
- Алгоритм цілочисельного відношення
- Subject
- Category:Number theoretic algorithms
- WasDerivedFrom
- Integer relation algorithm?oldid=1081697113&ns=0
- WikiPageLength
- 7827
- Wikipage page ID
- 13644054
- Wikipage revision ID
- 1081697113
- WikiPageUsesTemplate
- Template:Number theoretic algorithms
- Template:Pi
- Template:Reflist