The function φ(n) (the Euler phi function of n, also known as the totient function) gives the number of positive integers relatively prime to n. For example, φ(10)=4 because 1, 3, 7, 9 are relatively prime to 10. The function σ(n) is the sum of the divisors of n. For example, σ(10)=18 because the divisors of 10 are 1, 2, 5, 10 and 1+2+5+10=18. The plot shows either the unsorted or sorted values of φ(n) or σ(n) for n from 1 to up to a maximum of 6000. You can drag the locator to see that the line through the bulk of the unsorted values corresponds to the mostly linear part of the sorted values on the left. For large values the plot of the sorted values has a visible change in curvature on the rightEducação Superior::Ciências Exatas e da Terra::Matemática