Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

The normal number of prime factors of f a ( n ) FILIP SAIDAK

- F. Saidak
- 2005

Assuming a quasi-generalized Riemann Hypothesis (6) for certain Dedekind zeta functions, we prove the following theorem: If a ≥ 2 is a square-free integer, then for the exponent function f a (n)… Expand

57 16- PDF

ZHOU ’ S THEORY OF CONSTRUCTING IDENTITIES

- F. T. Howard, F. Saidak
- 2006

We give a new simple proof of Chizhong Zhou’s method of constructing identities for linear recurrence sequences. We show how Zhou’s theorem can be used to prove a wide variety of identities for… Expand

10 6

On the modulus of the Riemann zeta function in the critical strip

- F. Saidak, P. Zvengrowski
- Mathematics
- 2003

For the Riemann zeta function C( s ), defined for complex s = cr+it, we write a = ^ + A, and we study the horizontal behaviour of |C( S)| in the critical strip |A| |CQ+A +І I ) for 0 < A < T-, 27T +… Expand

25 4

Square-free values of the Carmichael function

- F. Pappalardi, F. Saidak, I. Shparlinski
- Mathematics
- 1 November 2003

We obtain an asymptotic formula for the number of square-free values among p−1, for primes p⩽x, and we apply it to derive the following asymptotic formula for L(x), the number of square-free values… Expand

20 3- PDF

A note on the maximal coefficients of squares of Newman polynomials

- K. Berenhaut, F. Saidak
- Mathematics
- 1 August 2007

Abstract In a recent paper [G. Yu, An upper bound for B 2 [ g ] sets, J. Number Theory 122 (1) (2007) 211–220] Gang Yu stated the following conjecture: Let { p i } i = 1 ∞ be an arbitrary sequence of… Expand

6 3- PDF

Non-Abelian Generalizations of the Erdős-Kac Theorem

Abstract Let $a$ be a natural number greater than 1. Let ${{f}_{a}}\left( n \right)$ be the order of $a\,\bmod \,n$ . Denote by $\omega \left( n \right)$ the number of distinct prime factors of $n$ .… Expand

17 2- PDF

On Goldbach's Conjecture for Integer Polynomials

- F. Saidak
- Mathematics, Computer Science
- Am. Math. Mon.
- 1 June 2006

TLDR

8 1- PDF

Descartes Numbers

- W. Banks, A. Güloglu, C. Nevans, F. Saidak
- 2007

We call n a Descartes number if n is odd and n = km for two integers k,m > 1 such that σ(k)(m + 1) = 2n, where σ is the sum of divisors function. In this paper, we show that the only cube-free… Expand

5 1- PDF

Horizontal Monotonicity of the Modulus of the Riemann Zeta Function and Related Functions

- Y. Matiyasevich, F. Saidak, Peter D. Zvengrowski
- Mathematics
- 12 May 2012

As usual let s = �+it. For any fixed value t = t0 with |t0| ≥ 8, and for � ≤ 0, we show that |�(s)| is strictly monotone decreasing in �,

6 1- PDF

Riemann and his zeta function

- E. Kudryavtseva, F. Saidak, Peter D. Zvengrowski
- Mathematics
- 2005

An exposition is given, partly historical and partly mathematical, of the Riemann zeta function � ( s ) and the associated Riemann hypothesis. Using techniques similar to those of Riemann, it is… Expand

3 1- PDF

...

1

2

3

4

...