中文
相关论文

相关论文: On Kurepa's problems in number Theory

200 篇论文

Let p be any prime, and let a and n be nonnegative integers. Let $r\in Z$ and $f(x)\in Z[x]$. We establish the congruence $$p^{\deg f}\sum_{k=r(mod p^a)}\binom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{\sum_{i=a}^{\infty}[n/p^i]})$$ (motivated by…

数论 · 数学 2007-07-25 Zhi-Wei Sun , Donald M. Davis

We use topological ideas to show that, assuming the conjecture of Erd\"(o)s on subsets of positive integers having no $p$ terms in arithmetic progression (A. P.), there must exist a subset $M_p$ of positive integers with no $p$ terms in A.…

数论 · 数学 2007-05-23 Goutam Pal

In this paper, we confirm some congruences conjectured by V.J.W. Guo and M.J. Schlosser recently. For example, we show that for primes $p>3$, $$…

数论 · 数学 2020-06-30 Chen Wang

In 1987, Dan Gordon defined an elliptic curve analogue to Carmichael numbers known as elliptic Carmichael numbers. In this paper, we prove that there are infinitely many elliptic Carmichael numbers. In doing so, we resolve in the…

数论 · 数学 2018-08-01 Thomas Wright

Let p be any prime, and $p^(\nu_p(n!))$ the maximal power of $p$ dividing $n!$. It is proved that there exists a positive integer $n_0$, which depends only on $p$, such that $q^(\nu_q(n!)) < p^(\nu_p(n!))$ for all $n \ge n_0$ and all primes…

数论 · 数学 2026-04-28 Dan Levy

We prove in particular that for any sufficiently large prime $p$ there is $1\le a<p$ such that all partial quotients of $a/p$ are bounded by $O(\log p/\log \log p)$. For composite denominators a similar result is obtained. This improves the…

数论 · 数学 2023-01-02 Nikolay Moshchevitin , Brendan Murphy , Ilya Shkredov

There has been always an ambiguity in division when zero is present in the denominator. So far this ambiguity has been neglected by assuming that division by zero as a non-allowed operation. In this paper, I have derived the new set of…

综合数学 · 数学 2011-07-07 Mohd Abubakr

Let $k\ge 2$ be a positive integer and $P^+(n)$ the greatest prime factor of a positive integer $n$ with convention $P^+(1)=1$. For any $\theta\in \left[\frac 1{2k},\frac{17}{32k}\right)$, set…

数论 · 数学 2023-06-06 Yuchen Ding , Lilu Zhao

Define a permutation $\sigma$ to be coprime if $\gcd(m,\sigma(m)) = 1$ for $m\in[n]$. In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations on $[n]$ is $n!\cdot (c+o(1))^n$ where \[c =…

数论 · 数学 2022-03-30 Ashwin Sah , Mehtaab Sawhney

Let $p$ be an odd prime, and $m,r \in \mathbb{Z}^+$ with $m$ coprime to $p$. In this paper we investigate the real quadratic fields $K = \mathbb{Q}(\sqrt{m^2p^{2r} + 1})$. We first show that for $m < C$, where constant $C$ depends on $p$,…

数论 · 数学 2024-08-08 Peikai Qi , Matt Stokes

In the paper we probe the possibilities of creating a Kurepa tree in a generic extension of a model of CH plus no Kurepa trees by an omega_1-preserving forcing notion of size at most omega_1. In the first section we show that in the Levy…

逻辑 · 数学 2016-09-06 Renling Jin , Saharon Shelah

For an odd prime $p$ and two positive integers $n\geq 3$ and $k$ with $\frac{n}{{\rm gcd}(n,k)}$ being odd, the paper determines the weight distribution of a $p$-ary cyclic code $\mathcal{C}$ over $\mathbb{F}_{p}$ with nonzeros…

信息论 · 计算机科学 2009-01-19 Xiangyong Zeng , Lei Hu , Wenfeng Jiang , Qin Yue , Xiwang Cao

In the thirties of the last century, I. M. Vinogradov established uniform distribution modulo 1 of the sequence $p\alpha$ when $\alpha$ is a fixed irrational real number and $p$ runs over the primes. In particular, he showed that the…

In this paper we consider alternating Kurepa's function $A(z)$ \cite{Petojevic_02}. We give some recurrent relations for alternating Kurepa's function via appropriate sequences of rational functions and gamma function. Also we give some…

复变函数 · 数学 2007-05-23 Branko Malesevic

In this paper, we prove that for any odd prime $p$ and for any $p$-integer $\alpha $,we have $ \binom{\alpha p-1}{p-1}\equiv 1-\alpha (\alpha -1)(\alpha ^{2}-\alpha -1)p\sum_{k=1}^{p-1}\frac{1}{k}+\alpha ^{2} (\alpha-1)^{2}p^{2}\sum_{1\leq…

组合数学 · 数学 2016-07-05 Farid Bencherif , Rachid Boumahdi

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

We study the existence and multiplicity of positive solutions for the following concave-critical problem driven by an operator of mixed order obtained by the sum of the classical $p$-Laplacian and of the fractional $p$-Laplacian,…

偏微分方程分析 · 数学 2026-05-08 Mousomi Bhakta , Nirjan Biswas , Paramananda Das

Let $p$ be any odd prime number. Let $k$ be any positive integer such that $2\leq k\leq [\frac{p+1}3]+1$. Let $S = (a_1,a_2,...,a_{2p-k})$ be any sequence in ${\Bbb Z}_p$ such that there is no subsequence of length $p$ of $S$ whose sum is…

组合数学 · 数学 2007-05-23 W D Gao , A Panigrahi , R Thangadurai

Let $p$ be a prime, $\varepsilon>0$ and $0<L+1<L+N < p$. We prove that if $p^{1/2+\varepsilon}< N <p^{1-\varepsilon}$, then $$ \#\{n!\!\!\! \pmod p;\,\, L+1\le n\le L+N\} > c (N\log N)^{1/2},\,\, c=c(\varepsilon)>0. $$ We use this bound to…

数论 · 数学 2015-05-25 M. Z. Garaev , J. Hernández

This article deals with a conjecture, introduced in [GQ] (hereinafter $SFLT2$), which generalizes the second case of Fermat's Last Theorem: {\it Let $p>3$ be a prime. The diophantine equation $\frac{u^p+v^p}{u+v}=w_1^p$ with $u,v,u+v,…

数论 · 数学 2013-05-30 Roland Quême