DOCSLIB.ORG

Unitary Analogues of Some Arithmetic Functions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Unitary Analogues of Some Arithmetic Functions Thai Journal of Mathematics : (2020) 127{134 Special Issue: The 14th IMT-GT ICMSA 2018 http://thaijmath.in.cmu.ac.th Online ISSN 1686-0209 Unitary Analogues of Some Arithmetic Functions Pussadee Yangklany;1, Vichian Laohakosolz, Pattira Ruengsinsubz and Sukrawan Mavechay yDepartment of Mathematics, Faculty of Science, King Mongkut's Institute of Technology Ladkrabang, Bangkok 10520, Thailand e-mail : pussadee [email protected] and [email protected] zDepartment of Mathematics, Faculty of Science, Kasetsart University, Bangkok 10900, Thailand e-mail : [email protected] and [email protected] Abstract : A number of arithmetic functions, referred to as the generalized unitary-Euler's totient, generalized unitary-Cohen's totient, generalized unitary-divisor, generalized unitary-Liouville, odd-phi, and even-phi functions which generalize the classical totient, divisor and Liouville functions, are intro- duced in the setting of unitary convolution. Basic properties of these functions extending the existing ones are established. Results related to the problem of counting exponentially odd and exponentially even numbers are derived as applications. Keywords : arithmetic function; unitary convolution; multiplicative function 2010 Mathematics Subject Classification : 11A25 (2000 MSC) 1 Introduction An arithmetic function, [1], is a complex-valued function defined on the set of positive integers. The set of arithmetic functions, A, with addition +, and unitary convolution t defined, respectively, by X (f + g)(n) = f(n) + g(n); (f t g)(n) = f (n=d) g(d); djjn where djjn denotes the unitary divisor (i.e., those divisors d of n for which gcd(d; n=d) = 1), is a commu- tative ring with zero divisors [2]. The identity element under the unitary convolution is the function ( 1 if n = 1 I(n) = 0 if n > 1: A non-zero arithmetic function f is said to be multiplicative if f(mn) = f(m)f(n) whenever gcd(m; n) = 1: Note that a unitary convolution of two multiplicative functions is a multiplicative function. 1Corresponding author. Copyright c 2020 by the Mathematical Association of Thailand. All rights reserved. 128 Thai J. M ath. Special Issue (2020)/ P. Yangklan, V. Laohakosol, P. Ruengsinsub and S. Mavecha A modern systematic study of unitary convolution seems to be started by Cohen. In [3], mimicking the classical case, he introduced the unitary Euler's totient as follows: for a; b 2 Z with b > 0, denote by (a; b)∗ the greatest divisor of a which is a unitary divisor of b; when (a; b)∗ = 1, the integer a is said to be semiprime to b. The unitary Euler's totient, ', is defined to be the number of positive integers that are semiprime to n, i.e., X '(n) = 1: x≤n (x;n)∗=1 A semi-reduced residue system mod n, denoted by SRRS(n), is a set of integers in a residue system mod n that are semiprime to n. In the same paper, Cohen introduced a unitary Ramanujan sum c∗(m; n) by X c∗(m; n) = exp(2πimx=n) x2SRRS(n) where the summation extends over the integers x in a semi-reduced residue system mod n. Based upon this notion, we observe that '(n) = c∗(0; n): Cohen also defined µ(n) = c∗(1; n) and proved a unitary analogue of the M¨obiusinversion formula which states that for f; g 2 A, we have X X f(n) = g(d) () g(n) = µ(d)f(n=d); djjn djjn as well as several identities relating to these functions such as X X !(n) '(d) = n; µ(d) = I(n); '(n) = (ζ1 t µ)(n); µ(n) = (−1) (1.1) djjn djjn where ζ1(n) := n, and !(n) denotes the number of distinct prime factors of n with !(1) = 0. In addition, Cohen introduced the concept of an exponentially odd number which is an integer n 2 N whose prime a1 as factorization takes the form n = p1 : : : ps with all powers ai being odd positive integers. Denote by Eo the set of all exponentially odd numbers. Observe that n 2 Eo whenever its greatest unitary square divisor (the largest unitary divisor which is a square) is 1, and so 1 2 Eo (because its greatest unitary square divisor is 1). Apart from Cohen's work, Rao in [4] gave the following extension of Cohen's totient. For n; m; k 2 N, k ∗ k let (n; m )k denote the largest unitary divisor of m that divides n and is a kth power. Denote the unitary ∗ k k ∗ analogue of Cohen's totient, 'k(m), as the number of positive integers n ≤ m such that (n; m )k = 1. Rao proved that ∗ X k k Y 1 'k(m) = d µ(m=d) = (ζk t µ)(m) = m 1 − ; (1.2) pkνp(m) djjm pjn k where ζk(n) := n and νp(m) denotes the highest power of the prime p that divides m. This result implies ∗ ∗ at once that 'k is a multiplicative function and obviously that '1 = ': Let d(n) denote the number of unitary divisors of n, and let σk(n) denote the sum of the kth power of the unitary divisors of n (see also [5]), i.e., X !(n) X k d(n) = 1 = 2 ; σk(n) = d = (ζk t U)(n): djjn djjn where U(n) := 1 for all n 2 N. Rao also established the identities X ∗ X ∗ k σk(n) = 'k(n=d)d(d); σs+k(d)'k(n=d) = n σs(n): djjn djjn Unitary Analogues of Some Arithmetic Functions 129 Recently, in [6], a generalized unitary M¨obiusfunction was introduced via !(n) µα(n) = (−α) (n 2 N; α 2 C n f0g); µ0 := I; µ1 := µ, µ−1 = U: The main objectives in [6] were (i) to prove the following generalized unitary M¨obiusinversion formula: for f; g 2 A and α 2 C n f0g, we have X n X n f(n) = g(d)µ () g(n) = f µ (d); or symbolically; f = g t µ () g = f t µ ; −α d d α −α α djjn djjn (ii) to derive some characterizations of multiplicative function using generalized unitary M¨obiusfunction. Here, we continue our unitary investigation by further generalizing the unitary totient, unitary divisor and unitary Liouville functions. This is done by introducing the so-called gu-Euler's totient, gu-Cohen's totient, gu-divisor, gu-Liouville, odd-phi, and even-phi functions (the abbreviation gu stands for gener- alized unitary). Apart from deriving properties of these functions which extend the existing ones, in the last section, we apply these results to functions that are related to the problem of counting exponentially odd and exponentially even numbers. 2 Preliminaries There are two parts in this section; generalized unitary analogues are defined in the first part and their properties are established in the second part. 2.1 Definitions Let α 2 R. 1. The gu-Euler's totient, 'α, is defined by 'α = ζ1 t µα: ∗ 2. The gu-Cohen's totient, 'α, is defined by ∗ 'α = ζα t µ. 3. The gu-divisor function, σα(n), is defined to be the sum of the αth power of positive unitary divisor d of n, i.e., α X α σ (n) = d (n 2 N): djjn 4. The gu-Liouville function, λα, is defined by Ω(n) λα(n) = (−α) (n 2 N); λ0 := I; where Ω(n) is the number of prime factors of n counting with multiplicity with Ω(1) = 0. The following facts are easily checked. • The gu-Euler's totient, gu-Cohen's totient, gu-divisor function and gu-Liouville function are mul- tiplicative functions. (P !(n=d) djjn d(−α) if α 2 R n f0g • 'α(n) = ζ1(n) if α = 0: ∗ • For α 2 N, the function 'α is identical with the unitary analogue of the Cohen's totient. α • σ = ζα t µ−1: • σ1 = σ and σ0(n) = d(n). Ω(n) • λ1 is identical with the classical Liouville function, which is defined by λ(n) = (−1) ([1]). • For α 2 N, we have λα = λ t · · · t λ (the unitary convolution of α factors). 130 Thai J. M ath. Special Issue (2020)/ P. Yangklan, V. Laohakosol, P. Ruengsinsub and S. Mavecha 2.2 Properties In this sub-section, we derive a number of properties relating to the functions defined above some of which generalize those in (1.2). Note first that for α; β 2 C n f0g, µα t µβ = µα+β (see [6]). Proposition 2.2.1. For α; β 2 R, n 2 N, p prime, we have α Q ανp(n) 1) σ (n) = pjn p + 1 α 2) ζα = µ t σ Q νp(n) 3) 'α(n) = pjn p − α P Q νp(n) 4) djjn 'α(d) = pjn p + 1 − α β 5) 'α t σ = ζ1 t ζβ t µα−1 ∗ Q ανp(n) 6) 'α(n) = pjn p − 1 P ∗ 7) djjn 'α(d) = ζα(n) ∗ ∗ 8) ζα t 'β = ζβ t 'α ∗ α 9) 'α t d = σ ∗ β 10) 'α t σ = ζα t ζβ P Q νp(n) 11) djjn λα(d) = pjn 1 + (−α) Q νp(n) 12) λα t µβ (n) = pjn (−α) − β β Q βνp(n) νp(n) 13) (λα t σ )(n) = pjn p + (−α) + 1 Q νp(n) νp(n) 14) (λα t 'β)(n) = pjn p + (−α) − β ∗ Q βνp(n) νp(n) 15) (λα t 'β)(n) = pjn p + (−α) − 1 : Proof. 1) Since σα is multiplicative, we get σα(1) = 1. To prove the assertion, it suffices to evaluate α σ (pa) for prime p and a 2 N, which is X σα(pa) = dα = pαa + 1: djjpa Assertions 2), 5), 7), 8), 9) and 10) follow, respectively, from the identities α µ t σ = µ t ζα t µ−1 = ζα β 'α t σ = ζ1 t µα t ζβ t µ−1 = ζ1 t ζβ t µα−1 X ∗ ∗ 'α(d) = ('α t U)(n) = (ζα t µ t µ−1)(n) = ζα(n) djjn ∗ ∗ ζα t 'β = ζα t ζβ t µ = ζβ t ζα t µ = ζβ t 'α ∗ α 'α t d = ζα t µ t µ−2 = ζα t µ−1 = σ ∗ β 'α t σ = ζα t µ t ζβ t µ−1 = ζα t ζβ t I = ζα t ζβ: Unitary Analogues of Some Arithmetic Functions 131 ∗ β ∗ Since the functions 'α;'α; λα t µβ; λα t σ ; λα t µβ; λα t 'β are multiplicative, as in the proof of Assertion 1), Assertions 3), 6), 12), 13), 14) and 15) follow at once from the evaluation a p a a a X ! d a !(1) !(p ) a 'α(p ) = (ζ1 t µα)(p ) = d(−α) = p (−α) + (−α) = p − α djjpa ∗ a a a a aα 'α(p ) = (ζα t µ)(p ) = µ(p ) + ζα(p ) = p − 1 X pa (λ t µ )(pa) = λ (d)µ = λ (pa) + µ (pa) = (−α)a − β α β α β d α β djjpa X pa (λ t σβ)(pa) = λ (d)σβ = λ (pa) + σβ(pa) = (−α)a + pβa + 1 α α d α djjpa X pa (λ t ' )(pa) = λ (d)' = λ (pa) + ' (pa) = (−α)a + pa − β α β α β d α β djjpa X pa (λ t '∗ )(pa) = λ (d)'∗ = λ (pa) + '∗ (pa) = (−α)a + paβ − 1: α β α β d α β djjpa When n = 1, we have X X Ω(1) 'α(d) = 'α(1) = 1; λα(d) = λα(1) = (−α) = 1: djj1 djj1 For n ≥ 2, since the functions 'α t U; λα are multiplicative, as in the proof Assertion 1), Assertions 4) and 11) follow from a X a a a ('α t U)(p ) = 'α(p ) = 'α(1) + 'α(p ) = p + 1 − α djjpa X a Ω(pa) a λα(d) = λα(1) + λα(p ) = 1 + (−α) = 1 + (−α) : djjpa 3 Results Complementing the concept of exponentially odd numbers, an exponentially even number is defined to be a positive integer whose prime factorization contains only even prime powers, and let Ee be the set of all exponentially even numbers.
Load more

Recommended publications
  • Bi-Unitary Multiperfect Numbers, I
    Notes on Number Theory and Discrete Mathematics Print ISSN 1310–5132, Online ISSN 2367–8275 Vol. 26, 2020, No. 1, 93–171 DOI: 10.7546/nntdm.2020.26.1.93-171 Bi-unitary multiperfect numbers, I Pentti Haukkanen1 and Varanasi Sitaramaiah2 1 Faculty of Information Technology and Communication Sciences, FI-33014 Tampere University, Finland e-mail: [email protected] 2 1/194e, Poola Subbaiah Street, Taluk Office Road, Markapur Prakasam District, Andhra Pradesh, 523316 India e-mail: [email protected] Dedicated to the memory of Prof. D. Suryanarayana Received: 19 December 2019 Revised: 21 January 2020 Accepted: 5 March 2020 Abstract: A divisor d of a positive integer n is called a unitary divisor if gcd(d; n=d) = 1; and d is called a bi-unitary divisor of n if the greatest common unitary divisor of d and n=d is unity. The concept of a bi-unitary divisor is due to D. Surynarayana [12]. Let σ∗∗(n) denote the sum of the bi-unitary divisors of n: A positive integer n is called a bi-unitary perfect number if σ∗∗(n) = 2n. This concept was introduced by C. R. Wall in 1972 [15], and he proved that there are only three bi-unitary perfect numbers, namely 6, 60 and 90. In 1987, Peter Hagis [6] introduced the notion of bi-unitary multi k-perfect numbers as solu- tions n of the equation σ∗∗(n) = kn. A bi-unitary multi 3-perfect number is called a bi-unitary triperfect number. A bi-unitary multiperfect number means a bi-unitary multi k-perfect number with k ≥ 3: Hagis [6] proved that there are no odd bi-unitary multiperfect numbers.
    [Show full text]
  • On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function
    mathematics Article On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function ŠtˇepánHubálovský 1,* and Eva Trojovská 2 1 Department of Applied Cybernetics, Faculty of Science, University of Hradec Králové, 50003 Hradec Králové, Czech Republic 2 Department of Mathematics, Faculty of Science, University of Hradec Králové, 50003 Hradec Králové, Czech Republic; [email protected] * Correspondence: [email protected] or [email protected]; Tel.: +420-49-333-2704 Received: 3 October 2020; Accepted: 14 October 2020; Published: 16 October 2020 Abstract: Let Fn be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest positive integer k such that Fk ≡ 0 (mod n). In this paper, we shall find all positive solutions of the Diophantine equation z(j(n)) = n, where j is the Euler totient function. Keywords: Fibonacci numbers; order of appearance; Euler totient function; fixed points; Diophantine equations MSC: 11B39; 11DXX 1. Introduction Let (Fn)n≥0 be the sequence of Fibonacci numbers which is defined by 2nd order recurrence Fn+2 = Fn+1 + Fn, with initial conditions Fi = i, for i 2 f0, 1g. These numbers (together with the sequence of prime numbers) form a very important sequence in mathematics (mainly because its unexpectedly and often appearance in many branches of mathematics as well as in another disciplines). We refer the reader to [1–3] and their very extensive bibliography. We recall that an arithmetic function is any function f : Z>0 ! C (i.e., a complex-valued function which is defined for all positive integer).
    [Show full text]
  • Prime Divisors in the Rationality Condition for Odd Perfect Numbers
    Aid#59330/Preprints/2019-09-10/www.mathjobs.org RFSC 04-01 Revised The Prime Divisors in the Rationality Condition for Odd Perfect Numbers Simon Davis Research Foundation of Southern California 8861 Villa La Jolla Drive #13595 La Jolla, CA 92037 Abstract. It is sufficient to prove that there is an excess of prime factors in the product of repunits with odd prime bases defined by the sum of divisors of the integer N = (4k + 4m+1 ℓ 2αi 1) i=1 qi to establish that there do not exist any odd integers with equality (4k+1)4m+2−1 between σ(N) and 2N. The existence of distinct prime divisors in the repunits 4k , 2α +1 Q q i −1 i , i = 1,...,ℓ, in σ(N) follows from a theorem on the primitive divisors of the Lucas qi−1 sequences and the square root of the product of 2(4k + 1), and the sequence of repunits will not be rational unless the primes are matched. Minimization of the number of prime divisors in σ(N) yields an infinite set of repunits of increasing magnitude or prime equations with no integer solutions. MSC: 11D61, 11K65 Keywords: prime divisors, rationality condition 1. Introduction While even perfect numbers were known to be given by 2p−1(2p − 1), for 2p − 1 prime, the universality of this result led to the the problem of characterizing any other possible types of perfect numbers. It was suggested initially by Descartes that it was not likely that odd integers could be perfect numbers [13]. After the work of de Bessy [3], Euler proved σ(N) that the condition = 2, where σ(N) = d|N d is the sum-of-divisors function, N d integer 4m+1 2α1 2αℓ restricted odd integers to have the form (4kP+ 1) q1 ...qℓ , with 4k + 1, q1,...,qℓ prime [18], and further, that there might exist no set of prime bases such that the perfect number condition was satisfied.
    [Show full text]
  • Arxiv:Math/0201082V1
    2000]11A25, 13J05 THE RING OF ARITHMETICAL FUNCTIONS WITH UNITARY CONVOLUTION: DIVISORIAL AND TOPOLOGICAL PROPERTIES. JAN SNELLMAN Abstract. We study (A, +, ⊕), the ring of arithmetical functions with unitary convolution, giving an isomorphism between (A, +, ⊕) and a generalized power series ring on infinitely many variables, similar to the isomorphism of Cashwell- Everett[4] between the ring (A, +, ·) of arithmetical functions with Dirichlet convolution and the power series ring C[[x1,x2,x3,... ]] on countably many variables. We topologize it with respect to a natural norm, and shove that all ideals are quasi-finite. Some elementary results on factorization into atoms are obtained. We prove the existence of an abundance of non-associate regular non-units. 1. Introduction The ring of arithmetical functions with Dirichlet convolution, which we’ll denote by (A, +, ·), is the set of all functions N+ → C, where N+ denotes the positive integers. It is given the structure of a commutative C-algebra by component-wise addition and multiplication by scalars, and by the Dirichlet convolution f · g(k)= f(r)g(k/r). (1) Xr|k Then, the multiplicative unit is the function e1 with e1(1) = 1 and e1(k) = 0 for k> 1, and the additive unit is the zero function 0. Cashwell-Everett [4] showed that (A, +, ·) is a UFD using the isomorphism (A, +, ·) ≃ C[[x1, x2, x3,... ]], (2) where each xi corresponds to the function which is 1 on the i’th prime number, and 0 otherwise. Schwab and Silberberg [9] topologised (A, +, ·) by means of the norm 1 arXiv:math/0201082v1 [math.AC] 10 Jan 2002 |f| = (3) min { k f(k) 6=0 } They noted that this norm is an ultra-metric, and that ((A, +, ·), |·|) is a valued ring, i.e.
    [Show full text]
  • MORE-ON-SEMIPRIMES.Pdf
    MORE ON FACTORING SEMI-PRIMES In the last few years I have spent some time examining prime numbers and their properties. Among some of my new results are the a Prime Number Function F(N) and the concept of Number Fraction f(N). We can define these quantities as – (N ) N 1 f (N 2 ) 1 f (N ) and F(N ) N Nf (N 3 ) Here (N) is the divisor function of number theory. The interesting property of these functions is that when N is a prime then f(N)=0 and F(N)=1. For composite numbers f(N) is a positive fraction and F(N) will be less than one. One of the problems of major practical interest in number theory is how to rapidly factor large semi-primes N=pq, where p and q are prime numbers. This interest stems from the fact that encoded messages using public keys are vulnerable to decoding by adversaries if they can factor large semi-primes when they have a digit length of the order of 100. We want here to show how one might attempt to factor such large primes by a brute force approach using the above f(N) function. Our starting point is to consider a large semi-prime given by- N=pq with p<sqrt(N)<q By the basic definition of f(N) we get- p q p2 N f (N ) f ( pq) N pN This may be written as a quadratic in p which reads- p2 pNf (N ) N 0 It has the solution- p K K 2 N , with p N Here K=Nf(N)/2={(N)-N-1}/2.
    [Show full text]
  • ON PERFECT and NEAR-PERFECT NUMBERS 1. Introduction a Perfect
    ON PERFECT AND NEAR-PERFECT NUMBERS PAUL POLLACK AND VLADIMIR SHEVELEV Abstract. We call n a near-perfect number if n is the sum of all of its proper divisors, except for one of them, which we term the redundant divisor. For example, the representation 12 = 1 + 2 + 3 + 6 shows that 12 is near-perfect with redundant divisor 4. Near-perfect numbers are thus a very special class of pseudoperfect numbers, as defined by Sierpi´nski. We discuss some rules for generating near-perfect numbers similar to Euclid's rule for constructing even perfect numbers, and we obtain an upper bound of x5=6+o(1) for the number of near-perfect numbers in [1; x], as x ! 1. 1. Introduction A perfect number is a positive integer equal to the sum of its proper positive divisors. Let σ(n) denote the sum of all of the positive divisors of n. Then n is a perfect number if and only if σ(n) − n = n, that is, σ(n) = 2n. The first four perfect numbers { 6, 28, 496, and 8128 { were known to Euclid, who also succeeded in establishing the following general rule: Theorem A (Euclid). If p is a prime number for which 2p − 1 is also prime, then n = 2p−1(2p − 1) is a perfect number. It is interesting that 2000 years passed before the next important result in the theory of perfect numbers. In 1747, Euler showed that every even perfect number arises from an application of Euclid's rule: Theorem B (Euler). All even perfect numbers have the form 2p−1(2p − 1), where p and 2p − 1 are primes.
    [Show full text]
  • Fixed Points of Certain Arithmetic Functions
    FIXED POINTS OF CERTAIN ARITHMETIC FUNCTIONS WALTER E. BECK and RUDOLPH M. WAJAR University of Wisconsin, Whitewater, Wisconsin 53190 IWTRODUCTIOW Perfect, amicable and sociable numbers are fixed points of the arithemetic function L and its iterates, L (n) = a(n) - n, where o is the sum of divisor's function. Recently there have been investigations into functions differing from L by 1; i.e., functions L+, Z.,, defined by L + (n)= L(n)± 1. Jerrard and Temperley [1] studied the existence of fixed points of L+ and /._. Lai and Forbes [2] conducted a computer search for fixed points of (LJ . For earlier references to /._, see the bibliography in [2]. We consider the analogous situation using o*, the sum of unitary divisors function. Let Z.J, Lt, be arithmetic functions defined by L*+(n) = o*(n)-n±1. In § 1, we prove, using parity arguments, that L* has no fixed points. Fixed points of iterates of L* arise in sets where the number of elements in the set is equal to the power of/.* in question. In each such set there is at least one natural number n such that L*(n) > n. In § 2, we consider conditions n mustsatisfy to enjoy the inequality and how the inequality acts under multiplication. In particular if n is even, it is divisible by at least three primes; if odd, by five. If /? enjoys the inequality, any multiply by a relatively prime factor does so. There is a bound on the highest power of n that satisfies the inequality. Further if n does not enjoy the inequality, there are bounds on the prime powers multiplying n which will yield the inequality.
    [Show full text]
  • On Some New Arithmetic Functions Involving Prime Divisors and Perfect Powers
    On some new arithmetic functions involving prime divisors and perfect powers. Item Type Article Authors Bagdasar, Ovidiu; Tatt, Ralph-Joseph Citation Bagdasar, O., and Tatt, R. (2018) ‘On some new arithmetic functions involving prime divisors and perfect powers’, Electronic Notes in Discrete Mathematics, 70, pp.9-15. doi: 10.1016/ j.endm.2018.11.002 DOI 10.1016/j.endm.2018.11.002 Publisher Elsevier Journal Electronic Notes in Discrete Mathematics Download date 30/09/2021 07:19:18 Item License http://creativecommons.org/licenses/by/4.0/ Link to Item http://hdl.handle.net/10545/623232 On some new arithmetic functions involving prime divisors and perfect powers Ovidiu Bagdasar and Ralph Tatt 1,2 Department of Electronics, Computing and Mathematics University of Derby Kedleston Road, Derby, DE22 1GB, United Kingdom Abstract Integer division and perfect powers play a central role in numerous mathematical results, especially in number theory. Classical examples involve perfect squares like in Pythagora’s theorem, or higher perfect powers as the conjectures of Fermat (solved in 1994 by A. Wiles [8]) or Catalan (solved in 2002 by P. Mih˘ailescu [4]). The purpose of this paper is two-fold. First, we present some new integer sequences a(n), counting the positive integers smaller than n, having a maximal prime factor. We introduce an arithmetic function counting the number of perfect powers ij obtained for 1 ≤ i, j ≤ n. Along with some properties of this function, we present the sequence A303748, which was recently added to the Online Encyclopedia of Integer Sequences (OEIS) [5]. Finally, we discuss some other novel integer sequences.
    [Show full text]
  • PRIME-PERFECT NUMBERS Paul Pollack [email protected] Carl
    PRIME-PERFECT NUMBERS Paul Pollack Department of Mathematics, University of Illinois, Urbana, Illinois 61801, USA [email protected] Carl Pomerance Department of Mathematics, Dartmouth College, Hanover, New Hampshire 03755, USA [email protected] In memory of John Lewis Selfridge Abstract We discuss a relative of the perfect numbers for which it is possible to prove that there are infinitely many examples. Call a natural number n prime-perfect if n and σ(n) share the same set of distinct prime divisors. For example, all even perfect numbers are prime-perfect. We show that the count Nσ(x) of prime-perfect numbers in [1; x] satisfies estimates of the form c= log log log x 1 +o(1) exp((log x) ) ≤ Nσ(x) ≤ x 3 ; as x ! 1. We also discuss the analogous problem for the Euler function. Letting N'(x) denote the number of n ≤ x for which n and '(n) share the same set of prime factors, we show that as x ! 1, x1=2 x7=20 ≤ N (x) ≤ ; where L(x) = xlog log log x= log log x: ' L(x)1=4+o(1) We conclude by discussing some related problems posed by Harborth and Cohen. 1. Introduction P Let σ(n) := djn d be the sum of the proper divisors of n. A natural number n is called perfect if σ(n) = 2n and, more generally, multiply perfect if n j σ(n). The study of such numbers has an ancient pedigree (surveyed, e.g., in [5, Chapter 1] and [28, Chapter 1]), but many of the most interesting problems remain unsolved.
    [Show full text]
  • On Arithmetic Functions of Balancing and Lucas-Balancing Numbers 1
    MATHEMATICAL COMMUNICATIONS 77 Math. Commun. 24(2019), 77–81 On arithmetic functions of balancing and Lucas-balancing numbers Utkal Keshari Dutta and Prasanta Kumar Ray∗ Department of Mathematics, Sambalpur University, Jyoti Vihar, Burla 768 019, Sambalpur, Odisha, India Received January 12, 2018; accepted June 21, 2018 Abstract. For any integers n ≥ 1 and k ≥ 0, let φ(n) and σk(n) denote the Euler phi function and the sum of the k-th powers of the divisors of n, respectively. In this article, the solutions to some Diophantine equations about these functions of balancing and Lucas- balancing numbers are discussed. AMS subject classifications: 11B37, 11B39, 11B83 Key words: Euler phi function, divisor function, balancing numbers, Lucas-balancing numbers 1. Introduction A balancing number n and a balancer r are the solutions to a simple Diophantine equation 1+2+ + (n 1)=(n +1)+(n +2)+ + (n + r) [1]. The sequence ··· − ··· of balancing numbers Bn satisfies the recurrence relation Bn = 6Bn Bn− , { } +1 − 1 n 1 with initials (B ,B ) = (0, 1). The companion of Bn is the sequence of ≥ 0 1 { } Lucas-balancing numbers Cn that satisfies the same recurrence relation as that { } of balancing numbers but with different initials (C0, C1) = (1, 3) [4]. Further, the closed forms known as Binet formulas for both of these sequences are given by n n n n λ1 λ2 λ1 + λ2 Bn = − , Cn = , λ λ 2 1 − 2 2 where λ1 =3+2√2 and λ2 =3 2√2 are the roots of the equation x 6x +1=0. Some more recent developments− of balancing and Lucas-balancing numbers− can be seen in [2, 3, 6, 8].
    [Show full text]
  • Types of Integer Harmonic Numbers (Ii)
    Bulletin of the Transilvania University of Bra¸sov • Vol 9(58), No. 1 - 2016 Series III: Mathematics, Informatics, Physics, 67-82 TYPES OF INTEGER HARMONIC NUMBERS (II) Adelina MANEA1 and Nicu¸sorMINCULETE2 Abstract In the first part of this paper we obtained several bi-unitary harmonic numbers which are higher than 109, using the Mersenne prime numbers. In this paper we investigate bi-unitary harmonic numbers of some particular forms: 2k · n, pqt2, p2q2t, with different primes p, q, t and a squarefree inte- ger n. 2010 Mathematics Subject Classification: 11A25. Key words: harmonic numbers, bi-unitary harmonic numbers. 1 Introduction The harmonic numbers introduced by O. Ore in [8] were named in this way by C. Pomerance in [11]. They are defined as positive integers for which the harmonic mean of their divisors is an integer. O. Ore linked the perfect numbers with the harmonic numbers, showing that every perfect number is harmonic. A list of the harmonic numbers less than 2 · 109 is given by G. L. Cohen in [1], finding a total of 130 of harmonic numbers, and G. L. Cohen and R. M. Sorli in [2] have continued to this list up to 1010. The notion of harmonic numbers is extended to unitary harmonic numbers by K. Nageswara Rao in [7] and then to bi-unitary harmonic numbers by J. S´andor in [12]. Our paper is inspired by [12], where J. S´andorpresented a table containing all the 211 bi-unitary harmonic numbers up to 109. We extend the J. S´andors's study, looking for other bi-unitary harmonic numbers, greater than 109.
    [Show full text]
  • Problem Solving and Recreational Mathematics
    Problem Solving and Recreational Mathematics Paul Yiu Department of Mathematics Florida Atlantic University Summer 2012 Chapters 1–44 August 1 Monday 6/25 7/2 7/9 7/16 7/23 7/30 Wednesday 6/27 *** 7/11 7/18 7/25 8/1 Friday 6/29 7/6 7/13 7/20 7/27 8/3 ii Contents 1 Digit problems 101 1.1 When can you cancel illegitimately and yet get the cor- rectanswer? .......................101 1.2 Repdigits.........................103 1.3 Sortednumberswithsortedsquares . 105 1.4 Sumsofsquaresofdigits . 108 2 Transferrable numbers 111 2.1 Right-transferrablenumbers . 111 2.2 Left-transferrableintegers . 113 3 Arithmetic problems 117 3.1 AnumbergameofLewisCarroll . 117 3.2 Reconstruction of multiplicationsand divisions . 120 3.2.1 Amultiplicationproblem. 120 3.2.2 Adivisionproblem . 121 4 Fibonacci numbers 201 4.1 TheFibonaccisequence . 201 4.2 SomerelationsofFibonaccinumbers . 204 4.3 Fibonaccinumbersandbinomialcoefficients . 205 5 Counting with Fibonacci numbers 207 5.1 Squaresanddominos . 207 5.2 Fatsubsetsof [n] .....................208 5.3 Anarrangementofpennies . 209 6 Fibonacci numbers 3 211 6.1 FactorizationofFibonaccinumbers . 211 iv CONTENTS 6.2 TheLucasnumbers . 214 6.3 Countingcircularpermutations . 215 7 Subtraction games 301 7.1 TheBachetgame ....................301 7.2 TheSprague-Grundysequence . 302 7.3 Subtraction of powers of 2 ................303 7.4 Subtractionofsquarenumbers . 304 7.5 Moredifficultgames. 305 8 The games of Euclid and Wythoff 307 8.1 ThegameofEuclid . 307 8.2 Wythoff’sgame .....................309 8.3 Beatty’sTheorem . 311 9 Extrapolation problems 313 9.1 Whatis f(n + 1) if f(k)=2k for k =0, 1, 2 ...,n? . 313 1 9.2 Whatis f(n + 1) if f(k)= k+1 for k =0, 1, 2 ...,n? .
    [Show full text]