Related papers: Carmichael Numbers in All Possible Arithmetic Prog…

We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…

We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…

Let $b \geq 2$ be an integer, and write the base $b$ expansion of any non-negative integer $n$ as $n=x_0+x_1b+\dots+ x_{d}b^{d}$, with $x_d>0$ and $ 0 \leq x_i < b$ for $i=0,\dots,d$. Let $\phi(x)$ denote an integer polynomial such that…

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

A strictly increasing sequence of positive integers is called a slightly curved sequence with small error if the sequence can be well-approximated by a function whose second derivative goes to zero faster than or equal to $1/x^\alpha$ for…

We obtain results for the following question where $m\ge 1$ and $n\ge 2$ are integers. Question. For which continuous functions $f\colon [0,\infty)\to [0,\infty)$ does there exist a continuous function $\varphi\colon (0,1)\to (0,\infty)$…

Quadratic irrationals posses a periodic continued fraction expansion. Much less is known about cubic irrationals. We do not even know if the partial quotients are bounded, even though extensive computations suggest they might follow…

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

The bulk of this paper is devoted to the comparison of several models for the theory of (infinity,2)-categories: that is, higher categories in which all k-morphisms are invertible for k > 2 (the case of (infinity,n)-categories is also…

Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements $a_1,...,a_m$ of the cyclic group of order $m$, there is a permutation $\pi$ such that…

Fix $k$ a positive integer, and let $\ell$ be coprime to $k$. Let $p(k,\ell)$ denote the smallest prime equivalent to $\ell \pmod{k}$, and set $P(k)$ to be the maximum of all the $p(k,\ell)$. We seek lower bounds for $P(k)$. In particular,…

This paper proves the existence of infinitely many Perrin pseudoprimes, as conjectured by Adams and Shanks in 1982. The theorem proven covers a general class of pseudoprimes based on recurrence sequences. The result uses ingredients of the…

Let K be a number field, let f(x) in K(x) be a rational function of degree d> 1, and let z in K be a wandering point such that f^n(z) is nonzero for all n > 0. We prove that if the abc-conjecture holds for K, then for all but finitely many…

We study the repetition of patches in self-affine tilings in R^d. In particular, we study the existence and non-existence of arithmetic progressions. We first show that an arithmetic condition of the expansion map for a self-affine tiling…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Let $a\geq 1, b\geq 0$ and $k\geq 2$ be any given integers. It has been proven that there exist infinitely many natural numbers $m$ such that sum of divisors of $m$ is a perfect $k$th power. We try to generalize this result when the values…

Let A and M be nonempty sets of positive integers. A partition of the positive integer n with parts in A and multiplicities in M is a representation of n in the form n = \sum_{a\in A} m_a a, where m_a is in M U {0} for all a in A, and m_a…

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.