Skip to main content

Questions tagged [infinite-sequences]

Filter by
Sorted by
Tagged with
9 votes
1 answer
748 views

Magic square on an infinite lattice

This question came to me while reading the discussion of magic square in the complex plane with equal integrals along every horizontal, vertical and diagonal "magic square in the complex plane with ...
Gerry Myerson's user avatar
6 votes
2 answers
2k views

References for the result that $\sqrt{n}$ is equidistributed mod 1

It is not difficult to show (even without Weyl criterion) that the sequence $\sqrt{n}$, $n=1,2,\ldots$ is equidistributed mod 1. However, I need a reference to this result. Can you help me? Thanks.
Richard Bonne's user avatar
5 votes
2 answers
379 views

Asymptotic rate for $\sum\binom{n}k^{-1}$

This MO question prompted me to ask: What is the second order asymptotic growth/decay rate for the sum $$\sum_{k=0}^n\frac1{\binom{n}k}$$ as $n\rightarrow\infty$?
T. Amdeberhan's user avatar
3 votes
1 answer
475 views

Is there a summation method where the divergent series $S = U_0+U_1+U_2+\dots$ converges to a finite value?

Consider the function $$ M(v) = \frac{m_0}{\sqrt{1 - \left(\frac{v}{c}\right)^2}}, $$ where $v \in \left]-c;c\right[$, $m_0\in\mathbb{R}^{*+}$, and $c=3\cdot10^8$. Let $(U_n)$ be a sequence with ...
z.10.46's user avatar
  • 33
3 votes
1 answer
218 views

Is there a two-dimensional Higman's lemma?

A string over a finite alphabet $A$ can be thought of as a function $f:\{1,2,...,m\} \rightarrow A$ for some natural number $m$. A 2-Dim string over $A$ is a function $f$ where $f:\{1,2,\ldots,m\}\...
Charles Rackoff's user avatar
3 votes
1 answer
201 views

"Approximating" linear recursion with homogenous polynomial coefficients by linear recursion with constant coefficients

In a lecture I once attended, I remember the speaker using a result of the following nature: $``$Let $\{A_n\}_{n=1}^\infty \subset \mathbb R$ be a sequence satisfying a recursion of the form $$P(n) ...
asrxiiviii's user avatar
2 votes
1 answer
119 views

A second attempt at a two-dimensional Higman's Lemma

Let $A$ be a fixed finite alphabet. If $s$ and $t$ are finite strings over $A$, define $s\leq t$ if $s$ can be obtained by deleting zero or more characters from $t$. Higman's Lemma states that if $s_1,...
Charles Rackoff's user avatar