The lower bound of weighted representation function

Abstract: For any given set

A

of nonnegative integers and for any given two positive integers

k_{1}, k_{2}

,

R_{k_{1}, k_{2}} (A, n)

is defined as the number of solutions of the equation

n = k_{1} a_{1} + k_{2} a_{2}

with

a_{1}, a_{2} i n A

. In this paper, we prove that if integer

k g e q 2

and set

A s u b s e t e q m a t h b b N

such that

R_{1, k} (A, n) = R_{1, k} (m a t h b b N s e t m i n u s A, n)

holds for all integers

n g e q n_{0}

, then

R_{1, k} (A, n) g g l o g n

.

This page was built for publication: The lower bound of weighted representation function