Related papers: On the representation of friable integers by linea…

Let $a, b\in \mathbb{N}$ be relatively prime. We consider $(a-1)(b-1)/2$, which arises in the study of the $pq$-th cyclotomic polynomial, where $p,q$ are distinct primes. We prove two possible representations of $(a-1)(b-1)/2$ as…

The representation dimension of a finite group G is the smallest positive integer m for which there exists an embedding of G in GL_m(C). In this paper we find the largest value of representation dimensions, as Granges over all groups of…

In this paper, it is established that every sufficiently large positive integer $n$ subject to $n\equiv0\pmod2$ can be represented as a sum of one square of prime and seventeen fifth powers of primes, which gives an enhancement upon the…

Given an integer $n \ge 2$, its prime factorization is expressed as $n= \prod_{i=1}^s p_i^{a_i}$. We define the function $f(n)$ as the smallest positive integer such that $f(n)!$ is divisible by $n$. The main objective of this paper is to…

Call an interval $\{N+1,\dots,N+H\}$ of consecutive natural numbers \emph{bad} if the product $(N+1) \dots (N+H)$ is divisible by the square of its largest prime factor; \emph{very bad} if this product is powerful, and \emph{type $F_3$} if…

Given relatively prime positive integers a_1,...,a_n, the Frobenius number is the largest integer that cannot be written as a nonnegative integer combination of the a_i. We examine the parametric version of this problem: given a_i=a_i(t) as…

Let $f$ be a newform of weight $2$ on $\Gamma_0(N)$ with Fourier $q$-expansion $f(q)=q+\sum_{n\geq 2} a_n q^n$, where $\Gamma_0(N)$ denotes the group of invertible matrices with integer coefficients, upper triangular mod $N$. Let $p$ be a…

Let $G$ denote the unramified quasi-split unitary group $\mathbb{U}(1,1)(F)$ over a $p$-adic field $F$ with residual characteristic $p \neq 2$. In this paper, we first construct a large family of irreducible representations of the maximal…

An integer n is said to be y-friable if its largest prime factor $P^+(n)$ is less than y. In this paper, it is shown that the y-friable integers less than x have a weak exponent of distribution at least $3/5-\varepsilon$ when $(\log…

In this paper we prove that inf_{|z_k| => 1} max_{v=1,...,n^2} |sum_{k=1}^n z_k^v| = sqrt n+O(n^{0.2625+epsilon}). This improves on the bound O(sqrt (n log n)) of Erdos and Renyi. In the special case of $n+1$ being a prime we have…

Let $\mathcal{F}=\{f_1,\ldots,f_R\}$ be a family of forms of odd degrees at most $d$ in $s$ variables. We study the solutions to the system $f_1(\mathbf{x})=\ldots=f_R(\mathbf{x})=0$ of the form $x_i=y_ip_i$ with $|y_i|\leq Y_\mathcal{F}$…

We prove that there are infinitely many integers, which can represent as sum of a square-free integer and a prime $p$ with $||\alpha p+\beta||<p^{-1/10}$, where $\alpha$ is irrational.

We derive a compact determinant formula for calculating and factorizing the hypersum polynomials S^{(L)}_k(N) \equiv \sum_{n_1=1}^N ...\sum_{n_{L+1}=1}^{n_{L}}(n_{L+1})^k expressed in the variable N(N+L+1)

We show that for every $0 < \epsilon \leq 1$ and integer $k\geq 1$, there exists an integer $n = n(\epsilon,k)$ so that for all primes $p$, and integers $0 \leq a \leq p-1$, there exist integers $1 \leq x_1 < ... < x_n \leq p^\epsilon$ such…

The paper exploits an isomorphism between the natural numbers N and a space U of periodic sequences of the roots of unity in constructing a recursive procedure for representing and computing the prime numbers. The nth wave number ${\bf…

The Frobenius number for a set of relatively prime positive integers, where the smallest integer in the set is at least 2, is the largest integer that cannot be expressed as a nonnegative linear combination of those integers. We analyze the…

Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degree of uniformity $k$ such that assuming…

In this note, we represent integers in a type of factoradic notation. Rather than use the corresponding Lehmer code, we will view integers as permutations. Given a pair of integers n and k, we give a formula for n mod k in terms of the…

In this paper, it is shown that if F(x , y) is an irreducible binary form with integral coefficients and degree $n \geq 3$, then provided that the absolute value of the discriminant of F is large enough, the equation |F(x , y)| = 1 has at…

In this paper, we consider the Diophantine equation $\lambda_1U_{n_1}+\ldots+\lambda_kU_{n_k}=wp_1^{z_1} \cdots p_s^{z_s},$ where $\{U_n\}_{n\geq 0}$ is a fixed non-degenerate linear recurrence sequence of order greater than or equal to 2;…