so... like for instance... pointers in game maker are broken

so i just took an array and shoved a memory allocator in it

if a computer doesnt work i can fix it. if a program doesnt work i re-load it ;P

now I have working 'pointers'

dont point, its rude :P

lol

@Faust7 if a program doesn't work I uninstall it. Unless it is my program... then I rebrand it as a feature.

otherwise, I pretty much expect it to not be working yet

omg what are you microsoft!

(i mean, aside from the development phase)

in which case all hell can break lose

@Faust7 no. Microsoft can't program a lightbulb. Their own OS is so massive that standards on numbers of glitches predict so many security holes that you can drive a US army tank straight in.

lol

there shit never works right

i only use microsoft for gaming

think of this way

3 bugs per 1000 lines of code

windows has roughly a billion from what I've heard

do the math

granted, 3 is the maximum for basic stuff

but still

which is why my computer dual boots ^^

lol

Did you guys know the first computer bug was an actual insect they found that flew into a transistor and burned it out?

all OSes will do it

it's just the size of the code

the more features, the more risks

its just too much effort to game in linux

ironically game maker 8.0, which was made for windows only... runs better on linux

lol

i hear a few games that broke on windows 8 actually run great on linux

windows 10 fixed the issue

well the nice thing about windows is that its so broken

something with midi files

almost anything will "work"

its like a russian tank

to be fair Game Maker is a piece of shit though

no onw knows why it runs

but it doesnt really break down pernamently

i mostly use it to take advantage of the game loop and graphics

so...

that's probably part of the issue.

anyway

it's late

enjoy some advanced napping

goodnight. Also, why does chat stop you from messaging simply from posting a little fast?

nah. I'm gonna go lie down and watch youtube.

Probably to avoid bots

*boots

Are you a robot duck?

Worse. I'm a programmer, which means I type so fast that even posts like this seem like flooding with spam posts.

well im going back to figure out how calculus works for awhile enjoy your tube of U

A duck versus a bot

FIGHT

I also have a latent ability to write a 'small' writing assignment, specifically due to the fact that I type so fast and quickly write thousands of words. It's not unusual for me to write 500+ words a day and end up with a 8000-10000 word paper.

couldnt the duck just fly away?

dear god. I'm having flashbacks to 2013

2013 wasnt so bad

wait for it...

the-cult-of-duck.wikia.com/wiki/…

literally duck VS bots.

shit

wow thats alot of caps

part 3

we used all caps for titles. It was our way of doing bold headings way back when.

ironically we've come full circle

the game I'm making is actually a really random prequel to all that. But don't tell anyone. It's kind of the obscure secret.

^^

i wouldn't say plot twist since it's set like 1000's of years in the past. XD

im mor eof a rpg fan than builder fan

lol

it is a turn based rpg

grid based one, like the fire emblem games if I hear the rumors right

i've never played that

anyway, goodnight

i really need to install latex on the computer

sharelatex.com works as well

most of the time i can just read it but i have no idea what eric just said

is that true?

im not understanding it correctly (ifi was id assume it would be exactly that no need for sup)

Hello guyz

morning

good morning

I have one very easy problem

dunno bout the good part but alright ^^

I have solved it

But the answer seems to wrong

Given two points in 2d space, I have to find the size of the largest square that can be drawn centered at those points such that, the squares do not intersect ( they may touch each other but must not intersect )

For this problem , I have found the distance between centers of two squares

Then the answer will be simply distance/2 .

Am I doing something wrong here ?

each ahs an x,y cord

diffrence squared sq rted

what is ahs ?

has*

so what will be the procedure to solve this problem ?

$\sqrt {(x_0-x_1)^2 + (y_0 -y_1)^2}$

Yes I have applied this formula

thats the distance bewtween the 2 points

ok

Then the ans will be simply distance/2 .

Is it right ?

take half the x distance and half the y distance thats the largest each square can be

@IccheGuri you don't need /2.

So what will I need ?

oh

@LeakyNun

Just the distance itself.

shit

hes rite

@Faust7 language.

why should the answer be just distance itself ?

@LeakyNun

@IccheGuri draw a diagram.

uh sorry ?

didnt think anyone would find that offencive.

I have to draw two square between two points

@IccheGuri draw it and upload it.

ok

got it?

I am drawing a diagram to verify my argument

Here the distance betweeen tho centersof square is 4

got it

whats the length of one of the sides of the square

4

@IccheGuri nice

What will be the side length of the largest axis parallel squares centered at points A and B ?

@IccheGuri max(|x1-x2|, |y1-y2|)

again, draw a diagram, and it will be apparent.

What will be the side length of the largest axis parallel squares centered at points A and B ?

"axis-parallel square"

is a square whose sides are parallel to the axes

the axes being the x-axis and the y-axis.

the diagonal length should equal the distance no?

@Faust7 draw a diagram.

nvm

then why the answer is max(|x1-x2|, |y1-y2|) ?

@IccheGuri have you drawn a diagram?

@IccheGuri what is AB is not horizontal?

move the centre point of the red square up one point

ok I am drawing a picture in where AB is not horizontal .

then try moving it up 5 points

what is the mathematical logic of this answer max(|x1-x2|, |y1-y2|) ?

@IccheGuri draw it first.

Can anyone confirm this for me please:

$(1 + \rho + \frac{\rho^2}{2!} + \frac{\rho^3}{3!} + ... + \frac{\rho^n}{n!} + ...) = e^\rho$

@MarksCode that is correct.

is this some sort of summation?

@MarksCode yes.

$\displaystyle \sum_{n=0}^\infty \dfrac{\rho^n}{n!} = e^\rho$

@IccheGuri draw the two pictures with the red square shifted up one point then 5 points

Thanks @LeakyNun

@MarksCode no problem.

what happened the size of the square when you shifted up one point? then what happened when u shift it up 5 points?

@IccheGuri draw AB neither parallel to the axes nor diagonal.

sorry you said the distance was 4 points so i have confused you

ok

that's better

can you see it now?

wait

@IccheGuri I thought the two squares have to be the same

those 2 squares arent the same size...

I have to find the side length of the largest axis parallel squares centered at A and B .

ok

According to the problem format the squares have to be equal . So I have done mistake in drawing the diagram

Anyone know what one would need to understand to get through an explanation of C* Algerbra?

now explain the issue

the centres got futher away then when they were in line with each other yes?

did the squares get any bigger?

I have not understood your words

sorry

these squares are the same size as they are in the diagram you drew

but the centre of these 2 squares is closer together

ok

then ?

if you keep moving the second square up eventually when it passes the point where the x and y distance are the same

the squares will get bigger

thats why i was trying to get you to draw one with it up slightly and then up alot whichever diffrence whether it be in the x or the y is largest determines the size of the squares

if you used rectangles this wouldn't be the case of course... it would be an average...

Sorry iam clearly not qualified to explain this :(

ok I have understood

i guess you could say the logic is coming from the fact that you MUST have a square not a rectangle

so even though one side could be larger it doesnt help you...

what class is this for if you dont mind me asking?

I am solving a programming problem

This problem is in in basic geometry category

I can't wait til summer already, going to be interning at a cool company :)

Just gotta get this dang take-home final over with :(

ah i know very little about programming

and appertnly very little about geometry lol

in where are you studying ?

Math

never done basic geometry though

honestly i have no idea what im doing but im allegedly good at whatever it is im doing

What will be the formula if two square is not of equal size ?

make one square a point

the other one as large as possible

Anybody want to cry with me as I try doing this take-home final?

What will be formula for the above figure ?

could you restate precisely what your asking for?

(╯°□°）╯︵ ┻━┻

lol

oh god

i dont think thats an answer for your take home final

that dog got messed up

I have to find the side length of the largest axis parallel squares centered at A and B

I give up

sorry for wasting you guyss time

@Faust7

Ok seriously Im done now

if both squares have to the same size that make sense

if they dont have to be you could just keep making the pink square smaller and the red one bigger until the pink one is simply a point

anyway the same formula will wokr that Leaky gave you for the second picutre

the length f the side of each of the squares will need to sum to two times the largest diffrence

(when you make them the same size your splitting that 2d between each square giving you a distance of d for each one

I have not understood this line

the length f the side of each of the squares will need to sum to two times the largest diffrence

@Faust7

hi all

Does this look right? $\sum_{k=0}^\infty k\frac{\rho^ke^{-\rho}}{k!} = \rho$

Yes

Ok thanks

I just found the answer online, I have no clue what it actually means

wait, no

wait, yes*

You can cause the first term is 0

Yeah, indeed.

And then of course the sum is just the power series expansion of $e^\rho$

Its a problem about queuing systems

Any of you familiar with those?

Nope :/

awwww mannnn

Given two points in 2d space, I have to find the size of the largest square that can be drawn centered at those points such that, the squares do not intersect ( they may touch each other but must not intersect )

I have to find the side length of the largest axis parallel squares centered at A and B

Anyone here ?

Hello

Hi

@IccheGuri does this solve your problem?

Well I'm back to MSE. It's been a while.

what will be the output for this input ?

3 6 7 12

@IccheGuri Dude what? Are those meant to be the points (3,6) and (7,12)?

Yes

Nvm misunderstood the question. It ought to be 6

Have you read my problem ?

What is the reason for 6 ?

Yes the ans is 6 but how ?

@TimTheEnchanter

I'm typing, please wait

ok

The vertical separation is greater than the horizontal, so the squares of greatest size will have a common edge parallel to the x-axis ( y = 9 ). From the diagram it should then be clear that the side is $y_2 - y_1 = 6$.

So the ans is Max(abs(x1-x2),abs(y1-y2)).

Is it ?

Yes

@PVAL-inactive mathoverflow.net/questions/54143/…

Maybe you have seen that before though

@Secret Here's an ordinal collapsing function for you:

$$C(\alpha)_0=\{0,1,\omega_1\}\\C(\alpha)_{n+1} =C(\alpha)_n\cup\{\gamma+\delta,\gamma \delta,\gamma^\delta,\chi(\gamma),\psi_\gamma( \eta)|\gamma,\delta,\eta\in C(\alpha)_n \land\eta<\alpha\}\\\psi_\beta(\alpha) =\sup\{\max\{\gamma_n| \gamma_n\in C(\alpha)_n\land \gamma_n<\chi(\beta)\} |n\in\mathbb N\}$$

$$D(\alpha)_0=\{0,1,\omega_1\}\\ D(\alpha)_{n+1}=D(\alpha)_n \cup\{\gamma+\delta,\gamma\delta, \gamma^\delta,\omega_{1+\gamma}^{CK}, \psi_\eta(\gamma),\chi(\eta)|\gamma,\delta,\eta\in D(\alpha)_n\land\eta<\alpha\} \\\chi(\alpha)=\sup\{\max\{\gamma_n| \gamma_n\in D(\alpha)_n\land \gamma_n<\omega_1\}|n\in\mathbb N\}$$

@SimplyBeautifulArt OMG we are going beyond Church Kleene now? I thought that barrier was insurmountable since everything after that is incomputable (except for those uncoutable ordinals that corresponds to cardinals, which we still have a recursive map for them

@Secret Wdym?

The ordinal collapsing functions are designed to take uncomputable ordinals and map them to computable ordinals

The notation itself must be recursive, but it should be able to handle any ordinal

Looks like there are going to be more interesting fixed points to see from uncomputable ordinals. Cannot wait to get back to it after I finish this dreaded writeup

Writing is always painful

Any ordinal that doesn't directly influence the notation gets collapsed into the greatest ordinal below it that is within the notation