Related papers: Cullen Numbers with the Lehmer Property

An integer $n$ is said to be ternary if it is composed of three distinct odd primes. In this paper, we asymptotically count the number of ternary integers $n \leq x$ with the constituent primes satisfying various constraints. We apply our…

Let g be a finite dimensional simple Lie algebra over an algebraically closed field of characteristic zero. We show that if the Gelfand-Kirillov conjecture holds for g, then g has type A_n, C_n or G_2.

Let $T(n)=\left\{\begin{array}{ll}3n+1&(n\hbox{ odd})\frac n2&(n\hbox{ even})\end{array}\right.$ ($n\in\mathbb Z$). We call "the orbit of the integer $n$", the set $$ \mathcal O_n:=\{m\in\mathbb Z\;:\;\exists k\ge0,\ m=T^k(n)\} $$ and we…

In this paper, we characterize the odd positive integers $n$ satisfying the congruence $\sum_{j=1} ^ {n-1} j^{\frac{n-1}{2}}\equiv 0 \pmod n$. We show that the set of such positive integers has an asymptotic density which turns out to be…

Let n>1 be a number. Let Gn be the hypergraph of all rectangles in an n-dimensional Euclidean space. It is consistent that ZF+DC holds, the chromatic number of Gn is countable, yet the chromatic number of Gn+1 is uncountable.

We say a polynomial f having integer coefficients is strongly coefficient convex if the set of coefficients of f consists of consecutive integers only. We establish various results suggesting that the divisors of x^n-1 with integer…

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

In this paper, we generalize D. H. Lehmer's result to give a sufficient condition for level one cusp forms $f$ with integral Fourier coefficients such that the smallest $n$ for which the coefficients $a_n(f)=0$ must be a prime. Then we…

We show characterizations of the class of Cullen-regular functions in the sense of Gentili-Struppa for any domain $\Omega$ in terms of the Fueter operator. We then state a Integral Theorem and discuss how it can be used to define a more…

Based on a presentation of $\mathcal{C}_n$ and the help of [GAP], we construct the character table of the Clifford group $\mathcal{C}_n$ for $n=1,2,3$. As an application, we can efficiently decompose the (higher power of) tensor product of…

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

Let $p$ be a prime, $m$ be a positive integer ( $m \geq 1$, and $m \geq 2$ if $p=2$), and $\chi_n$ be a multiplicative complex character on $\mathbb F^*_{p^m}$ with order $n| (p^m-1)$. We show that a partition $\mathcal A_1 \cup \mathcal…

We prove that there does not exist a non-square quadratic polynomial with integer coefficients and an axis of symmetry which takes square values for N consecutive integers for N=7 or N >= 9. At the opposite, if N <= 6 or N=8 there are…

We call an odd positive integer $n$ a $\textit{Descartes number}$ if there exist positive integers $k,m$ such that $n = km$ and \begin{equation} \sigma(k)(m+1) = 2km \end{equation} Currently, $\mathcal{D} = 3^{2}7^{2}11^{2}13^{2}22021$ is…

A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…

Let $\epsilon$ be a fixed positive quantity, $m$ be a large integer, $x_j$ denote integer variables. We prove that for any positive integers $N_1,N_2,N_3$ with $N_1N_2N_3>m^{1+\epsilon},$ the set $$ \{x_1x_2x_3 \pmod m: \quad x_j\in [1,N_j]…

We show that if $k\ge 2$ is an integer and $(F_n^{(k)})_{n\ge 0}$ is the sequence of $k$-generalized Fibonacci numbers, then there are only finitely many triples of positive integers $1<a<b<c$ such that $ab+1,~ac+1,~bc+1$ are all members of…

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}_{n=1}^{\infty}$; Lekkerkerker proved that the average number of summands for integers in $[F_n,…

We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…

Let $c\phi_{k}(n)$ be the $k$-colored generalized Frobenius partition function. By employing the generating function of $c\phi_{6}(3n+1)$ found by Hirschhorn, we prove that $c\phi_{6}(27n+16)\equiv 0$ (mod 243). This confirms a conjecture…