Yannik K.

well that explains that my approach was wrong

@TedShifrin oh yeah because those are negative right

yes i know, there is rendering involved ^^

$ \frac{7x^{0.2}y^{-0.3}}{10} = 2x^{-0.8}y^{0.7} $

how do i write LaTeX in here ? just staring with $ and then the code ?

really ... maybe then i made a mistake because this is what i was getting when trying to solve a simple lagrange multiplier exercise

yeah solve sorry

its pretty late and i feel dumb for not knowing how to dissolve "x + 3.5x^0.9 = 100" to x

@Semiclassical Well your first approach seems to be the more obvious one in my opinion

@Semiclassical Thanks. i played around with (-1)^n but i did not had that full approach

it seems a little off for me right now that can it can have both no maximum and minimum

@AkivaWeinberger So i might be a bit confused right now, but what is then an example for a sequence that has no maximum AND minimum. Since the sequence can only rise or fall

@AkivaWeinberger With the sequence you gave (1/n) it was quite obvious it has no minimum, but it has a maxium right ? since 1 is the largest element and is included

I know about those terms, but infimum and supremum are special cases of upper / lower limit

@AkivaWeinberger You're right. I know that now too. Bounded means only there is an upper limit and lower limit, but minimum means its included in the sequence

Hi, considering i have a "sequence" that converges against "infinite". I shall prove that such sequence has a "minimal member". I am a bit confused how exactly i should prove this, because i thought if a sequence converges it automatically means that the sequence is "restricted" and has a minimal member ^^

@AkivaWeinberger The real question behind this is that with this relation i should be able to say something about infimum, supremum, minimum, maximum of U

@AkivaWeinberger So ok this would be possible that the whole thing is negative.

oh yeah i mean positive xd

@AkivaWeinberger OK i got it now, but back to my question. if x is for example smaller than a its smaller than all the other vars and hence the whole product is negative

@AkivaWeinberger First why are you always putting a $ in front of a variable ? Well if x is for example smaller than a its also smaller than all others variables and the whole product is positive

Well i do not know about you, but when i always tried to find an example set, it would never work, because the whole product has to be < 0

If i have 4 real numbers specified through the relation a < b < c < d, and i construct the set U = { x real : (x-a)(x-b)(x-c)(x-d) < 0}

Let me guess you are using NumPy or SciPy in Python ?

it is not a programming language - its a commercial software

BTW do math students write a single line of code in their "college career" - and i dont mean MATLAB

do not agree. i study computer science and i hate everything in math that enforces me to prove sth.

@heather if you just wanna do math without any field of application you go crazy - trust me - just use it as a tool xD

@PVAL-inactive you mean "analysis" how it is called in the non "anglo american" region haha

Social life is f*cked up if you you are going for a REAL degree haha xD

@Semiclassical This is just a "naive first" assumption but can it be that the whole graph just works if i have k +1 nodes for this given conditions ? But well, thats just for complete graphs, right, i could just omit the edges for graphis with more nodes and still fullfilll the conditions

@Semiclassical yeah and somewhere i need to use the fact that "each node has k neighbors"

@Semiclassical Well i know if V is the set of all my nodes then VC2 is the amount of all possible edges (because edges are represented as tuples)

Well in my case i have to get to the two expressions first.

yes i meant that xD

well isn't this just "nCr" ?

but wouldn't that deliver a wrong result

And that two vertices have one common neighbor

@Semiclassical yeah well this seems to be not the required answer, You do not know how many edges you have , you only know that each vertex (or node) has k edges

So if i understood this "double counting" principle right, that means with the given conditions i have to find two expressions of the amount of nodes, right ?

i have a "double counting" problem to solve. The example is a graph (with edges and nodes of course). Edges are represented mathematically as a "pair" or tuple; of course all edges are then a subset of the cross product V x V (if V is the set of nodes). Follwing conditions are given: 1. Each node has exactly k neighbors (= connected with an edge) and 2. each two nodes have only one common neighbor. So i need to find out the amount of nodes with the double counting principle.

Well, maybe in written form, mainly because as a student of computer science many sources are in english, but for speaking good english, i had to speak english daily.

Well, I am happy that I do not chose to study any language or smth. Not really my cup of tea :D

Oh, sorry just looked over the examples and did not read the description text.

Well in these examples german seems to behave like english but in my first examples it does not behave that way in german

We also say often "Nicht schlecht" (= not bad) instead of "Gut" (= good)

Yeah, statements like „Er hat damit nicht unrecht“ or „nicht übel“ are often used in german.

Oookay. Well, to be honest, someone would rarely say "Das ist nicht uninteressant" in german. Rather just simple "Das ist interessant".

What do u mean by more complicated ?

Nope, as I said we only use one negative to negote sth.