Let
a
1
,
a
2
,
a
3
,
…
,
a
2
0
1
3
, and
a
2
0
1
4
be
2
0
1
4
positive distinct prime integers where
a
i
<
a
i
+
1
for all positive integer
i
<
2
0
1
4
Find the least possible value of a 1 if
a 1 2 + a 2 2 + a 3 2 + ⋯ + a 2 0 1 3 2 + a 2 0 1 4 2
is divisible by 2 0 1 5
Please show your solutions! Thanks!!!
You may like this
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.
Its not necessary that the number should be odd to be divisible by 2015 as 4030 is also divisible by 2015...
Log in to reply
4030 is an even number
Log in to reply
oh i mean that it isn't necessary for a number to be divisible by 2015 if it is odd , it can be even too....
Log in to reply
@Vighnesh Raut – digits at the end of prime numbers - 2 , 3 , 5 , 7
now their square(digits at unit place) - 4 , 9 , 5 , 9
expect 5 none is a prime number and for the sum divided by 2015 primilarily we should have 0 as its unit's place( others are secondary)
now take the sums of the squares of these prime number ( leave here 2) no sum have 0 as a result in its units place
Problem Loading...
Note Loading...
Set Loading...
Except 2 all the other prime numbers are odd
If we take all the numbers odd prime then the result cannot be divisible by 2015 as the sum would be even
thus for the sum to be divisible by an odd number any one number should be even