Add to ORKGWe find the form of all solutions to φ(n) |σ(n) with three or fewer prime factors, except when the quotient is 4 and n is even.
From the Washington University Senior Honors Thesis Abstracts (WUSHTA), 2017. Published by the Offic...
For any positive integer k let φ(k), σ(k), and τ(k) be the Euler function of k, the divisor sum func...
Abstract. We study the number and nature of solutions of the equation (n) = (n + k), where denotes ...
We find the form of all solutions to ø(n) | σ(n) with three or fewer prime factors, except when the ...
We prove that the only solutions to the equation σ(n)=2φ(n) with at most three distinct prime factor...
We study integers n > 1 satisfying the relation σ(n) = γ(n) ² , where σ(n) and γ(n) are the sum of d...
ABSTRACT. We show that the equation φ(a) = σ(b) has infinitely many solutions, where φ is Euler’s t...
Let denotes the sum of the positive divisors of the positive integer and be the Euler’s totient f...
We study integers n > 1 satisfying the relation σ(n) = γ(n)², where σ(n) and γ(n) are the sum of div...
We study the sum [equation omitted for formating reasons] of consecutive iterations of the Euler fun...
Let φ denote the Euler function. For a fixed integer k ≠ 0, we study positive integers n for which t...
AbstractLet N be sufficiently large odd integer. It is proved that the equation N=n1+n2+n3 has solut...
Abstract. We study the solutions of the equation φ(Cm)/φ(Cn) = r, where r is a fixed rational numbe...
We give upper bounds for the number of solutions to congruences with the Euler function φ(n) and wit...
If n is a positive integer such that ϕ(n)σ(n) = m² for some positive integer m, then m≤n. We put m =...
From the Washington University Senior Honors Thesis Abstracts (WUSHTA), 2017. Published by the Offic...
For any positive integer k let φ(k), σ(k), and τ(k) be the Euler function of k, the divisor sum func...
Abstract. We study the number and nature of solutions of the equation (n) = (n + k), where denotes ...
We find the form of all solutions to ø(n) | σ(n) with three or fewer prime factors, except when the ...
We prove that the only solutions to the equation σ(n)=2φ(n) with at most three distinct prime factor...
We study integers n > 1 satisfying the relation σ(n) = γ(n) ² , where σ(n) and γ(n) are the sum of d...
ABSTRACT. We show that the equation φ(a) = σ(b) has infinitely many solutions, where φ is Euler’s t...
Let denotes the sum of the positive divisors of the positive integer and be the Euler’s totient f...
We study integers n > 1 satisfying the relation σ(n) = γ(n)², where σ(n) and γ(n) are the sum of div...
We study the sum [equation omitted for formating reasons] of consecutive iterations of the Euler fun...
Let φ denote the Euler function. For a fixed integer k ≠ 0, we study positive integers n for which t...
AbstractLet N be sufficiently large odd integer. It is proved that the equation N=n1+n2+n3 has solut...
Abstract. We study the solutions of the equation φ(Cm)/φ(Cn) = r, where r is a fixed rational numbe...
We give upper bounds for the number of solutions to congruences with the Euler function φ(n) and wit...
If n is a positive integer such that ϕ(n)σ(n) = m² for some positive integer m, then m≤n. We put m =...
From the Washington University Senior Honors Thesis Abstracts (WUSHTA), 2017. Published by the Offic...
For any positive integer k let φ(k), σ(k), and τ(k) be the Euler function of k, the divisor sum func...
Abstract. We study the number and nature of solutions of the equation (n) = (n + k), where denotes ...