Some Pythagorean type equations concerning arithmetic functions
| dc.contributor.author | Kézér, Ildikó | |
| dc.date.accessioned | 2024-07-30T13:18:02Z | |
| dc.date.available | 2024-07-30T13:18:02Z | |
| dc.date.issued | 2021-03-18 | |
| dc.description.abstract | 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 2 + y 2 = z 2 , we study equation f(x 2 ) + f(y 2 ) = f(z 2 ) 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 | en |
| dc.format | application/pdf | |
| dc.identifier.citation | Teaching Mathematics and Computer Science, Vol. 18 No. 2 (2020) , 157-179 | |
| dc.identifier.doi | https://doi.org/10.5485/TMCS.2020.0514 | |
| dc.identifier.eissn | 2676-8364 | |
| dc.identifier.issn | 1589-7389 | |
| dc.identifier.issue | 2 | |
| dc.identifier.jatitle | Teach. Math. Comp. Sci. | |
| dc.identifier.jtitle | Teaching Mathematics and Computer Science | |
| dc.identifier.uri | https://hdl.handle.net/2437/378511 | |
| dc.identifier.volume | 18 | |
| dc.language | en | |
| dc.relation | https://ojs.lib.unideb.hu/tmcs/article/view/10970 | |
| dc.rights.access | Open Access | |
| dc.rights.owner | Ildikó Kézér | |
| dc.subject | arithmetic functions | en |
| dc.title | Some Pythagorean type equations concerning arithmetic functions | en |
| dc.type | folyóiratcikk | hu |
| dc.type | article | en |
Fájlok
Eredeti köteg (ORIGINAL bundle)
1 - 1 (Összesen 1)