Displaying 181 – 200 of 484

Showing per page

Multiplicative functions and k -automatic sequences

Soroosh Yazdani (2001)

Journal de théorie des nombres de Bordeaux

A sequence is called k -automatic if the n ’th term in the sequence can be generated by a finite state machine, reading n in base k as input. We show that for many multiplicative functions, the sequence ( f ( n ) mod v ) n 1 is not k -automatic. Among these multiplicative functions are γ m ( n ) , σ m ( n ) , μ ( n ) et φ ( n ) .

Nonaliquots and Robbins numbers

William D. Banks, Florian Luca (2005)

Colloquium Mathematicae

Let φ(·) and σ(·) denote the Euler function and the sum of divisors function, respectively. We give a lower bound for the number of m ≤ x for which the equation m = σ(n) - n has no solution. We also show that the set of positive integers m not of the form (p-1)/2 - φ(p-1) for some prime number p has a positive lower asymptotic density.

Currently displaying 181 – 200 of 484