How many integers 1 ≤ N ≤ 1 0 0 0 can be written both as the sum of 2 6 consecutive integers and as the sum of 1 3 consecutive integers?
Details and assumptions
The consecutive integers are allowed to be a mix of negative integers, 0 and positive integers (as long as they are consecutive).
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.
Most solutions failed to establish sufficient AND necessary conditions on the number.
L e t S 2 6 b e t h e f i r s t i n t e g e r o f t h e g r o u p 2 6 . ∴ t h e l a s t i s S 2 6 + 2 5 , a v e r a g e o f 2 6 i n t e g e r s i s 2 2 S 2 6 + 2 5 . L e t S 1 3 b e t h e f i r s t i n t e g e r o f t h e g r o u p 1 3 . ∴ t h e l a s t i s S 2 6 + 1 2 , a v e r a g e o f 1 3 i n t e g e r s i s 2 2 S 1 3 + 1 2 . ∴ S u m o f 2 6 i n t e g e r s = 2 6 ∗ 2 2 S 2 6 + 2 5 = 1 3 ∗ ( 2 S 2 6 + 2 5 ) = N i . a n d S u m o f 1 3 i n t e g e r s = 1 3 ∗ 2 S 1 3 + 6 = 1 3 ∗ ( S 1 3 + 6 ) = N i . S o 1 3 ∗ ( 2 S 2 6 + 2 5 ) = 1 3 ∗ ( S 1 3 + 1 2 ) ⟹ S 1 3 = 2 S 2 6 + 1 3 . ⟹ f o r e v e r y i n t e g e r S 2 6 , t h e r e e x i s t s a n i n t e g e r S 1 3 . S o i t i s s u f f i c i e n t t o c o n s i d e r o n l y o f S 2 6 . L e t s = S 2 6 . S o s m i n , c o r r e s p o n d i n g t o N = 1 , ⟹ s m i n = 2 6 1 − 1 3 ∗ 2 5 = − 1 2 . 4 6 1 5 . B u t s i s a n i n t e g e r , s o s m i n = − 1 2 . C o r r e s p o n d i n g a c t u a l N m i n = 1 3 ∗ ( 2 ∗ ( − 1 2 ) + 2 5 ) = 1 3 . I n t h e s a m e w a y s m a x , c o r r e s p o n d i n g t o N = 1 0 0 0 , ⟹ , s m a x = 2 6 1 0 0 0 − 1 3 ∗ 2 5 = 2 5 . 9 6 1 5 . B u t s i s a n i n t e g e r , s o s m a x = 2 5 . . C o r r e s p o n d i n g a c t u a l N m a x = 1 3 ∗ ( 2 ∗ 2 5 + 2 5 ) = 9 7 5 . S o 1 3 ≤ N ≤ 9 7 5 . N o w i n c r e a s e o f 1 i n s , N i n c r e a s e s b y 2 6 . S o h o w m a n y 2 6 i n 1 3 ≤ N ≤ 9 7 5 N u m b e r o f N = 2 2 9 7 5 − 1 3 + 1 = 3 7 + 1 = 3 8 . .
The sum:
( − 6 ) + ( − 5 ) + ( − 4 ) + ⋯ + 4 + 5 + 6 = 0
Is the sum of 1 3 consecutive numbers. Any other sum of 1 3 consecutive number can be obtained from this one adding 1 to each number in the sum. Therefore we can express every sum of 1 3 consecutive numbers with a number of the form 1 3 a (where a is an integer). The sum:
( − 1 2 ) + ( − 1 1 ) + ( − 1 0 ) + ⋯ + 1 1 + 1 2 + 1 3 = 0
Is the sum of 2 6 consecutive numbers. Any other sum of 2 6 consecutive number can be obtained from this one adding 1 to each number in the sum. Therefore we can express every sum of 2 6 consecutive numbers with a number of the form 2 6 b + 1 3 (where b is an integer). Clearly, all of these numbers can also be expressed as 1 3 a for some integer a
therefore I have to find how many numbers between 1 and 1 0 0 0 are multiples of 1 3 but not of 2 6 . These numbers are: ⌊ 1 3 1 0 0 0 ⌋ − ⌊ 2 6 1 0 0 0 ⌋ = 7 6 − 3 8 = 3 8
Why is this solution wrong? It establishes a necessary condition for a number to be written as the sum of 13 consecutive numbers, but doesn't show that the same condition is sufficient.
For example, all even integers can be written as the form N , where N is an integer, which is a necessary condition. However, this is not a sufficient condition.
Let the 1 3 consecutive integers be a , a + 1 , a + 2 , … a + 1 2 for an integer a . The sum of these integers is ( 2 a + 1 2 ) 2 1 3 = ( a + 6 ) ( 1 3 ) . Thus, every integer that is divisible by 1 3 can be written as the sum of 1 3 consecutive integers.
Let the 2 6 consecutive integers be b , b + 1 , b + 2 , … b + 2 5 for an integer b . The sum of these integers is ( 2 b + 2 5 ) 2 2 6 = ( 2 b + 2 5 ) ( 1 3 ) . Thus, every integer that is divisible by 1 3 but not 2 6 ( 2 b + 2 5 is odd) can be written as the sum of 2 6 consecutive integers. Every integer of this form can also be written as the sum of 1 3 consecutive integers (from above). Hence, there are ⌊ 1 3 1 0 0 0 ⌋ − ⌊ 2 6 1 0 0 0 ⌋ = 3 8 integers that can be written as the sum of 2 6 and 1 3 consecutive integers within the given range.
I split the problem up into two sets--the set of 26 consecutive integers and the set of 13 consecutive integers. If you examine any set of 26 integers (lets take one to 26 for example), you will find that you can split the set into 13 pairs of numbers adding up to twice the lowest integer + 25 (in the example, 27). This means that any set = 13 * {2X + 25}. 2X + 25 must be a positive integer, so X is greater than -25. 13 * {2X + 25} is less than one thousand, so 2X + 25 must be less than 76.9 (the same as 1000 divided by 13). X is an integer, so functionally, 2X+25 must be less than 75. So the domain of the set is all the odd numbers from 1 to 75. For the sum of the 13 consecutive integers, the sum=13 * {the middle number}. The domain of the middle number goes from 1 to 76. There are 38 numbers in the intersection of the domains, so the answer is 38
as a certain number has to be expressed as a sum of 13 consecutive integers, consider the arithmetic progression A − 6 + A − 5 . . . . . . . . . + A + A + 1 + . . . . . A + 6 = X (where A is an integer and X is a certain integer between 1 and 1000 inclusive of both 1 and 1000) we also notice that these are consecutive integers as the common difference between each integer is 1. the above equation when simplified gives 1 3 A = X hence we know that X is a multiple of 13.also since the maximum value of X is 1000 ,the maximum value that A can take is 76 (as 13 multiplied by 77 is 1001 which is greater than 1000)
now consider a similar progression B − 1 2 + B − 1 1 . . . . . . . . . . + B + B + 1 . . . . . . + B + 1 3 where B is an integer the above sum should also equal the same X as the previous expression as it is the same integer being expressed as the sum of 26 and 13 consecutive integers. we see that the above expession contains 26 integers each with common difference 1 therefore B − 1 2 + B − 1 1 . . . . . . . + B + B + 1 . . . . . . + B + 1 3 = X but we already know that X = 1 3 A plugging that in the above expression B-12+B-11.......+B+B+1......+B+13=13A we notice that this simplifies to 26B+13=13A which equals 26B=13(A-1) which futher simplifies to B= 2 A − 1 therefore for B to be an integer 2 A − 1 should be an integer.this we notice only happens when a is odd since a can take a maximum value of 76 and a minimum value of 1 there are 38 odd numbers between 1&76.therefore the ans is 38 NOTE-instead of the expression B-12+B-11.......+B+B+1......+B+13 we could also have written B-13+B-12+B-11.......+B+B+1....+B+12 which would also have 26 consecutive integers and the same simplification process would follow leading us to the equation B= 2 A + 1 here too B is only an integer when A is odd but the only difference between the 2 procedures is that in this equation A does not take the value 1 but instead take the value -1.hence the answer still remains 38
Pick an integer n 1 and sum it to its 25 consecutive integers forming the number N 1 :
N 1 = ∑ i = n 1 n 1 + 2 5 i = 2 6 n 1 + ∑ i = 1 2 5 i = 2 6 n 1 + 3 2 5
Pick another integer n 2 and sum it to its 12 consecutive integers forming the number N 2 :
N 2 = ∑ i = n 2 n 2 + 1 2 i = 1 3 n 2 + ∑ i = 1 1 2 i = 1 3 n 2 + 7 8
Asking that N 1 = N 2 ≡ N , one gets:
n 2 = 1 9 + 2 n 1
Let's see then the minimum and maximum values of n 1 such that 1 ≤ N ≤ 1 0 0 0 . It is not difficult to see that
n 1 m i n = − 1 2 for which N m i n = 1 3
and
n 1 m a x = 2 5 for which N m a x = 9 7 5
Therefore, from n 1 m i n = − 1 2 to n 1 m a x = 2 5 , we have a total of 3 8 integers.
suppose the number is P, then P = 2 6 a + 1 3 ∗ 2 5 = 1 3 b + 1 3 ∗ 6 this gives us b − 2 a = 1 9 and there will be solution only if b is an odd number.......the first range gives us − 6 < b < 7 1 .......there are 38 odd numbers in this range, so answer is 38! :D
Let the first number out of the thirteen consecutive numbers = x . Then the final number = x + 1 3 and the sum of all of these 13 numbers = 1 3 x + 2 1 2 × 1 3 = 1 3 x + 7 8 .
Using similar logic, we can express the sum of the twenty six consecutive numbers as 2 6 y + 3 2 5
Since these are two ways of expressing the same number, 2 6 y + 3 2 5 = 1 3 x + 7 8
2 y + 1 9 = x
1 9 = x − 2 y .
Now, we also know that the output number is going to be less than 1000 and greater than 1.
We can therefore form some inequalities:
1 0 0 0 > 2 6 y + 2 3 5 > 1
1 0 0 0 > 1 3 x + 7 8 > 1
Which simplify to give (rounded whole numbers)
− 9 < y < 2 9 = 38 values of y. − 5 < x < 9 0 = 95 values of x.
Since we are asked to find the number of integers, and not the number of solutions, we can see that the answer must be 3 8
Problem Loading...
Note Loading...
Set Loading...
Suppose that x can be expressed as the sum of 26 consecutive integers and 13 consecutive integers. Let the 13 integers be a − 6 , a − 5 , . . . , a + 5 , a + 6 . Then x = 1 3 a . Let the 26 consecutive integers be b − 1 2 , b − 1 1 , . . . , b + 1 2 , b + 1 3 . Then x = 2 6 b + 1 3 . Thus, x = 0 ( m o d 1 3 ) , and x = 1 3 ( m o d 2 6 ) . Thus, the values of x that work are 1 3 ( 2 n + 1 ) for nonnegative integers n . It is well-known that 1 0 0 1 = 7 ∗ 1 1 ∗ 1 3 , so the largest value of x that works is 1 3 ( 7 7 − 2 ) = 1 3 ∗ 7 5 . Thus, the values of x that work are 1 3 ∗ 1 , 1 3 ∗ 3 , . . . , 1 3 ∗ 7 5 , so 38 numbers work, Q. E. D.
[Latex Edits - Calvin]