Counting the solutions of _1 x₁^k₁ + + _t x_t^k_t c n

Abstract: Given a polynomial

Q (x_{1}, c d o t s, x_{t}) = l a m b d a_{1} x_{1}^{k_{1}} + c d o t s + l a m b d a_{t} x_{t}^{k_{t}}

, for every

c i n m a t h b b Z

and

n g e q 2

, we study the number of solutions

N_{J} (Q; c, n)

of the congruence equation

in

(m a t h b b Z / n m a t h b b Z)^{t}

such that

x_{i} i n (m a t h b b Z / n m a t h b b Z)^{i} m e s

for

i i n J s u b s e t e q I = 1, c d o t s, t

. We deduce formulas and an algorithm to study

N_{J} (Q; c, p^{a})

for

p

any prime number and

a g e q 1

any integer. As consequences of our main results, we completely solve: the counting problem of

Q (x_{i}) = s u m l i m i t s_{i i n I} l a m b d a_{i} x_{i}

for any prime

p

and any subset

J

of

I

; the counting problem of

Q (x_{i}) = s u m l i m i t s_{i i n I} l a m b d a_{i} x_{i}^{2}

in the case

t = 2

for any

p

and

J

, and the case

t

general for any

p

and

J

satisfying

m i n v_{p} (l a m b d a_{i}) m i d i i n I = m i n v_{p} (l a m b d a_{i}) m i d i i n J

; the counting problem of

Q (x_{i}) = s u m l i m i t s_{i i n I} l a m b d a_{i} x_{i}^{k}

in the case

t = 2

for any

p m i d k

and any

J

, and in the case

t

general for any

p m i d k

and

J

satisfying

m i n v_{p} (l a m b d a_{i}) m i d i i n I = m i n v_{p} (l a m b d a_{i}) m i d i i n J

.

Recommendations

Cites work

Cited in

(12)

This page was built for publication: Counting the solutions of \(\lambda_1 x_1^{k_1} + \dots + \lambda_t x_t^{k_t} \equiv c \bmod n\)