y = ⌊ 1 ⌋ + ⌊ 2 ⌋ + ⌊ 3 ⌋ + ⋯ + ⌊ x 2 − 1 ⌋
Let x and y be a pair of prime numbers.
If pairs { x 1 , y 1 } , { x 2 , y 2 } , { x 3 , y 3 } … { x n , y n } are all of the solutions to the equation above, find the value of i = 1 ∑ n x i y i .
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.
wow this is so easy to understand! :) thank u
Log in to reply
Beautiful solution. I just followed my intuition and blasted 45 = (2 3) + (3 13) in as soon as I discovered that x=5 implies that y is not prime. Nice proof.
Note that ⌊ 1 ⌋ + ⋯ + ⌊ x 2 − 1 ⌋ = 1 + 1 + 1 + 2 + 2 + 2 + 2 + 2 + ⋯ + ( x − 1 ) + ( x − 1 ) + ⋯ + ( x − 1 ) 2 x + 1 times
hence the sum defining y can be easily written as
y = i = 1 ∑ x − 1 ( 2 i + 1 ) ⋅ i = i = 1 ∑ x − 1 2 i 2 + i = 2 i = 1 ∑ x − 1 i 2 + i = 1 ∑ x − 1 i = 3 ( x − 1 ) x ( 2 x − 1 ) + 2 ( x − 1 ) x
that leads to
6 y = x ( x − 1 ) ( 4 x + 1 )
Now x is prime, and it divides 6 y so either x divides 6 , or x divides y .
In the first case x can be 2 or 3 . Both values, put in the equation, give a prime number for y .
Namely we have x = 2 ⇒ y = 3 and x = 3 ⇒ y = 1 3 .
In the second case x divides y . But y is prime and this means x = y .
Putting x = y in the equation we have ( x − 1 ) ( 4 x + 1 ) = 6 that has no integer solutions.
So the only pair of prime solutions are ( 2 ; 3 ) and ( 3 ; 1 3 ) and the answer is 4 5 .
Terms from floor(x-1) up to floor (sqrt(x^2 -1 ) all have value (x-1)
Such (2x-1) terms are there.
So the expression of y is sum of terms (x-1)(2x-1) for all prime values of x.
For x=2, y=3
For x=3, y=13
All higher values of y are found composite.
So answer is 2x3+3x13 = 45
Someone please provide complete analytical solution.
Problem Loading...
Note Loading...
Set Loading...
There are 2 n + 1 terms equal to n for each n , because there are 2 n + 1 integers in [ n 2 , ( n + 1 ) 2 ) . So y = n = 1 ∑ x − 1 n ( 2 n + 1 ) = 3 ( x − 1 ) x ( 2 x − 1 ) + 2 x ( x − 1 ) = 6 x ( x − 1 ) ( 4 x + 1 ) .
Clearly ( 2 , 3 ) and ( 3 , 1 3 ) are solutions, so we need only show that for x ≥ 4 , y cannot be prime.
Well, at least one of the three terms in product in the numerator is even, and at least one is divisible by 3. Suppose x ≥ 4 . Call the terms f 1 , f 2 , f 3 . Note that all the f i are at least 3 .
If 2 ∣ f 1 and 3 ∣ f 1 , then we can write y = ( f 1 / 6 ) f 2 f 3 as a product of three numbers, at least two of which ( f 2 and f 3 ) are strictly greater than 1 , so it can't be prime.
If 2 ∣ f 1 and 3 ∣ f 2 , then we can still write y in that way, because we can write y = ( f 1 / 2 ) ( f 2 / 3 ) f 3 and both f 1 / 2 and f 3 are strictly greater than 1 .
Those are the only two cases (after we reorder the terms appropriately), so y cannot be prime for x ≥ 4 . So the answer is 2 ⋅ 3 + 3 ⋅ 1 3 = 4 5 .