相关论文: Etude probabiliste des p-quotients de Fermat

Solving the equation $P_a(X):=X^{q+1}+X+a=0$ over finite field $\GF{Q}$, where $Q=p^n, q=p^k$ and $p$ is a prime, arises in many different contexts including finite geometry, the inverse Galois problem \cite{ACZ2000}, the construction of…

Let K/Q be a Galois extension of degree n, of Galois group G, and let $\eta\in K^\times$. For all large enough prime p, we define, by use of the Frobenius theorem on group determinants, the family $(\Delta_p^\theta(\eta) \in \F_p)_\theta$…

In this paper, we provide a generalization of Proth's theorem for integers of the form $Kp^n+1$. In particular, a primality test that requires only one modular exponentiation similar to that of Fermat's test without the computation of any…

Let $F(\sigma)$ be the random Dirichlet series $F(\sigma)=\sum_{p\in\mathcal{P}} \frac{X_p}{p^\sigma}$, where $\mathcal{P}$ is an increasing sequence of positive real numbers and $(X_p)_{p\in\mathcal{P}}$ is a sequence of i.i.d. random…

Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…

Let a be a positive integer which is not a perfect h-th power with h greater than 1, and Q_a(x;4,j) be the set of primes p less than x such that the residual order of a(mod p) is congruent to j modulo 4. When j=0, 2, it is known that…

Let $p>3$ be a prime, and let $q_p(2)=(2^{p-1}-1)/p$ be the Fermat quotient of $p$ to base 2. Recently, Z. H. Sun proved that \sum_{k=1}^{p-1}\frac{1}{k\cdot 2^k}\equiv q_p(2)-\frac{p}{2}q_p(2)^2 \pmod{p^2} which is a generalization of a…

In this paper, we investigate the trinomial probability distribution of the first and second kind from the $\mathcal{R}(p,q)$-quantum algebras. Moreover, we compute their $\mathcal{R}(p,q)$-factorial moments and derive the corresponding…

It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum…

In this paper the limit probabilities of first-order properties are studied. The random graph $G(n,p)$ {\it obeys Zero-One $k$-Law} if for each first-order property with quantifier depth not greater than $k$ its probability tends to 0 or…

Let g be a non-zero rational number. Let N_{g,t}(x) denote the number of primes p<=x for which the subgroup of the multiplicative group of the finite field having p elements that is generated by g mod p is of residual index t. In Part I,…

Frechet bounds of the 1-st kind for sets of events and its main properties are considered. The lemma on not more than two nonzero values of lower Frechet-bounds of the 1-st kind for a set of half-rare events is proved with the corollary on…

We study number theoretic properties of the map $x \mapsto x^{x} \mod{p}$, where $x \in \{1,2,\ldots,p-1\}$, and improve on some recent upper bounds, due to Kurlberg, Luca, and Shparlinski, on the number of primes $p < N$ for which the map…

Let $p>1$ be a large prime number, let $q=O(\log\log p)$ and let $1\leq a<q$ be a pair of relatively prime integers. It is proved that there is a prime primitive root $u\ll (\log p)(\log \log p)^5$ such that $u\equiv a\bmod q$ in the prime…

It was recently proven [Hilhorst, JSTAT, P10023 (2010)] that the q-generalization of the Fourier transform is not invertible in the full space of probability density functions for q > 1. It has also been recently shown that this…

Fix \epsilon > 0, and let p_1 = 2, p_2 = 3,... be the sequence of all primes. We prove that if (q,a) = 1 then there are infinitely many pairs p_r, p_{r+1} such that p_r \equiv p_{r+1} \equiv a \mod q and p_{r+1} - p_r < \epsilon\log p_r.…

We present an alternative frequencists' proof of the quantum probability rule which does not make use of the frequency operator, with expectation that this can circumvent the recent criticism against the previous proofs which use it. We…

Let $q \in (0,1)$ and $\delta \in (0,1)$ be real numbers, and let $C$ be a coin that comes up heads with an unknown probability $p$, such that $p \neq q$. We present an algorithm that, on input $C$, $q$, and $\delta$, decides, with…

Suppose that f : F_p^n -> [0,1] has expected value t in [p^(-n/9),1] (so, the density t can be quite low!). Furthermore, suppose that support(f) has no three-term arithmetic progressions. Then, we develop non-trivial lower bounds for f_j,…

We introduce the concept of quotient in PN spaces and give some examples. We prove some theorems with regard to the completeness of a quotient.