English
Related papers

Related papers: Generalizations of Carmichael numbers I

200 papers

Let $\mathcal{A}=\left(a_i\right)_{i=1}^\infty$ be a weakly increasing sequence of positive integers and let $k$ be a fixed positive integer. For an arbitrary integer $n$, the restricted partition $p_\mathcal{A}(n,k)$ enumerates all the…

Combinatorics · Mathematics 2023-05-02 Krystian Gajdzica

In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…

Number Theory · Mathematics 2021-06-15 Chi Zhang

We present a general theorem characterizing the relationship between the prime base $p$ representations of non-negative integers $x$ and their positive integer powers, $x^n$. For any positive integer $l$, the theorem establishes the…

Number Theory · Mathematics 2019-07-04 John S. McCaskill , Peter R. Wills

Let $n \ge 3$ be an integer. Let $P_n = \{1, 2, 3, ..., n-1, n \}$ and let $S_n$ be the symmetric group of permutations on $P_n$. Motivated by the theory of discrete dynamical systems on the interval, we associate each permutation $\si_n$…

Rings and Algebras · Mathematics 2009-09-30 Bau-Sen Du

Let $R$ be a commutative ring with a non-zero identity, $S$ be a multiplicatively closed subset of $R$ and $M$ be a unital $R$-module. In this paper, we define a submodule $N$ of $M$ with $(N:_{R}M)\cap S=\emptyset$ to be weakly $S$-primary…

Commutative Algebra · Mathematics 2022-03-29 Ece Yetkin Celikel , Hani A. Khashan

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

We generalize the asymptotic estimates by Bubboloni, Luca and Spiga (2012) on the number of $k$-compositions of $n$ satisfying some coprimality conditions. We substantially refine the error term concerning the number of $k$-compositions of…

Number Theory · Mathematics 2021-05-31 László Tóth

In a recent paper, Bruinier and Ono prove that the coefficients of certain weight -1/2 harmonic Maass forms are traces of singular moduli for weak Maass forms. In particular, for the partition function $p(n)$, they prove that…

Number Theory · Mathematics 2011-07-22 Eric Larson , Larry Rolen

We consider a particular type of matrices which belong at the same time to the class of Hessenberg and Toeplitz matrices, and whose determinants are equal to the number of a type of compositions of natural numbers. We prove a formula in…

Combinatorics · Mathematics 2010-07-06 Milan Janjic

In this paper, we prove that there are infinitely many $n$ for which $rad(\varphi(n))|n-1$ but $n$ is not a Carmichael number. Additionally, we prove that for any $k\geq 3$, there exist infinitely many $n$ such that $\varphi(n)|(n-1)^k$ but…

Number Theory · Mathematics 2015-08-25 Nathan McNew , Thomas Wright

We use the theory of Kolyvagin systems to prove (most of) a refined class number formula conjectured by Darmon. We show that for every odd prime $p$, each side of Darmon's conjectured formula (indexed by positive integers $n$) is "almost" a…

Number Theory · Mathematics 2019-02-20 Barry Mazur , Karl Rubin

Let $A=\pmb k[x_1,...,x_n]/{(x_1^d,...,x_n^d)}$, where $\pmb k$ is an infinite field. If $\pmb k$ has characteristic zero, then Stanley proved that $A$ has the Weak Lefschetz Property (WLP). Henceforth, $\pmb k$ has positive characteristic…

Commutative Algebra · Mathematics 2011-10-14 Andrew R. Kustin , Adela Vraciu

An integer $k$ is called regular (mod $n$) if there exists an integer $x$ such that $k^2x\equiv k$ (mod $n$). This holds true if and only if $k$ possesses a weak order (mod $n$), i.e., there is an integer $m\ge 1$ such that $k^{m+1} \equiv…

Number Theory · Mathematics 2015-05-14 Brăduţ Apostol , László Tóth

A weak basis of a module is a generating set of the module minimal with respect to inclusion. A module is said to be regularly weakly based provided that each of its generating sets contain a weak basis. In the paper we study (1) rings over…

Rings and Algebras · Mathematics 2017-01-25 Michal Hrbek , Pavel Růžička

A Sierpi\'nski number is a positive odd integer $k$ such that $k \cdot 2^n + 1$ is composite for all positive integers $n$. Fix an integer $A$ with $2 \le A$. We show that there exists a positive odd integer $k$ such that $k\cdot a^n + 1$…

Number Theory · Mathematics 2023-05-17 Michael Filaseta , Robert Groth , Thomas Luckner

A well-known open problem asks to show that $2^n+5$ is composite for almost all values of $n$. This was proposed by Gil Kalai as a possible Polymath project, and was posed originally by Christopher Hooley. We show that, assuming GRH and a…

Number Theory · Mathematics 2023-08-24 Olli Järviniemi , Joni Teräväinen

A weak measurement consists in coupling a system to a probe in such a way that constructive interference generates a large output. So far, only the average output of the probe and its variance were studied. Here, the characteristic function…

Quantum Physics · Physics 2012-03-07 Antonio Di Lorenzo

A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$…

General Mathematics · Mathematics 2023-04-04 Zsófia Juhász , Máté Bartalos , Péter Magyar , Gábor Farkas

We establish the Kolmogorov-Feller weak law of large numbers for Frechet mean on non-compact symmetric spaces under certain regularity conditions. Our results accommodate non-identically distributed random variables and are accompanied by…

Probability · Mathematics 2025-09-03 Jongmin Lee , Sungkyu Jung

We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits…

Number Theory · Mathematics 2019-03-13 Jon Grantham , Witold Jarnicki , John Rickert , Stan Wagon