Lesson plan

Integer relation algorithm

An integer relation between a set of real numbers x 1 , x 2 , ..., x n is a set of integers a 1 , a 2 , ..., a n , not all 0, such that : a_1x_1 + a_2x_2 + \cdots + a_nx_n = 0.\, 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.

Back to article

Article summary

An integer relation between a set of real numbers x 1 , x 2 , ..., x n is a set of integers a 1 , a 2 , ..., a n , not all 0, such that : a_1x_1 + a_2x_2 + \cdots + a_nx_n = 0.\, 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.

Key claims

  1. publication date: 1979 — source: Wikipedia · confidence 0.95

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. The record states that the publication date is "1979". What evidence would count against this claim?
  3. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  4. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

  1. Wikipedia https://en.wikipedia.org/w/index.php?oldid=1366506437

Key claims and bibliography are generated from the same tracked claims and sources as the article page.