English
Related papers

Related papers: Pell's equation without irrational numbers

200 papers

D. S. Hong and P. Pongsriiam have provided a necessary and sufficient condition for the generating function for Fibonacci numbers (resp. the Lucas numbers) to be an integer value, for rational numbers. In other words, their results relate…

Number Theory · Mathematics 2019-09-16 Yuji Tsuno

An alternative formula is presented for the evaluation of the zeta function values $\zeta(2k)$ without the need for Bernoulli numbers. Our formula is recursive, and improves the efficiency with which we can calculate large values of the…

Numerical Analysis · Mathematics 2011-11-18 Srinivasan Arunachalam

In this paper, we revisit the classical problem of Bratu differential equation in one-dimension. While it is known that the finite difference discretized form of continuous Bratu equation gives rise to spurious bifurcations, we show that…

Dynamical Systems · Mathematics 2026-05-29 Shrinidhi S. Pandurangi , Utkarsh S. Nikam

Pellet's theorem determines when the zeros of a polynomial can be separated into two regions, based on the presence or absence of positive roots of an auxiliary polynomial, but does not provide a method to verify its conditions or to…

Numerical Analysis · Mathematics 2012-10-09 Aaron Melman

The set of all $\ell$-zero-sumfree subsets of $\mathbb{Z}/n\mathbb{Z}$ is a simplicial complex denoted by $\Delta_{n,\ell}$ We create an algorithm via defining a set of integer partitions we call $(n,\ell)$-congruent partitions in order to…

Combinatorics · Mathematics 2019-06-26 Ashleigh Adams , Carole Hall , Eric Stucky

This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional…

Computation and Language · Computer Science 2016-08-23 Subhro Roy , Dan Roth

Assuming a deep but standard conjecture in the Langlands programme, we prove Fermat's Last Theorem over $\mathbb Q(i)$. Under the same assumption, we also prove that, for all prime exponents $p \geq 5$, Fermat's equation $a^p+b^p+c^p=0$…

Number Theory · Mathematics 2018-05-15 George Turcas

We compute the Ext-algebra of the Brauer tree algebra associated to a line with no exceptional vertex.

Representation Theory · Mathematics 2021-02-01 Olivier Dudas

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

Logic · Mathematics 2026-01-06 Saharon Shelah

We show that to determine all solvable elements in the Weyl algebra is closely related to the Dixmier's open question. Sufficient conditions for an elements being unsolvable are given, and properties of solvable elements are obtained.

Rings and Algebras · Mathematics 2017-03-14 Chaowen Zhang

A general method for solving linear differential equations of arbitrary order, is used to arrive at new representations for the solutions of the known differential equations, both without and with a source term. A new quasi-solvable…

Mathematical Physics · Physics 2008-04-24 N. Gurappa , Pankaj K. Jha , Prasanta K. Panigrahi

A numerical explicit method to evaluates transient solutions of linear partial differential non-homogeneous equation with constant coefficients is proposed.

Numerical Analysis · Computer Science 2010-11-11 Hiroshi Abe

We formalise the well-known rules of partial differentiation in a version of equational logic with function variables and binding constructs. We prove the resulting theory is complete with respect to polynomial interpretations. The proof…

Logic in Computer Science · Computer Science 2020-08-05 Gordon D. Plotkin

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

Numerical Analysis · Mathematics 2025-10-20 H. Hakopian

We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…

Combinatorics · Mathematics 2012-05-03 B. S. Kochkarev

We derive closed formulas for the number of $k$-coloured partitions and the number of plane partitions of $n$ in terms of the Bell polynomials.

General Mathematics · Mathematics 2020-12-22 Sumit Kumar Jha

A new family of generalized Pell numbers was recently introduced and studied by Br\'od \cite{Dorota}. These number possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of generalized Pell numbers can…

Number Theory · Mathematics 2020-10-28 Helmut Prodinger

The statistical physics approach to the number partioning problem, a classical NP-hard problem, is both simple and rewarding. Very basic notions and methods from statistical mechanics are enough to obtain analytical results for the phase…

Condensed Matter · Physics 2007-05-23 Stephan Mertens

In this paper, we give an algorithm for finding general rational solutions of a given first-order ODE with parametric coefficients that occur rationally. We present an analysis, complete modulo Hilbert's irreducibility problem, of the…

Symbolic Computation · Computer Science 2025-07-10 Sebastian Falkensteiner , Rafael Sendra

The BRST structure of polynomial Poisson algebras is investigated. It is shown that Poisson algebras provide non trivial models where the full BRST recursive procedure is needed. Quadratic Poisson algebras may already be of arbitrarily high…

High Energy Physics - Theory · Physics 2008-11-26 A. Dresse , M. Henneaux