中文
相关论文

相关论文: On the decimal and octal digits of $1/p$

200 篇论文

Let $p>3$ be a prime and $b\ge 2$ an integer such that $p$ does not divide $b$. Then $1/p$ has a periodic digit expansion with respect to the basis $b$. The length $q$ of the period is the (multiplicative) order of $b$ mod $p$. In the case…

数论 · 数学 2026-05-21 Kurt Girstmair

Let b be an odd integer such that b=+/-1 (mod 8) and let q be a prime with primitive root 2 such that q does not divide b. We show that if (p(k)) is a sequence of odd primes, with 0<=k<=q-2 such that p(k)=2p(k-1)+b for all 1<=k<=q-2, then…

数论 · 数学 2009-08-20 Douglas S. Stones

Let $p$ be an odd prime, and define $$G_p(x)=\prod_{k=1}^{(p-1)/2}\left(x-e^{2\pi i k^2/p}\right).$$ In this paper we study values of $G_p(x)$ at roots of unity via Galois theory, and confirm some previous conjectures. For example, for any…

数论 · 数学 2026-05-12 Zhi-Wei Sun

Let $S$ be a string of $l$ decimal digits. We give an explicit upper bound on some prime $p$ whose decimal representation contains the string $S$. We also show, as a corollary of the Green-Tao theorem, that there are arbitrarily long…

数论 · 数学 2014-07-31 Adrian Dudek

We show that for each positive integer $a$ there exist only finitely many prime numbers $p$ such that $a$ appears an odd number of times in the period of continued fraction of $\sqrt{p}$ or $\sqrt{2p}$. We also prove that if $p$ is a prime…

数论 · 数学 2023-09-04 Vítězslav Kala , Piotr Miska

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

计算机科学中的逻辑 · 计算机科学 2022-05-25 Ruben Gamboa , Woodrow Gamboa

Let $p$ be an odd prime. In this paper we investigate quadratic residues modulo $p$ and related permutations, congruences and identities. If $a_1<\ldots<a_{(p-1)/2}$ are all the quadratic residues modulo $p$ among $1,\ldots,p-1$, then the…

数论 · 数学 2019-07-10 Zhi-Wei Sun

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

数论 · 数学 2010-02-25 Li-Lu Zhao , Zhi-Wei Sun

Let $\delta(p)$ tend to zero arbitrarily slowly as $p\to\infty$. We exhibit an explicit set $\mathcal{S}$ of primes $p$, defined in terms of simple functions of the prime factors of $p-1$, for which the least primitive root of $p$ is $\le…

数论 · 数学 2024-10-08 Kevin Ford , Mikhail R. Gabdullin , Andrew Granville

Many famous integer sequences including the Catalan numbers and the Motzkin numbers can be expressed in the form $ConstantTermOf\left[P(x)^nQ(x)\right]$ for Laurent polynomials $Q$, and symmetric Laurent trinomials $P$. In this paper we…

组合数学 · 数学 2024-03-04 Nadav Kohen

Let $p$ be a prime number and $k$ be a positive integer not divisible by $p$. We describe the Heller translates of the periodic Lie module $\mathrm{Lie}(pk)$ in characteristic $p$ and show that it has period $2p-2$ when $p$ is odd and $1$…

表示论 · 数学 2015-01-27 Kay Jin Lim , Kai Meng Tan

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

数论 · 数学 2020-06-30 Komal Agrawal , Paul Pollack

Let $f(x) \in \mathbb{F}_p[x]$, and define the orbit of $x\in \mathbb{F}_p$ under the iteration of $f$ to be the set \[ \mathcal{O}(x):=\{x,f(x),(f\circ f)(x),(f\circ f\circ f)(x),\dots\}. \] An orbit is a $k$-cycle if it is periodic of…

数论 · 数学 2024-10-02 Jonathan Root

For a prime $p$ and an integer $x$, the $p$-adic valuation of $x$ is denoted by $\nu_{p}(x)$. For a polynomial $Q$ with integer coefficients, the sequence of valuations $\nu_{p}(Q(n))$ is shown to be either periodic or unbounded. The first…

数论 · 数学 2017-08-15 Luis A. Medina , Victor H. Moll , Eric Rowland

Let $p$ be an odd prime. For any $p$-adic integer $a$ we let $\overline{a}$ denote the unique integer $x$ with $-p/2<x<p/2$ and $x-a$ divisible by $p$. In this paper we study some permutations involving quadratic residues modulo $p$. For…

数论 · 数学 2025-03-04 Hai-Liang Wu

The purpose of this note is to report on the discovery of the primes of the form $p=1+n!\sum n$, for some natural numbers $n>0$. The number of digits in the prime p are approximately equal to $\lfloor log_{10}(1+n!\sum n)\rceil+1$.

综合数学 · 数学 2018-04-02 Maheswara Rao Valluri

Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*,$ then we say that $g$ is a $t$-near primitive root modulo $p$. We point out the easy result that each primitive residue class contains a…

数论 · 数学 2019-11-13 Pieter Moree , Min Sha

According to a popular belief, the decimal digits of mathematical constants such as {\pi} behave like statistically independent random variables, each taking the values 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 with equal probability of 1/10. If…

数论 · 数学 2025-04-15 Paula Nataniela Roba , Karlis Podnieks

The decimal digits of $\pi$ are widely believed to behave like as statistically independent random variables taking the values $0, 1, 2, 3, 4, 5$, $6, 7, 8, 9$ with equal probabilities $1/10$. In this article, first, another similar…

数论 · 数学 2014-11-17 Karlis Podnieks

Let $p$ be an odd prime number. In this article, we study the number of quadratic residues and non-residues modulo $p$ which are multiples of $2$ or $3$ or $4$ and lying in the interval $[1, p-1]$, by applying the Dirichlet's class number…

数论 · 数学 2019-01-30 Jaitra Chattopadhyay , Bidisha Roy , Subha Sarkar , R. Thangadurai
‹ 上一页 1 2 3 10 下一页 ›