# On Euler's ø-Function

@article{BakerOnE,
title={On Euler's {\o}-Function},
author={Henry Frederick Baker},
journal={Proceedings of The London Mathematical Society},
pages={30-32}
}
• H. Baker
• Published 1 November 1889
• Mathematics
• Proceedings of The London Mathematical Society
On the error term of a lattice counting problem
• Mathematics
• 2017
We improve the error terms of some estimates related to counting lattices from recent work of L. Fukshansky, P. Guerzhoy and F. Luca (2017). This improvement is based on some analytic techniques, in
Division polynomials and intersection of projective torsion points
• Mathematics
• 2016
Given two elliptic curves, each of which is associated with a projection map that identifies opposite elements with respect to the natural group structure, we investigate how their corresponding
Second-Order Partial Differentiation of Real Binary Functions
• Mathematics
Formaliz. Math.
• 2009
This article defines second- order partial differentiation of real binary functions and discusses the relation of second-order partial derivatives and partial derivatives defined in [17].
Has Carmichael's Totient Conjecture Been Proven? No, No, it has not.
Carmichael’s totient conjecture lacks the name recognition of such media darlings as the twin prime conjecture or the Riemann hypothesis, but in 2018 this open question in number theory blipped
Results for Wieferich Primes
Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ and $z \geq x$ be large numbers. The exact asymptotic formula for the number of Wieferich primes $p$ such that $v^{p-1} \equiv 1 \bmod p^2$ in
The Matiyasevich Theorem. Preliminaries
Summary In this article, we prove selected properties of Pell’s equation that are essential to finally prove the Diophantine property of two equations. These equations are explored in the proof of
Generalized Fibonacci Primitive Roots.
This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.
Fermat’s Little Theorem via Divisibility of Newton’s Binomial
Fermat’s Little Theorem is proved in a classical way, on the basis of divisibility of Newton's binomial, which provides a good example, how the application of registrations could shorten the length of Mizar proofs.