Related papers: Pell's equation without irrational numbers
There are several versions of Bell's inequalities, proved in different contexts, using different sets of assumptions. The discussions of their experimental violation often disregard some required assumptions and use loose formulations of…
In this article, we present an iterative method to find simple roots of nonlinear equations, that is, to solving an equation of the form $f(x) = 0$. Different from Newton's method, the method we purpose do not require evaluation of…
One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…
We provide a simple method to compute the Betti numbers if the Stanley-Reisner ideal of a simplicial tree and its Alexander dual.
New formulas for approximation of zeta-constants were derived on the basis of a number-theoretic approach constructed for the irrationality proof of certain classical constants. Using these formulas it's possible to approximate certain…
In this paper, we investigate the generalized Pell sequence, the generalized complex Pell sequence and the generalized dual Pell sequence using the Pell numbers. We obtain special cases of these sequences. Furthermore, we give recurrence…
We reduce the problem of constructing asymptotically good tree codes to the construction of triangular totally nonsingular matrices over fields with polynomially many elements. We show a connection of this problem to Birkhoff interpolation…
In this paper, we explore the relationship between repdigits and associated Pell numbers, specifically focusing on two main aspects: expressing repdigits as the difference of two associated Pell numbers, and identifying which associated…
We prove peeling estimates for the small data solutions of the Maxwell Klein Gordon equations with non-zero charge and with a non-compactly supported scalar field, in $(3+1)$ dimensions. We obtain the same decay rates as in an earlier work…
The continued fraction expansion of an irrational number $\alpha$ is eventually periodic if and only if $\alpha$ is a quadratic irrationality. However, very little is known regarding the size of the partial quotients of algebraic real…
After Abel Ruffini theorem and Galois Theory the search for a method or formula to solve quintic equation ends. This paper discuss about the radical solution of quintic equation using a method that could be proved in some simple steps. A…
The theorem below gives another way of computing the distribution prime counting function without using recursion and the values of Prime numbers
In this article we propose a new fractional derivative without singular kernel. We consider the potential application for modeling the steady heat-conduction problem. The analytical solution of the fractional-order heat flow is also…
Given a tree of weighted vertices, it is sometimes possible to break the tree into two equally-weighted subtrees within an allowable error. We give a fast algorithm that finds an edge which breaks the tree into equal-weight components or…
We present a technique for reducing the order of polynomial-like iterative equations; in particular, we answer a question asked by Wenmeng Zhang and Weinian Zhang. Our method involves the asymptotic behaviour of the sequence of consecutive…
In this paper, we prove that there exists a unique solution to the Dirichlet boundary value problem for a general class of semilinear second order elliptic partial differential equations. Our approach is probabilistic. The theory of…
I present a simple algorithm for enumerating the trees generated by a Context Free Grammar (CFG). The algorithm uses a pairing function to form a bijection between CFG derivations and natural numbers, so that trees can be uniquely decoded…
Poisson's equation is the canonical elliptic partial differential equation. While there exist fast Poisson solvers for finite difference and finite element methods, fast Poisson solvers for spectral methods have remained elusive. Here, we…
Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as…
This paper presents iterative methods for solving tensor equations involving the T-product. The proposed approaches apply tensor computations without matrix construction. For each initial tensor, these algorithms solve related problems in a…