# Re: Question on modular algebra

*From*: "Dani Camps" <danicamps81@xxxxxxxxx>*Date*: 16 Mar 2007 02:54:25 -0700

On 15 mar, 16:46, Peter Pearson <ppear...@xxxxxxxxxxxxxxx> wrote:

On 14 Mar 2007 08:43:26 -0700, Dani Camps <danicamp...@xxxxxxxxx> wrote:

[snip]

I have a sequence generated with the following expression

A(x)=(d + a*x) (mod n)

Where 0<=d<n, and a and n are coprimes, i.e gcd(a,n)=1.[snip]

Consider r consecutive values of the sequence A(x)

starting from 0, so {A(0) ... A(r-1)} where 0<=r<n. What I

want to know is how many values of the subset {A(0)

... A(r-1)} are above my threshold j.

An approximate solution would be simple. Do you need an

exact solution? Faster than just counting them?

--

To email me, substitute nowhere->spamcop, invalid->net.

Hi,

What I am looking for is the exact value in a close formula. I need

this in order to proof something, so I am not interested in an

algorithm. Do you have any idea ? An approximation, or better a bound,

can be a starting point.

Best Regards

Dani

.

**Follow-Ups**:**Re: Question on modular algebra***From:*Dani Camps

**References**:**Question on modular algebra***From:*Dani Camps

**Re: Question on modular algebra***From:*Peter Pearson

- Prev by Date:
**Re: the bit-length relationship of RSA's key pair** - Next by Date:
**Re: Question on modular algebra** - Previous by thread:
**Re: Question on modular algebra** - Next by thread:
**Re: Question on modular algebra** - Index(es):