Related papers: A congruence sum and rational approximations
Some finite series of harmonic numbers involving certain reciprocals are evaluated. Products of such reciprocals are expanded in a sum of the individual reciprocals, leading to a computer program. A list of examples is provided.
We consider the question of approximating any real number $\alpha$ by sums of $n$ rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2} + ... + \frac{a_n}{q_n}$ with denominators $1 \leq q_1, q_2, ..., q_n \leq N$. This leads to an inquiry on…
Given positive coprime integers $a$ and $b$ and a natural number $h$, we obtain reciprocity relations which can be used to quickly evaluate summations like $\sum_{i=1}^{h} \{\frac{ib}{a}\}^2$ and $\sum_{i=1}^{h} \lfloor \frac{ib}{a}…
We prove a simple inequality for a sum of squares of norms of two vectors in an inner product space. Next, using this inequality we derive the so--called "reverse uncertainty relation" and analyze its properties.
We give necessary and sufficient topological conditions for a simple closed curve on a real rational surface to be approximable by smooth rational curves. We also study approximation by smooth rational curves with given complex…
We give a simple proof for the reciprocity formulas of character Dedekind sums associated with two primitive characters, whose modulus need not to be same, by utilizing the character analogue of the Euler-MacLaurin summation formula.…
In the present paper and as an application of Roth's theorem concerning the rational approximation of algebraic numbers, we give a sufficient condition that will assure us that a series of positive rational terms is a transcendental number.…
We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.
A row and a column of two linear relations in Hilbert spaces are presented respectively as a sum and an intersection of two linear relations. As an application, necessary and sufficient conditions for the adjoint of a column to be a row are…
In this paper we investigate the sums of reciprocals to an arithmetic progression taken modulo one, that is sums of $\{n\alpha-\gamma\}^{-1}$, where $\alpha$ and $\gamma$ are real parameters and $\{\,\cdot\,\}$ is the fractional part of a…
We introduce and investigate a series of matching problems for patterns with variables under Simon's congruence. Our results provide a thorough picture of these problems' computational complexity.
In this paper, we develop a method of evaluating general exponential sums with rational amplitude functions for multiple variables which complements works by T. Cochrane and Z. Zheng on the single variable case. As an application, for…
The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conjugate (or cyclic shifts of each other). The notion of…
Mathematical proofs are often said to justify their conclusions by indicating the existence of a corresponding formal derivation. We argue that this widespread view relies on an under-examined notion of correspondence, or what it means for…
A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…
We compute the constant of approximation for an arbitrary rational point on an arbitrary smooth cubic hypersurface $X$ over a number field $k$, provided that there is a $k$-rational line somewhere on $X$. In the process, we verify the Coba…
In this note we associate a sequence of non-negative integers to any convergent series of positive real numbers and study this sequence for the series $\sum_{n \geq 1} n^{-k}$ where $k$ is an integer $\geq 2$.
Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in…
We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n,…
The goal of this survey is to introduce all the necessary concepts and theorems to provide a rigorous and self-contained proof of the Law of Quadratic Reciprocity and see how this is a useful tool to obtain results such as the problem of…