Related papers: On representations by Egyptian fractions

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

Let $p/q$ ($p, q \in \mathbb{N}^*$) be a positive rational number such that $p > q^2$. We show that for any $\epsilon > 0$, there exists a set $A(\epsilon) \subset [0, 1[$, with finite border and with Lebesgue measure $< \epsilon$, for…

We give a bijective parameter representation for a sum of squares of numbers being equal to another sum of squares of numbers.

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…

We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…

It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a representation of this series which in turn allows a simple…

The notion of an Egyptian domain (where the analogue of Egyptian fractions works appropriately), first explored by Guerrieri-Loper-Oman, is extended to the more general notions of generically and locally Egyptian domains. Results from the…

We describe those unipotent representations of a finite group of Lie type which are defined over the rational numbers.

We find a polynomial in three variables whose values at nonnegative integers satisfy the Erd\H{o}s-Straus Conjecture. Although the perfect squares are not covered by these values, it allows us to prove that there are arbitrarily long…

In this note, we presented a new decomposition of elements of finite fields of even order and illustrated that it is an effective tool in evaluation of some specific exponential sums over finite fields, the explicit value of some…

This paper answers in the affirmative a question raised by Karl Schwede concerning an upper bound on the multiplicity of F-pure rings.

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

Combining $2$-descent techniques with Riemann-Roch and B\'ezout's theorems, we give an upper bound on the number of rational points of bounded height on elliptic and hyperelliptic curves over function fields of characteristic $\neq 2$. We…

Introducing the notion of a rational system of measure preserving transformations and proving a recurrence result for such systems, we give sufficient conditions in order a subset of rational numbers to contain arbitrary long arithmetic…

In this note, we derive a finite summation formula and an infinite summation formula involving Harmonic numbers of order up to some order by means of several definite integrals

Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…

Which integers can be written as a quotient of sums of distinct powers of three? We outline our first steps toward an answer to this question, beginning with a necessary and almost sufficient condition. Then we discuss an algorithm that…

Let $F(x_1,...,x_n)$ be a form of degree $d\geq 2$, which produces a geometrically irreducible hypersurface in $\mathbb{P}^{n-1}$. This paper is concerned with the number of rational points on F=0 which have height at most $B$. Whenever…

In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…