Loading [MathJax]/extensions/MathZoom.js
Displaying 281 –
300 of
388
Skolem conjectured that the "power sum" A(n) = λ₁α₁ⁿ + ⋯ + λₘαₘⁿ satisfies a certain local-global principle. We prove this conjecture in the case when the multiplicative group generated by α₁,...,αₘ is of rank 1.
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality , with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
In a recent paper, Freitas and Siksek proved an asymptotic version of Fermat’s Last Theorem for many totally real fields. We prove an extension of their result to generalized Fermat equations of the form , where A, B, C are odd integers belonging to a totally real field.
Currently displaying 281 –
300 of
388