Search

Search Results

• Some Pythagorean type equations concerning arithmetic functions

  157-179

  Ildikó Kézér

  Views:

  60

  We investigate some equations involving the number of divisors d(n); the sum of divisors σ(n); Euler's totient function ϕ(n); the number of distinct prime factors ω(n); and the number of all prime factors (counted with multiplicity) Ω(n). The first part deals with equation f(xy) + f(xz) = f(yz). In the second part, as an analogy to x² + y² = z², we study equation f(x²) + f(y²) = f(z²) and its generalization to higher degrees and more terms. We use just elementary methods and basic facts about the above functions and indicate why and how to discuss this topic in group study sessions or special maths classes of secondary schools in the framework of inquiry based learning.

  Subject Classification: 97F60, 11A25

• Comparing various functions of the divisors of an integer in different residue classes

  247-258

  Ildikó Kézér

  Views:

  30

  The main goal of this paper is to investigate some problems related to the distribution of the divisors of a number in different residue classes. We study these questions modulo 3, and use mostly just elementary number theory. In some special cases, we demonstrate how this problem is related to other fields of maths, especially to combinatorics. Since the author is also a secondary school teacher, we use elementary methods that can be discussed in secondary school, mainly within the framework of group study sessions or in special maths classes. We do think that the investigation of these types of questions can motivate children to find their own way to create their own questions, and to get a deeper insight into problem solving by these experimentations.

• On some problems on composition of arithmetic functions

  161-181

  Ildikó Kézér

  Views:

  17

  The main goal of this paper is to investigate some problems related to the commutativity of the composition of arithmetic functions. The concept of commutativity arises many times in high school maths, so it is natural to study the composition of functions, namely the equation f(g(n)) = g(f(n)), where f and g are such well known arithmetic functions as d(n), φ(n), σ(n), ω(n), or Ω(n). We study various aspects of solvability: can we exhibit infinitely many solutions; can we determine every solution; can we find suitable values in the range of both functions f and g for which the equation is, or is not solvable, respectively. We need just the basic facts about the above functions,and we use only elementary methods in the proofs. We present some interesting questions, their solutions, and raise some unsolved problems. We found that this topic can be discussed well in secondary school, mainly within the framework of group study sessions as we had some classes with a group of kids in 9th grade. We summarize the experiences of this experiment in the last section.