Results 221 to 230 of about 3,148,152 (262)
Some of the next articles are maybe not open access.
A Diophantine Equation Related to the Sum of Squares of Consecutive k -Generalized Fibonacci Numbers
The Fibonacci quarterly, 2014Let (Fn)n≥0 be the Fibonacci sequence given by Fn+2 = Fn+1 + Fn, for n ≥ 0, where F0 = 0 and F1 = 1. There are several interesting identities involving this sequence such as F 2 n +F 2 n+1 = F2n+1, for all n ≥ 0.
Ana Paula Chaves, D. Marques
semanticscholar +1 more source
2008
Abstract As an appetizer, here is a typical problem of the kind Sections 1–5 should equip you to solve. You are invited to try it as soon as you wish. You may find it hard for now, but by the end of Section 5, where its solution is given, it should not look difficult to you.
Alexander Zawaira, Gavin Hitchcock
openaire +2 more sources
Abstract As an appetizer, here is a typical problem of the kind Sections 1–5 should equip you to solve. You are invited to try it as soon as you wish. You may find it hard for now, but by the end of Section 5, where its solution is given, it should not look difficult to you.
Alexander Zawaira, Gavin Hitchcock
openaire +2 more sources
1986
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Quadratic Diophantine Equations
200434.1. We take a nondegenerate quadratic space \((V,\,{\varphi})\) of dimension \(\,n\,\) over a local or global field F in the sense of §21.1.
openaire +1 more source
1995
Abstract Diophantus worked in Alexandria probably in the middle of the third century AD (some authors suggest early in the second century AD). His six or seven surviving books show that he had a highly developed understanding of many number theoretical problems.
openaire +1 more source
Abstract Diophantus worked in Alexandria probably in the middle of the third century AD (some authors suggest early in the second century AD). His six or seven surviving books show that he had a highly developed understanding of many number theoretical problems.
openaire +1 more source
On solutions of the diophantine equation $$\varvec{F_{n}-F_{m}=3^{a}}$$
Proceedings - Mathematical Sciences, 2019B. D. Bitim, R. Keskin
semanticscholar +1 more source
1992
Abstract A basic property of integers is that they can be expressed uniquely as a product of prime numbers. In this chapter we investigate other rings having a similar type of unique factorization property. As a means of motivating our investigation, let us begin by considering two number theoretic puzzles involving so-called Diophantine
openaire +1 more source
Abstract A basic property of integers is that they can be expressed uniquely as a product of prime numbers. In this chapter we investigate other rings having a similar type of unique factorization property. As a means of motivating our investigation, let us begin by considering two number theoretic puzzles involving so-called Diophantine
openaire +1 more source
On a Diophantine equation involving primes
The Ramanujan journal, 2018Yingchun Cai
semanticscholar +1 more source
Notes on diophantine equations
1953Verschiedene Bemerkungen und Parameterlösungen zu den Diophantischen Gleichungen \[ x^2+ y^2 + z^2 = 1, \quad A(x^2+ y^2 + z^2) = B(xy + x z + yz), \] und \[ (r^4 + s^4) x^4 - y^4 = z^2 \quad\text{und}\quad (r^4 - s^4) x^4 + y^4 = z^2. \]
openaire +3 more sources
On the Diophantine equation (x − d)4 + x4 + (x + d)4 = yn
, 2017Zhong-Can Zhang
semanticscholar +1 more source

