中文
相关论文

相关论文: A Generalization of Euler's Theorem on Congruencie…

200 篇论文

In this short note, we introduce an Euler analogue of Wilson's theorem; $a_1a_2... a_{\phi(n)}\equiv (-1)^{\phi(n)+1}~({\rm mod}~n)$ say, where ${\rm gcd}(a_i,n)=1$.

数论 · 数学 2007-05-23 Mehdi Hassani , Mahmoud Momeni-Pour

The purpose of this article is to introduce the concept of invariance and its properties. These properties can be used to check the primality of a number. Combining these properties with the Euler theorem, it is possible to generalize this…

数论 · 数学 2023-09-06 Juan Hernandez-Toro

A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…

数论 · 数学 2015-07-02 József Vass

For a given real number $a$ we define the sequence $\{E_{n,a}\}$ by $E_{0,a}=1$ and $E_{n,a}=-a\sum_{k=1}^{[n/2]} \binom n{2k}E_{n-2k,a}$ $(n\ge 1)$, where $[x]$ is the greatest integer not exceeding $x$. Since $E_{n,1}=E_n$ is the n-th…

数论 · 数学 2013-07-30 Zhi-Hong Sun , Hai-Yan Wang

For a nonzero integer $a$ let ${E_n^{(a)}}$ be given by $\sum_{k=0}^{[n/2]}\binom n{2k}a^{2k}E_{n-2k}^{(a)}=(1-a)^n$ $(n=0,1,2,...)$, where $[x]$ is the greatest integer not exceeding $x$. As $E_n^{(1)}=E_n$ is the Euler number, $E_n^{(a)}$…

数论 · 数学 2013-07-16 Zhi-Hong Sun , Long Li

In this note we present a family of congruences which hold if and only if a natural number $n$ is prime.

数论 · 数学 2007-05-23 L. J. P. Kilford

According to Euler's relation any polytope P has as many faces of even dimension as it has faces of odd dimension. As a generalization of this fact one can compare the number of faces whose dimension is congruent to i modulo m with the…

组合数学 · 数学 2011-07-11 Laszlo Major

Let q>1 and m>0 be relatively prime integers. We find an explicit period $\nu_m(q)$ such that for any integers n>0 and r we have $[n+\nu_m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q),…

数论 · 数学 2007-08-06 Zhi-Wei Sun , Roberto Tauraso

Euler function $\phi(n)$ is the number of positive integers less than $n$ and relatively prime to $n$. Suppose that $\phi^1(n)=\phi(n)$ and $\phi^i(n)=\phi(\phi^{i-1}(n))$. Let $A\subseteq \mathbb{N}$, and $A_{\phi}=\{ \phi^k(n)| n\in A ,…

组合数学 · 数学 2020-12-24 Nima Ghanbari , Saeid Alikhani

We make an analytical proof for Lehmer's totient conjecture. Lehmer conjectured that there is no solution for the congruence equation $n-1\equiv 0~(mod~\phi(n))$ with composite integers,$n$, where $\phi(n)$ denotes Euler's totient function.…

综合数学 · 数学 2016-08-30 Ahmad Sabihi

In this article, we shall generalize a theorem due to Frobenius in group theory, which asserts that if $p$ is a prime and $p^{r}$ divides the order of a finite group, then the number of subgroups of order $p^{r}$ is $\equiv$ 1(mod $p$).…

群论 · 数学 2022-03-29 Supravat Sarkar

The partition function is known to exhibit beautiful congruences that are often proved using the theory of modular forms. In this paper, we study the extent to which these congruence results apply to the generalized Frobenius partitions…

数论 · 数学 2018-09-05 Marie Jameson , Maggie Wieczorek

Let $X$ be a set of positive integers, and let $\mathbb Z_K$ be the ring of integers of a number field $K$ of degree $n$. Denote by $N(I)$ the absolute norm of an ideal $I$ of $\mathbb Z_K$, and by $\mathcal A$ the set of principal ideals…

数论 · 数学 2019-11-19 Salvatore Tringali

We show that Lieb's concavity theorem holds more generally for any unitary invariant matrix function $\phi:\mathbf{H}_+^n\rightarrow \mathbb{R}_+^n$ that is concave and satisfies H\"older's inequality. Concretely, we prove the joint…

泛函分析 · 数学 2019-05-08 De Huang

A \emph{composition} is a sequence of positive integers, called \emph{parts}, having a fixed sum. By an \emph{$m$-congruence succession}, we will mean a pair of adjacent parts $x$ and $y$ within a composition such that $x\equiv y(\text{mod}…

组合数学 · 数学 2013-07-30 Toufik Mansour , Mark Shattuck , Mark C. Wilson

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

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

数论 · 数学 2021-08-03 Jorma Jormakka , Sourangshu Ghosh

We show, conditional on a uniform version of the prime k-tuples conjecture, that there are x(log x)^{-1+o(1)} numbers not exceeding x common to the ranges of Euler's function phi(n) and the sum-of-divisors function sigma(m).

数论 · 数学 2019-10-22 Kevin Ford , Paul Pollack

We classify all instances of the condition $a_{p}(f) \equiv x \bmod \lambda$ being related to a congruence on the prime $p$, where $a_{p}(f)$ denotes the $p$th Fourier coefficient of a classical normalised cuspidal eigenform $f$ and…

数论 · 数学 2025-06-11 Michael A. Daas

We show that Lieb's concavity theorem holds more generally for any unitarily invariant matrix function $\phi:\mathbf{H}^n_+\rightarrow \mathbb{R}$ that is monotone and concave. Concretely, we prove the joint concavity of the function $(A,B)…

泛函分析 · 数学 2019-06-04 De Huang
‹ 上一页 1 2 3 10 下一页 ›