Pages

You have an empty notebook with 96 sheets. Each sheet is numbered on both sides, with the page numbers ranging from 1 to 192 (inclusive).

Is it possible to rip out 25 sheets such that the sum of the page numbers on these sheets is exactly 1990?

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.

10 solutions

Venkatachalam J
Apr 17, 2017

Nice observation. We see that it is not possible to choose 25 pages whose sum of page numbers is 1990. What are the possible number of pages that we could tear such that their sum would be 1990?

Pranshu Gaba - 4 years, 1 month ago

Log in to reply

We need to tear Even number of pages then we will get the sum 1990. For example, If you tear 6 pages with the page numbers (183+184)+(185+186)+(187+188)+(189+190)+(191+192)+(57+58) we will get the sum 1990. There will be more number of solutions to your question. But, it must be always Even number of pages.

Venkatachalam J - 4 years, 1 month ago

Log in to reply

Yes, being even is a necessary condition. I was wondering what would the sufficient condition be. The problem boils down to:

We have numbers 3, 5, 7, ... 383. We have to add some of them to get 1990. How many numbers can we add together to get 1990?

Pranshu Gaba - 4 years, 1 month ago

Log in to reply

@Pranshu Gaba Your question is not clear. Please explain me with an example. You want to add only odd numbers to get 1990?

Venkatachalam J - 4 years, 1 month ago

In the book, the numbers of each pages are placed in a specific way. If in a side of the sheet we have an odd number, the other side will have an even number in it. If each sheet is numbered in this way, we have a sheet with the numbers 1 and 2, a sheet with the numbers 25 and 26 and so on.

Then the sum of the two page numbers in a sheet will always be odd (even + odd = odd). We will sum up 25 sheets, or 25 odd numbers. How the sum of an odd number of odd number is always odd, after you sum up all of these numbers you will end up with an odd number as a result. How 1990 is even, then is impossible to obtain this sum.

Hi, just one small error in your explanation. "How the sum of an odd number of odd number is always odd,"
You meant to say that the sum of an even number and an odd number is always odd.

So as you will have 25 even nos and 25 odd numbers to add, the total will be an odd number. Hence, it is impossible to obtain 1990, as this is an even number.

Deana Dodds - 4 years, 1 month ago

Log in to reply

Oh, thank you for this observation!

Victor Paes Plinio - 4 years, 1 month ago

I think by "sum of an odd number of odd number is always odd", Victor meant that an odd number multiplied by an odd number is always odd. Adding 25 odd numbers is an odd number.

Pranshu Gaba - 4 years, 1 month ago
Brown Bear
Apr 17, 2017

I did this by asuming that we CAN get a sum of 1990 and seeing what page we would need to start on.

25 sheets is 50 pages. Let the first page ripped out be page "a", so the sum of the ripped-out page numbers is "a + a+1 + a+2 + ... + a+49". The sum 1+2+3+...+49 = 25*49 = 1225 (49th triangular number), and we have 50 lots of "a", so if we assume that the statemet is true we would get "1990 = 50a + 1225". Solving for "a", this would mean that the first page ripped out would have to be page 15.3, and you can't have .3 of a page, so therefore it is impossible.

In fact, if you started on page 15 and ripped out 25 sheets, the sum of the page numbers ripped out would be 50*15 + 1225 = 1975, so less than 1990. Starting on page 16 would be impossible because page 16 would be on the same sheet as page 15, and starting on page 17 would give a total sum of page numbers of 2075, which is bigger than 1990.

If we try to rip out 25 sheets randomly what will happen. Will we get the sum of the page numbers on these sheets is exactly 1990?

Venkatachalam J - 4 years, 1 month ago

You showed that it's not possible to get 1990 by ripping out 25 consecutive sheets, but that's not what the question asked.

You could adapt this method, though. Start with pages 1-50 ripped out; but replace 49+50, and tear out 51+52 instead. This increases the total of page numbers by 4. You can repeat, swapping a torn page and its not-torn neighbour will always add 4 to the total. The only group of torn pages where there isn't a torn page followed by an intact one is if you tear out 143-192.

So the total of page numbers can be increased in steps of 4 from 1275 right up to 8375 (if my mental arithmetic serves me right).

So the total is equal to 1275+4n, where n is the sum of "unchosen sheets before this one" for the 25 torn pages.

There answer's still no, though, because there's no positive integer solution for 1275+4n = 1990.

Angel Wedge - 4 years, 1 month ago
Phoenix Timmons
Apr 20, 2017

Let S b S_b be the set of all sheets in a notebook with b b total sheets, and x x sheets ripped out.

S b = { a : 1 a b } S_b= \{ a : 1\leq a\leq b \} where a , b N a,\,b \in \mathbb{N} , and let T x S b : T x = x T_x\subset S_b : |T_x|=x where x S b x\in S_b .

Let s n s_n be the set of page numbers on the n n th page of the notebook where s n = { 2 n 1 , 2 n } s_n = \{2n-1,2n\} and n S b n \in S_b .

s n = 2 n 1 + 2 n = 4 n 1 \sum s_n = 2n-1+2n = 4n-1

Let y y be the sum of all the page numbers on the sheets in T x T_x .

y = n T x s n y =\displaystyle \sum_{n\in T_x}\sum s_n \Rightarrow

y = n T x ( 4 n 1 ) y =\displaystyle \sum_{n\in T_x}(4n-1) \Rightarrow

y = n T x 4 n n T x 1 y =\displaystyle \sum_{n\in T_x}4n - \sum_{n\in T_x}1 \Rightarrow

y = 4 n T x n x y = \displaystyle 4\sum_{n\in T_x}n - x \Rightarrow

x + y = 4 n T x n x + y = \displaystyle 4\sum_{n\in T_x}n \Rightarrow

x + y 4 = n T x n \displaystyle \frac{x+y}{4} = \sum_{n\in T_x}n

Therefore, n S b 1 n b n N n T x n N x + y 4 N \displaystyle n\in S_b \Rightarrow 1\leq n\leq b \Rightarrow n \in \mathbb{N} \Rightarrow \sum_{n\in T_x}n \in \mathbb{N} \Rightarrow \frac{x+y}{4} \in \mathbb{N} .

By the definition of divisibility, x + y 4 N 4 ( x + y ) \displaystyle \frac{x+y}{4} \in \mathbb{N} \Rightarrow 4|(x+y) .

Assume V { T x } V \in \{T_x\} and V = { n : n m = m } V = \{n : n_m = m\} where n m n_m is the m m th element of V V .

n V ( 4 n 1 ) = m = 1 x ( 4 n m 1 ) = m = 1 x ( 4 m 1 ) = m = 1 x 4 m m = 1 x 1 = 4 m = 1 x m x = \displaystyle \sum_{n \in V}(4n-1) = \sum_{m=1}^{x}(4n_m-1) = \sum_{m=1}^{x}(4m-1) = \sum_{m=1}^{x}4m - \sum_{m=1}^{x}1 = 4\sum_{m=1}^{x}m - x =

4 ( x ( x + 1 ) 2 ) x = 2 ( x ) ( x + 1 ) x = 2 x 2 + 2 x x = 2 x 2 + x \displaystyle 4\bigg(\frac{x(x+1)}{2}\bigg) - x = 2(x)(x+1)-x = 2x^2+2x-x = 2x^2 +x

Assume W { T x } W \in \{T_x\} and W = { n : n m = b ( m 1 ) } W = \{n : n_m = b-(m-1)\} where n m n_m is the m m th element of W W .

n W ( 4 n 1 ) = m = 1 x ( 4 n m 1 ) = m = 1 x ( 4 ( b ( m 1 ) ) 1 ) = m = 1 x ( 4 b 4 m + 4 1 ) = m = 1 x 4 b m = 1 x 4 m + m = 1 x 3 = \displaystyle \sum_{n \in W}(4n-1) = \sum_{m=1}^{x}(4n_m-1) = \sum_{m=1}^{x}(4(b-(m-1))-1) = \sum_{m=1}^{x}(4b-4m+4-1) = \sum_{m=1}^{x}4b - \sum_{m=1}^{x}4m + \sum_{m=1}^{x}3 =

4 b x ( 2 x 2 + 2 x ) + 3 x = 4 b x 2 x 2 + x 4bx - (2x^2+2x) + 3x = 4bx - 2x^2 + x

Since V V is the set of the first x x pages in the notebook and W W is the set of the last x x pages in the notebook, it is apparent that ( 2 x 2 + x ) y ( 4 b x 2 x 2 + x ) (2x^2 + x) \leq y\leq (4bx-2x^2+x) .

Therefore, x ! Y x = { y : 4 ( x + y ) ( 2 x 2 + x ) y ( 4 b x 2 x 2 + x ) } \forall \: x \: \exists! \: Y_x = \{y : 4|(x+y) \land (2x^2 + x) \leq y\leq (4bx-2x^2+x)\} , where x x is the number of sheets ripped out of the notebook and Y x Y_x is the set of all possible sums of the page numbers on x x sheets.


Let b = 96 b=96 , x = 25 x = 25 , and y = 1990 y = 1990 .

25 96 T 25 S 96 25\leq 96 \Rightarrow T_{25} \subset S_{96} , so this is a valid scenario. In order for 1990 Y 25 1990 \in Y_{25} , two conditions must be met:

  • Condition 1: 4 ( x + y ) 4|(x+y)

25 + 1990 = 2015 25 + 1990 = 2015 and 4 2015 4\nmid 2015

F A I L \color{#D61F06}FAIL

  • Condition 2: ( 2 x 2 + x ) y ( 4 b x 2 x 2 + x ) (2x^2 + x) \leq y\leq (4bx-2x^2+x)

2 ( 2 5 2 ) + 25 = 1275 1990 4 ( 96 ) ( 25 ) 2 ( 2 5 2 ) + 25 = 8375 2(25^2)+25 = 1275 \leq 1990 \leq 4(96)(25)-2(25^2)+25 = 8375

P A S S \color{#20A900}PASS

Therefore, 1990 Y 25 1990 \notin Y_{25} .


In conclusion, it is impossible to rip out 25 sheets such that the sum of the page numbers on these sheets is exactly 1990.

Hence, the answer is NO .


Credit to Pranshu Gaba for noticing the need for an upper bound on y y .

I find it a bit difficult to follow your solution because there are so many variables involved.

I think the gist of it is that if we tear out x x pages, then the sum can be y y if 4 x + y 4 \mid x + y and 2 x 2 + x y 50 b 2 x 2 + x 2x^2 + x \le y \le 50 b - 2x^2 + x . Is this a sufficient condition on y y ?

Pranshu Gaba - 4 years, 1 month ago

Log in to reply

Unfortunately, one of the pitfalls of proving something in a general form (especially with Set theory) is that it typically takes a lot of variables. If you have any tips on where I can reduce the number of variables, I'd be happy to adjust the proof!

But yes, that is the gist of the proof, though the first term in the upper bound should be 4xb and not 50b. Thanks for catching that y has an upper bound as I neglected to include that in the original proof. I've updated the proof with this condition.

Phoenix Timmons - 4 years, 1 month ago

Log in to reply

Right, 50b was for the case when x = 25 x = 25 . In general, it would be 4 x b 4xb . This is my attempt at reducing the number of variables:

The sum of page numbers on the ith sheet is 2 i 1 + 2 i = 4 i 1 2i-1 + 2i = 4i -1 . Suppose the book has b b sheets. We are tearing out x x sheets. We want the sum of page numbers to be y y .

The minimum possible sum of page numbers of b b sheets is when we tear out the first x x sheets, whose sum is i = 1 x ( 4 i 1 ) = 2 x ( x + 1 ) x = 2 x 2 + x \displaystyle \sum _{i = 1} ^x (4i - 1) = 2x(x+1) -x = 2x^2 + x .
The maximum possible sum of page numbers of b b sheets is when we tear out the last x x sheets, whose sum is i = b x b ( 4 i 1 ) = 4 x b 2 x 2 + x \displaystyle \sum _{i = b-x} ^ b (4i -1) = 4xb -2x^2 + x
Therefore a necessary condition on y y is 2 x 2 + x y 4 x b 2 x 2 + x 2x^2 + x \le y \le 4xb -2x^2 + x .

Also, sum of page numbers of each sheet is 1 ( m o d 4 ) -1 \pmod{4} . The sum of all page numbers is y ( x ) ( m o d 4 ) y \equiv (-x) \pmod{4} . This means x + y 0 ( m o d 4 ) x + y \equiv 0 \pmod{4} . We get another necessary condition on y y : 4 x + y 4 \mid x + y .

Pranshu Gaba - 4 years, 1 month ago

You are working too hard to impress us with your command of LaTeX.

It does not take an essay of Ramanujan-like proportions to answer this one.

The answer only requires noting that every page has an odd sum of page numbers, 4n - 1 where n is the index of the page from 1..96, each page being numbered 2n-1 and 2n. Any sum of an odd number of pages is odd. 25 is odd. 1990 is even. So the answer is "No".

One might ask what numbers of pages can we remove that can sum to 1990? A partial answer below.

The sum of page numbers is 4 (s1 + s2 +,,,_sn) - n where n is the number of pages, and s1,...,sn are the indices of the pages removed in 1..96. This follows from simply combining terms using the sum of page numbers ( 4s - 1) on each individual page.

Any target sum T (e.g. 1990) must be in the form 4S - n where S is the sum of n page indices.

That is, T + n must be a multiple of 4.

1990 is an odd multiple of 2. 1990 can be the sum of page numbers only when 1990 + n is a multiple of 4.

This only occurs when n is an odd multiple of 2. Clearly this eliminates all odd numbers of pages, e.g. 25.

With 96 pages and T = 1990, a minimum of 6 pages must be removed to reach the sum of 1990 at all. For example, 96 + 95 + .. + 92 = 470, 470 + 29 = 499, 4(499) - 6 = 1990, so removing the 6 pages 96..92, and 29 works.

For an even multiple of 2 pages removed , 4k where k = 2,3,..
1990 + 4k = 2(995 + 2k) which is not divisible by 4, and thus 1990 cannot be the sum of 4k removed pages.

For an odd multiple of 2 pages removed, 2(2k-1) where k = 2,3,..
1990 + 2(2k-1) = 2(995) + 4k - 2 = 2(994) + 4k = 4(497) + 4k = 4 (497 + k) is a multiple of 4.

The original question can be answered "yes" only if the number of pages removed is an odd multiple of 2.

Do we need to work much harder than that?

One might go on to establish the maximum values for k before the sum of k pages will always exceed 1990, or any general target sum value That is what is partial about this answer.

Robert DeLisle - 4 years, 1 month ago

Log in to reply

I appreciate the feedback, but it's not a matter of trying to impress. By the time I answered the question, there were already a myriad of sufficient solutions. As a student of number and set theories, I wanted to take a different approach and solve the problem in a more general form with proper notation. Without the LaTeX, I feel like the solution would have been even harder to follow.

Phoenix Timmons - 3 years, 6 months ago
Sankar Ganesh
Apr 23, 2017

Let the first page ripped out be x. Since the pages of the book must be consecutive, the next pages are x+1, x+2, and so on until x+24. The sum of these expressions is 25x added to the sum of the first 24 numbers. Gauss' formula tells us that the sum of the first 24 positive integers is 25*24/2 which is 300. This is 25x+300. This must be equal to 1990 because the question states that the sum is 1990. The equation is 25x +300 = 1990 which has no integer solutions so the answer is no.

No; To be 1990 + 25 1990+25 would have to be divisible by 4 4 .

Why must 1990+25 be divisible by 4? What is the reasoning behind it?

Pi Han Goh - 4 years, 1 month ago

Log in to reply

Each page indexed s = 1 to 96 has an odd page number total 4s - 1.

The sum of page numbers is 4 (s1 + s2 +,,,_sn) - n where n is the number of pages, and s1,...,sn are the indices of the pages removed in 1..96. This follows from simply combining terms using the sum of page numbers ( 4s - 1) on each individual page.

Any target sum T (e.g. 1990) must be in the form 4S - n where S is the sum of n page indices.

That is, T + n (e.g. 1990 + 25) must be a multiple of 4.

He should have explained that.

Robert DeLisle - 4 years, 1 month ago

If we sum CONSECUTIVE page numbers from a to b (positive integers), with a>0 and 192>b>a (b can be the last page number), and force the sum to be 1990, the results for a and b must satisfy two conditions: a is odd and b is even. For languages writing from left to right, each sheet has an odd number on its left side and an even number on its right side in an ascending manner.

using WolframAlpha

Input: (sum(n), n=a to b)=1990, 192>=b>a, a>0

Result: Integer solution a=90, b=109 (both conditions are not satisfied), NOT POSSIBLE

Further, if we add a condition for b to be even in the WoframAlpha input, i.e., mod(b,2)=0, we get even values for b; but, values for a are not integers anymore.

This proof does not consider non-consecutive pages.

There isn't a need to resort to WolframAlpha. The equation you obtained is a standard quadratic Diophantine equation. It can be easily solved using Simon's favorite factoring trick .

Pi Han Goh - 4 years, 1 month ago
Mike Murphy
Apr 20, 2017

Just like (n+1) * n/2 represents the sum of the first n integers, you can write the sum of "n" consecutive integers (from x to x + n - 1) as (n/2) * (x + x + n - 1) = (n/2) * (2x + n - 1). In the case above, n = 50 (2 pages per sheet), so we have the sum as (50/2) * (2x + 49) = 50x + 25*49. Setting this equal to 1990, we have 50x + 1225 = 1990, which results in a non-integer solution for x (15.3). Therefore there is no solution that satisfies this question.

Well, you have shown that there is no solution if we ripped out "consecutive" pages. But how do you know that there isn't a solution for "not necessarily consecutive pages" as well?

Pi Han Goh - 4 years, 1 month ago
Annie Li
Apr 19, 2017

no because 1990 is not divisible by 25.

Could you explain why "1990 is not divisible by 25" implies it is impossible to find 25 pages whose sum is 1990?

I have found a combination of 24 pages that add up to 1990, but 1990 is not divisible by 24.

Pranshu Gaba - 4 years, 1 month ago

The divisibility of the desired sum by the number of sheets doesn't provide a definitive answer.

For example, the sum of sheets 1, 2, and 4 = (1 + 2 + 3 + 4 + 7 + 8) = 25, but 25 is not divisible by 3.

Phoenix Timmons - 4 years, 1 month ago
Bar Avidan
Apr 17, 2017

The sum of these page numbers is really higher than 1990, so even if we rip the 25th highest pages the sum we'll get will be above 10000.

I misread the question this way too, assuming "rip out" meant "remove" not "choose". The issue comes to whether you assume "these" refers to the set of ripped sheets or remaining sheets.

D L - 4 years, 1 month ago

Don't get what you mean to say by this? For example the sum of the 25 first page is 25 x 51 = 1275. Which is less than 1990. But the odd and even sun explanation is the best way to work.

Peter van der Linden - 4 years, 1 month ago

Don't get it-- did this on a spreadsheet and found that adding together values of sheet #s 1,2,7,10,14,30-42 I get 1990 (1+2+3+4+13+14+19+20+27+28+59+60+61+62+63+64+65+66+67+68+69+70+71+72+73+74+75+76+77+78+79+80+81+82+83+84 = 1990)

D H - 4 years, 1 month ago

Log in to reply

Ugh, just now noticing the 25 page requirement. RTFI

D H - 4 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...