The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1

Displaying 1 – 17 of 17

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 ) .

Currently displaying 1 – 17 of 17

Page 1