- #1

al-mahed

- 262

- 0

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter al-mahed
- Start date

- #1

al-mahed

- 262

- 0

- #2

al-mahed

- 262

- 0

come on guys... this is an olympic problem, from the M.O. from Brazil

- #3

CRGreathouse

Science Advisor

Homework Helper

- 2,842

- 0

sum(n=-2007,2007,issquare(Mod(n,2^2007))) = 670 (15ms in Pari)

Now if you actually want to solve it by hand, you'll need to look over quadratic reciprocity more carefully.

- #4

al-mahed

- 262

- 0

you need to solve by hand

- #5

huba

- 32

- 0

Wikipedia, under "quadratic residue", says that a number is a residue mod 2^m (m any natural number) if and only if it is of the form (4^k)*(8n+1).

I counted 336 integers in [1,2007] that are of that form. I thought an equal number__might__ be in [-2007,-1], but that would give me 672, not 670.

I counted 336 integers in [1,2007] that are of that form. I thought an equal number

Last edited:

- #6

huba

- 32

- 0

Is it at this point that quadratic reciprocity should be applied? But how if it applies to odd primes?

Something else (in my previous post): m any natural number > 2.

Something else (in my previous post): m any natural number > 2.

Last edited:

- #7

huba

- 32

- 0

Share:

- Last Post

- Replies
- 2

- Views
- 581

- Replies
- 3

- Views
- 503

- Replies
- 4

- Views
- 274

- Replies
- 4

- Views
- 1K

- Last Post

- Replies
- 2

- Views
- 637

- Last Post

- Replies
- 3

- Views
- 500

- Last Post

- Replies
- 17

- Views
- 1K

- Replies
- 3

- Views
- 953

- Last Post

- Replies
- 3

- Views
- 805

- Last Post

- Replies
- 2

- Views
- 845