On the Euler function of Fibonacci numbers.
For a positive integer we write for the Euler function of . In this note, we show that if is a fixed positive integer, then the equation has only finitely many positive integer solutions .
For a prime p > 2, an integer a with gcd(a,p) = 1 and real 1 ≤ X,Y < p, we consider the set of points on the modular hyperbola . We give asymptotic formulas for the average values and with the Euler function φ(k) on the differences between the components of points of .
We introduce the real valued real analytic function κ(t) implicitly defined by (κ(0) = -1/2). By studying the equation κ(t) = n (without making any unproved hypotheses), we show that (and how) this function is closely related to the (exact) position of the zeros of Riemann’s ζ(s) and ζ’(s). Assuming the Riemann hypothesis and the simplicity of the zeros of ζ(s), it follows that the ordinate of the zero 1/2 + iγₙ of ζ(s) is the unique solution to the equation κ(t) = n.
We consider an approximation to the popular conjecture about representations of integers as sums of four squares of prime numbers.
Let be a totally real cyclic number field of degree that is the product of two distinct primes and such that the class number of the -th cyclotomic field equals 1. We derive certain necessary and sufficient conditions for the existence of a Minkowski unit for .