« first day (2255 days earlier)      last day (3061 days later) » 
00:00 - 21:0021:00 - 00:00

00:20
@sirC isn't that the same thing
Discovered as in you find an ancient stone tablet and uncover its secrets through an alien translation device? @sirC
00:44
I have this homework problem:

Is there an integer x such that 2016x − 1 is divisible by 46466401? Find it, or prove that none exists.

I'm not sure what to do, I have thought about proving by x=even/odd but it doesnt matter because 2016x - 1 will always be odd
oh wait I read that backwards lol
I kinda cheated but I programmed a script and 2016 * 23048 - 1 = 4644767, and 2016 * 23048 - 1 = 46466783
That should count as a "proof" i think
@KeithYong Clever
What class is this
Network Security, we're learning cryptography math atm
01:18
I think I need to sleep lol.
01:51
@KeithYong: Have you learned about the Euclidean algorithm? You're asking if you can write $1=2016x+46466401y$.
 
2 hours later…
03:37
Hey @TedShifrin here ?
would anyone like to discuss some presentation theory ?
04:00
@SamuelYusim here ?
user228700
Hi :-) Can anybody help me with a bit of a homework-tsy question? I've been asked to find the range of a rational expression $y=(x+2)/(2x^2+3x+6)$. I multiplied both sides if this expression by $2x^2+3x+6$ to obtain a quadratic equation in x: $2yx^2+(3y-1)x+6y-2=0$
user228700
Since it's given that $x$ is real, this equation must have real roots. For the case in which $y≠0$, the discriminant, $D≥0$ Upon solving this, I find that $x$ lies in the range $[-13/3, 1/3]$-{0}
user228700
For the case that $y=0$, the equation becomes $x=-2$, which is possible, since $x$ is real.
user228700
So, is the total range of $x$ given by $[-13/3, 1/3]$-{0}+{-2}?
user228700
Please help if possible...
07:41
Hi @iwriteonbananas, @Danu
Hi @BalarkaSen
08:03
@BalarkaSen What's up dude
@iwriteonbananas Killing time
what about ya
Trying to see why the geometric realization functor $sSet\to Top$ preserves cofibrations
should be obvious I think
Do u know about model categories?
nope, not really
08:06
I think you do
Given a category you just say what cofibrations, fibrations and weak equivalences are. Then these have to satisfy some basic axioms
In Top it's exactly what u tihnk it is
weak equivalence as in the analogue of weak homotopy equivalence?
Yeah, iso on $\pi_n$
gotcha
why's equipping my category with such structures the "right" axiomatization of the homotopy category?
oh ok. was just wondering why do we care
08:11
Yeah, I haven't really gotten that far yet
fair enough
What time is it in West Bengal?
like 2 PM
Oh
You're only 4 timezones away from me
what's the time there?
08:14
like 10am
I found this funny:
Given a diagram in Top, there is a spectral sequence computing the cohomology of the homotopy colimit in terms of the cohomology of the ingredients
If your diagram is a pushout diagram, this spectral sequence is basically the mayer-vietoris sequence lol
oh no, so all the years I fought with you about not saying the pushout when doing Mayer-Vietoris (partially because the standard proof doesn't really use the fact that it's a pushout) are all futile
great
cute though.
Ted challenged me to reformulate Guillemin-Pollack's proof of Borsuk-Ulam into the standard cup product (or transfer sequence) proof once upon a long time ago. I thought about it a little and I think I'd be hard-pushed to do that
curious
(yes, that's how I am killing time)
08:26
What's Guillemin-Pollack's proof?
It's an induction proof, using a version of the argument principle ($f : X \to \Bbb R^n$ be a map from an $n$-manifold $X$ with boundary s.t. $f \neq 0$ on $\partial X$. Then the number of roots of $f$ is the degree of $f/|f|$ on $\partial X$ -- either in the oriented or in the mod 2 category)
Cool, I am totally unfamiliar with that proof of B.-U.
You want to approximate an integral with vertical bars. In simplest case you have only two bars. You divide the x-interval in the middle. Say, [0,1] is divided at 0.5. The question, what should I choose for the height of the bar? Should I sample the f(x) in the middle of the bars, i.e. at points .25 and .75?
I ask because it seems natural to me to sample the interval at .33 and .66. But, it seems incompatible with two bar separation.
@iwriteonbananas It's a neat proof.
I can sketch it in the alg-top room if you want.
Yeah, please do
and link me to that room again
09:30
Hello!!
Let $F\subseteq E\subseteq K$ be consecutive field extensions and $f\in F[x]$ be non-constant.
I want to show that if $K$ is the splitting field of $f$ over $F$, then $K$ is the splitting field of $f$ also over $E$.

Since $K$ is the splitting field of $f$ over $F$, we have that $f(x) = c\prod (x-a_i)^{m_i}$, where $m_i$ are non-negative integers and $(x-a_i)\in K[x]$.
Since $F\subseteq E$ we have that $f\in E[x]$. Therefore, $K$ must be also the splitting field of $f$ also over $E$.

Is this correct?
09:59
22
Q: Has anyone ever actually seen this Daniel Biss paper?

nardol5A student asked me about a paper by Daniel Biss (MIT Ph.D. and Illinois state senator) proving that "circles are really just bloated triangles." The only published source I could find was the young adult novel An Abundance of Katherines by John Green, which includes the following sentence: Danie...

So unfortunate :P
TFW you make a huge breakthrough, but all of it collapses based on a basic mistake.
10:42
@MaryStar That is not quite correct.
11:21
If I find the power series solution to an ODE at the point $x_0=0$ in the form $a_0 y_1(x) + a_1y_2(x)$, will the solution to the same ODE at the point $x_0 =1$ be on the form $a_0y_1(x-1)+a_1y_2(x-1)$?
 
2 hours later…
user228700
13:33
@mercio: Hi again :-) I've got a really small doubt along the lines of what we discussed yesterday...
When Huybrechts speaks of the degree of a line bundle on a complex curve, what does he mean?
I can imagine it makes sense if the line bundle arises from a divisor (which, on a curve, can be assigned a degree).
But without a divisor, what is the degree?
user228700
I'm essentially trying to find the conditions for the location of roots of a quadratic equation under different conditions. Eg: I need to find conditions on the coefficients, and $D$ if, say, both roots are greater than some number $p$. If my quadratic equation is $ax^2+bx+c=0$, then is it OK to rewrite this equation as $x^2+(b/a)x+c/a=0$ so that we're always dealing with an upward facing parabola (which may or may not cut the x-axis)? (These conditions vary; am I allowed to do this always?)
14:00
if $a$ is nonzero then $z= 0$ is equivalent to $z/a = 0$ yes
user228700
14:11
@mercio Yes, this I know but by rewriting it this way, I'm making the coefficient of $x^2$ positive and hence, the parabola will be concave. Is this correct?
14:38
@Danu Perhaps he cares about the topology only? Namely, the number a generic topological section represents in the top homology of the curve?
Aka the first Chern class
14:52
@BalarkaSen Wait, whaa
@Danu Hmm?
(i) what is a generic "topological" section?
(ii) how do I get it to represent a number in $H^2$?
@Danu A section which is not necessarily holomorphic, just a continuous map.
@Danu Intersection number with the zero section.
Hmm... Huybrechts has no information about transversality/intersection numbers so I'd be weirded out if he used it in a side remark
15:12
@Danu It agrees with your definition for bundles which do admit a holomorphic section.
But yeah, no idea.
OK, if you say so
Actually, what if the divisor is not effective @BalarkaSen
I guess then I don't get a holomorphic section anyways
Right.
OK, I can live with this :P
Excellent, me too.
Now, when H. writes $H^1(X,\Bbb Z)\otimes_{\Bbb Z}\Bbb R)\otimes_{\Bbb R}\Bbb C$, does he mean tensor products as modules over given ring?
What kind of a $\Bbb Z$-module is $\Bbb R$?
15:18
Abelian group.
Just define action of Z on R by n * a = a + a + .. + a
Oh yeah, that was it, $\Bbb Z$-modules are abelian groups
but mostly what I was thinking about
what is its dimension?
infinite?
Yeah, okay, and that's okay, I guess?
Why not?
I dunno, infinite-dimensional things are scary
15:22
$H^1(X, \Bbb Z) \otimes_{\Bbb Z} \Bbb R$ should be finite dimensional as an $\Bbb R$-module however, so that shouldn't be much of a problem (don't forget the second tensor product!)
Yeah
15:39
@Danu all we're doing is changing what ring it's a module over
@MikeMiller Yeah
I don't have a big problem with it :)
A harder problem for me is the following:
Given that $H^1(X,\Bbb C)$ is the above tensor product, "this shows that $H^1(X,\Bbb Z)\to H^1(X,\Bbb C)\to H^{0,1}(X)$ is injective with discrete image that generates $H^{0,1}(X)$".
Seems a little sketchy. Dimensions seem wrong.
$b^{0,1}$ should be $g$.
I don't know what $g$ is
15:46
Of an arbitrary complex manifold
?
I'm talking about a curve here for convenience, sorry
For a Kahler manifold $H^1 = H^{0,1} \oplus H^{1,0}$
Yes, I know
so you see the dimension problem?
No @MikeMiller
The image is supposed to be discrete
Dimensions of what?
16:01
Lets say you were talking to a person who knew what a Fourier transform was, and you wanted to motivate the fact you can derive the quadratic formula by taking a discrete fourier transform of the roots of your quadratic, how would you motivate even taking that DFT? It works, but it's not like you're expanding a wave function in exponential waves, what are you doing
$H^1$ and $H^{0,1}$
so I guess it could still be true that the full composite is injective, but that second map does kill a half-dimensional complex subspace
Yes,
I think the full composite being injective is what Huybrechts says
this is what I don't understand
Ugh
My book says "Note that if $r$ is not a rational number, then $x^r$ is defined by $x^r = e^{rln x}$"
How do you want to define it?
Oh right, we might encounter infinite many values for $x^r$ if $r$ is rational
16:12
Huh?
@MikeMiller Uh, I meant finitely many values*
No. $x$ here is positive, and $x^r$ has a single well-defined positive value for any rational $r$.
So why does $r$ have to not be a rational number?
You could define $x^r$ that way when $r$ is rational as well. It's just that when $r$ is rational, there's already a perfectly good way to define it: if $r=p/q$, take the positive $q$th root and then take it to the $p$th power.
In my complex analysis book they say "If $\alpha$ is a complex constant and $ z \neq 0$, then we define $z^{\alpha}$ by $z^{\alpha} := e^{\alpha log z}$
16:22
Anyways @MikeMiller I guess that $H^1(X,\Bbb Z)$ injects into $H^1(X,\Bbb R)$, which then injects into $H^1(X,\Bbb C)$, filling out $H^{0,1}(X)$
@Danu Duh. Thanks.
Not super sure about how that works, but okay...
It should be something like that
I'm forgetting all the math I ever pretended to know.
I mean, $r \in \mathbf{R}$ so it's certainly complex and $x \neq 0$ so surely it holds even for rational $r$
I have this crippling insecurity when it comes down to writing out anything when it comes to "modules" (magic word)
The reason why I care is because Huybrechts proves that the kernel of $H^1(X,\mathcal O^*)\to H^2(X,\Bbb Z)$ (from the exponential sequence)---which is equal to $H^1(X,\mathcal O)/H^1(X,\Bbb Z)$ on a compact manifold (because the map between those two in the LES is injective)---is a complex torus. Which kind of sounds cool
So the point is to prove that the map from $H^1(X,\Bbb Z)$ into $H^1(X,\mathcal O)=H^{0,1}(X)$ has a lattice as image
16:26
mhm
This is done by proving it for the map induced by inclusion $\Bbb Z\subset \Bbb C$ (post-composed with projection to $(0,1)$) and then noting the map agrees with the one from the exp. seq.
that's called the Picard variety of your complex manifold
or rather, the identity component of the Picard variety
Eh... could be
it's the "continuous part of the Picard group" for Huybrechts
$\operatorname{Pic}^0(X)$
Identity component... so it's something like $\operatorname{Pic}(X)$ is $\operatorname{Pic}^0(X)$, plus somehow the discrete part generating further copies?
16:31
yes, and the discrete part here is $H^2(X;\Bbb Z)$
Well, the image of Pic in it but yes
somethingsomething Chern class
I'm excited for ch. 4 which should clear some stuff up about chern classes
So could you perhaps tell me why $H^1(X,\Bbb R)$ injects into $H^{0,1}(X)$ (as opposed to...??) @MikeMiller?
16:48
@MikeMiller Hi
Are you busy?
Oh, actually it's clear that the discrete part generates copies. Thanks for setting me onto that track Mike :)
17:07
Hi chat
hi everyone
Today in class we saw that if $\mathfrak{M}_\mathcal{L^1}$ denotes the subsets of $\mathbb{R}$ which are Lebesgue measurable then we have $|\mathbb{R}|< |\mathfrak{M}_\mathcal{L^1}|\le |2^\mathbb{R}|$. Can we prove that there are as many measurable sets as there are subsets of the reals without assuming some form of GCH or could the second inequality be strict too in ZFC alone?
@Danu I initially read the above as "something something Chem class" and wondered why you'd care about chemistry :p
Hi, I had this question math.stackexchange.com/questions/1924388/… closed as off-topic but I think it should be closed as duplicate. I don't quite understand the reason given for closing the question as off-topic.
actually I already know the answer to the question above now that I think of it, nevermind
17:38
@Krijn: Hey.
Hey Bala!
Have you done some more algebra/number theory already? :D
None yet, and I don't plan to do so any soon.
I gave your Weil conjecture papers a quick look yesterday, by the way.
Ah, yes
Although I don't know how much Elliptic Curve theory you know
You know more than me anyway
Well, yeah, I took two courses in it ._.
17:42
Right
One on elliptic curves and one on alg geom
But I want to understand why Algebraic Number Theory is sort of the same thing
Um, not sure what you mean by "the same thing"
The same thing as what?
Why we can see it as a theory of algebraic curves
I sort of understand the laymen's explanation but I would like to understand it in full detail
something something Spec Z
Jup
17:47
I don't know anything about it either :)
hi @Krijn and @balarka
Hi @Alessandro
Hi @Alessandro
I'm looking for a movie to watch tonight, any suggestion @Krijn?
@Balarka knows much more movies than me, I think
17:49
What kind of movie do you want to watch?
Nah
Coincidentally, I'm also watching a movie tonight
You never finished the one I recommended :P But I won't push it.
Any genre is fine, as long as it is a good movie
around 2h30m at most as running time though
define 'good movie'
Imdb rating > 8
17:51
lol
@BalarkaSen I'll finish it!
I Will
mad max: fury road
hachiko
A movie which is good in the opinion of the person suggesting it to me I suppose @Mike whether I find it good too decides whether I'll ask that person for suggestions again :P
I've seen both
the godfather
synecdoche, new york
17:52
have you seen any of Tarkovsky? those are my personal favorites
the man who fell to earth
@BalarkaSen too long
fair enough
Hi everybody,
Can anyone explain me the assumption below in answer
http://math.stackexchange.com/questions/25241/proof-there-is-a-1-1-correspondence-between-an-uncountable-set-and-itself-minus?rq=1

>>assuming countable choice it has a countably infinite subset B`
The Grand Budapest Hotel
Not yet, but Solaris has been on my "list of movies to watch" for quite some time @balarka
17:54
Amélie?
i have stalker and nostalghia on top of solarys, just so you know (in that order, yes)
J'ai tué ma mere
Solaris is a good movie but there's too much going on, somehow
have any of you seen breathless, by Goddard? I have been planning to watch it
17:55
Of course, Balarka and I are referring to the American version starring everyone's favorite, George Clooney, instead of the unwatchable Russian.
I'll add those to the list too @balarka
I've heard breathless is good, but I didn't see it
@Alessandro I gave you some suggestions; I can give more if you give me a feeling you're looking for tonight.
I think those were enough, I really should watch the godfather sooner or later and tonight might be a good moment to do so
@theindigamer thanks
17:57
That might pass your time cutoff.
@shcolf are you asking what the axiom of countable choice is or why do you need to assume it there?
Hm, it's a bit too long at 2h55m
I might have enough time but I can't be sure and I hate having to leave a movie halfway through to finish it later
@Alessandro actually I'm wondering why do I need to assume it there, because I haven't studied it
@MikeM: I didn't watch naked lunch after seeing a film by Cronenberg. I can't take that much gore :/
What did you see?
The Fly
17:59
Also, naked lunch is rather bizarre.
The Fly is great. Not my favorite Cronenberg.
it's a nice film, yeah. just too visually disturbing
It's just a movie about an annoying fly. Dunno what you could possibly find upsetting.
I think it's needed to be sure that $A\setminus B$ isn't an amorphous set and so it has a countable subset. Those are kinda technical details you don't really need to worry about, especially because you are already assuming the axiom of choice to prove that countable union of countable sets is countable @shcolf
well, my notions of disturbing are rather odd. I found Lynch's stuff (mentally) disturbing :P
I think most people would agree that Lynch is at least extremely weird, if not disturbing?
18:05
@BalarkaSen Here's a problem I heard recently that you might like. Let $C_p$ be the $\Bbb R$ vector space with basis given by the set of collections of disjoint simple closed curves in $S^2$ that don't intersect a given set of $p$ points, and such that no curve bounds a disc disjoint from the other curves and the points.
This forms a chain complex, with $\partial: C_p \to C_{p-1}$ given by taking the alternating sum over what you get when you delete one of the $p$ points.
@Alessandro can you please tell me, at which moment we assume axiom of choice in proving countable union of countable sets is countable, I think I've missed that also.
The only thing is that sometimes, when you delete a point, you might get a circle left that does bound a disc (if that circle winds in a small loop around the point, eg). In that case, you delete that circle and multiply by $\delta$, where $\delta > 0$ is a real number.
So for instance if for $x \in C_2$ the two points are the north and south pole and the circle is the equator, $\partial(x) = \delta y - \delta y$ where $y$ is the configuration of no circles and one point.
What's the homology of this chain complex?
Hmm, alright (I don't see why I'd multiply by $\delta$)
It's just the definition. It gives a family of chain complexes. It's related to something in operator algebras somehow.
@shcolf I don't know the details of the proof in your book or the one a professor showed you, but you have a countable family of countable sets, $\{S_n\}_{n\in\mathbb{N}}$ and at some point in the proof you're probably going to consider a sequence $(s_n)_{n\in\mathbb{N}}$, such that $s_n\in S_n\forall n$, to state that such a sequence exists you need the axiom of (countable) choice
18:10
It's known that it vanishes for $\delta \leq 2$, I think (or maybe just $\delta < 2)$. People think it vanishes for all $\delta$, but aren't sure.
interesting
I'll read the problem once again carefully
worrying about those details is probably just confusing right now so I wouldn't mind too much @shcolf
@Alessandro thanks alot man. After reading your answer and some answers
from math.stackexchange.com/questions/603456/… here, I think I'm getting an untuition
@MikeMiller Ah, so the objects of $C_p$ are formal linear combinations of configurations of such curves and the $p$ points.
@BalarkaSen Equivalently, $C_p$ is generated by the set of "collections of simple closed curves on $S^2 \setminus x_1, \dots, x_p$ up to isotopy, modulo the relation that you can delete a circle that bounds, as long as you multiply the resulting thing by $\delta$"
Yes.
18:14
Got it, I was a bit confused about what to take alternating sum over after deleting a point, in the defn of $\partial$.
The axiom of choice is almost always (implicitely) assumed anyway, most of the people not assuming it are doing so on purpose to study what happens without @shcolf
Does someone have any idea for the general case of this question math.stackexchange.com/questions/1954108/… ?
so your "north pole, south pole, equator" configuration is a closed chain/cycle, yup?
very interesting
There is a subtlety here in that it seems like you need to pick identifications with what happens when you delete the north pole or the south pole, given that it's a point deleted in both,b ut in different places. I'm not sure what you're supposed to do for that.
18:21
Why can't you do an ambient-isotopy of the whole configuration?
I'm not sure if that's allowed.
I don't see what can go wrong. I want to say "Two configurations in $S^2$ are equivalent if there is a diffeotopy of $S^2$ starting at the identity, taking points to points, curves to curves.", just to clarify
No, it makes perfect sense. I just don't know if that's the definition of the chain complex, or if the points are demanded fixed.
Well, you would have to sign the points, I think, too. Which might be weird.
Or I guess I don't orient the curves in the first place. That could be OK.
Maybe I should find somewhere this is actually defined. :P
I find this to be really good working music.
18:30
speaking of, I seem to have lost my headphones
hey @BalarkaSen just good question
If I have group of order pqr where p < q < r
which I proved isn't simple
then I showed that any two distinict prime pq can't be simple
but then
I was wondering why does this finish it ?
finish which?
by lagrange we know that normal subgroup can have order p,q,r or pq,pr,qr
why can't our normal subgroup be product of primes ?
18:37
"our" normal subgroup? I am confused about what you are trying to show. Can you precisely state it?
ok so what I am trying to show is the following I have a group of order |G| = pqr where p < q < r. I am trying to show it must have a normal subgroup of order p,q, or r.
I showed that such group can't be simple right ?
I showed it by direct counting argument
Now I would like to show that it must have order p,q or r
@Adeek Not "must" though. Just that there is a normal subgroup of prime order.
You've got quantifiers wrong
I would like to show that it must be of prime order and not product of primes
You wrote here that you have to show there exists a normal subgroup of prime order. Now you're claiming you also have to show there is no normal subgroup of semiprime (aka product of primes) order?
yeah
19:01
What is the interpretation of R^2 for random forest regression? With a linear regression, I understand R^2 is the explained variance in the dependent variable predicted by the independent variable.
19:41
@Adeek Sorry, I left. I am a bit rusty on group theory, but I don't think existence isn't hard. Take an $r$-Sylow subgroup of $G$. Number of such subgroups divides $pq$, and is $1\pmod{r}$. It can't be $p$ or $q$ because they are both less than $r$, hence dividing will give residue exactly $p$ and $q$ respectively. If it's $pq$, the total number of elements these subgroups occupy is $pq(r - 1) + 1 = pqr - (pq - 1)$ (prime order subgroups, so intersect trivially).
Look at the $q$-Sylow subgroups. Number of such things divide $pr$, and it can't be $p$ as before ($p$ is not 1 mod $q$). So is at least $r$ (if not normal!). That gives a total of $r(q - 1)$ nonidentity elements. Also the $p$-Sylow subgroup gives $p - 1$ nonidentity elements. So you have a total of $r(q - 1) + p - 1$ nonidentity elements. This is larger than $p(q - 1) + p - 1 = pq - 1$
That implies either the number of $r$-Sylow groups is 1, or the number of $q$-Sylow groups is $1$, so you get a normal subgroup in any case.
I think the other stronger result that such things are the only possible orders of normal subgroups should be provable from similar counting arguments.
Actually the stronger result is trivially false. Look at $\Bbb Z_{15} \times \Bbb Z_2$. $\Bbb Z_{15}$ is a fine normal subgroup of semiprime order :P
Hi @arctictern
19:59
hi
what's up?
looking at past putnam problems
just did this one: count the triples (A,B,C) of sets with A∪B∪C={1,...,10} and A∩B∩C empty.
@MikeMiller this is high on my list...is it as good as it looks?
@arctictern nice
@Danu It's in my top 5.
20:11
The actor is so great. The master was masterful
Seymour Hoffman
but it only got a 7.5 on imdb and hence can't be that good because that's how movies work.
@AndrewThompson bleh
Also, this result that the Picard group is a torus fibration is awesome
@AndrewThompson hahaha
Imbd rating correlateds with quality in a... Complicated way
i prefer rotten tomatoes' rating over imdb's.
but i do not consider any of their ratings overly relevant to the film's quality
yeah, people tend to say that. i don't really watch movies a lot so i wouldn't really know.
20:15
Yeah
I usually see what Roger Ebert thinks about the movie
Best movie I've seen in a long time was "Embrace of the Serpent"
@MikeMiller Did you get through the (parts you were interested in in the) paper?
(Original title is Spanish)
The ending is a bit of a matter of taste but everything leading up to it is great
The settlement gone astray is one of the best scenes I've seen
(Intentionally cryptic... Don't wanna spoiler)
I plan to watch some of Kiarostami's stuff soon, especially since I have more time now
20:22
Once upon a time in Anatolia was also good
@Danu I saw that out here before the oscars. It was amazing.
@AndrewT Not yet. I'm working through a web of related stuff too. I'm about halfway through it.
But right now I'm trying to find my screwdriver.
@MikeMiller embrace of the serpent? (I'm on phone, can't see what you replied to)
How did you like the ending?
I didn't reply to any message. But yes.
@arctictern shouldn't that just be $6^{10}$? i feel like i'm somehow making it too easy
@Semiclassical yes
20:25
mmkay
My girlfriend thought it was weak. I liked it
nother one I liked: compute average number of "local maximums" of a permutation in S_n (define appropriately)
Wait, they got an Oscar?
huh
would a local max be something with a->b->c and b>a,c?
right, or edge cases just bigger than its one immediate neighbor
20:27
not sure what you mean by that
each element has both a predecessor and a successor
like f(1) bigger than f(2) (but there is no f(0) since 0's not in {1,...,n})
how could there be no f(0)?
I don't remember. They were nominated, and there was a viewing for members of the academy.
can use symmetry to arrive at the solution relatively quickly
20:29
sure
i'm tempted to think of it diagramatically
i.e. draw $n$ dots on a circle and then $n$ arrows between them
but i can't be arsed, if i'm honest
nah, you want to see how often k is a local max for each k=1,...,n
split into cases k=1, 1<k<n and k=n
@MikeMiller oh, nice
20:43
Man I hate time limits
00:00 - 21:0021:00 - 00:00

« first day (2255 days earlier)      last day (3061 days later) »