English
Related papers

Related papers: On strong Skolem starters for $\mathbb{Z}_{pq}$

200 papers

Consider a set $A$ with no $p$-term arithmetic progressions for $p$ prime. The $p$-Stanley sequence of a set $A$ is generated by greedily adding successive integers that do not create a $p$-term arithmetic progression. For $p>3$ prime, we…

Combinatorics · Mathematics 2017-07-07 Mehtaab Sawhney , Jonathan Tidor

Define $\psi_m$ to be the smallest strong pseudoprime to the first $m$ prime bases. The exact value of $\psi_m$ is known for $1\le m \le 8$. Z. Zhang have found a 19-decimal-digit number $Q_{11}=3825\,12305\,65464\,13051$ which is a strong…

Number Theory · Mathematics 2012-07-03 Yupeng Jiang , Yingpu Deng

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

Number Theory · Mathematics 2019-04-01 Lucile Devin

The Skolem Problem asks, given a linear recurrence sequence $(u_n)$, whether there exists $n\in\mathbb{N}$ such that $u_n=0$. In this paper we consider the following specialisation of the problem: given in addition $c\in\mathbb{N}$,…

Number Theory · Mathematics 2020-06-16 George Kenison , Richard Lipton , Joël Ouaknine , James Worrell

Let $\sigma(n)$ and $\gamma(n)$ denote the sum of divisors and the product of distinct prime divisors of $n$ respectively. We shall show that, if $n\neq 1, 1782$ and $\sigma(n)=(\gamma(n))^2$, then there exist odd (not necessarily distinct)…

Number Theory · Mathematics 2021-09-22 Tomohiro Yamada

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

Logic in Computer Science · Computer Science 2026-03-12 Ruiwen Dong , Doron Shafrir

Two elements in a group $G$ are said to $z$-equivalent or to be in the same $z$-class if their centralizers are conjugate in $G$. In \cite{kkj}, it was proved that a non-abelian $p$-group $G$ can have at most $\frac{p^k-1}{p-1} +1$ number…

Group Theory · Mathematics 2016-05-05 Shivam Arora , Krishnendu Gongopadhyay

If $a>b$ and $n>1$ are positive integers and $a$ and $b$ are relatively prime integers, then a large Zsigmondy prime for $(a,b,n)$ is a prime $p$ such that $p \,|\, a^n-b^n$ but $p \,\nmid \, a^m-b^m$ for $1 \leq m < n$ and either $p^2 \, |…

Number Theory · Mathematics 2024-07-11 Ömer Avcı

This paper deals more generally with @-numbers defined as follows: Call `\textit{alpha number}' of order $(\underline{\alpha},\bar{\alpha})\in\mathbb{H}^2$, (denote its family by @$_{(\underline{\alpha},\bar{\alpha})\in\mathbb{H}^2;…

Number Theory · Mathematics 2021-05-28 Abiodun E. Adeyemi

In 1938, Skolem conjectured that $\mathbf{SL}_n(\mathbb{Z})$ is not a polynomial family for any $n \ge 2$. Carter and Keller disproved Skolem's conjecture for all $n \ge 3$ by proving that $\mathbf{SL}_n(\mathbb{Z})$ is boundedly generated…

Number Theory · Mathematics 2015-11-05 Dong Quan Ngoc Nguyen

For any prime p and any positive integer n, let B(p,n) denote the n-th layer of the cyclotomic Z_p-extension over the rationals. Based on the heuristics of Cohen and Lenstra, and refined by new results on class numbers of particular B(p,n),…

Number Theory · Mathematics 2015-01-05 John C. Miller

We show that computing the strongest polynomial invariant for single-path loops with polynomial assignments is at least as hard as the Skolem problem, a famous problem whose decidability has been open for almost a century. While the…

Programming Languages · Computer Science 2023-11-15 Julian Müllner , Marcel Moosbrugger , Laura Kovács

A prime number $p$ is called a Schenker prime if there exists such $n\in\mathbb{N}_+$ that $p\nmid n$ and $p\mid a_n$, where $a_n = \sum_{j=0}^{n}\frac{n!}{j!}n^j$ is so-called Schenker sum. T. Amdeberhan, D. Callan and V. Moll formulated…

Number Theory · Mathematics 2014-01-09 Piotr Miska

Let p be an odd prime. Let K_p = \Q(zeta_p) be the p-cyclotomic field. We apply a Kummer and Stickelberger relation of K_p to some singular not primary numbers A of K_p connected to p-class group of K_p and prove they verify the congruence…

Number Theory · Mathematics 2007-05-23 Roland Queme

Let $p$ be an odd prime, let $N$ be a prime with $N \equiv 1 \pmod{p}$, and let $\zeta_p$ be a primitive $p$-th root of unity. We study the $p$-rank of the class group of $\mathbb{Q}(\zeta_p, N^{1/p})$ using Galois cohomological methods and…

Number Theory · Mathematics 2024-08-09 Ufuoma Asarhasa , Rusiru Gambheera , Debanjana Kundu , Enrique Nunez Lon-wo , Arshay Sheth

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…

Number Theory · Mathematics 2019-09-04 Ke Gong , Chaohua Jia

If $p$ is an odd prime, then we prove that $\e(H_2(G,\mathbb{Z})) \mid p\ \e(G)$ for $p$ groups of class 7. We prove the same for $p$ groups of class at most $p+1$ with $\e(Z(G))=p$. We also prove Schurs conjecture if $\e(G/Z(G))$ is $2,3$…

Group Theory · Mathematics 2020-06-30 A. E. Antony , V. Z. Thomas

In this paper we investigate the structure of finite $p$-groups with the property that every subgroup of index $p^i$ is powerful for some $i$. For odd primes $p$, we show that under certain conditions these groups must be potent. Then,…

Group Theory · Mathematics 2021-01-15 James Williams

Let $\overline{p}_{j,k}(n)$ denotes the number of $(j,k)$-regular overpartitions of a positive integer $n$ such that none of the parts is congruent to $j$ modulo $k$. Naika et. al. (2021) proved infinite families of congruences modulo…

Number Theory · Mathematics 2021-09-16 Riyajur Rahman , Nipen Saikia

The Skolem Problem asks to determine whether a given integer linear recurrence sequence has a zero term. This problem arises across a wide range of topics in computer science, including loop termination, formal languages, automata theory,…

Discrete Mathematics · Computer Science 2024-02-21 Florian Luca , James Maynard , Armand Noubissie , Joël Ouaknine , James Worrell