Related papers: Fun With Very Large Numbers
An $(n, 1)$ string is a bound state of a D-string and $n$ fundamental strings. It may be described by a D-string with a world volume electric field turned on. As the electric field approaches its critical value, $n$ becomes large. We…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…
We introduce a refinement of the usual Ehrenfeucht-Fra\"{\i}ss\'e game. The new game will help us make finer distinctions than the traditional one. In particular, it can be used to measure the size formulas needed for expressing a given…
We give an example of two $n\times n$ chess positions, $A$ and $B$, such that (1) there is a sequence $\sigma$ of legal chess moves leading from $A$ to $B$; (2) the length of $\sigma$ cannot be less than $\exp \Theta(n)$.
A finite word $w$ is called \emph{rich} if it contains $\vert w\vert+1$ distinct palindromic factors including the empty word. Let $q\geq 2$ be the size of the alphabet. Let $R(n)$ be the number of rich words of length $n$. Let $d>1$ be a…
We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…
In this paper; we prove that all sequences can be broken up in cycles. Each cycle follows the same pattern: 1) Upward trajectory. Odd and even numbers alternate until the cycle reaches an upper bound 2) Downward trajectory. Two or more…
Let $\Omega$ be a set of positive integers and let $f:\Omega \rightarrow \Omega$ be an arithmetic function. Let $V = (v_i)_{i=1}^n$ be a finite sequence of positive integers. An integer $m \in \Omega$ has \textit{increasing-decreasing…
Throughout history, recreational mathematics has always played a prominent role in advancing research. Following in this tradition, in this paper we extend some recent work with crazy sequential representations of numbers- equations made of…
We give an explicit upper bound for non-principal Dirichlet $L$-functions on the line $s=1+it$. This result can be applied to improve the error in the zero-counting formulae for these functions.
We prove a functional extension of an exponential inequality originally proposed by Bin Zhao and proved by Xiaosheng Mou. The main result asserts that if $\alpha_1\leq \cdots\leq \alpha_n$ and $\sum_{k=1}^n \alpha_k=0$, then \[ \sum_{k=1}^n…
The problem is addressed of defining the values of functions, whose variables tend to infinity, from the knowledge of these functions at asymptotically small variables close to zero. For this purpose, the extrapolation by means of different…
Representative examples of our results are as follows. For any positive integer $N$ the equation $$ x^3+y^3=z^3+t^3, \quad x,y,z,t\in \mathbb{N}, \quad \{x,y\}\not=\{z,t\} $$ has no solutions satisfying $$ N\le x,y,z,t <…
We prove that a real number a greater than or equal to 2 is the irrationality exponent of some computable real number if and only if a is the upper limit of a computable sequence of rational numbers. Thus, there are computable real numbers…
When researchers carry out a null hypothesis significance test, it is tempting to assume that a statistically significant result lowers Prob(H0), the probability of the null hypothesis being true. Technically, such a statement is…
We generalize the classical "1089-number trick", which states that a certain combination of addition, subtraction and swapping the digits of a three-digit number will always output 1089. More precisely, we show that any pair of zero…
We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…
Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…
The "significance filter" refers to focusing exclusively on statistically significant results. Since frequentist properties such as unbiasedness and coverage are valid only before the data have been observed, there are no guarantees if we…