Skip to main content

Questions tagged [diophantine-approximation]

For questions about approximating real numbers by rational numbers.

0 votes
0 answers
59 views

Suppose we define a binary sequence $\varepsilon _{k}$ such that it satisfies the equation $$\varepsilon _{k} =\left\lceil \left(\frac{3}{2}\right)^{k}\left( 8-\frac{1}{3}\sum _{j=0}^{\infty }\left(\...
Val0's user avatar
  • 177
4 votes
1 answer
177 views

Let $z_1 , \dotsc , z_k \in \mathbb{C}$. Is it true that there exists $n \in \mathbb{Z}^+$ such that $\operatorname{Re} ( z_j^n ) \geq 0$ for each $j$? Let $A = [ 0 , 1/4 ] \cup [ 3/4 , 1 ]$. By ...
Matemáticos Chibchas's user avatar
18 votes
0 answers
359 views

Is it true that the sequence $\{n \sin(n^n/2)\}$ is unbounded but does not tend to infinity? The question was from an introductory calculus class. Here, in this class, “a sequence $\{a_n\}$ tends to ...
Lei Zhao's user avatar
  • 636
3 votes
0 answers
144 views

Introduction : Put $r_n=2^n \{ 1.5^n \} $, i.e : the remainder of $3^n \pmod {2^n}$. If the following inequality holds: $\forall n>1 , r_n<2^n-1.5^n$ (an open problem). It has been proved that ...
Lhachimi's user avatar
  • 638
2 votes
0 answers
360 views

The Problem : $\forall x,d>0 \quad d\mid 5 \cdot 2^x +9 \implies v_2(d+27) \le x+3 \quad(\star)$ However, I know how to prove this but I'm asking for a new method to prove it ! Why a new method ? ...
Lhachimi's user avatar
  • 638
1 vote
0 answers
51 views

Consider the equilateral triangular (Eisenstein) lattice $L = \mathbb{Z}\langle a, b \rangle \subset \mathbb{R}^2$ with $a = (1, 0)$ and $b = \left(\frac{1}{2}, \frac{\sqrt{3}}{2}\right)$. A wrap is ...
user avatar
0 votes
1 answer
75 views

I'm looking for a known or clean algorithm for the following simultaneous Diophantine approximation problem. I have $n$ real numbers $\vec{a} = (a_1, a_2, \ldots, a_n) \in \mathbb{R}^n$ such that $0 \...
Alien's user avatar
  • 711
6 votes
1 answer
227 views

I have no idea how to prove if the following series converge: $$ \sum_{n=1}^{+\infty}\frac{(n\varphi-\lfloor n\varphi\rfloor)^n}{n} $$ where $\varphi$ is the golden ratio. None criterion clearly ...
Mathland's user avatar
  • 744
1 vote
2 answers
441 views

Motivation : In a collatz orbit (of odd numbers) , one of the most reasonable questions to ask are : Can we keep dividing consecutively by $2^p$ forever ? ($p>1$) If not, what's the exact number ...
Lhachimi's user avatar
  • 638
3 votes
2 answers
460 views

Background: The Collatz conjecture is a famous unsolved problem in mathematics. It asserts that, starting from any positive integer, repeatedly applying the rules “if even, divide by 2; if odd, ...
Safwan Sayeem's user avatar
0 votes
0 answers
34 views

I was reading about the Dirichlet and Kronecker approximation theorem. The theorem by Dirichlet says that for any $\theta\in\mathbb R$, $N\in\mathbb N$ there exists some coprime $(h,k)$ where $0<k\...
Brightsun's user avatar
  • 424
0 votes
0 answers
46 views

I know that ratios of positive integers can approximate nonnegative real numbers arbitrarily well because for all real numbers $r \ge 0$ and $\epsilon > 0$ there are some integers $a, b > 0$ ...
codebender's user avatar
4 votes
2 answers
450 views

The conjecture : $\forall n>1, d\mid 3^n-2^n \Rightarrow v_2(d+1)<n$ where $v_2(x)$ denotes the $2$-adic valuation of $x$, i.e the highest power of $2$ that divides $x$ e.g : $v_2(12)=2$ since ...
Lhachimi's user avatar
  • 638
1 vote
0 answers
91 views

We know the basic fact that if $n \equiv 0 \pmod p$ then $|n| \geq p$ (provided $n \neq 0$). Let $\alpha$ be a non-zero algebraic number and suppose that there is a prime ideal $\mathcal{P}$ in $\...
NumDio's user avatar
  • 515
3 votes
2 answers
393 views

I found that $\frac{\pi}{\log(13)}$ is approximated by the fraction $\frac{52378158}{42764081}$ with remarkable precision. Using Wolfram Alpha: $$ \operatorname{N}\left[\frac{\pi}{\frac{52378158}{...
Eric Needham's user avatar

15 30 50 per page
1
2 3 4 5
37