• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 20:30
CEST 02:30
KST 09:30
  • Home
  • Forum
  • Calendar
  • Streams
  • Liquipedia
  • Features
  • Store
  • EPT
  • TL+
  • StarCraft 2
  • Brood War
  • Smash
  • Heroes
  • Counter-Strike
  • Overwatch
  • Liquibet
  • Fantasy StarCraft
  • TLPD
  • StarCraft 2
  • Brood War
  • Blogs
Forum Sidebar
Events/Features
News
Featured News
TL.net Map Contest #21: Voting10[ASL20] Ro4 Preview: Descent11Team TLMC #5: Winners Announced!3[ASL20] Ro8 Preview Pt2: Holding On9Maestros of the Game: Live Finals Preview (RO4)5
Community News
Weekly Cups (Oct 13-19): Clem Goes for Four0BSL Team A vs Koreans - Sat-Sun 16:00 CET6Weekly Cups (Oct 6-12): Four star herO85.0.15 Patch Balance Hotfix (2025-10-8)80Weekly Cups (Sept 29-Oct 5): MaxPax triples up3
StarCraft 2
General
The New Patch Killed Mech! Team Liquid Map Contest #21 - Presented by Monster Energy herO joins T1 Weekly Cups (Oct 13-19): Clem Goes for Four TL.net Map Contest #21: Voting
Tourneys
SC2's Safe House 2 - October 18 & 19 INu's Battles #13 - ByuN vs Zoun Tenacious Turtle Tussle Sparkling Tuna Cup - Weekly Open Tournament $1,200 WardiTV October (Oct 21st-31st)
Strategy
Custom Maps
Map Editor closed ?
External Content
Mutation # 496 Endless Infection Mutation # 495 Rest In Peace Mutation # 494 Unstable Environment Mutation # 493 Quick Killers
Brood War
General
BW caster Sayle BSL Season 21 BW General Discussion BGH Auto Balance -> http://bghmmr.eu/ BSL Team A vs Koreans - Sat-Sun 16:00 CET
Tourneys
Azhi's Colosseum - Anonymous Tournament [ASL20] Semifinal B [Megathread] Daily Proleagues SC4ALL $1,500 Open Bracket LAN
Strategy
[I] TvP Strategies and Build Roaring Currents ASL final [I] TvZ Strategies and Builds Current Meta
Other Games
General Games
Stormgate/Frost Giant Megathread Nintendo Switch Thread Path of Exile Dawn of War IV ZeroSpace Megathread
Dota 2
Official 'what is Dota anymore' discussion LiquidDota to reintegrate into TL.net
League of Legends
Heroes of the Storm
Simple Questions, Simple Answers Heroes of the Storm 2.0
Hearthstone
Deck construction bug Heroes of StarCraft mini-set
TL Mafia
TL Mafia Community Thread SPIRED by.ASL Mafia {211640}
Community
General
US Politics Mega-thread Things Aren’t Peaceful in Palestine Russo-Ukrainian War Thread Men's Fashion Thread Sex and weight loss
Fan Clubs
The herO Fan Club!
Media & Entertainment
Series you have seen recently... Anime Discussion Thread [Manga] One Piece Movie Discussion!
Sports
2024 - 2026 Football Thread Formula 1 Discussion MLB/Baseball 2023 NBA General Discussion TeamLiquid Health and Fitness Initiative For 2023
World Cup 2022
Tech Support
SC2 Client Relocalization [Change SC2 Language] Linksys AE2500 USB WIFI keeps disconnecting Computer Build, Upgrade & Buying Resource Thread
TL Community
The Automated Ban List Recent Gifted Posts
Blogs
The Heroism of Pepe the Fro…
Peanutsc
Rocket League: Traits, Abili…
TrAiDoS
Customize Sidebar...

Website Feedback

Closed Threads



Active: 1309 users

The Math Thread - Page 21

Forum Index > General Forum
Post a Reply
Prev 1 19 20 21 22 23 32 Next All
Kleinmuuhg
Profile Blog Joined September 2010
Vanuatu4091 Posts
Last Edited: 2018-09-24 17:43:00
September 24 2018 15:53 GMT
#401
On September 24 2018 05:31 Simberto wrote:
The cardinality of the whole N^4 is infinite. But the cardinality of N^4 which also satisfy a+b+c+d=40 is not.

This set might be a good idea but it is so huge I don't feel that way.

Edit: Not a good idea, see longer explanation below.
This is our town, scrub
The_Templar
Profile Blog Joined January 2011
your Country52797 Posts
Last Edited: 2018-09-24 16:25:08
September 24 2018 16:24 GMT
#402
IMO everyone is way overcomplicating this problem.
On September 24 2018 04:47 travis wrote:
I have an inclusion/exclusion principle question. I have been given a formula a+b+c+d = 40
2<=a<=15
0<=b<=20
0<=c<=25
1<=d<=25

It says to find the number of integer solutions using the exclusion/inclusion principle. I am... confused.

The answer I found is 5502, but I did not find it with exclusion/inclusion principle. I am not sure how to apply exclusion/inclusion here.

First, you should reduce the problem to a+b+c+d =37 with 0 ≤ a ≤ 13, 0 ≤ b ≤ 20, 0 ≤ c ≤ 25, and 0 ≤ d ≤ 24, which is functionally the same thing. Assuming you know how to find the number of solutions to a+b+c+d = 37 with no restrictions, you can use exclusion/inclusion to subtract the cases where a > 13, b > 20, c > 25, d > 24.
Moderatorshe/her
TL+ Member
Acrofales
Profile Joined August 2010
Spain18093 Posts
September 24 2018 16:27 GMT
#403
On September 25 2018 00:53 Kleinmuuhg wrote:
Show nested quote +
On September 24 2018 05:31 Simberto wrote:
The cardinality of the whole N^4 is infinite. But the cardinality of N^4 which also satisfy a+b+c+d=40 is not.

This set might be a good idea but it is so huge I don't feel that way.

I dunno. It doesn't seem so bad. The solution can be found in a similar way to the earlier problems, by seeing it as ways of placing 3 blue cars in between 40 red cars (thereby dividing the space up into 4 sets of red cars that sum to 40). There are
43!/(40!3!) = 12341 ways of doing that.

Imho the problem is that I agree with simberto that I don't see a way of using inclusion exclusion, because I can't find an easy way of calculating the union of that set and the set with the individual constraints.
Kleinmuuhg
Profile Blog Joined September 2010
Vanuatu4091 Posts
Last Edited: 2018-09-24 17:45:08
September 24 2018 17:26 GMT
#404
+ Show Spoiler +
On September 25 2018 01:27 Acrofales wrote:
Show nested quote +
On September 25 2018 00:53 Kleinmuuhg wrote:
On September 24 2018 05:31 Simberto wrote:
The cardinality of the whole N^4 is infinite. But the cardinality of N^4 which also satisfy a+b+c+d=40 is not.

This set might be a good idea but it is so huge I don't feel that way.

I dunno. It doesn't seem so bad. The solution can be found in a similar way to the earlier problems, by seeing it as ways of placing 3 blue cars in between 40 red cars (thereby dividing the space up into 4 sets of red cars that sum to 40). There are
43!/(40!3!) = 12341 ways of doing that.

Thanks for using my car example :D but I am afraid in this case that will not yield the correct result. Best seen by the fact that an integer can be used more than once (drawing with putting back)

On September 25 2018 01:24 The_Templar wrote:
IMO everyone is way overcomplicating this problem.
First, you should reduce the problem to a+b+c+d =37 with 0 ≤ a ≤ 13, 0 ≤ b ≤ 20, 0 ≤ c ≤ 25, and 0 ≤ d ≤ 24, which is functionally the same thing. Assuming you know how to find the number of solutions to a+b+c+d = 37 with no restrictions, you can use exclusion/inclusion to subtract the cases where a > 13, b > 20, c > 25, d > 24.

Reducing is an elegant idea I like it.
The second part of your answer however is not how Inclusion - Exclusion works. Without going into math details, let me try to explain:
You dont count good cases and bad cases and then substract the bad cases. You count different combinations of sets of good cases and then substract the number of good cases you counted more than once.
Imagine you have you want to count fruit you bought but you are a bit of a dimwit so you only know that you bought 8 apples (A) and you bought 7 green fruit (B) and that you have 3 green Apples (A ∩ B) . Then the total number of fruit is
8+7-3=12. You count all apples and all green fruit, but then you counted the green apples twice, hence you substract that number.
Obviously if you have more than 2 sets (which might be the case here ) then you count some stuff thrice etc.. formulas for those cases are very intuitive and can be found everywhere (wikipedia eg).
What does this mean for our case here? We dont want to count cases that are not valid solutions to our equation (and substract them later or sth. like that; This can work to get to a solution but its not inclusion-exclusion) Hence
counting all solutions to a+b+c+d=40 or 37 is not the way to go.


And just after writing all of this I realize that I am dumb and tired. I'd delete it but I will let it stand as a warning to all others.
Im going to bed good night. sorry ;D
This is our town, scrub
Melliflue
Profile Joined October 2012
United Kingdom1389 Posts
September 24 2018 17:44 GMT
#405
I think The_Templar is on the right lines.
Let S = set of solutions for a+b+c+d=37
A= solutions with a<=13
B = solutions with b<=20
C = solutions with c<=25
D = solutions with d<=24
then you are looking for the intersection of A,B,C,D.

The number of solutions that satisfy all of those inequalities is |S| - those which fail at least one;
|AnBnCnD| = |S| - |S\A u S\B u S\C u S\D|

You can use inclusion-exclusion principle on |S\A u S\B u S\C u S\D| because the intersections are small and often empty (for example, (S\A)n(S\C) requires both a>13 and c>25 but then a+b+c+d>38 which is not possible).

So mainly you need to know |S\A| etc and the condition a>=14 can be reduced to a+b+c+d=23, with a,b,c,d>=0.

Side note:
+ Show Spoiler +
On September 24 2018 05:24 Simberto wrote:
4 dimensional space with integers as elements in each dimension. An element might look like this

(1,4,291,11)

So basically, you have a set out of sets of 4 numbers. I don't know if this actually makes the thing easier to solve though.

Edit to your edit:

I was suggesting finding all a, b, c, d with a+b+c+d = 40 (or rather the amount of such things)

And the amount of abcd which satisfies the second set of inequalities

And the amount of stuff in the union of those sets.

Then you can use inclusion exclusion to find the amount of stuff in the intersection of those sets.

This is an aside, but why do you call N^4 a space? It is not a vector space (because there are no additive inverses) and it is not interesting as a topological space unless you give it a weird topology, and there is no obvious metric to make it a metric space, and even if you do give it a topology I don't see how that would in any way help. This also means that 'dimension' is not well-defined. I don't find it helpful here to talk about spaces or dimension.
Acrofales
Profile Joined August 2010
Spain18093 Posts
Last Edited: 2018-09-24 21:53:24
September 24 2018 21:51 GMT
#406
On September 25 2018 02:44 Melliflue wrote:
I think The_Templar is on the right lines.
Let S = set of solutions for a+b+c+d=37
A= solutions with a<=13
B = solutions with b<=20
C = solutions with c<=25
D = solutions with d<=24
then you are looking for the intersection of A,B,C,D.

The number of solutions that satisfy all of those inequalities is |S| - those which fail at least one;
|AnBnCnD| = |S| - |S\A u S\B u S\C u S\D|

You can use inclusion-exclusion principle on |S\A u S\B u S\C u S\D| because the intersections are small and often empty (for example, (S\A)n(S\C) requires both a>13 and c>25 but then a+b+c+d>38 which is not possible).

So mainly you need to know |S\A| etc and the condition a>=14 can be reduced to a+b+c+d=23, with a,b,c,d>=0.

Side note:
+ Show Spoiler +
On September 24 2018 05:24 Simberto wrote:
4 dimensional space with integers as elements in each dimension. An element might look like this

(1,4,291,11)

So basically, you have a set out of sets of 4 numbers. I don't know if this actually makes the thing easier to solve though.

Edit to your edit:

I was suggesting finding all a, b, c, d with a+b+c+d = 40 (or rather the amount of such things)

And the amount of abcd which satisfies the second set of inequalities

And the amount of stuff in the union of those sets.

Then you can use inclusion exclusion to find the amount of stuff in the intersection of those sets.

This is an aside, but why do you call N^4 a space? It is not a vector space (because there are no additive inverses) and it is not interesting as a topological space unless you give it a weird topology, and there is no obvious metric to make it a metric space, and even if you do give it a topology I don't see how that would in any way help. This also means that 'dimension' is not well-defined. I don't find it helpful here to talk about spaces or dimension.

Yeah, that is smart. Hadn't thought of it that way. Furthermore, you can do inclusion-exclusion for the union too:

|S\A u S\B| = |S\A| + |S\B| - |S\A n S\B| and in addition to S\A n S\B being a fairly small set, you can simply repeat Templar's initial trick in reducing the problem again here. Neat!

Oh, and as you pointed out, any intersection of more than 2 is empty, so only need to worry about the pairwise factors. Otherwise you'd still have quite a lot of work to do.

Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
September 25 2018 19:17 GMT
#407
Pushing this thread along, one question at a time. Thank you everyone for your contributions to my education. I have a graph theory question... not sure if this is in anyone's realm of knowledge here.

I was wondering if the following is the case for a hamiltonian graph.

Let's say we have a hamiltonian graph. Somehow, we just know it is. It has N nodes, and each node has a random amount of edges between 3 and n/2.

I do believe, and I think I remember having done it before, that I can systematically remove edges until every node has the same degree, simply by examining the count of how many times each node is in an edge, and removing the edges that are out of balance.

My question is - does doing this ever remove hamiltonicity of the graph, or is it always safe to do this when investigating hamiltonicity?
mahrgell
Profile Blog Joined December 2009
Germany3943 Posts
September 25 2018 20:43 GMT
#408
On September 26 2018 04:17 travis wrote:
Pushing this thread along, one question at a time. Thank you everyone for your contributions to my education. I have a graph theory question... not sure if this is in anyone's realm of knowledge here.

I was wondering if the following is the case for a hamiltonian graph.

Let's say we have a hamiltonian graph. Somehow, we just know it is. It has N nodes, and each node has a random amount of edges between 3 and n/2.

I do believe, and I think I remember having done it before, that I can systematically remove edges until every node has the same degree, simply by examining the count of how many times each node is in an edge, and removing the edges that are out of balance.

My question is - does doing this ever remove hamiltonicity of the graph, or is it always safe to do this when investigating hamiltonicity?


In short: it ain't safe.

Simply assume 8 nodes, split in 2 groups of 4 nodes, all connected to each other. Then add 2 edges between the 2 groups so that the graph becomes hamiltonian. You could/would now remove the 2 connecting edges, thus leading to two isolated clusters.
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
September 25 2018 21:29 GMT
#409
that's true, but there's 2 edges we can remove in that graph that *are* safe, too.

so I suppose my question should be, is it impossible to guarantee the existence of edges that are safe to remove?
Acrofales
Profile Joined August 2010
Spain18093 Posts
Last Edited: 2018-09-25 21:43:42
September 25 2018 21:41 GMT
#410
Why does each node have a degree of at least 3, and not at least 2? Seems to me, you can safely remove all edges that aren't on the hamiltonian cycle, leaving each node with exactly 2 edges. Thus if any node has degree > 2 you can safely remove one. But obviously knowing which ones, requires you to find the hamiltonian cycle...

E: nvm. I misread. Deleted this paragraph. Rest is ok.
mahrgell
Profile Blog Joined December 2009
Germany3943 Posts
Last Edited: 2018-09-25 22:19:29
September 25 2018 22:18 GMT
#411
On September 26 2018 06:29 travis wrote:
that's true, but there's 2 edges we can remove in that graph that *are* safe, too.

so I suppose my question should be, is it impossible to guarantee the existence of edges that are safe to remove?


See Acros post: if you reduce the graph down to the hamilton ring, thus every node having 2 edges, you always have a perfect solution

But if you want to enforce the 3+ edges condition on the the new graph, it is easy to create a counter example.
e.g. [image loading]
Here you are absolutely forced to remove the connections between the 2 clusters, if you want to keep every node at 3+ edges.

edit: of course the left cluster is fully connected... blegh... forgot to put those in.
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
Last Edited: 2018-09-25 23:27:59
September 25 2018 23:22 GMT
#412
edit: nevermind, just a minute, I actually did miss one edge


edit2: wow, fantastic. nice construction it perfectly illustrates that this isn't the case
Geiko
Profile Blog Joined June 2010
France1939 Posts
October 18 2018 12:44 GMT
#413
Hey guys I need your help, I used to know the answer to a math puzzle but I can't seem to figure it out anymore...

There is a room with 8 levers numbered 1-8 which are in a random (unknown) initial position. The guard is going to tell you a number between 1 and 8, then you're going to go in the room, look at the levers, move one and only one lever, and then leave the room. Then your friend goes in the room and he has to guess the number that the guard gave you.
You can discuss strategy with your friend before the game starts.

What is the strategy to be 100% sure that your friend will find the right number ?

If I remember well, the answer had to do with logical gate XOR, but I can't figure it out anymore :'(
geiko.813 (EU)
Ciaus_Dronu
Profile Joined June 2017
South Africa1848 Posts
Last Edited: 2018-10-18 14:13:45
October 18 2018 14:12 GMT
#414
On October 18 2018 21:44 Geiko wrote:
Hey guys I need your help, I used to know the answer to a math puzzle but I can't seem to figure it out anymore...

There is a room with 8 levers numbered 1-8 which are in a random (unknown) initial position. The guard is going to tell you a number between 1 and 8, then you're going to go in the room, look at the levers, move one and only one lever, and then leave the room. Then your friend goes in the room and he has to guess the number that the guard gave you.
You can discuss strategy with your friend before the game starts.

What is the strategy to be 100% sure that your friend will find the right number ?

If I remember well, the answer had to do with logical gate XOR, but I can't figure it out anymore :'(


Question about this, are you *forced* to move a lever? Can you just leave the levers alone?

My current approach is to try find a nice partition of a hypercube (totally equivalent to binary strings of certain length differing at one digit, which is in turn totally equivalent to on/off levers of which you flip one) which might make the answer fall out (the answer will be in the form of "you can find a partition of all possible arrangements of levers into 8 classes such that you can always take a starting configuration, flip one lever, and wind up in any class of your choosing).

EDIT: nvm I think it doesn't matter if you are forced to move one.
Geiko
Profile Blog Joined June 2010
France1939 Posts
October 18 2018 14:52 GMT
#415
On October 18 2018 23:12 Ciaus_Dronu wrote:
Show nested quote +
On October 18 2018 21:44 Geiko wrote:
Hey guys I need your help, I used to know the answer to a math puzzle but I can't seem to figure it out anymore...

There is a room with 8 levers numbered 1-8 which are in a random (unknown) initial position. The guard is going to tell you a number between 1 and 8, then you're going to go in the room, look at the levers, move one and only one lever, and then leave the room. Then your friend goes in the room and he has to guess the number that the guard gave you.
You can discuss strategy with your friend before the game starts.

What is the strategy to be 100% sure that your friend will find the right number ?

If I remember well, the answer had to do with logical gate XOR, but I can't figure it out anymore :'(


Question about this, are you *forced* to move a lever? Can you just leave the levers alone?

My current approach is to try find a nice partition of a hypercube (totally equivalent to binary strings of certain length differing at one digit, which is in turn totally equivalent to on/off levers of which you flip one) which might make the answer fall out (the answer will be in the form of "you can find a partition of all possible arrangements of levers into 8 classes such that you can always take a starting configuration, flip one lever, and wind up in any class of your choosing).

EDIT: nvm I think it doesn't matter if you are forced to move one.


Yes you are forced, but like you said, it basically doesn't matter because if you find the correct method, there will always be a lever that won't change the class of the lever configuration. The problem is finding a smart way to partition the 8 dimension hypercube. The answer was fairly elegant and simple if that helps...
geiko.813 (EU)
opisska
Profile Blog Joined February 2011
Poland8852 Posts
Last Edited: 2018-10-18 15:01:53
October 18 2018 15:01 GMT
#416
Number the levers 1-8 and make number so that you add the lever's number if it's ON, then modulo 8 and +1 to get a number from 1-8. Switching a single lever can change this number by any amount.
"Jeez, that's far from ideal." - Serral, the king of mild trashtalk
TL+ Member
Geiko
Profile Blog Joined June 2010
France1939 Posts
October 18 2018 15:10 GMT
#417
On October 19 2018 00:01 opisska wrote:
Number the levers 1-8 and make number so that you add the lever's number if it's ON, then modulo 8 and +1 to get a number from 1-8. Switching a single lever can change this number by any amount.


Was my first guess too but it doesn't work...

Let's say you enter the room and the configuration is
1:ON
2-8:OFF
and you want to make your friend guess the number 2. There's no lever that can make the sum = 2 [8].
geiko.813 (EU)
opisska
Profile Blog Joined February 2011
Poland8852 Posts
Last Edited: 2018-10-18 15:30:03
October 18 2018 15:14 GMT
#418
On October 19 2018 00:10 Geiko wrote:
Show nested quote +
On October 19 2018 00:01 opisska wrote:
Number the levers 1-8 and make number so that you add the lever's number if it's ON, then modulo 8 and +1 to get a number from 1-8. Switching a single lever can change this number by any amount.


Was my first guess too but it doesn't work...

Let's say you enter the room and the configuration is
1:ON
2-8:OFF
and you want to make your friend guess the number 2. There's no lever that can make the sum = 2 [8].


That's why it's modulo 8 and then +1, but the switches are numbered 1-8 not 0-7. Thus the sum is already 2. If you are forced to move a lever, you can always move the last one which has no effect (equals to 8).

edit: To elaborate, if you were able to not act at all, you would have 9 options, but you need only 8, so you can have that taken away, but you need to basically have one option equal to "it's already good" and that's the last lever with value 8

edit2: I am dumb, it would work exactly as well with switches numbered 0-7, only the first one would do nothing. Getting into the "modulo something" thinking is always hard
"Jeez, that's far from ideal." - Serral, the king of mild trashtalk
TL+ Member
Geiko
Profile Blog Joined June 2010
France1939 Posts
Last Edited: 2018-10-18 15:33:14
October 18 2018 15:32 GMT
#419
On October 19 2018 00:14 opisska wrote:
Show nested quote +
On October 19 2018 00:10 Geiko wrote:
On October 19 2018 00:01 opisska wrote:
Number the levers 1-8 and make number so that you add the lever's number if it's ON, then modulo 8 and +1 to get a number from 1-8. Switching a single lever can change this number by any amount.


Was my first guess too but it doesn't work...

Let's say you enter the room and the configuration is
1:ON
2-8:OFF
and you want to make your friend guess the number 2. There's no lever that can make the sum = 2 [8].


That's why it's modulo 8 and then +1, but the switches are numbered 1-8 not 0-7. Thus the sum is already 2. If you are forced to move a lever, you can always move the last one which has no effect (equals to 8).

To elaborate, if you were able to not act at all, you would have 9 options, but you need only 8, so you can have that taken away, but you need to basically have one option equal to "it's already good" and that's the last lever with value 8.


The problem with your method is that not all options are possible.

If the configuration is
1:OFF, 7:ON
2:OFF, 6:ON
3.OFF, 5.ON
4:OFF
The sum is 5+6+7=2[8]

if you switch lever 1: sum=3[8]
if you switch lever 2: sum=4[8]
if you switch lever 3: sum=5[8]
if you switch lever 4: sum=6[8]
if you switch lever 5: sum=5[8]
if you switch lever 6: sum=4[8]
if you switch lever 7: sum=3[8]
if you switch lever 8: sum=2[8]

you'll notice there is no way to obtain sum=1[8] or sum=7[8] or sum=0[8]

If you needed to make any of these numbers, the method doesn't work.


geiko.813 (EU)
opisska
Profile Blog Joined February 2011
Poland8852 Posts
October 18 2018 15:39 GMT
#420
On October 19 2018 00:32 Geiko wrote:
Show nested quote +
On October 19 2018 00:14 opisska wrote:
On October 19 2018 00:10 Geiko wrote:
On October 19 2018 00:01 opisska wrote:
Number the levers 1-8 and make number so that you add the lever's number if it's ON, then modulo 8 and +1 to get a number from 1-8. Switching a single lever can change this number by any amount.


Was my first guess too but it doesn't work...

Let's say you enter the room and the configuration is
1:ON
2-8:OFF
and you want to make your friend guess the number 2. There's no lever that can make the sum = 2 [8].


That's why it's modulo 8 and then +1, but the switches are numbered 1-8 not 0-7. Thus the sum is already 2. If you are forced to move a lever, you can always move the last one which has no effect (equals to 8).

To elaborate, if you were able to not act at all, you would have 9 options, but you need only 8, so you can have that taken away, but you need to basically have one option equal to "it's already good" and that's the last lever with value 8.


The problem with your method is that not all options are possible.

If the configuration is
1:OFF, 7:ON
2:OFF, 6:ON
3.OFF, 5.ON
4:OFF
The sum is 5+6+7=2[8]

if you switch lever 1: sum=3[8]
if you switch lever 2: sum=4[8]
if you switch lever 3: sum=5[8]
if you switch lever 4: sum=6[8]
if you switch lever 5: sum=5[8]
if you switch lever 6: sum=4[8]
if you switch lever 7: sum=3[8]
if you switch lever 8: sum=2[8]

you'll notice there is no way to obtain sum=1[8] or sum=7[8] or sum=0[8]

If you needed to make any of these numbers, the method doesn't work.




Okay, fuck me, I am dumb! I see the problem now, can't see how I did not see it at first. Long time since I did a puzzle like this the last time ...
"Jeez, that's far from ideal." - Serral, the king of mild trashtalk
TL+ Member
Prev 1 19 20 21 22 23 32 Next All
Please log in or register to reply.
Live Events Refresh
Replay Cast
23:00
LiuLi Cup #46 - Day 2
CranKy Ducklings214
Liquipedia
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
Nathanias 98
SpeCial 86
PiGStarcraft66
CosmosSc2 54
StarCraft: Brood War
Artosis 712
Soulkey 209
NaDa 48
Dota 2
monkeys_forever341
PGG 102
League of Legends
ScreaM954
Cuddl3bear2
Counter-Strike
fl0m929
Super Smash Bros
hungrybox369
Heroes of the Storm
Khaldor154
Other Games
summit1g8568
shahzam583
C9.Mang0296
Skadoodle159
Maynarde157
Trikslyr63
fpsfer 3
Organizations
Other Games
gamesdonequick726
Counter-Strike
PGL364
Other Games
BasetradeTV46
StarCraft 2
Blizzard YouTube
StarCraft: Brood War
BSLTrovo
sctven
[ Show 16 non-featured ]
StarCraft 2
• Hupsaiya 64
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• LaughNgamezSOOP
• Migwel
• sooper7s
StarCraft: Brood War
• Azhi_Dahaki19
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
League of Legends
• Doublelift4748
Other Games
• imaqtpie1510
• Scarra1087
• Shiphtur232
Upcoming Events
Wardi Open
10h 30m
Wardi Open
14h
PiGosaur Monday
23h 30m
Replay Cast
1d 9h
Tenacious Turtle Tussle
1d 22h
The PondCast
2 days
OSC
2 days
WardiTV Invitational
3 days
Online Event
3 days
RSL Revival
4 days
[ Show More ]
RSL Revival
4 days
WardiTV Invitational
4 days
Afreeca Starleague
5 days
Snow vs Soma
Sparkling Tuna Cup
5 days
WardiTV Invitational
5 days
CrankTV Team League
5 days
RSL Revival
5 days
Wardi Open
6 days
CrankTV Team League
6 days
Liquipedia Results

Completed

Acropolis #4 - TS2
WardiTV TLMC #15
HCC Europe

Ongoing

BSL 21 Points
ASL Season 20
CSL 2025 AUTUMN (S18)
C-Race Season 1
IPSL Winter 2025-26
EC S1
Thunderpick World Champ.
CS Asia Championships 2025
ESL Pro League S22
StarSeries Fall 2025
FISSURE Playground #2
BLAST Open Fall 2025
BLAST Open Fall Qual
Esports World Cup 2025
BLAST Bounty Fall 2025
BLAST Bounty Fall Qual

Upcoming

SC4ALL: Brood War
BSL Season 21
BSL 21 Team A
BSL 21 Non-Korean Championship
RSL Offline Finals
RSL Revival: Season 3
Stellar Fest
SC4ALL: StarCraft II
CranK Gathers Season 2: SC II Pro Teams
eXTREMESLAND 2025
ESL Impact League Season 8
SL Budapest Major 2025
BLAST Rivals Fall 2025
IEM Chengdu 2025
PGL Masters Bucharest 2025
TLPD

1. ByuN
2. TY
3. Dark
4. Solar
5. Stats
6. Nerchio
7. sOs
8. soO
9. INnoVation
10. Elazer
1. Rain
2. Flash
3. EffOrt
4. Last
5. Bisu
6. Soulkey
7. Mini
8. Sharp
Sidebar Settings...

Advertising | Privacy Policy | Terms Of Use | Contact Us

Original banner artwork: Jim Warren
The contents of this webpage are copyright © 2025 TLnet. All Rights Reserved.