S ( p ) = k = 1 ∑ p − 1 ( ⌊ p 2 k 2 ⌋ − 2 ⌊ p k 2 ⌋ )
Let p be a prime number such that p ≡ 1 ( m o d 4 ) . Find the closed form of S ( p ) .
Enter your answer as S ( 1 0 1 ) correct up to 2 decimal places.
Notation : ⌊ ⋅ ⌋ denotes the floor function .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Can you elaborate
Where (.) denotes fraction part function and [.] denotes GIF.
Write k 2 / p = [ k 2 / p ] + ( k 2 / p ) .
Multiply both sides by 2 and take GIF on both sides.
We write general term of this summation as
[ 2 ( k 2 / p ) ] .
Where (.) denotes fraction part function and [.] denotes GIF.
Now by induction we see that the summation of this quantity for p = 4 ξ + 1 is equal to
[ p / 2 ] .
Note: Mathematical induction is applied on ξ .
Are you sure induction works?
Problem Loading...
Note Loading...
Set Loading...
Note that ⌊ p 2 k 2 ⌋ − 2 ⌊ p k 2 ⌋ = ⌊ p 2 ( k 2 ( m o d p ) ) ⌋ .
Now we have to find the number of solutions of k 2 ( m o d p ) > ⌊ 2 p ⌋ .
Let S 1 be the set of integers k from 1 to p − 1 which satisfy the condition, and S 2 be its complimentary set.
Now, p ≡ 1 ( m o d 4 ) , so there is a solution to x 2 ≡ − 1 ( m o d p ) . Let the solution be a .
Note that f ( x ) = a x ( m o d p ) is an injection from S 1 to S 2 , and also from S 2 to S 1 .
Thus, ∣ S 1 ∣ = ∣ S 2 ∣ = 2 p − 1 , giving us the answer as 5 0 .