Negation of a double negative is not ... Mind Blown

How many ways can a subset of the + + signs in the following expression be turned into - signs in such a way that the equation becomes valid?

1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 = 4 1+1+1+1+1+1+1+1+1+1+1+1 = 4


The answer is 330.

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.

12 solutions

Bat Man
Nov 3, 2013

1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 = 12 1+1+1+1+1+1+1+1+1+1+1+1=12

So to get 4 4 we have to decrease it by 8 8 . To do that we got to have 4 4 1 -1 's.

There are 11 11 + + signs and we need 4 4 - signs.

We have 11 C 4 = 330 11C4=330 .

what is the meaning of C4 in 11C4=330???

Ronaldo Cargando - 7 years, 7 months ago

Log in to reply

C is actually written as subscript..It means choosing '4' out of '11'..11C4 could be expanded as 11! / (11-4)!*4! = 330

Thejus Jòséph - 7 years, 7 months ago
Rogan Gavin
Nov 4, 2013

We know that there are: 12 "1"s and 11 "+" signs.

To interpret the question, "How many ways can a subset of the + signs..." . They are asking How many ways can a number (<12) of + signs be turned into - signs so that the eqn becomes valid

To fulfill the equation we must remove 8 "1", meaning that we must change 4 "+" signs into 4 \boxed{4} "-" signs.

There are no brackets in this question, so we don't have to worry about that.

Now, we know that we must choose any 4 of the 11 "+" to change, thus, 11C4 = 330

whats the C?

Prim Vudhichamnong - 7 years, 7 months ago

Log in to reply

I think it's the symbol for combination. Learned it from statistics.

Arnold Fernando - 7 years, 7 months ago
Pranjal Namdeo
Nov 4, 2013

by permutations and combinations: we have to replace any of the 11 "+" signs with 4 "-"signs to get the ans ;therefore 11C4=330 Q.E.D

What is QED

Swati Soni - 7 years, 7 months ago

Log in to reply

The definition of QED is "Quod Erat Demonstrandum (it has been proved)" ..it's a latin phrase!

Thejus Jòséph - 7 years, 7 months ago
Himadri Shee
Feb 23, 2014

4 can be obtained by turning 4 + signs into - signs.

For this we have to take a combination of 4 + signs out of 11. This can be done in 11C4 ways i.e. 330 ways.

Sk Ashif Akram
Nov 6, 2013

Total No. of Signs=11, We observe that 8-4=4, so there must be 4 negative signs out of 11 signs. So, Number of ways is simply 11C4=330

Para que a equação se torne válida, é necessário que tenham apenas 4 sinais +. O restante, há de se anularem.

(+)1 +1 +1 +1 +1 -1 +1 -1 +1 -1 +1 -1

Cai em uma permutação com repetição. 11! / (7!.4!) = 330

Shaan Vaidya
Dec 1, 2013

Well, I did it like this: Firstly, there are 12 1's of which, if there are 4 -1's and 8 1's we get the desired result. Also, there are 11 +signs and the first '1' is positive so we need to change any 4 out of the 11 '+' signs to '-'. So, definitely the answer is 11C4 = 330.

Bhargav Das
Nov 26, 2013

The sum given is 12 12 in Left hand side of the expression .We need to alter some + '+' into '-' to make it 4 4 . We observe, 8 + 4 = 12 8+4=12 and 8 4 = 4 8-4=4 .Therefore, we need to alter 4 4 + '+' signs into '-' signs out of a total of 11 11 + '+' signs.This can be done in: ( 11 4 ) = 330 \dbinom{11}{4}=\boxed{330} ways.

Tan Li Xuan
Nov 22, 2013

There are 12 of the number 1.Each time we flip a sign from + + to - we subtract 2 because before the flip the 1 was a positive 1 and after the flip it is a negative 1 so the difference is 1 ( 1 ) = 2 1 -(-1) = 2 .So we must flip 12 4 2 = 4 \frac{12-4}{2} = 4 signs.The number of ways we can pick the signs to be flipped is 11 C 4 = 11 × 10 × 9 × 8 4 × 3 × 2 × 1 = 330 11 C 4 = \frac{11 \times 10 \times 9 \times 8}{ 4 \times 3 \times 2 \times 1} = 330 (the combination formula).

Chandra Bunjaya
Nov 9, 2013

11!/4!7!

Note that the only way to have our expression evaluate to 4 is to have 4 negative signs and 7 positive. This should be clear since: ( 7 + 1 ) + ( 1 ) ( 4 ) = 4 (7+1)+(-1)(4)=4 (we have the 7 + 1 7+1 term as the first digit is positive).

So, out of 11 11 total symbols, we must choose 4 4 negative signs, and, since all negative signs are equivalent, it is order-independent.

We compute this by: ( 11 4 ) = 330 \binom{11}{4}=330 Which is our answer.

Rajnikant 007
Nov 4, 2013

You need only 4 1's with + to make 4 means turn remaining 7 '+' to '-' . It turns into a problem of making permuting 11 objects of which 7 are like of one kind and 4 are like of second kind. 11!/4!*7!=330

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...