Open AccessOn the coprimality of some arithmetic functions
Author(s) -
Koninck De,
Imre Kátai
Publication year - 2010
Publication title -
publications de l institut mathematique
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.246
H-Index - 17
eISSN - 1820-7405
pISSN - 0350-1302
DOI - 10.2298/pim1001121d
Subject(s) - mathematics , integer (computer science) , function (biology) , combinatorics , arithmetic function , euler's totient function , asymptotic formula , arithmetic , set (abstract data type) , divisor function , arithmetic progression , euler's formula , discrete mathematics , divisor (algebraic geometry) , mathematical analysis , computer science , evolutionary biology , biology , programming language
Let stand for the Euler function. Given a positive integer n , let (n ) stand for the sum of the positive divisors of n and let (n ) be the number of divisors
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom