• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 05:28
CEST 11:28
KST 18:28
  • 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
Tournament Spotlight: FEL Cracow 20256Power Rank - Esports World Cup 202576RSL Season 1 - Final Week9[ASL19] Finals Recap: Standing Tall15HomeStory Cup 27 - Info & Preview18
Community News
Google Play ASL (Season 20) Announced21BSL Team Wars - Bonyth, Dewalt, Hawk & Sziky teams10Weekly Cups (July 14-20): Final Check-up0Esports World Cup 2025 - Brackets Revealed19Weekly Cups (July 7-13): Classic continues to roll8
StarCraft 2
General
Tournament Spotlight: FEL Cracow 2025 #1: Maru - Greatest Players of All Time I offer completely free coaching services Power Rank - Esports World Cup 2025 What tournaments are world championships?
Tourneys
FEL Cracov 2025 (July 27) - $10,000 live event Esports World Cup 2025 $25,000 Streamerzone StarCraft Pro Series announced $5,000 WardiTV Summer Championship 2025 WardiTV Mondays
Strategy
How did i lose this ZvP, whats the proper response
Custom Maps
External Content
Mutation #239 Bad Weather Mutation # 483 Kill Bot Wars Mutation # 482 Wheel of Misfortune Mutation # 481 Fear and Lava
Brood War
General
Google Play ASL (Season 20) Announced Dewalt's Show Matches in China BGH Auto Balance -> http://bghmmr.eu/ BW General Discussion Flash Announces (and Retracts) Hiatus From ASL
Tourneys
[Megathread] Daily Proleagues [BSL20] Non-Korean Championship 4x BSL + 4x China CSL Xiamen International Invitational [CSLPRO] It's CSLAN Season! - Last Chance
Strategy
Simple Questions, Simple Answers [G] Mineral Boosting Does 1 second matter in StarCraft?
Other Games
General Games
Stormgate/Frost Giant Megathread Nintendo Switch Thread Total Annihilation Server - TAForever [MMORPG] Tree of Savior (Successor of Ragnarok) Path of Exile
Dota 2
Official 'what is Dota anymore' discussion
League of Legends
Heroes of the Storm
Simple Questions, Simple Answers Heroes of the Storm 2.0
Hearthstone
Heroes of StarCraft mini-set
TL Mafia
TL Mafia Community Thread Vanilla Mini Mafia
Community
General
US Politics Mega-thread UK Politics Mega-thread Stop Killing Games - European Citizens Initiative Things Aren’t Peaceful in Palestine Russo-Ukrainian War Thread
Fan Clubs
INnoVation Fan Club SKT1 Classic Fan Club!
Media & Entertainment
[\m/] Heavy Metal Thread Anime Discussion Thread Movie Discussion! [Manga] One Piece Korean Music Discussion
Sports
2024 - 2025 Football Thread Formula 1 Discussion TeamLiquid Health and Fitness Initiative For 2023 NBA General Discussion
World Cup 2022
Tech Support
Installation of Windows 10 suck at "just a moment" Computer Build, Upgrade & Buying Resource Thread
TL Community
TeamLiquid Team Shirt On Sale The Automated Ban List
Blogs
Ping To Win? Pings And Their…
TrAiDoS
momentary artworks from des…
tankgirl
from making sc maps to makin…
Husyelt
StarCraft improvement
iopq
Socialism Anyone?
GreenHorizons
Eight Anniversary as a TL…
Mizenhauer
Customize Sidebar...

Website Feedback

Closed Threads



Active: 711 users

The Math Thread - Page 8

Forum Index > General Forum
Post a Reply
Prev 1 6 7 8 9 10 32 Next All
Mafe
Profile Joined February 2011
Germany5966 Posts
Last Edited: 2017-06-23 19:15:04
June 23 2017 19:13 GMT
#141
On June 24 2017 03:54 ninazerg wrote:
Does 1 + 1 ever not equal 2?

Usually, one defines 2 to be 1+1. In this sense, 1+1=2 always holds.

But you can have 1+1=0 for example, in which case 2=0 (so still 1+1=2). In this case, ifthere is already some object taking the role of "2", one typically writes 0 instead of 2, to have a unambiguous notation.
Acrofales
Profile Joined August 2010
Spain17983 Posts
June 23 2017 19:17 GMT
#142
No. 1+1=10 in many many daily cases
Simberto
Profile Blog Joined July 2010
Germany11507 Posts
June 23 2017 19:22 GMT
#143
On June 24 2017 04:13 Mafe wrote:
Show nested quote +
On June 24 2017 03:54 ninazerg wrote:
Does 1 + 1 ever not equal 2?

Usually, one defines 2 to be 1+1. In this sense, 1+1=2 always holds.

But you can have 1+1=0 for example, in which case 2=0 (so still 1+1=2). In this case, ifthere is already some object taking the role of "2", one typically writes 0 instead of 2, to have a unambiguous notation.


Indeed. In the realm of natural numbers (or in the reals, or for rationals, or a lot of other realms), 1 + 1 = 2.

However, it is quite easy to conceive of an mathematical object worth study where that is not the case. Take, for example, the F2. That is the body of numbers modulo 2. In that body, there are only two objects, everything that is 0 modulo 2, and everything that is congruent 1 modulo 2. (One could of course also call these different.

It is quite obvious that 1+1 in that body equals, because 2 is equal to zero in that body.
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
June 24 2017 02:59 GMT
#144
On June 24 2017 01:33 AbouSV wrote:
So in the end, Travis made this thread to solve some homework questions :D


in all fairness, it was a really hard question, lol

it took a long time but Shala helped me solve it over skype.
DarkPlasmaBall
Profile Blog Joined March 2010
United States44312 Posts
June 24 2017 03:10 GMT
#145
On June 24 2017 03:54 ninazerg wrote:
Does 1 + 1 ever not equal 2?


1+1=3 for especially large values of 1

+ Show Spoiler +
Merely just a joke about rounding numbers... typically, 1.3 would be rounded down to 1 while 2.6 would be rounded up to 3, so while 1.3+1.3=2.6, individually rounding those three numbers would create the incorrect estimation that 1+1=3.
"There is nothing more satisfying than looking at a crowd of people and helping them get what I love." ~Day[9] Daily #100
AbouSV
Profile Joined October 2014
Germany1278 Posts
June 24 2017 09:13 GMT
#146
On June 24 2017 12:10 DarkPlasmaBall wrote:
Show nested quote +
On June 24 2017 03:54 ninazerg wrote:
Does 1 + 1 ever not equal 2?


1+1=3 for especially large values of 1

+ Show Spoiler +
Merely just a joke about rounding numbers... typically, 1.3 would be rounded down to 1 while 2.6 would be rounded up to 3, so while 1.3+1.3=2.6, individually rounding those three numbers would create the incorrect estimation that 1+1=3.


Not so much a joke, just showing you're a physicist :p
Coming from math, I had a real hard time at first understanding the shenanigans behind 'pi = 1' or '1000+200 = 1000' and such.
meatpudding
Profile Joined March 2011
Australia520 Posts
June 24 2017 09:26 GMT
#147
On June 24 2017 03:54 ninazerg wrote:
Does 1 + 1 ever not equal 2?


1 + 1 = 0 (Mod 2)

And I guess looking above, lots of times.

If you can't post picures, you need to add .png to the image link.[image loading]

Be excellent to each other.
flamewheel
Profile Blog Joined December 2009
FREEAGLELAND26781 Posts
June 24 2017 13:02 GMT
#148
Math thread \o/

I've forgotten so much math already
Writerdamn, i was two days from retirement
hypercube
Profile Joined April 2010
Hungary2735 Posts
June 24 2017 13:32 GMT
#149
On June 24 2017 18:13 AbouSV wrote:
Show nested quote +
On June 24 2017 12:10 DarkPlasmaBall wrote:
On June 24 2017 03:54 ninazerg wrote:
Does 1 + 1 ever not equal 2?


1+1=3 for especially large values of 1

+ Show Spoiler +
Merely just a joke about rounding numbers... typically, 1.3 would be rounded down to 1 while 2.6 would be rounded up to 3, so while 1.3+1.3=2.6, individually rounding those three numbers would create the incorrect estimation that 1+1=3.


Not so much a joke, just showing you're a physicist :p
Coming from math, I had a real hard time at first understanding the shenanigans behind 'pi = 1' or '1000+200 = 1000' and such.


I feel just the opposite. I get annoyed when people are working with rough estimates but use a value of pi that is correct to 5 decimal places. I know that's what some textbooks tell you to do, but come on people, use common sense.
"Sending people in rockets to other planets is a waste of money better spent on sending rockets into people on this planet."
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
Last Edited: 2017-06-24 14:56:51
June 24 2017 14:50 GMT
#150
So, this is kind of a crossover between CS and math. Not sure which thread to post this in. I guess math, but hopefully some people here understand it.

I have a boolean formula (A ^ B) ^ (C V D) V ( B ^ D) ^ ( ~C V ~D) etc etc
We are looking for the asymptotic complexity of finding satisfiability(a combination of true and falses that makes the final output true), through brute force. The question is how many combinations of inputs are there, basically. I believe the answer is 2^n.



The 2nd part of the question says that we now have an ability to pass our algorithm both the conditions (A = true, B = false, C = true, etc etc - in our 2^n combinations) - but we can ALSO pass an integer "k". Our algorithm will return if we have satisfied the assignment, but will ALSO return if the boolean formula can be satisfied with "k" or less TRUE values.

The question for the 2nd part is what is the asymptotic complexity to find a satisfying assignment. Here is what I believe the answer is.

First, find the exact "k" value. This can be done by passing "k = n", then if it comes back true, cut "k" in half, pass it again. If it's false cut it in half between k and n, if it's true again cut it in half again.. etc etc. Keep dividing our portions by half until we get an exact k. This is log_2(n) operations.

Once we have an exact k, we know we need to pass that many trues into our algorithm. Therefore the total number of combinations to try will be (n choose k).

So I think the complexity this time will be log_2(n) + (n choose k), which asymptotically is just n choose k - which in the average case I think is much better than the first scenario.

Does this math look good? I just wanted to see if anyone spots any obvious mistakes.
AbouSV
Profile Joined October 2014
Germany1278 Posts
June 24 2017 14:51 GMT
#151
On June 24 2017 22:32 hypercube wrote:
Show nested quote +
On June 24 2017 18:13 AbouSV wrote:
On June 24 2017 12:10 DarkPlasmaBall wrote:
On June 24 2017 03:54 ninazerg wrote:
Does 1 + 1 ever not equal 2?


1+1=3 for especially large values of 1

+ Show Spoiler +
Merely just a joke about rounding numbers... typically, 1.3 would be rounded down to 1 while 2.6 would be rounded up to 3, so while 1.3+1.3=2.6, individually rounding those three numbers would create the incorrect estimation that 1+1=3.


Not so much a joke, just showing you're a physicist :p
Coming from math, I had a real hard time at first understanding the shenanigans behind 'pi = 1' or '1000+200 = 1000' and such.


I feel just the opposite. I get annoyed when people are working with rough estimates but use a value of pi that is correct to 5 decimal places. I know that's what some textbooks tell you to do, but come on people, use common sense.


I still agree. I mean pi at 5 decimals is as bad as taking 1 or 10. You can't replace pi by anything, just keep it. This has been the topic of many discussions at the (physics) lab :p
hypercube
Profile Joined April 2010
Hungary2735 Posts
June 24 2017 17:18 GMT
#152
On June 24 2017 23:51 AbouSV wrote:
Show nested quote +
On June 24 2017 22:32 hypercube wrote:
On June 24 2017 18:13 AbouSV wrote:
On June 24 2017 12:10 DarkPlasmaBall wrote:
On June 24 2017 03:54 ninazerg wrote:
Does 1 + 1 ever not equal 2?


1+1=3 for especially large values of 1

+ Show Spoiler +
Merely just a joke about rounding numbers... typically, 1.3 would be rounded down to 1 while 2.6 would be rounded up to 3, so while 1.3+1.3=2.6, individually rounding those three numbers would create the incorrect estimation that 1+1=3.


Not so much a joke, just showing you're a physicist :p
Coming from math, I had a real hard time at first understanding the shenanigans behind 'pi = 1' or '1000+200 = 1000' and such.


I feel just the opposite. I get annoyed when people are working with rough estimates but use a value of pi that is correct to 5 decimal places. I know that's what some textbooks tell you to do, but come on people, use common sense.


I still agree. I mean pi at 5 decimals is as bad as taking 1 or 10. You can't replace pi by anything, just keep it. This has been the topic of many discussions at the (physics) lab :p


It depends on *why* your error is what it is. If you have a 10% error because that's the limit of your instrument and there's no reasonable way to improve it, then sure use the best value of pi you can. But if you have a 10% error because you are just looking for a ballpark figure then what's the point? You might as well put that extra effort into improving your measurement or your model or whatever.

There's a difference between measurements and ballpark estimates. Both have errors, but when you estimate you create errors in order to keep moving along and get to some reasonable number as fast as possible. Saying that pi ~ 3.14 is no different than saying 900 + 95 ~= 1000
"Sending people in rockets to other planets is a waste of money better spent on sending rockets into people on this planet."
meatpudding
Profile Joined March 2011
Australia520 Posts
June 25 2017 01:21 GMT
#153
On June 24 2017 23:50 travis wrote:
So, this is kind of a crossover between CS and math. Not sure which thread to post this in. I guess math, but hopefully some people here understand it.

I have a boolean formula (A ^ B) ^ (C V D) V ( B ^ D) ^ ( ~C V ~D) etc etc
We are looking for the asymptotic complexity of finding satisfiability(a combination of true and falses that makes the final output true), through brute force. The question is how many combinations of inputs are there, basically. I believe the answer is 2^n.



The 2nd part of the question says that we now have an ability to pass our algorithm both the conditions (A = true, B = false, C = true, etc etc - in our 2^n combinations) - but we can ALSO pass an integer "k". Our algorithm will return if we have satisfied the assignment, but will ALSO return if the boolean formula can be satisfied with "k" or less TRUE values.

The question for the 2nd part is what is the asymptotic complexity to find a satisfying assignment. Here is what I believe the answer is.

First, find the exact "k" value. This can be done by passing "k = n", then if it comes back true, cut "k" in half, pass it again. If it's false cut it in half between k and n, if it's true again cut it in half again.. etc etc. Keep dividing our portions by half until we get an exact k. This is log_2(n) operations.

Once we have an exact k, we know we need to pass that many trues into our algorithm. Therefore the total number of combinations to try will be (n choose k).

So I think the complexity this time will be log_2(n) + (n choose k), which asymptotically is just n choose k - which in the average case I think is much better than the first scenario.

Does this math look good? I just wanted to see if anyone spots any obvious mistakes.


Soon we are going to need the Algorithms Thread.

I'm not sure I understand part 2, do you mean you can choose k out of n inputs arbitrarily? Or the first k of n?
Be excellent to each other.
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
June 25 2017 01:37 GMT
#154
In part 2 you can pass an integer "k". in addition to your series of true/false.

It then tells you if the formula is satisfiable with "k" true values or less. So if your formula needs 10 true values, and you pass it a "k" value of 9, it will return false for that.

It's not tied to the actual series of boolean variables you are sending, other than that they are both related to solving the formula. They could be 2 different functions for all it matters.
meatpudding
Profile Joined March 2011
Australia520 Posts
Last Edited: 2017-06-25 02:07:46
June 25 2017 01:52 GMT
#155
On June 25 2017 10:37 travis wrote:
In part 2 you can pass an integer "k". in addition to your series of true/false.

It then tells you if the formula is satisfiable with "k" true values or less. So if your formula needs 10 true values, and you pass it a "k" value of 9, it will return false for that.

It's not tied to the actual series of boolean variables you are sending, other than that they are both related to solving the formula. They could be 2 different functions for all it matters.


Are there any restrictions on the formula? The example is (A op B) op (...) ..., so it's always the same pattern or brackets? Not sure about this off the top of my head. Naive solution is to check everything at O(2^n) but if you analyse the formula itself, shouldn't it be something is O(n) because you just count the operations in a certain way? Eg, (n-k) equals the number of ANDs or some such.

Edit: The problem I have with your original solution is that you are looking at the complexity of how many function calls to f(n, k) as a binary search on k. But I am wondering if the question is to figure out the complexity of f, how it determines what to return for a given k.
Be excellent to each other.
xwoGworwaTsx
Profile Joined April 2012
United States984 Posts
June 25 2017 05:17 GMT
#156
in all my years in academic mathematics, this is the best math problem i have ever encountered. so simple yet so frustatingly elusive. And the answer is elegant and massively satisfying.

problem: prove that 1+1=2 without using addition and numbers in your process and solution.

anybody want to have a go?
meatpudding
Profile Joined March 2011
Australia520 Posts
June 25 2017 05:33 GMT
#157
On June 25 2017 14:17 xwoGworwaTsx wrote:
in all my years in academic mathematics, this is the best math problem i have ever encountered. so simple yet so frustatingly elusive. And the answer is elegant and massively satisfying.

problem: prove that 1+1=2 without using addition and numbers in your process and solution.

anybody want to have a go?


What's your area of mathematics?
Be excellent to each other.
Acrofales
Profile Joined August 2010
Spain17983 Posts
Last Edited: 2017-06-25 06:23:52
June 25 2017 06:22 GMT
#158
On June 25 2017 14:17 xwoGworwaTsx wrote:
in all my years in academic mathematics, this is the best math problem i have ever encountered. so simple yet so frustatingly elusive. And the answer is elegant and massively satisfying.

problem: prove that 1+1=2 without using addition and numbers in your process and solution.

anybody want to have a go?

Peano arithmetic defines numbers as literals in a FOL. Does that count as "using numbers"? Otherwise you could do it in set theory, but it's basically the same.
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
June 27 2017 19:43 GMT
#159
Could someone help me with summation algebra

I keep getting problems where I am summing to some portion of n, say

the sum from i=1 to (n/2) of i

now, I know that the sum i=1 to n of i is gauss sum:
1/2n(n+1)

I know this because I have memorized it

but when we sum to n/2 it becomes 1/8n(n+2)

I know this because wolfram alpha tells me so

but how can I manually solve this sum? Is there some rule for what happens to the sum when I only sum to a portion of my "n" ?
Liebig
Profile Joined August 2010
France738 Posts
June 27 2017 20:27 GMT
#160
Another way to put it:

let f(x) = sum from i=1 to x of i
let g(x) = (1/2) * x * (x+1)

you know that f(x) = g(x) for all x.

what you want is f(n/2) which is equal to g(n/2)

so if you just plug n/2 instead of x in g, you get

g(n/2)=(1/2) * (n/2) * (n/2+1) = (n/4)*(n+2)/2 = n(n+2)/8
Prev 1 6 7 8 9 10 32 Next All
Please log in or register to reply.
Live Events Refresh
FEL
09:00
Cracow 2025
Krystianer vs sOs
SKillous vs ArT
MaNa vs Elazer
Spirit vs Gerald
Clem vs TBD
uThermal vs TBD
Reynor vs TBD
Lambo vs TBD
ComeBackTV 535
RotterdaM441
IndyStarCraft 273
CranKy Ducklings88
3DClanTV 62
Rex58
LiquipediaDiscussion
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
RotterdaM 441
IndyStarCraft 273
Rex 58
ProTech56
StarCraft: Brood War
Hyuk 3956
firebathero 1054
Hyun 697
Mini 641
Larva 631
BeSt 224
EffOrt 133
Backho 110
Mind 108
ZerO 88
[ Show more ]
zelot 51
Free 49
sorry 37
scan(afreeca) 35
Noble 34
Shinee 28
Sacsri 27
Bale 25
Sharp 24
soO 24
NaDa 10
IntoTheRainbow 9
yabsab 8
Dota 2
XcaliburYe561
Counter-Strike
Stewie2K1315
shoxiejesuss442
Heroes of the Storm
Khaldor244
Other Games
gofns7448
Happy357
SortOf158
Beastyqt117
ZerO(Twitch)16
Organizations
StarCraft 2
Blizzard YouTube
StarCraft: Brood War
BSLTrovo
sctven
[ Show 13 non-featured ]
StarCraft 2
• Berry_CruncH355
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• LaughNgamezSOOP
• Migwel
• sooper7s
StarCraft: Brood War
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
Dota 2
• WagamamaTV440
• lizZardDota2207
Upcoming Events
BSL20 Non-Korean Champi…
4h 32m
BSL20 Non-Korean Champi…
8h 32m
Bonyth vs Zhanhun
Dewalt vs Mihu
Hawk vs Sziky
Sziky vs QiaoGege
Mihu vs Hawk
Zhanhun vs Dewalt
Fengzi vs Bonyth
Sparkling Tuna Cup
2 days
WardiTV European League
2 days
Online Event
2 days
uThermal 2v2 Circuit
3 days
The PondCast
4 days
Replay Cast
4 days
Korean StarCraft League
5 days
CranKy Ducklings
6 days
Liquipedia Results

Completed

CSLPRO Last Chance 2025
Esports World Cup 2025
Murky Cup #2

Ongoing

Copa Latinoamericana 4
Jiahua Invitational
BSL 20 Non-Korean Championship
BSL 20 Team Wars
FEL Cracov 2025
CC Div. A S7
Underdog Cup #2
IEM Cologne 2025
FISSURE Playground #1
BLAST.tv Austin Major 2025
ESL Impact League Season 7
IEM Dallas 2025
PGL Astana 2025
Asian Champions League '25

Upcoming

ASL Season 20: Qualifier #1
ASL Season 20: Qualifier #2
ASL Season 20
CSLPRO Chat StarLAN 3
BSL Season 21
RSL Revival: Season 2
Maestros of the Game
SEL Season 2 Championship
WardiTV Summer 2025
uThermal 2v2 Main Event
HCC Europe
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
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.