Displaying 321 – 340 of 1340

Showing per page

The distribution of square-free numbers of the form [ n c ]

Xiaodong Cao, Wenguang Zhai (1998)

Journal de théorie des nombres de Bordeaux

It is proved that the sequence [ n c ] ( n = 1 , 2 , ) contains infinite squarefree integers whenever 1 < c < 61 36 = 1 . 6944 , which improves Rieger’s earlier range 1 < c < 1 . 5 .

The distribution of the sum-of-digits function

Michael Drmota, Johannes Gajdosik (1998)

Journal de théorie des nombres de Bordeaux

By using a generating function approach it is shown that the sum-of-digits function (related to specific finite and infinite linear recurrences) satisfies a central limit theorem. Additionally a local limit theorem is derived.

The distribution of the values of a rational function modulo a big prime

Alexandru Zaharescu (2003)

Journal de théorie des nombres de Bordeaux

Given a large prime number p and a rational function r ( X ) defined over 𝔽 p = / p , we investigate the size of the set x 𝔽 p : r ˜ ( x ) > r ˜ ( x + 1 ) , where r ˜ ( x ) and r ˜ ( x + 1 ) denote the least positive representatives of r ( x ) and r ( x + 1 ) in modulo p .

The Divisibility Modulo 4 of Kloosterman Sums over Finite Fields of Characteristic 3

Sin, Changhyon (2011)

Serdica Journal of Computing

Recently Garashuk and Lisonek evaluated Kloosterman sums K (a) modulo 4 over a finite field F3m in the case of even K (a). They posed it as an open problem to characterize elements a in F3m for which K (a) ≡ 1 (mod4) and K (a) ≡ 3 (mod4). In this paper, we will give an answer to this problem. The result allows us to count the number of elements a in F3m belonging to each of these two classes.

Currently displaying 321 – 340 of 1340