# Category:Diophantine approximation

Computing portal |

Here is a list of articles in the Diophantine approximation category of the Computing portal that unifies foundations of mathematics and computations using computers.

Diophantine approximation is the quantitative study of rational number approximations to real numbers.

## Pages in category "Diophantine approximation"

The following 34 pages are in this category, out of 34 total.

- Diophantine approximation
*(computing)*

### A

- Auxiliary function
*(computing)*

### B

- Beatty sequence
*(computing)*

### D

- Davenport–Schmidt theorem
*(computing)* - Dirichlet's approximation theorem
*(computing)* - Discrepancy of hypergraphs
*(computing)* - Discrepancy theory
*(computing)* - Duffin–Schaeffer conjecture
*(computing)*

### E

- Equidistributed sequence
*(computing)* - Equidistribution theorem
*(computing)*

### F

- Faltings' product theorem
*(computing)* - Faltings's product theorem
*(computing)*

### H

- Harmonious set
*(computing)* - Heilbronn set
*(computing)* - Hurwitz's theorem (number theory)
*(computing)*

### K

- Kronecker's theorem
*(computing)*

### L

- Lagrange number
*(computing)* - Liouville number
*(computing)* - Littlewood conjecture
*(computing)* - Low-discrepancy sequence
*(computing)*

### M

- Markov constant
*(computing)* - Markov number
*(computing)* - Markov spectrum
*(computing)*

### O

- Oppenheim conjecture
*(computing)*

### P

- Proof that e is irrational
*(computing)*

### R

- Restricted partial quotients
*(computing)*

### S

- Schneider–Lang theorem
*(computing)* - Siegel's lemma
*(computing)* - Subspace theorem
*(computing)*

### T

- Three-gap theorem
*(computing)* - Roth's theorem
*(computing)*

### V

- Van der Corput inequality
*(computing)* - Van der Corput sequence
*(computing)*

### W

- Weyl's inequality
*(computing)*