DOCSLIB.ORG

Instructions for Authors

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Instructions for Authors KMITL Sci. Tech. J. Vol.17 No.1 Jan.-Jun. 2017 Unitary Convolution and Generalized MӦbius Function Pussadee Yangklan*, Pattira Ruengsinsub and Vichian Laohakosol Department of Mathematics, Faculty of Science, Kasetsart University, Bangkok 10900, Thailand Abstract The concept of unitary convolution in the commutative ring of arithmetic functions, under the two operations of addition and unitary convolution, is investigated. A generalized unitary M bius function is defined and its basic properties, which extend those corresponding classical ones are derived. Of particular interest are certain generalized unitary M bius inversion formula and ӧsome characterizations of multiplicative functions. ӧ Keywords: arithmetic function, M bius inversion formula, multiplicative function, unitary convolution ӧ 1. Introduction An arithmetic function [1] is a complex-valued function defined on the set of positive integers. The set of arithmetic functions, , is a commutative ring under the usual addition defined by (f+=+ g )() n f () n gn () and the unitary convolution, , defined by (f gn )()= ∑∑ fndgd( /) ()= gndfd( /) (), dn|| dn|| where dn|| denotes the unitary divisor, i.e., those divisors d for which gcd (d,n/d) = 1. The identity element under the unitary convolution is the function 1 ifn = 1 In()= 0 ifn > 1, which is also the identity under the Dirichlet convolution, * , defined by (f * g )( n )= ∑ f ( dgn ) ( / d ). dn∣ For f ∈ such that f (1)≠ 0 , its inverse under the unitary convolution exists and is denoted by −1 f . Notice that when n is squarefree, we have (f gn )()(= f * gn )(). Cohen [2] considered a unitary analogue of the M bius function µ ( n ) = ( − 1) ω () n , (1.1) ӧ where ω()n is the number of distinct prime factors of n withω(1)= 0. Generalizing Cohen's notion, we define a generalized unitary M bius function by *Corresponding author: Tel.: +66 851421272 E-mail: [email protected] 1 KMITL Sci. Tech. J. Vol.17 No.1 Jan.-Jun. 2017 ω()n µαα ()n = ( − ) , where α ∈ {0} and µ0 = I, so that µµ1 = . Denote by , the set of multiplicative functions, viz., M:={ f∈= A {0}; fmn ( ) fmfn ( )()whenevergcd(,)mn= 1.} Evidently, µα is a multiplicative function, and it is easily checked that a unitary convolution of two multiplicative functions is a multiplicative function. The objectives in this work are 1) to collect basic properties associated with unitary convolution; 2) to prove the generalized unitaryMӧbius inversion formula and to derive relations among the generalized unitary Mӧbius function and multiplicative functions; 3) to derive some characterizations of multiplicative function. 2. Preliminaries 2.1 The work of Cohen in 1960 [2] Cohen seemed to be the first person who seriously used the concept of unitary convolution to solve arithmetical problems. First, he defined the unitary Euler's totient, ϕ (n ). For ab, ∈ with b > 0, denote by (,)ab* the greatest divisor of a which is a unitary divisor of b. When (,ab)* =1 the integer a is said to be semiprime to b. The unitary Euler's totient is defined as the number of positive integers in {1, 2,… ,n } that are semiprimeto n, i.e., ϕ ()n=∈…{ k {1,2,,};(,) n kn* = 1.} Cohen introduced a trigonometric sum c* (,) mn for the case of unitary divisors, mimicking the Ramanujan's sum cmn(,)in the ordinary case, by c* (,) m n= ∑ e ( mx ,) n (,)xn* = 1 where e( m , n )= exp(2π im / n ).He proved that nif nm | ∑c* (,) md = dn|| 0 ifnm . Furthermore, he defined ϕ = * and µ = * (nc ) (0, n ) (ncn ) (1, ). Cohen gave the following interesting consequences: ∑∑ϕµ(d )= n , ( d )= In ( ), c* ( mn , )= ∑ µ ( d )( n / d ), dn|| dn|| dn|| ω()n ϕ()nn= ζµ1 (), µ () n= (1) − whereζ1()nn= ,and for fg,,∈ the unitary Mӧbius inversion holds, namely, f() n= ∑∑ gd ()← → gn ()= µ () d f ( n / d ). dn|| dn|| He also established a number of analytical estimates. If fn()is defined by fn()= ( g hn )()for gh, ∈ and if gn()is bounded, then for real number x ≥ 2, we have x2 ∞ gn()()ϕ n = + 22 ∑∑f() n 3 Ox( log x ). 2 = n nx n1 2 KMITL Sci. Tech. J. Vol.17 No.1 Jan.-Jun. 2017 2.2 The work of Cohen in 1961 [3] Let ξη, ∈ denote functions satisfying ∑ ξ(d ) ηδ ( )= In ( ). dnδ = (d ,δ )1= Cohen proved fn()= ∑∑ξ ()() dg δ ←→ gn ()= fd ()(),ηδ dnδδ= dn= (dd ,δδ )1= ( , )1= as well as the generalized unitary inversion formula f() n= ∑∑ g ()δ← → gn ()= µδ () d f () dnkkδδ= dn= (dd ,δδ )1= ( , )1= where k ∈ . Cohen applied the unitary convolution and the generalized unitary inversion formula to treat some asymptotic problems involving the distribution of certain sets of integers. 2.3 The work of Cohen in 1964 [4] A positive integer n is said to be k-free if it has no prime factor of multiplicity ≥ k and k-full if it has no prime factor of multiplicity< k. The set of k-full and k-free integers are denoted by Qk and Lk respectively. Their characteristic functions are denoted by qnk ()and lk (n ), respectively. Cohen * defined the generalized Mӧbius function, µk , to be the multiplicative function such that −<1, if 1 ek * e µk ()p = 0, if ek for any prime p and e∈ . Cohen proved that for all k ≥1, n ** ∑∑µµk()d= l k () n ←→ kk()dq= In () dn|| dn|| d and for fg,,∈ the following inversion formula holds nn * gn()= ∑∑ f () dqkk←→ f() n= gd ()µ . dn|| dddn|| * Further, Cohen defined ϕk ()n to be the number of integers m in a complete residue system mod n which are semiprime to the maximal unitary divisor of n contained in Qk . He proved nn ** * ϕµk()n= ∑∑ d k← → ϕkk(),dq= n dn|| dddn|| and x2 ∞ µϕ()()nn ϕ *= k + 22 ∑∑k ()n 3 Ox( log x ). nx 0 n=1 n 2.4 The work of Horadam [5] ** Horadam defined generalized integers andϕ () n as follows: suppose there is given a finite or infinite sequence {p}of real numbers (generalized primes) such that 1<pp12 < <…. Form the set {} of all possible p-products; these numbers are called generalized integers. Let { n}be the set ** of generalized integers. Defineϕ () n to be the number of generalized integers contained in { n} which are semiprimeto n . Horadam proved: 3 KMITL Sci. Tech. J. Vol.17 No.1 Jan.-Jun. 2017 • ∑ ϕ** ()dn= ,for all n ∈; ddδδ=n ,( , ) = 1 • if fh(),()nnare multiplicative, then the unitary convolution of g() n and h() n is also multiplicative; • a unitary inversion formula: if G( n )= ∑ Fd ( ), dδ =n (d ,)1δ = then F( n )= ∑ µδ (dG ) ( ). dδ =n (d ,)1δ = 2.5 The work of Rao [6] Rao (see also [2]) gave the following extension of Cohen's totient. For positive integers nmk, , , k * k let (,nm )k denote the largest unitary divisor of m that divides n and is a k th power. Denote by * k k * ϕk ()m the number of integers n in a complete residue system mod m such that (nm , )k = 1. Rao proved that 1 ϕ* ()m= dkk µ ( md /)= ζµ () m = m 1 − , kk∑∏ kmν p () dm|| pn| p k whereζ k (nn ):= 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. Let dn()denote the number of unitary divisors of n, and let σ k ()n denote the sum of the k th power of the unitary divisors of n (see also [7]), i.e., ω ()nk dn()=∑∑ 1 = 2 ,σζkk ()n= d = Un(). dn|| dn|| Rao also established the identities * **kk * σk()n= ∑ ϕk (/)(), nddd ∑ ϕ (/ ndd11 )= ∑∑ ϕk (/ nd2 ) d 2 , σϕsk+ () d k (/) nd= n σs (). n dn|| d12|| n d|| n dn|| 2.6 The work of Rearick [8] Let be the set of all f ∈ such that f (1) is a positive real number. Rearick proved that the groups { ,*},{ ,*},{ , },{ , } and { ,}+ are isomorphic. 2.7 The work of Hansen and Swanson [9] Hansen and Swanson defined the following concepts. 1. The greatest common unitary divisor (gcud) of positive integers ab, , written as gcud (,)ab , is the integer d ∈ such that d|| ad, | | b, and if c|| ac, | | b, then cd|| . 2. The least common unitary divisor (lcud) of positive integers ab, ,written as lcud (,)ab, ab is the integer d defined by d = . gcud(ab , ) 3. Any positive integers are unitarily relatively prime if gcud = 1. ab, (,)ab 4. A positive integer n is a unitary perfect number if the sum of all the unitary divisors of n is 2n . 4 KMITL Sci. Tech. J. Vol.17 No.1 Jan.-Jun. 2017 2.8 The work of Johnson [10] * Johnson studied the multiplicative properties of snk ( ), defined for fg,,∈ by * sk ( n )= ∑ f ( dgk ) ( / d ). d||( nk , )* He proved that for fg,,∈ * ** 1. smk ( ab )= sm () a s k () b whenever (ak,) =( bm ,) = 1; ** 2. sabsamm( )= () whenever (bm,) = 1; ** 3. smk() a= s m ()() agkwhenever (ak,) = 1 ; * 4. if fg, ∈, then snk ()is multiplicative in k for each fixed n. 2.9 The work of Hsu [11] Hsu extended the Mӧbius in version formula based on the prime factorization of integers. Let x1 xs t1 ts np= 1 ps and dp= 1 ps , with pi being distinct primes, xi and ti being nonnegative integers satisfying 0.≤≤txiiReplacing fn()and gd()in the M bius inversion formula by = … and = … respectively. Hsu proved the following theorems: f(( x )) fx (1 , , xs ) g(( t )) gt (1 , , ts ), ӧ Theorem 2.1 For fg,,∈ we have f(,,) x11…= xss∑ gt (,,) … t 0≤≤txii if and only if gx(,,)1… xs =∑ f ( x1 −… t 1 ,, xss − t )(,,),µ11 t … t s 0≤≤txii where ++ (−≤ 1) tt1 s if all t 1 i µ11(,tt…= ,s ) 0 if there is a ti ≥ 2.
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]
  • 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]
  • 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]
  • On the Largest Odd Component of a Unitary Perfect Number*
    ON THE LARGEST ODD COMPONENT OF A UNITARY PERFECT NUMBER* CHARLES R. WALL Trident Technical College, Charleston, SC 28411 (Submitted September 1985) 1. INTRODUCTION A divisor d of an integer n is a unitary divisor if gcd (d9 n/d) = 1. If d is a unitary divisor of n we write d\\n9 a natural extension of the customary notation for the case in which d is a prime power. Let o * (n) denote the sum of the unitary divisors of n: o*(n) = £ d. d\\n Then o* is a multiplicative function and G*(pe)= 1 + p e for p prime and e > 0. We say that an integer N is unitary perfect if o* (N) = 2#. In 1966, Sub- baro and Warren [2] found the first four unitary perfect numbers: 6 = 2 * 3 ; 60 = 223 - 5 ; 90 = 2 * 325; 87,360 = 263 • 5 • 7 • 13. In 1969s I announced [3] the discovery of another such number, 146,361,936,186,458,562,560,000 = 2183 • 5^7 • 11 • 13 • 19 • 37 • 79 • 109 * 157 • 313, which I later proved [4] to be the fifth unitary perfect number. No other uni- tary perfect numbers are known. Throughout what follows, let N = 2am (with m odd) be unitary perfect and suppose that K is the largest odd component (i.e., prime power unitary divisor) of N. In this paper we outline a proof that, except for the five known unitary perfect numbers, K > 2 2. TECHNIQUES In light of the fact that 0*(pe) = 1 + pe for p prime, the problem of find- ing a unitary perfect number is equivalent to that of expressing 2 as a product of fractions, with each numerator being 1 more than its denominator, and with the denominators being powers of distinct primes.
    [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]
  • 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]
  • A Study of .Perfect Numbers and Unitary Perfect
    CORE Metadata, citation and similar papers at core.ac.uk Provided by SHAREOK repository A STUDY OF .PERFECT NUMBERS AND UNITARY PERFECT NUMBERS By EDWARD LEE DUBOWSKY /I Bachelor of Science Northwest Missouri State College Maryville, Missouri: 1951 Master of Science Kansas State University Manhattan, Kansas 1954 Submitted to the Faculty of the Graduate College of the Oklahoma State University in partial fulfillment of .the requirements fqr the Degree of DOCTOR OF EDUCATION May, 1972 ,r . I \_J.(,e, .u,,1,; /q7Q D 0 &'ISs ~::>-~ OKLAHOMA STATE UNIVERSITY LIBRARY AUG 10 1973 A STUDY OF PERFECT NUMBERS ·AND UNITARY PERFECT NUMBERS Thesis Approved: OQ LL . ACKNOWLEDGEMENTS I wish to express my sincere gratitude to .Dr. Gerald K. Goff, .who suggested. this topic, for his guidance and invaluable assistance in the preparation of this dissertation. Special thanks.go to the members of. my advisory committee: 0 Dr. John Jewett, Dr. Craig Wood, Dr. Robert Alciatore, and Dr. Vernon Troxel. I wish to thank. Dr. Jeanne Agnew for the excellent training in number theory. that -made possible this .study. I wish tc;, thank Cynthia Wise for her excellent _job in typing this dissertation •. Finally, I wish to express gratitude to my wife, Juanita, .and my children, Sondra and David, for their encouragement and sacrifice made during this study. TABLE OF CONTENTS Chapter Page I. HISTORY AND INTRODUCTION. 1 II. EVEN PERFECT NUMBERS 4 Basic Theorems • • • • • • • • . 8 Some Congruence Relations ••• , , 12 Geometric Numbers ••.••• , , , , • , • . 16 Harmonic ,Mean of the Divisors •. ~ ••• , ••• I: 19 Other Properties •••• 21 Binary Notation. • •••• , ••• , •• , 23 III, ODD PERFECT NUMBERS . " . 27 Basic Structure • , , •• , , , .
    [Show full text]
  • On Product Partitions of Integers
    Canad. Math. Bull.Vol. 34 (4), 1991 pp. 474-479 ON PRODUCT PARTITIONS OF INTEGERS V. C. HARRIS AND M. V. SUBBARAO ABSTRACT. Let p*(n) denote the number of product partitions, that is, the number of ways of expressing a natural number n > 1 as the product of positive integers > 2, the order of the factors in the product being irrelevant, with p*(\ ) = 1. For any integer d > 1 let dt = dxll if d is an /th power, and = 1, otherwise, and let d = 11°^ dj. Using a suitable generating function for p*(ri) we prove that n^,, dp*(n/d) = np*inK 1. Introduction. The well-known partition function p(n) stands for the number of unrestricted partitions of n, that is, the number of ways of expressing a given positive integer n as the sum of one or more positive integers, the order of the parts in the partition being irrelevant. In contrast to this, we consider here the function p*(n), which denotes the number of ways of expressing n as the product of positive integers > 2, the order of the factors in the product being irrelevant. For example, /?*(12) = 4, since 12 can be expressed in positive integers > 2 as a product in these and only these ways: 12,6 • 2, 4-3, 3-2-2. We may say that/?(n) denotes the number of sum partitions and p*(n) the number of product partitions of n. We note that the number of product partitions of n = p\axpiai.. .pkak in standard form is independent of the particular primes involved; for example, /?*(12) = p*(22 • 3) = p*(p\p2) for every choice of distinct primes p\ and/?2- For computing it is usually convenient to let pj be they'th prime; for easily ordering the divisors in increasing order it suffices to take/?2 > P\a\P?> > Pia]P2ai, etc.
    [Show full text]