#serious-discussion

1 messages · Page 490 of 1

neat lintel
#

none of this talks about curvature

#

but if you use imagination, one of the examples she gives can help you think of whats going on

#

I see

#

like

#

you know how earth is round

#

Yeah

#

and thats not completely obvious from when you are born

#

Correct

#

this is only the case because you are so small compared to earth

#

so you cant really see the obvious curve that exists when you zoom out

#

And this is analogous to the universe in general and our observations about it?

#

kinda

#

but we can do math

#

to see what curvature looks like locally

#

and estimate what that means about global curvature

#

creatures like ants (if they were intilligent) would have no chance of verifying these things.

#

because of how small they are in comparison to the earth

mortal igloo
#

One way you can detect curvature is to parallel transport a vector around a large loop (or around a loop many times)

neat lintel
#

also because their vision is shit

mortal igloo
#

If the resulting vector is rotated compared to the original vector, your space is curved

#

One day I hope to parallel transport myself around a room without changing my facing direction many times until my facing direction changes

neat lintel
#

So they(ants) say this hill is kinda steep and conclude a vague idea how the planet actually is?

mortal igloo
#

Intuitively this shouldn't work but the math says it will...

neat lintel
#

ill give you honest opinion

#

idk why anyone gives a shit

#

It's math for the sake of math I guess

#

And physicists with way too much free time

#

what

mortal igloo
#

Are you lampooning theoretical physics

neat lintel
#

bro

#

the curvature of the earth is not calculated 'for fun'

#

Mr. Icy001

#

whats last cool NT thing you learned

neat lintel
#

not earth

#

even so

coarse grotto
neat lintel
#

it has no forseeable practicality

#

you are coping otherwise

mortal igloo
neat lintel
#

is arthur packets a type of food

mortal igloo
#

If you define food correctly, yes

neat lintel
#

langlands 😵‍💫

mortal igloo
#

Did you google it? lol

neat lintel
#

yeah

#

Modern Gps systems rely on relativity theories for their accuracy (lagtime due to speeds), and the idea that mass curves space time is applicable in how light bends around stars so that their postion is altered, and we have observed altered positions of stars that would not be predicted by newton's laws of gravitations otherwise

#

It is viewable on a cosmic scale

#

honestly langlands program sounds like one of those things i would like if i had enough background

mortal igloo
#

I'm under the impression no one in the world would say they have enough background on Langlands currently

neat lintel
#

the purpose sounds cool, but idk if it is as cool as it seems

#

how do people even get into that

#

i am still a silly undergrad and im naive about who knows what

#

how many advisors are doing langlands

mortal igloo
#

linear algebra -> commutative algebra -> algebraic geometry + representation theory -> graduate school -> pick an advisor working on Langlands, probably

#

Or read a lot

neat lintel
#

oh shit!

#

im in the pipeline

#

barely in step 2: commutative alg

mortal igloo
#

but expository material on Langlands is extremely unfriendly

neat lintel
#

reading sucks sometimes ngl

#

feels lonely

#

and i am already lonely enough irl

mortal igloo
#

Are you lonely right now?

neat lintel
#

anyways

mortal igloo
#

Trick question

neat lintel
#

is your advisor working on langlands

mortal igloo
#

An off-shoot of it, I'd say

neat lintel
#

what in the sam harris

mortal igloo
#

what's up with Sam Harris nowadays

neat lintel
#

idk

#

just sounds like a funny name

#

i want to learn more about number theory connections to other fields

mortal igloo
#

I feel the sudden urge to calculate how many times I need to walk around my room to feel the curvature of the Earth

neat lintel
#

i dont have enough examples though

mortal igloo
#

Basically the principle is this

#

If you start at the north pole, go all the way to the equator, then go a quarter circle around the equator, then go back to the north pole, all while "facing" the same direction, your rotation is 90 degrees off from where you started

#

This means that parallel transport around a loop with the area of 1/8 of the Earth's surface area causes a 90 degree vector rotation

#

On a surface with constant curvature, the amount a vector is rotated when parallel transported around a loop is directly proportional to the area enclosed by the loop

#

Ok so 1/8 of the surface area of the earth is 24.6 million square miles

#

divide that by the area of my room which is on the order of 500 square feet

#

1.4 x 10^12 😔

#

So a vector parallel transported around my room will be rotated by like 0.00000000009 degrees

#

will need to repeat that 11 billion times to rotate it by 1 degree

velvet dagger
#

Did someone say Langlands

neat lintel
bronze pelican
#

lan glands

mortal igloo
#

So basically for all intents and purposes the section of Earth covered by my room is flat

neat lintel
mortal igloo
#

🕵️

neat lintel
#

how do you spell that word

#

percievable

#

persevable

#

precievable

mortal igloo
#

pregananant

neat lintel
#

perceivable

velvet dagger
#

@mortal igloo I didn't realize you were near the langlands program

neat lintel
#

cant spell perceivable without a perc 30

velvet dagger
#

What kinda stuff do you do (or your advisor does if you're not there yet)

mortal igloo
#

hehe

#

My thesis was related to automorphic representations over function fields, and right now I'm trying to fill myself in on the theta correspondence and Shimura variety stuff

velvet dagger
#

Wait are you a postdoc? I thought you were a grad student lol

mortal igloo
#

Yep

narrow rock
#

langlands stare

velvet dagger
#

But yeah that's good stuff. Covers 2 of the 4 research projects in AWS this semester

mortal igloo
#

You may have heard of my adventure this semester which is teaching Calc II students for the first time

neat lintel
#

amazon web services

velvet dagger
#

Lmao

mortal igloo
#

Are you going to AWS?

velvet dagger
#

I applied yeah

neat lintel
#

oh wtf

#

arizona winter sem

mortal igloo
#

We might see each other then!

neat lintel
#

right?

velvet dagger
#

That'd be pretty dope! I'm looking especially at the project about quaternionic modular forms

mortal igloo
#

I was invited as one of the assistants but I'm not sure if they are following up

velvet dagger
#

Or possibly the one about constructing vector-valued automorphic forms from scalar-valued ones

#

Tbh I haven't thought enough about anything beyond GL2 to really get the point of the second project

mortal igloo
#

That sounds like theta correspondence

neat lintel
velvet dagger
#

Yup that Mahael

neat lintel
#

lol

#

i think i applied to this

#

or some version of it

velvet dagger
#

Basically I'm thinking Pollack, followed by just doing rep theory psets at night, followed by Eischen's project

#

Gan's stuff was a bit scary and I've never really thought about function fields

mortal igloo
#

Is rep theory psets part of this AWS?

narrow rock
#

I should apply next year catThin4K

#

the projects look pretty cool

velvet dagger
#

Yeah basically the way it seems to work is, there are lectures and associated projects. You can either sign up to do the projects, you can sign up to be in study groups which review the lecture content in the evenings, or you can sign up for "problem sessions" which just do a bunch of psets in the evenings

pure sun
#

thats about right, yeah

narrow rock
#

is it online this year

pure sun
#

but for the projects it's not really a sign up

#

it's more of an application

velvet dagger
#

There were 2 problem sessions, one was on "Rep theoretic aspects of automorphic forms" and the other is "Geometric aspects of automorphic forms"

mortal igloo
#

Oh so you were saying your top 3 choices for what to do basically?

pure sun
#

you can sign up for the problem sessions and the study groups but you typically have to apply for the project groups

#

also in my experience nobody really monitored the attendance at the problem sessions and study groups and so you could basically move between them freely

velvet dagger
#

So yeah I put Pollack's project as my top choice, second choice is rep theory problem session, third was Eischen's project

mortal igloo
#

nice

pure sun
#

good luck

#

AWS is fun

velvet dagger
#

Was considering geometric problem session since I don't really get what's happening in Eischen's project but when talking to my advisor, we weren't really sure if geometric means AG or hyperbolic geometry

#

And when he went over Eischen's thing he was like yeah this could be cool I'd go with this over the geometry problem session

velvet dagger
mortal igloo
#

I can't find information on the geometric problem session

velvet dagger
#

Yeah they don't seem to have it anywhere

neat lintel
#

random question

#

why do deserts have sand wave patterns?

#

they don't

clever knot
neat lintel
#

yeah

#

i know sand movement is caused by wind mostly

#

but why is this always so orderly

clever knot
#

A dune is a landform composed of wind- or water-driven sand. It typically takes the form of a mound, ridge, or hill. An area with dunes is called a dune system or a dune complex. A large dune complex is called a dune field, while broad, flat regions covered with wind-swept sand or dunes with little or no vegetation are called ergs or sand seas....

#

i assume the large wind gusts pick up a large line of sand and throw it up slightly over

neat lintel
#

shit is cool ngl

jolly token
#

Does anyone of you have any experience self teaching himself relatively "advance topics"(linear algebra I&II, optimization, group theory, etc) in mathematics as a high school student? What would recommend to your back then self after having gained experience later on your career? What are some interesting topics to study?
Thank you in advance!

honest veldt
#

i don't think i qualify here

brave hollow
honest veldt
#

study groups bleak

brave hollow
#

group theory sotrue its in the name

honest veldt
#

maybe one day I'll meet someone who knows what algebra is, that'd be a day

fair mural
#

to be fair, when i feel like it is quite often lol

light needle
fair mural
#

wait i don’t think i really answered your question now that i think about it

light needle
#

But also when i think about it, maybe getting bogged down in the details is important when ur new to math and the topics

icy forge
fair mural
#

oof

honest veldt
#

In any case, I found starting with linear algebra to be really helpful, it was a nice transition from computational stuff like calculus to the more abstract side of maths (I did abstract linear algebra, not the one that mostly focuses on R^n and C^n and stuff)

light needle
#

Oh yeah also that do LA with rigor

#

Rather than with like mitocw

#

Or w/e

honest veldt
#

Yeah, it was real nice

#

I used Axler's Linear Algebra Done Right, but there might be better books out there

#

Ask around

light needle
#

Like i was around 15 when i did LA but like, mostly computationally, definately wish i did it rigorously it would open up more math for me

ancient flame
#

15???? damnnnn

rotund steppe
solemn sequoia
#

When did RIT start offering a PhD in Mathematical Modeling?!

#

First I've heard of a program specific to modeling.

sharp mulch
#

Suspicious

coarse grotto
#

RIT attempted to guilt trip me for not applying

sharp mulch
#

I mean I looked at the website and it isn't like a scam I guess

#

I'm a bit concerned about the coursework requirements though

#

Do they not have any pure math? It looks like their department is entirely applied math

coarse grotto
#

yeah, and it looks like their only math phd option is the mathematical modeling program

frozen venture
#

Is there a way to define the limit of a sequence of groups?

sharp mulch
#

What ambient space are you working in

unborn trellis
#

that's a loaded question

mortal igloo
#

There’s category theoretical limits

unborn trellis
#

depends on whether you ask an algebraist or analyst

mortal igloo
#

Inductive and projective limits

sharp mulch
#

You can consider all the groups as just sets and take the intersection of all of them

frozen venture
#

My thinking was that we would first need to define a metric on this set of groups.

sharp mulch
#

Do they though

frozen venture
#

Intuitively yeah

sharp mulch
#

D_n is generally not abelian whereas the circle group is

#

I'd believe it if you said that Z_n approached the circle group as n->infinity

frozen venture
#

Hmm, I think I used the wrong terminology sorry

mortal igloo
#

The corresponding thing for dihedral groups should be O(2)

frozen venture
#

I mean the group of reflections and rotations of circle

sharp mulch
#

Ok the orthogonal group

frozen venture
#

Yeah

#

So how would you define limits in this setting in order to capture this intuition?

sharp mulch
#

Well you'll need to be careful because you want D_n to approach O(2) and not the infinite dihedral group

#

But I think I would argue that a n-gon approaches a circle as n goes to infinity

frozen venture
#

Wouldn't you need to define a metric on this set of groups?

pure sun
#

there are more general notions of "limits" than just metric spaces

#

for example, you can talk about direct limits of directed sets of groups

#

though you need to be careful about how you would apply that in this case

mortal igloo
#

If for each $n\mid N$ you embed $D_n$ into $D_N$ and take the inductive limit, I believe you will get the subgroup of $O(2)$ consisting of reflections and rational angle rotations

pure sun
#

also as ange wrote, how do you anticipate being able to distinguish the group you're considering from the infinite dihedral group?

fathom swallowBOT
#

Icy001

mortal igloo
#

This is probably the best you can do, and to get all of $O(2)$ you need to take some sort of completion

fathom swallowBOT
#

Icy001

pure sun
#

which to me looks equally well like the "limit" of the dihedral groups

#

(i concur with icy, btw)

bronze pelican
#

Letts gooooo

#

I'm mentoring an undergrad research project next semester

pure sun
#

cool!

#

those are fun

#

what topic?

bronze pelican
#

On something called the Log-Rank conjecture and its connection to incidence geometry

sharp mulch
#

I wonder when I'll hear back about the thing I applied to mentor

neat lintel
#

isnt direct limit most general notion

#

because afaik you just need index set and a partial order

#

directed set*

#

in one word i think its a directed set

#

and a maximal element?

#

or maybe not

#

probably not

pure sun
#

if you take the direct limit of a directed set with a maximal element you will just get the maximal element back

frozen merlin
#

but it's been 3 weeks

#

if you were him, would you appreciate a follow up email or would it just annoy you

bronze pelican
#

Follow up

#

Sometimes people forget

bronze pelican
#

I'm taking a diff geo final oral exam in 1 hour

#

😬

fair mural
#

good luck

mortal igloo
#

Good luck!

somber musk
bronze pelican
#

Ty

neat lintel
#

or does it always exist?

pure sun
#

Depends on the category

#

In a category of modules it will always exist because you can construct it explicitly

#

(Assuming no set theory nonsense gets in the way but i dont think that should really be an issue)

velvet dagger
#

@bronze pelican remember if you have something equal to zero take a derivative, you'll be just fine

#

(Jokes aside good luck fam)

neat lintel
#

cool is cool

bronze pelican
#

Finished the oral exma

#

Bro wtf was that

fair mural
#

did you do good

mortal igloo
#

How hard was it?

bronze pelican
#

It was fine

#

Being on the spot is kind of nerve wracking

mortal igloo
#

I can imagine

narrow rock
#

icy honorable stare

sharp mulch
#

Brofib it's stopped raining so you can go outside now

swift sinew
#

figured id drop back into the server for christmas (eve), hows everyone doing?

fair mural
#

i think i remember you, i’m doing pretty good, what about you?

swift sinew
#

doing well! are finals done for you?

fair mural
#

i’m not actually in college so i’m not doing those lol

swift sinew
#

haha well i hope the holidays are going well, nice to hear from you again

fair mural
#

same to you

ancient flame
#

fuck the holidays

swift sinew
#

nice to see this server hasnt changed

ancient flame
#

LOL

#

dw it's just me

velvet dagger
#

It has now we have another nerd here named justAlex smh

fair mural
#

no meanies allowed

ancient flame
#

beaned

swift sinew
#

mod privileges revoked

#

rip

ancient flame
#

rip

stone valve
#

wait what

rotund steppe
#

Why is real analysis a prerequisite of differential equations

#

i thought it was like right after calc and linear algebra

devout nacelle
# rotund steppe Why is real analysis a prerequisite of differential equations

It depends on the kind of differential equations class you're taking. Cookbook courses that emphasise methods to solve usually only have calculus (and possibly linear algebra) as a prerequisite; more theoretical courses that emphasise the qualitative analysis of equations, existence/uniqueness of solutions, etc. require a first course in real analysis.

coarse grotto
#

yeah, a look at the syllabus will be a better descriptor of the expectations

bright hill
#

What do you guys do when you absolutely have NO IDEA how to solve a problem?

neat lintel
#

ask here

#

in the help channels

bright hill
#

Well, I'm asking but no one is answering

leaden skiff
#

usually there's something you can try

leaden skiff
bright hill
#

For example

#

All of those 3 are monsters on their own

#

But man, the last one

#

All I could do since yesterday was blankly stare at the wall trying to find something to try

leaden skiff
#

ok well i don't really know real analysis, but like if i had to do it i'd ust try playing around with the problems first

#

just make random guesses and see what happens

#

like my first instinct for 6.7 is trying to interleave digits

#

like if one element of R^2 is (0.1111...,0.222...) then the corresponding element in R might be 0.121212...

bright hill
#

Yeah I tried that

#

But there is still a problem with numbers who end in all 0s or all 9s

#

I sort've found a clue for 0.6.8 too but it has a similar caveat

solid yoke
#

if its any help (0,1) is isomorphic to R, so you can show the powerset of N has same cardinality as (0,1)

bright hill
#

Yeah I tried that too

#

I then considered them in binary

#

So for every real number x in (0,1) and start with the empty set; if x has 1 in its 1st digit after decimal add the number 1

#

If it has 1 in its 2nd digit, add the number 2

#

And so on

solid yoke
#

hmm

bright hill
#

But that would map 0.011111111... and 0.1000... to different sets

#

Although they're the same number

solid yoke
#

why dont you try if you have 0.1

#

map it to 1

#

0.01

#

map it to 10

#

and 0.11 = 11

#

so you have an injective function

bright hill
#

But I need a bijective function to determine cardinality

#

I think the shröder-bernstein theorem can help me but I still haven't understood it will enough yet

solid yoke
#

you can use the bernstein theorem

#

show AlessthanorequalB and BlessthanorequalA

#

then AtildaB

bright hill
#

Yeah, yeah

#

I understand that part

river linden
#

If you show A injective to B and vise versa you get A ~ B. so the .99... issue doesn't matter

bright hill
#

But there's an exercise which serves as a proof sketch

river linden
solid yoke
#

I did this question a bit back in set theory

bright hill
#

Anyways

#

My original question was about the last one

#

How do you approach such a problem?

river linden
#

try and list Q st the diag is zeros? then the diag would be rational

#

not sure if Q grows "too fast" for you to do that though

bright hill
#

There are rational which don't have any 0 on them

river linden
#

ah right

bright hill
#

So you won't be listing all rationals like that

river linden
#

then try to get a repeating decimal like x/9 somehow? intuitively it should be possible

#

but maybe it isn't

#

maybe base 2 is easier then bsse 10

bright hill
#

Both of these are things I thought about

river linden
#

idk then, mb look for a contradiction. I gtg

bright hill
#

K then

#

Thanks anyways

wispy dune
# bright hill For example

i think this works: ||We claim that the answer is no. Assume to the contrary, that the diagonal element is rational. Note that incrementing the digits of a rational (the increment of 9 is 0 in this case) still yields a rational. Now incrementing this diagonal element yields us a rational which is not on our list (by similar logic as in the standard diagonalization argument), which is a contradiction with the fact that our list contains every rational||

bright hill
#

I don't want an answer, srypacman

wispy dune
#

if you want a hint ||consider using the diagonalization argument||

jovial ember
#

I feel like you can solve this

deep mango
#

Wowie

#

Good morning!

jovial ember
#

@wispy dune I think you can solve it. ||Take a bijection x_n of N with the rationals in [0,1]. Then consider the specific bijection of N with N^2 where you do the zigzag. Then the diagonal elements are a specific fixed subsequence n_i, so just swap x_n_k in order with the numbers 0.1,0.11,0.111,… this gives you a way to list all of the rationals such that the diagonal elements are 0.1,0.11,0.111,…||

tiny marten
#

Classic zigzag thingy

wispy dune
#

an enumeration of the rationals?

jovial ember
#

Right

#

Or maybe I misinterpreted what the problem meant tbh

#

Idk wtf “the diagonal” meant

#

Maybe you don’t even need to list them in this 2-dimensional way lol

#

Actually

#

I re-read the problem and think I understand what it actually is asking

#

And I no longer think it’s possible

#

Whoops

deep mango
#

Is this "list all the rationals so that the diagonal gives another rational"?

jovial ember
#

Yes

deep mango
#

What if you do 1-it

#

Do you get a different rational from everything on the list

#

Idk

jovial ember
#

I think this is the idea or something

deep mango
#

Lots of edge cases

jovial ember
#

Pappa’s solution was to add 1 to every digit

deep mango
#

I see

#

I guess rational means it repeats so its ok

jovial ember
#

I mean

#

You don’t even need that

#

You make 9 roll over to a 0

#

Without carrying a 1

toxic schooner
jovial ember
#

So if you can represent any number as an infinite sequence you can just add 1 to each thing

toxic schooner
#

not really? it can probably mean terminating or non terminating repeating

toxic schooner
jovial ember
#

Or maybe there is an issue idk

somber musk
#

I'm seeing this 4th time today

scarlet lichen
#

same

neat lintel
#

why wasn't it "as" from the beginning?

fair mural
#

that’s what i said before

ancient flame
#

why aren't you "as" smart as me???

distant mason
sick kite
#

This is the 5th time I've seen this today

bronze pelican
main monolith
jovial ember
#

Guys wish RYC a happy birthday!

narrow rock
#

Happhtithdy dryc

primal crater
#

Happy Birthday @ryc

agile wedge
#

Happy Birthday Ryc ! catThumbsUp

deep mango
ancient flame
#

happy bday rychalkboard

bronze pelican
#

happy ryc day

toxic schooner
agile wedge
#

Who cares about that

#

Just say Happy Birthday and stop asking questions

devout nacelle
#

My birthday's tomorrow 🥳

stone valve
#

happy birthday

#

future u

#

😄

devout nacelle
stone valve
fringe needle
#

Bappy hday ryc

toxic schooner
#

Happy bday ryc!

toxic schooner
spring wyvern
fathom swallowBOT
#

just sаm

devout nacelle
#

Thanks

toxic schooner
#

i kinda get it but also dont, really dont understand mod notation pensivebread

primal crater
dry pasture
#

Help

toxic schooner
#

whats there to stare at catThin4K

neat lintel
#

everything 😳

deep mango
toxic schooner
somber musk
ashen bison
#

That’s the first time I’ve seen HCF used lol

woven grotto
#

Hello. What do you think is the best approach to solve such a task:
You need to invent some integral equivalent of sum of some function.
In other words you need somehow map discrete space to continuous one. I know that gamma function doing something familiar, but not exactly what I need to do.

#

I just need a hint in which direction to move. This is not kinda math "help to solve" question so I asked it here instead of help

#

or do I need to ask it in advance chat...

sick burrow
#

Here is fine

#

Not quite sure what the question is though

honest veldt
#

So you need the integral and the sum to produce equal results when given equal inputs?

woven grotto
#

yes

#

but integral would produce results in between as well

honest veldt
#

I see

woven grotto
#

And it must work for any function(in theory)

honest veldt
#

Now I'm lost again

woven grotto
#

I am managed to make it work for several polynomials but it is not following some pattern that I could detect

honest veldt
#

So you're trying to invent some new type of integral, rather than look for some function where this holds

woven grotto
#

Not new exactly. Just some modification that will do the trick

honest veldt
#

I get it

woven grotto
#

@honest veldt
I am managed to get the same results again with x^2 function. Still it is not working with all functions, but maybe this will help you.

woven grotto
crystal stream
#

are you trying to get integral representations of sums?

modern oasis
#

I found this paradox very interesting
https://www.youtube.com/watch?v=Uj3_KqkI9Zo

Sign up for our newsletter and never miss an animation: http://bit.ly/TEDEdNewsletter

View full lesson: http://ed.ted.com/lessons/the-infinite-hotel-paradox-jeff-dekofsky

Want more? Try to solve the buried treasure riddle: https://www.youtube.com/watch?v=tCeklW2e6_E

The Infinite Hotel, a thought experiment created by German mathematician Davi...

▶ Play video
#

the lesson is

#

dont play with infinity

deep mango
#

Im having trouble understanding what the paradox is

#

Or

#

What's paradoxical about it

coarse grotto
#

Ah yes, the TED-ed version of Hilbert’s Hotel, idk why they put paradox next to it
maybe to get more views bc paradoxes are whimsical

sly vale
#

since paradoxes are just "seemingly absurd statements that end up being true upon further inspection"

deep mango
#

well, if i had all the even rooms full, i would have infinitely many rooms full but i could put someone in room 1

#

sly vale
#

To the layman it's a paradox sully

#

Worse "math paradox" is the interesting number paradox

cinder zephyr
#

Nah

#

The worst "math paradox" is anything anyone tries to justify with Godel's stuff

stone valve
#

does anyone know how to makee the DI tabel in latex?

cinder zephyr
#

Like the whole "Math has a gaping hole" or whatever that video is

#

That's annoying

cinder zephyr
stone valve
#

DI table when u integrat by parts

cinder zephyr
#

Oh

#

Any table thing should do

stone valve
cinder zephyr
stone valve
#

something lik this

cinder zephyr
#

This makes life easier lol

stone valve
#

ok

sly vale
sly vale
#

Godel's stuff is perfectly fine

stone valve
cinder zephyr
#

No I know

#

I'm talking like

hushed iron
#

Veritasium's video was fine

cinder zephyr
#

Pop math stuff

hushed iron
#

Except his lies about Kronecker

sly vale
#

That's completely different than "Godel's stuff"

cinder zephyr
#

About how "Math will never be right" or some other shit I see

hushed iron
#

Veritasium didn't claim this

#

You're making things up

cinder zephyr
#

Right but people try to justify those "paradox's" with that video

sly vale
#

Derek presented the history of it

cinder zephyr
#

Veritasium's video is fine

hushed iron
#

The highly redacted history

cinder zephyr
#

People watching it draw the wrong conclusions

#

And that's the part that's annoying

#

I've had people tell me "why do u study math when this is a thing"

#

His video is fine I should have worded it better

sly vale
#

Yeah you should have lol

#

Given you started with a completely different thing

brittle jay
#

Hello,

#

I dont know if this is the right place to post this, but it is math related.

#

This is a question over Fractal Brownian Motion

#

I'm askingg specifically about section 2 of this post

#

It asks about how to reverse the effects of large amounts of Octaves, that is, the flattening that comes from it.

#

If anybody knows anything about how to solve this issue, I would be very thankful.

spring wyvern
young wagon
fading hull
#

You know who else has a gaping hole?

woven grotto
#

Integral itself is a sum, but continues one, and it somehow follows how discrete sum works. If you try to apply integral and discrete sum to the same function you may see they kinda follow each other, and with some manipulations you can force integral to give same exact values as discrete sum do. So I trying to figure out some generalisation of this.

woven grotto
woven grotto
crystal stream
#

there's also another formula from ramanujan

woven grotto
crystal stream
#

This one is nastier and doesn't let you pick bounds for the sum

woven grotto
#

that's a shame that I am still very bad at complex numbers

woven grotto
#

and this is really bad that desmos does not support complex numbers, nor 3d dimension drawing

#

I think I need to find a new tool for math visualisation

#

it's time to learn geogebra

livid gulch
#

Let a, b positive real numbers. Given a rectangle with sides a and b, is there a way to fill it only by using squares not necessarily of the same size?

static loom
#

my guess is yes if they're algebraic, no if they're not

#

and I suppose if they are both transcendental but can have it scaled out to be algebraic as a kind of corner case where the transcendental one technically has a solution

#

idk lol

hushed iron
#

Finitely many squares?

livid gulch
#

Yes

hushed iron
#

I suspect 1xsqrt(2) can't be covered by squares

#

More generally 1xa for a irrational cannot

static loom
#

you can kind of do a euclidean algorithm type reduction to look at equivalence classes of rectangles, for instance if you have a 5x13 rectangle you could make two 5x5 squares and cut them out to get a 5x3 rectangle. Generally speaking we could write the sides as a tuple (a,b) ~ (a,b-na) when b>na for positive integer n

#

additionally you have scaling (a,b) ~ (1, b/a)

#

but we don't have to cut a rectangle up into squares necessarily in this kind of way

#

but there might be a way to show that this is sufficient and other ways of cutting down rectangles doesn't matter

#

like suppose you have a rectangle cut into squares of varying sizes, then you can cut down the squares into a finer mesh of squares where they are all equal size, then on this grid recut it into the algorithm I describe, something like that

fair mural
bronze pelican
#

Filling a rectangle with sides a and b using the greedy algorithm is basically performing the Euclidean algorithms on the pair (a,b) to get the gcd

#

The greedy algorithm is choosing the largest square that will fit in the rectangle

#

And if there's an ambiguity, always choose the square with the largest area that is most bottom and most left

#

The Euclidean algorithm/ greedy algorithm terminates in finitwly many steps when the side lengths are commensurable, that is the side lengths have ratio a/b which is rational

#

As Merosity said, if you have any partition of a rectangle into finitely many squares then you can get a finer partition consisting of equally sized squares, which shows that any such rectangle has side lengths which are commensurable

#

Partitioning a rectangle into squares is very much related to approximating real number by rationals

#

And continued fraction expansion

static loom
#

I only suggested it might be true

#

I don't have a proof for that

bronze pelican
#

Now that I'm thinking about it, I don't know if it's true

static loom
#

yeah, when cutting up a rectangle with irrational side lengths, it's possible that the squares you put with irrational side lengths to fill it up might end up not having some finer mesh of all smaller squares, the same problem with the gcd not terminating

late anchor
#

Hey there. I sort of made up a problem for myself... here it is.

#

The computer makes up a natural number (with no limitations on its value). You can ask it about some number - and the computer will tell you if it's greater than its number, less, or equal

#

How fast can you get to the number made up by the computer?

sharp mulch
#

~log_2N steps I would guess

late anchor
#

I was trying to formalize "fast", and my best attempt so far is
Algorithm A is faster than algorithm B if for the worst case the function describing the growth of the number of iterations for A is at some point always lower than that of B

late anchor
sharp mulch
#

Algorithm speed is using formalized with big O notation

#

And constants on the leading order terms if you're being fancy

late anchor
#

There are faster ways to get the upper bound - e. g. by using towers or by squaring - but searching within lower/upper would still be log

late anchor
wild lantern
#

(Sans multiplicative constant or whatever)

simple raven
late anchor
#

Well, maybe in naive understanding

#

But it's not exactly big O

simple raven
#

But yeah you need some constants usually

wild lantern
#

You probably would have wound up at big O after a while lol.

late anchor
#

The thing is, it's infinite thing

#

Big O is described for finite cases

#

Now the "average" of naturals is not a finite number

#

For any finite number the prob that a random number is greater than that is 1

#

So Big O would be simply infinity

simple raven
#

Well, your computer has a finite amount of memory so you have to bound your random number

late anchor
#

That's why I was trying to formalize

wild lantern
#

What do you mean by "finite/infinite things" here?

sharp mulch
#

It doesn't matter that the numbers can be large

#

We're considering how the number of steps grows as the number grows

late anchor
#

The computer can make up any natural number and it's key in this problem

static loom
#

interesting thing to consider is there's no uniform probability distribution you can put on the natural numbers

#

and so your algorithm will depend on this choice

late anchor
#

You can think of a non-uniform one 😉

#

E. g. round of a sigmoid

wild lantern
#

Can't you compute big O of any function T from N to R?

static loom
#

the best strategy is to chop it so that you get the most information content

#

for the probability distribution there's a number that you can look at which is at the halfway point

simple raven
#

Well, if your random number is N you can find an algorithm which find the number in O(log N) steps, so we could quantify a solution to the problem with this

#

In algorithm analysis we always think like this, quantify the number of steps depending of the size of the entry, and the entry can be as big as we want

late anchor
static loom
#

I don't think big O is appropriate for this because this hypothetical computer has infinite memory

wild lantern
#

Well I don't know. I'm just asking because I don't fully understand your problem and it sounds interesting lol.

static loom
#

but instead of doing binary search on numbers, you're doing binary search based on the sets which split the probabilities

simple raven
#

Yes, but he choose a finite number

simple raven
#

So we need to analyse how we find the number according to the size of the number

late anchor
#

To the value of the number itself actually*

#

it's a matter of log10, but still 😛

static loom
#

for instance, there's a 51% chance the number is less than 192932 and a 49% the number is greater than or equal to 192932

late anchor
static loom
#

you get approximately one bit of information asking this

#

there is

#

because of what I said earlier

#

there's no uniform probability distribution on the naturals

#

so you must be picking from a non uniform distribution

wild lantern
#

The amount of steps for the given number n will at least always be bounded above by f(x)=x right?

static loom
#

this has a median

late anchor
#

Can we even talk about distribution at this point?

#

If we, say, play this game once

static loom
#

at a finite number

late anchor
#

And actually distribution won't help you

#

We aren't talking about average case, but about worst one

wild lantern
#

Since you can simply ask whether the number is greater or less than 0 and iterate one at a time in whichever direction til you reach it?

late anchor
#

For average case I agree you'd need to know how the computer makes up that number - but we don't know its rules, and our algorithm should be optimal for the worst case

simple raven
wild lantern
#

I see thonk

late anchor
#

You still can do worse if you want 😛

#

But yeah, that's the naive impl

wild lantern
#

Do it over NU{omega} and do a "normal" binary search that way kekw

late anchor
#

Finding a and 2a such that a < x < 2a and then do bin search between a and 2a would be the second "baseline"

simple raven
# late anchor But yeah, that's the naive impl

That's O(N)
We can do O(log N) by comparing with 2^k as k grows, and then find it in [2^k, 2^{k+1}] by dividing by 2 the size of the intervals at each step
You get 2.O(log N)=O(log N) !

wild lantern
#

Interesting thonk

late anchor
#

That's exactly what I described in my previous message 😉

late anchor
#

I wonder if there's a better algorithm

simple raven
#

Are you sure that's the same to look at 2k vs 2^k ?

late anchor
#

Or how we can prove that there's no

late anchor
#

Maybe I wasn't 100% clear, my bad then

sharp mulch
#

You might also want to ask in the CS server linked in network if you don't get a satisfactory answer here

simple raven
#

Oh ok, I thought a was a fixed number 😛

wild lantern
#

Can you do roughly the same trick with a faster growing function than b^x? For ex can you also do the same trick using k!?

late anchor
#

That's what I was thinking of

#

You can use faster growing functions to find the upper bound

#

However then the search between the lower and upper bound becomes harder?

simple raven
simple raven
late anchor
#

I think that searching in a fixed interval can't be faster than log2

#

So if an algo uses lower - upper bound search, then we can probably easily prove that log2 is the answer.
But what if it does not?

#

or am I actually wrong about my assumption?

simple raven
#

Yeah we could imagine an other algorithm which doesn't use bounding the number then searching, then I have no clue

late anchor
#

Yeah, same XD

#

Alright... thanks for the convo, it's after midnight for me already... guess time to sleep

simple raven
#

Like picking random numbers or something

bronze pelican
#

Still thinking about a rectangle whose ratio of side lengths is not rational but can be tiled by squares

#

Does such a rectangle exist?

sly vale
#

I'd think no..?

bronze pelican
#

Proof?

sly vale
#

Cause you'd require one of the side lengths to be irrational

bronze pelican
#

Why?

sly vale
#

How else do you get a/b to be irrational?

bronze pelican
#

Okay , but then why can't it be tiled by square s?

sly vale
#

oh wait

#

yeah it'd be tilable

bronze pelican
#

Example?

sly vale
#

so if I take a rectangle 1 by sqrt(2), I make squares with side lengths of each decimal place of sqrt(2) then just fill in the rest with those squares I'd think?

static loom
#

finitely many squares

sly vale
#

Oh

static loom
#

maybe we can work backwards, start by arbitrarily putting squares together and show that the resulting rectangle has width/length always rational

bronze pelican
#

Yes I forgot to mention the finitely many tiles part

static loom
#

might be doable by an induction argument

sharp mulch
#

Finite sum of rationals is rational

static loom
#

that's not a false statement

bronze pelican
#

Why is this hard? I've been thinking about this for hours opencry

static loom
#

lol they joys of math

sly vale
sharp mulch
dense belfry
sly vale
#

not enough info to answer what 8-4 is

fair mural
#

banned

bronze pelican
#

I gave u one

fair mural
#

stop spewing nonsense

dense belfry
#

show that there is an algorithm that tells you whether a polyonomial in any finite number of variables with rational coefficients has a rational solution, or show that no such algorithm exists

fair mural
dense belfry
#

that's for 1 variable

#

this is hilberts 10th problem for Q

#

grad school or advanced undergrad usually

bronze pelican
#

Rational root test works for all polynomials of 1 variable regardless of degree

#

Thats nice

dense belfry
#

anyway I was just trolling you with an open problem

ancient flame
dense belfry
#

I need to assign grades to my students today but a lot of them are actually going to fail

fair mural
#

liquid is a teacher?

dense belfry
#

yeah I teach

fair mural
#

lol

dense belfry
#

and now I have to give a bunch of F's out

#

😢

fair mural
#

what’s the class on

#

liquid is getting bombarded by questions

dense belfry
#

I taught 2 college classes, college algebra and basic probability and stats

static loom
#

I used to have trouble with remembering how the rational root test went until I learned newton polygons lol

fair mural
#

ok i’ve seen that a few times, what in the world is college algebra

static loom
#

but then I came up with a stupider trick that I should have learned a long time ago after that

dense belfry
#

its algebra for college students

static loom
#

just look at ax+b=0 and see that x=-b/a so you just think "oh yeah leading coeff divisors in denom, etc etc)

tall badge
#

they all joined at the same time. its a raid

fair mural
#

i was a bit suspicious of that at first

#

but nothing seemed wrong so i ignored it

#

it was quite weird that 3 new people came in chat all at the same time

static loom
#

lol

ancient flame
#

college algebra is like algebra 2 / precalc

dense belfry
#

no it's not

#

it is like algebra 1

fair mural
ancient flame
#

idk

bronze pelican
#

If you take the multiplicative inverse of sqrt2 and double it, you get sqrt2 back again

sharp mulch
#

Right

#

2*1/sqrt(2)=sqrt(2)

bronze pelican
#

Sqrt2 is a fixed point of x\mapsto 2/x

sharp mulch
#

Right

#

sqrt(3) is a fixed point of x -> 3/x

static loom
#

here's an approach I'm thinking about, but is sort of only looking at a special case when all the real numbers that appear are algebraic.

#

take all the squares that appear and index them by their side lengths, then wlog we can say the width of the rectangle is 1 and the height is some real number r

#

the sides are $s_i$ and now take two straight lines horizontal and vertical, then it cuts thorugh some squares of some side length some number of times, that gets us two equations

fathom swallowBOT
#

Merosity

static loom
#

the $f_i$ and $g_i$ are non negative integers $$1=\sum_{i=1}^n f_i s_i$$ $$r = \sum_{i=1}^n g_i s_i$$

fathom swallowBOT
#

Merosity

static loom
#

now we look at some automorphism of Q(r) that doesn't fix r and apply it

#

$$1=\sum_{i=1}^n f_i \sigma(s_i)$$ $$\sigma(r)=\sum_{i=1}^n g_i \sigma(s_i)$$

fathom swallowBOT
#

Merosity

static loom
#

that's as far as I've gotten, seems like it'd be possible to break something this way, maybe take more lines and build up multiple more equations and looka t more automorphisms simultaneously to help that

bronze pelican
#

I'm imagining a horizontal line sweeping up across the rectangle

#

This gives you a sequence of partitions of the width of the rectangle

#

Where the parts are coming from the multiset of sidelengths of squares

static loom
#

yeah exactly, those are the equations I'm referring to

#

might help to think of it as a matrix equation like $$F \begin{bmatrix}s_1 \ s_2 \ \vdots \ s_n \end{bmatrix} = \begin{bmatrix}r \r \ \vdots \r \ 1 \ 1 \\vdots \ 1 \end{bmatrix} $$

fathom swallowBOT
#

Merosity

static loom
#

s_i being all the distinct side lengths that can occur, then the F is the matrix of non negative integers of their frequencies that add up to either the real number r or 1

#

because wlog we can pick one side to be 1 by scaling

#

maybe some kind of matrix rank argument can be made idk

bronze pelican
static loom
#

you could, but I feel like that would be too isolating

#

I don't know, whatever works

#

in particular if we take F and augment with the vector of rs and 1s and do row operations, we still have rational number coefficients, which seems nice

bronze pelican
#

One thing to notice is that if you count the s_i's with multiplicity then the n-tuple (s_i) is a point on the n-sphere of radius r

static loom
#

hmm interesting, I guess the weird thing is n is not a constant now

#

or I guess it can be a constant you just have lots of 0 components

#

wait wait no that doesn't quite work

#

cause even though the lengths match up, the areas won't match up

#

wait I think I misunderstood but I understand now

#

you want $s_1^2+...+s_n^2 = r*1$ so it's radius $\sqrt{r}$ though

fathom swallowBOT
#

Merosity

bronze pelican
#

Oh right

static loom
#

if we glue the ends together to make it a torus, does the problem get easier?

#

suppose a rectangle is tilable iff a torus is with squares, does that open up some kind of elliptic curve memery lmao

#

modularity theorem => ??? => you can tile ur square 😎

dense belfry
#

okay I'm giving out 9 F's for my basic probability and stats class

#

can we get an F in the chat

static loom
#

lol did they deserve it though

dense belfry
#

I mean from the pov of not doing work yeah

static loom
#

good enough for me lol

bronze pelican
#

I thought I was gonna fail complex analysis and then got a B

mortal igloo
#

9 out of how many students?

dense belfry
#

38

#

To be fair they are remedial math students

bronze pelican
#

@static loom if the greedy algorithm terminates in finitely many steps, is it true that the side lengths are commensurable ?

#

Yes I think this is true

static loom
#

yeah pretty sure because the steps are the euclidean algorithm, so you're computing the gcd

#

in particular if we start with one side as a rational number, then we're getting a bunch of equations that relate things together through more integers and rational numbers with a finite number of operations

#

kinda like I wrote earlier if we use (a,b) to be a symbol that is 1 if there is a solution and -1 if there is no solution, then we have a handful of properties like (a,b)=(b,a), (a,b)=(1,b/a), and especially: (a,b)=(a,b-na) for integer n such that b>=an which is part of our algorithm that should boil down in finitely many steps

#

finitely many steps means eventually we end up with (1,1) (up to scaling) for a square

#

so we can walk back up the finitely many subtractions we did to show a,b are also rational multiples of some real number, kind of like we do usually with the euclidean algorithm when getting solutions to bezout's eqn

bronze pelican
#

👍

main monolith
#

Question, is it true that as the collatz conjecture starting numbers get larger, generally speaking (not strictly, but generally), the sequence steps to hit 4, 2, 1 also increase?

#

I've done a bit of playing on a calculator and while there are many exceptions, it seems fairly true.

cinder zephyr
#

I think it must but not in a meaningful way

vast surge
#

I mean, it's trivial to find a starting point of arbitrary length n to reach the 4,2,1 part in a Collatz conjecture sequence.

cinder zephyr
#

and also there is no general trend

vast surge
#

Just do 2^n and you get n steps

#

I don't know if that quite answers your question, but at least to an extent, it's really just "when numbers are bigger you need to divide by 2 more to get to 4", or if you want something fancier-sounding, the logarithm is an increasing function.

#

If the number of steps required tended to require significantly more than k*log(n) steps to reach 4,2,1 for appropriate choice of constant k that would be notable, but I've never heard about anything like that.

#

That said I don't even know how you would define that rigorously, the collatz algorithm behaves very chaotically.

bronze pelican
dense belfry
#

That's a nice proof

dense belfry
#

Tbh this problem did make me think of the Dehn invariant talk I went to a while ago

spring wyvern
gentle bay
#

He keeps doing that.

bronze pelican
#

He's a mere curiosity

gentle bay
#

Mhm?

spring wyvern
bronze pelican
#

whyare you asking me

spring wyvern
#

bc it was in his status and i forgot it and (i think you can still see his status)

bronze pelican
#

not my issue

bronze pelican
tiny marten
#

Squared squares

#

Interesting

bronze pelican
#

Its really interesting to me that this simple condition of being tilable by squares forces rationality

tiny marten
#

Aww I lost my blue name!

#

Not enough chatting I guess

bronze pelican
#

I wonder if similar rationality results hold in higher dimensions

#

Like say you have a rectangular prism. And suppose you are able to partition the prism into finitely many cubes. Can you conclude a rationality result, such as tha ratio of the sidelengths of the prism are rational

#

LolDongs if you missed it, yesterday we were talking about rectangles being partitioned into finitely many squares

#

And how that forces the ratio of the sidelengths of the rectangle to be rational

tiny marten
#

Oh really?

#

That's weird I wouldnt just immediately think something like that is true

#

Or I guess it makes sense now that I think about it actually

#

Yeah because they are squares it actually makes sense

rotund steppe
#

thank god my calc final was curved happy

#

I barely knew how to apply uniform convergence LMFAO

deep mango
ancient flame
#

wouldn't that be an analysis class

#

or an analysis-based calc class

#

idk

neat lintel
rotund steppe
#

No idea o.O it was based on how well you did relative to the class

#

based on your standard deviation or w/e

analog salmon
#

is it true that a monotonically increasing function and a monotonically decreasing function intersect at most once 🤔

bronze pelican
#

I have a question. Say you are given a partition of a rectangle into finitely many squares. We know that the side lengths of the rectangle must have ratio which is a rational number. Can we conclude that the sidelengths of each of the squares are commensurable with the side lengths of the rectangle?

peak tide
#

If you don't mean strictly monotone, then f=g=0 is a simple counterexample.

real sigil
#

is it true that when combining ceil and floor function symbols you get the rounding symbol

#

?

bronze pelican
bronze pelican
#

Now we've learned that given any tiling of a rectangle by finitley many squares, we can always scale the whole configuration such that all the side length of every square is a natural number.

humble storm
#

Fuck you guys

sharp mulch
#

?

sly vale
#

You too 🥰

real sigil
#

xDDDD

mystic mountain
#

rude

fair mural
#

my feelings are hurt

real sigil
wild lantern
fair mural
#

hi doot

wild lantern
#

Hello quantum

bright hill
fair mural
#

@bright hill you remember how you somehow found that one anime yesterday right

bright hill
#

Yeah?

fair mural
#

can you do the same to this

#

i’m sure you just reverse image searched it

sly vale
#

Yeah, that's from One Piece

fair mural
#

but just in case

#

oh nice

#

thanks

sly vale
#

oh I was right??

bright hill
fair mural
#

don’t know

sly vale
#

I just guessed a random anime

fair mural
#

mosh mean

bright hill
#

Lol

#

One piece has waaay different art style

sly vale
#

all weebs for me

bright hill
fair mural
#

we have done it

#

thanks

bright hill
#

It's nothing

fair mural
#

huh

bright hill
#

What?

bright hill
fair mural
#

oh lol

bright hill
#

And between the alternative images it gives you look for any keywords

rotund steppe
#

weebs catAngery

fair mural
#

anime pfp

#

and username is neko

stone valve
#

the irony

fair mural
#

when you respond to someone almost instantly but they don’t respond to you at all sad

spring wyvern
#

hi
anybody know merosity's monero address?

frigid lark
#

new member. First some hours already saying "fuck you".

#

🤔I cant tell if its someone who was banned previously here, but why not only allowing phone verified users.

#

omg quantum has new avatar.

fair mural
#

that happens often

#

me getting nitro has kinda ruined it though

fair mural
#

once again i instantly respond sad

rotund steppe
#

i was reading a book sad

mint patio
#

Do y’all see any reason why a MVC class would be a prerequisite for single variable real analysis

toxic schooner
#

wait MVC is a pre req for analysis?

mint patio
#

Because I’ve given up on self studying

toxic schooner
#

Oh class?

mint patio
#

I am so bad at it

toxic schooner
#

i dont see any apparent reason

fair mural
#

as someone that knows nothing about analysis

#

i don’t see a reason for it

mint patio
toxic schooner
#

as someone who knows 3 chapters worth of an analysis text

#

i see no reason either

mint patio
#

Right

#

Cause like

#

Ok so my school has an “advanced” MVC class

toxic schooner
mint patio
#

The standard MVC here is pretty dogshit to be honest

#

Like it’s just a typical sophomore plug chug calc class

toxic schooner
mint patio
#

The “advanced” one is a lot more interesting and abstract, a lot deeper connection to linear algebra

toxic schooner
#

ah so like plugging given stuff into formulae and all that?

mint patio
#

And I want to take it

mint patio
#

You took a standard gened calc 1, 2 class right

#

It’s just like that but multivariable

#

Idk how else to describe it

toxic schooner
#

Understood

mint patio
#

Yeah exactly

#

So this one’s a lot more interesting

#

And I want to take it this summer

#

But the thing is it’s a prereq for the single variable real analysis 1 class

toxic schooner
mint patio
#

but I’m so excited for that and I don’t want to wait till next fucking fall to take it

fair mural
#

weird

toxic schooner
#

that doesnt seem to make much sense

mint patio
#

I agree

#

Maybe it’s just bc the class is hard

toxic schooner
#

do they use apostol?

mint patio
#

It’s a weedout class I guess

#

The analysis class does not

#

It uses some random text I’ve never heard of

toxic schooner
mint patio
#

But idrc I have people here to explain and I am good at learning on my own

#

Just not good at discipline

toxic schooner
#

coz like, apostol does do both single and multi variable analysis

mint patio
#

Which is why I can’t self study

#

Yup so does this one

toxic schooner
#

a little less of the latter, but yeah

mint patio
#

The follow up class Analysis 2 does multivariable analysis

mint patio
#

And with an intro to Fourier series and some other cool stuff

mint patio
#

Also covers basic stuff on measures which also interests me but I don’t think we get to any Lebesgue integration

#

Anyways irrelevant

#

My question was

#

if I like just emailed one of the two profs for it

#

and asked why

#

would they mind

#

or ask why and say would u waive it for me or let me do it as a corequisite this summer

#

so I can take both at once

toxic schooner
#

That probably depends on who the profs are/what they are like

mint patio
#

I know one of them, I had him for my intro analysis class and he was chill

#

He’s like a 30-40 year old Indian teenager fuckboy

#

but in an adult’s body

#

He looks like a surfer

mint patio
#

He’s cool

toxic schooner
#

amazing description lmao

mint patio
#

The other professor is his best friend and all I know about her is she’s Russian

#

They teach like half of the upper division undergrad math classes

#

💀

toxic schooner
#

so yeah try asking him ig,
most probably wont mind

mint patio
#

Yuhhh if I remember maybe I’ll shoot my shot

#

But uh we’re in winter break now so they probably won’t respond for a while yeah?

#

sadge

toxic schooner
mint patio
#

I’m going to go read through the syllabi just to hype myself up

#

can I dm sammy

toxic schooner
#

sure

mint patio
#

how it started

#

how it’s going

toxic schooner
#

lmaoo

coarse grotto
fair mural
gentle bay
bright hill
#

I found the answer to 0.6.9

#

And it only took 5 days

fair mural
#

i would have given up after 5 minutes

#

that’s not a joke either

gentle bay
gentle bay
bright hill
#

Then how would you know you understood the material?

#

If you don't do the exercises?

gentle bay
#

Skip it or directly see the solution.

fair mural
#

obviously i do the exercises

#

i’m just saying i probably wouldn’t spend a week on a single problem

gentle bay
bright hill
#

I just have 2 or 3 that I juggle around until I solve them

fair mural
gentle bay
#

It would be the biggest achievement in life if I spent that much time in a prolem.