(ap-1 – 1)/pk with arbitrary k Abstract: Fermat quotients with arbitrary k are considered on an introduc-tory level. While the ongoing research on fermat-quotients is concerned with the very difficult problem to find an appropriate primenumber p for k>1 and a given base a, the article here is primarily concerned with the much simpler problem of finding appropriate bases a if the primenumber p is given. In chapter 3 I do a first step into the more difficult problem of finding primes for given small bases. I begin generalizing the problem to compos-ite n instead of prime p, making it an "Euler-quotient " to get more heuris
The project aims to deliver sufficient mathematical background to understand a partial proof, due to...
The objective of this paper is to answer the open problem proposed about the validity of phi-Euler’s...
In 1637 Fermat wrote: “It is impossible to separate a cube into two cubes, or a biquadrate into two ...
For centuries, mathematicians have been exploring the idea of prime numbers. How do we find them? Ar...
Fermat's Last Theorem—which we shall abbreviate to FLT—is the (as yet unproved) assertion that ...
Let S be the set of all positive integers with prime divisors from a fixed finite set of primes. Alg...
Abstract The focus of this thesis is on two functions: the exponential function and Euler’s factori...
In this thesis we study the Diophantine equation xp - Dy2p = z2; gcd(x; z) = 1; p prime: We combine ...
In the first part of this thesis various problems in diophantine approximation are considered, which...
We show that the equation $\frac{x^p + y^p}{x+y} = p^e z^q$ has no solutions in coprime integers $x,...
AbstractLet S be the set of all positive integers with prime divisors from a fixed finite set of pri...
1637 Fermat wrote: “It is impossible to separate a cube into two cubes, or a biquadrate into two biq...
Deep methods from the theory of elliptic curves and modular forms have been used to prove Fermat's l...
AbstractThis paper continues the search to determine for what exponents n Fermat's Last Theorem is t...
Fermat's Little Theorem states that xp=x(modp) for x∈N and primep, and so identifies an integer-valu...
The project aims to deliver sufficient mathematical background to understand a partial proof, due to...
The objective of this paper is to answer the open problem proposed about the validity of phi-Euler’s...
In 1637 Fermat wrote: “It is impossible to separate a cube into two cubes, or a biquadrate into two ...
For centuries, mathematicians have been exploring the idea of prime numbers. How do we find them? Ar...
Fermat's Last Theorem—which we shall abbreviate to FLT—is the (as yet unproved) assertion that ...
Let S be the set of all positive integers with prime divisors from a fixed finite set of primes. Alg...
Abstract The focus of this thesis is on two functions: the exponential function and Euler’s factori...
In this thesis we study the Diophantine equation xp - Dy2p = z2; gcd(x; z) = 1; p prime: We combine ...
In the first part of this thesis various problems in diophantine approximation are considered, which...
We show that the equation $\frac{x^p + y^p}{x+y} = p^e z^q$ has no solutions in coprime integers $x,...
AbstractLet S be the set of all positive integers with prime divisors from a fixed finite set of pri...
1637 Fermat wrote: “It is impossible to separate a cube into two cubes, or a biquadrate into two biq...
Deep methods from the theory of elliptic curves and modular forms have been used to prove Fermat's l...
AbstractThis paper continues the search to determine for what exponents n Fermat's Last Theorem is t...
Fermat's Little Theorem states that xp=x(modp) for x∈N and primep, and so identifies an integer-valu...
The project aims to deliver sufficient mathematical background to understand a partial proof, due to...
The objective of this paper is to answer the open problem proposed about the validity of phi-Euler’s...
In 1637 Fermat wrote: “It is impossible to separate a cube into two cubes, or a biquadrate into two ...