中文
相关论文

相关论文: A remark on Zoloterav's theorem

200 篇论文

Let $p=3n+1$ be a prime with $n\in\mathbb{N}=\{0,1,\cdots\}$, and let $g\in\mathbb{Z}$ be a primitive root modulo $p$. Let $0<a_1<\cdots<a_n<p$ be all the cubic residues modulo $p$ in the interval $(0,p)$. Then clearly the sequence $$a_1\…

数论 · 数学 2021-05-21 Hai-Liang Wu , Yue-Feng She

Our main result shows that for every odd natural number n > 1 there is a partition of the rational numbers, x/2n in lowest terms, in the unit interval, the product of whose Gamma values takes the form of powers of 2 and pi.

经典分析与常微分方程 · 数学 2009-07-13 Albert Nijenhuis

In this paper, we show that if $p\equiv 1\pmod 4$ is prime, then $4F_p$ admits a representation of the form $u^2-pv^2$ for some integers $u$ and $v$, where $F_n$ is the $n$th Fibonacci number. We prove a similar result when $p\equiv -1\pmod…

数论 · 数学 2015-02-17 Pedro Berrizbeitia , Florian Luca , Alberto Mendoza

We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…

数论 · 数学 2013-10-08 Ariane M. Masuda , Michael E. Zieve

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…

数论 · 数学 2022-10-17 Roland Bacher

Let $m$ be any positive integer and let $\delta_1,\delta_2\in\{1,-1\}$. We show that for some constanst $C_m>0$ there are infinitely many integers $n>1$ with $p_{n+m}-p_n\le C_m$ such that $$\left(\frac{p_{n+i}}{p_{n+j}}\right)=\delta_1\…

数论 · 数学 2019-09-06 Hao Pan , Zhi-Wei Sun

For a Jacobi matrix J on l^2(Z_+) with Ju(n)=a_{n-1} u(n-1) + b_n u(n) + a_n u(n+1), we prove that \sum_{|E|>2} (E^2 -4)^{1/2} \leq \sum_n |b_n| + 4\sum_n |a_n -1|. We also prove bounds on higher moments and some related results in higher…

数学物理 · 物理学 2007-05-23 Dirk Hundertmark , Barry Simon

Prempreesuk, Noppakaew, and Pongsriiam determined the Zeckendorf representation of the multiplicative inverse of $2$ modulo $F_n$, for every positive integer $n$ not divisible by $3$, where $F_n$ denotes the $n$th Fibonacci number. We…

数论 · 数学 2022-03-14 Gessica Alecci , Nadir Murru , Carlo Sanna

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab + cd with min(a, b) > max(c, d) of two ordered products. This gives a new proof Fermat's Theorem expressing primes of the form 1 + 4N as sums of two squares 1 .

历史与综述 · 数学 2021-11-05 Roland Bacher

Let $p>3$ be a prime. We investigate Legendre symbol of $\displaystyle \prod_{0<i<j<p/2 \atop p\nmid f(i,j) } f(i,j) \ $, where $i,j\in \Bbb Z, f(i,j)$ is a linear or quadratic form with integer coefficients. When $f=ai^2+bij+cj^2$ and…

数论 · 数学 2020-08-25 Chao Huang

Let $p$ be a sufficiently large prime number, $n$ be a positive odd integer with $n|\,p-1$ and $n>p^\varepsilon $, where $\varepsilon$ is a sufficiently small constant. Let $k(p,\,n)$ denote the least positive integer $k$ such that for…

数论 · 数学 2019-09-04 Ke Gong , Chaohua Jia

For every positive integer $n$ greater than $4$ there is a set of Latin squares of order $n$ such that every permutation of the numbers $1,\ldots,n$ appears exactly once as a row, a column, a reverse row or a reverse column of one of the…

组合数学 · 数学 2020-06-11 Stephan Foldes , András Kaszanyitzky , Laszlo Major

We define A_n=\sum_{i=1}^n (-1)^i\frac{1}{i} and we show that, for every prime p, there exists a number n such that A_n\equiv 0 (mod p).

综合数学 · 数学 2007-05-23 Antonio M. Oller Marcen

In 2003, Zhao discovered a curious congruence involving harmonic series and Bernoulli numbers: for any odd prime $p$, $$\sum_{\substack{i,j,k\ge 1\\\gcd(ijk,p)=1\\i+j+k=p}}\frac{1}{ijk}\equiv -2B_{p-3} \pmod{p},$$ where $B_n$ is the $n$-th…

数论 · 数学 2021-10-20 Shane Chern

Using the $q$-Wilf--Zeilberger method and a $q$-analogue of a "divergent" Ramanujan-type supercongruence, we give several $q$-supercongruences modulo the fourth power of a cyclotomic polynomial. One of them is a $q$-analogue of a…

数论 · 数学 2020-04-23 Victor J. W. Guo

Let $\Omega$ be a matrix with entries $a_{i,j}=\omega^{ij},$ $1\leq i,j \leq n,$ where $\omega=e^{2\pi \sqrt{-1}/n},$ $n\in \mathbb N.$ The Chebotarev theorem states that if $n$ is a prime then any minor of $\Omega$ is non-zero. In this…

数论 · 数学 2007-05-23 F. Pakovich

In this paper we present a new proof of the following 2010 result of Dubickas, Novikas, and Siurys: Let $(a,b)\in \mathbb{Z}^2$ and let $(x_n)_{n\ge 0}$ be the sequence defined by some initial values $x_0$ and $x_1$ and the second order…

数论 · 数学 2018-12-20 Dan Ismailescu , Adrienne Ko , Celine Lee , Jae Yong Park

For a polynomial with palindromic coefficients, unimodality is equivalent to having a nonnegative $g$-vector. A sufficient condition for unimodality is having a nonnegative $\gamma$-vector, though one can have negative entries in the…

组合数学 · 数学 2016-01-20 Charles Brittenham , Andrew Carroll , T. Kyle Petersen , Connor Thomas

In this paper, we characterize the odd positive integers $n$ satisfying the congruence $\sum_{j=1} ^ {n-1} j^{\frac{n-1}{2}}\equiv 0 \pmod n$. We show that the set of such positive integers has an asymptotic density which turns out to be…

数论 · 数学 2011-03-18 Jose Maria Grau , Florian Luca , Antonio M. Oller-Marcen

We show that if p is an odd prime then $$\sum_{k=0}^{p-1}E_kE_{p-1-k}=1 (mod p)$$ and $$\sum_{k=0}^{p-3}E_kE_{p-3-k}=(-1)^{(p-1)/2}2E_{p-3} (mod p),$$ where E_0,E_1,E_2,... are Euler numbers. Moreover, we prove that for any positive integer…

数论 · 数学 2010-12-22 Zhi-Wei Sun