« first day (2705 days earlier)      last day (2611 days later) » 

00:00
that's the end of an approximately 5+3+2 sleep cycle
00:14
why does this exist? emojicode.org
@Salt Have you seen this one? github.com/Property404/fetlang
this is brilliant
why don't i know this language
Honestly can't be that hard to learn either
Features:
Confusing English-like syntax and unhelpful error messages
this man deserves a nobel
01:11
Hi chat
Yo Eric!
01:31
Hey my sleep's fucked
End my life
hi Eric ...
typical Balarka
the whole starboard is about Balarka's foray into chemistry
Hey @Ted and @Balarka!
-2
Q: Why does $1 -1 + 1 - 1 + 1 + ... = \frac{1}{2}$?

Ritvik TanejaSince the integers are closed under addition and subtraction, the LHS must evaluate to an integer. But $\frac{1}{2}$ is not an integer. So, either $1 -1 + 1 - 1 + 1 + ... \neq \frac{1}{2}$ or the integers are not closed under addition and subtraction. The latter, however, is impossible, so it mus...

kill me
01:39
rehi Demonark
And yeah Balarka has committed treason now. Absolutely disgraceful
DISAPPOINTED
why're you yelling at us, Balarka?
It's a meme, as usual
rolls 11 2/3 eyes
01:42
eleven and a two-thirds. Nice.
<--- very tired of memes
I don't think we've had that before
@LeakyNun haha
You must embrace the memetics!
Is there any interesting theory about when an abelian group can be into an $R$-module for some given $R$?
@TedShifrin OK, so I found three papers which are far more accessible than Eliashberg-Mishachev's exposition of h-principle, and does it in a much more concretely. These are Rourke & Sanderson's "Compression theorem I, II, III".
The second paper states and proves the following theorem: Suppose $M^n$ is an embedded submanifold of $Q^q \times \Bbb R^k$ where $q - n \geq 1$ and the embedding is "compressible", i.e., $M$ is nowhere tangent to the $x_0 \times \Bbb R^k$'s or equivalently, the projection map to $Q$ is an immersion $M \to Q$.
01:54
@TedShifrin something I just discovered: in $n+3$ dimensions, the normal vectors of a plane through a point forms $S^n$, the sphere of $n$ dimensions
Suppose $H$ is the subspace in the Grassmannian $\text{Gr}_n(Q \times \Bbb R^k)$ corresponding to the $n$-plane subbundles of $\pi^*TQ$ (which is rank $q$). $U$ be a neighborhood of $H$ is the Grassmannian. Then there is an isotopy $h$ of $M$ in $Q \times \Bbb R^k$ which takes $M$ to $h(TM) \subset U$.
strange connection between linear algebra and topology
Leaky: What do you mean by plane? Totally ambiguous.
@Daminark Maybe you want a bimodule structure?
@TedShifrin a translation of a 2-dimensional subspace
01:56
So the orthogonal complement is $\Bbb R^{n+1}$, in which the unit vectors are an $S^n$. This isn't anything deep or fascinating.
Did you mean unit normal vectors
@TedShifrin alright
@BalarkaSen yes
@BalarkaSen Sorry what I meant is
$h$ takes $M$ to $h(M)$
Such that $Th(M) \subset U$
I haven't tried to absorb this yet, Balarka.
01:59
heya Meow
So after the isotopy, the tangent bundle of the perturbed manifold become "almost flat"
@TedShifrin Fair enough. I think this is much easier to understand than the abstract holonomic approximation theorem
They're doing it in a concrete context
I read through the first paper and it's very beautiful
Rourke & Sanderson are extremely famous ... when was this paper?
i was thinking about something mathy the other day
@TedShifrin 2001 it seems.
I didn't know the authors before finding this paper; interesting
Yes, well-known topology guys.
02:04
Coolio
@BalarkaSen maybe
Polio
@Kenny Extracts a lol the first time, not amusing the second time.
what the hell happened to my name
I imagine the next in the sequence is boring the third time, and then just annoying the fourth time.
02:05
Anyway I'll hold that for now
sigh I might as well change my name permanently to Kenny Lau
I never liked a leaky nun.
people in PPCG are more familiar with my anagram
and that's where I'm from
heres the problem i was thinking about: $p$ racers race $r$ races, and each time they get points according to their ranking (1st place gets 1, 2nd places gets 2, etc. etc.). for what values of $p$ and $r$ (specifically) can all racers get the same point value at the end of the races?
race race race
02:09
for example, $p = 2$, $r = 2$ works, since the first racer can get 1st then 2nd, for a total of 3, and the second can get 2nd then 1st, for the same total of 3
so i have a bunch of observations
for any $r = 2$ it works, since you can just flip the positions
Seems $p=r$ always works.
also, if $(p, r)$ works then $(p, nr)$ works for integer n
so therefore any even $r$ works
yes, that does always work
also, the total points at the end must be $rp(p+1)/2$
so, each player must get $r(p+1)/2$ points. of course, this means $r$ cant be odd when $p$ is even
otherwise you get a non-integer
so everything except for 2 odd numbers is trivial
besides when theyre equal
@MeowMix Is this condition sufficient?
Like that's one thing that comes to mind to try
Well, to be precise, that $r(p+1)/2$ is an integer
No, since $r=1$ and $p > 1$ can never work.
Hey @AlexWertheim
02:14
Good point. :thonk:
that is also true
Hey @Balarka, how goes it?
i was also looking into "groupings"
heya @AlexW :P
Not bad!
How about you
02:14
Howdy @Ted :) how are you doing? Haven't seen you around these parts in a while
(Not chat, LA lol)
so i THINK (dont quote me) you have to be able to group $1$ through $p$ into groups divisible by $r$ that all add up to the same value
Oh. I haven't stopped by to visit you guys the last few drives across LA.
Pretty good. Busy
Finished your thesis yet, Alex? :)
What have you been up to mathematically? Still topology? (I'll ignore the chemistry rumors)
LOL, that's a good one Ted :)
I am thinking about a problem though, so that's been nice
02:16
great
@AlexW A little bit of this, a little bit of that. Most actively thinking about either dynamics (in particular hyperbolic dynamics) or topology (in particular h principles)
that may be a handful of information so like heres an example for $p = 7$, $r = 3$:
1 2 3 4 5 6 7
5 3 7 4 6 1 2
6 7 2 4 1 5 3
all the columns are 12, and you can see the groups are $(4), (1\; 5\; 6), (2\; 3\; 7)$
of course the size of the group has to be divisible by $r$ otherwise the members in the group get unequal totals
@Balarka: neat! Don't know anything about either, but a cursory googling shows some interesting sounding stuff.
you google cursors?
No, I just curse while googling =P
02:20
Heh
Daminark enjoys bad pun
Be careful
You don't want to meddle in his affairs
True, but right now I'm not wearing my pun hat so don't fear
I will appreciate them but I cannot generate my quality content in this state of mind
good to know the peanut gallery is still going strong :)
Fargle!
Where?
02:23
Peanut galle... wat?
I prefer cashews and hazelnuts.
Cashews are objectively the best nut.
@AlexWertheim It is quite interesting actually. The machinery of h-principles gives you a proof of sphere eversion theorem, which you must know already
I prefer hazelnuts and peanuts as nutella and peanut butter, respectively
I think there's a proof of this fact using Yoneda.
02:24
Not I, Demonark. Nutella is way too sweet.
How've you been, Fargle?
@Balarka: you overestimate me, unless I'm being obtuse to obvious sarcasm. I don't even know what the sphere eversion theorem says. (Is this a result of Smale's?)
how beautiful is it that 1+J(R) is a group where J is jacobson radical
Alright. Soon to finish with all this school nonsense, at least for the time being.
02:25
I mean, J(R) is also a group (albeit under a different operation)
psst what's the Jacobson radical?
You mean you're quitting again, Fargle?
@AlexWertheim Oh no I wasn't. I thought you must have seen that famous video of sphere eversion at some point of time.
@Daminark the intersection of every maximum radical
No, graduating after this next semester, hopefully.
I don't intend to bow out without a piece of paper.
02:26
Oh, cool, Fargle. Great :)
it contains every nilpotent element I’ve heard
Only in commutative rings, Kenny
But does it contain the ones you didn't hear?
Grad school possibly down the line, but I don't want to burn out instantly. Baby steps.
@Daminark I fell right into that
@AlexWertheim why?
02:27
You getting your resume ready for job exploration, Fargle?
@TedShifrin Yeah, with some help from my brother and the career counselors at school.
@AlexWertheim What it says is the following. There is an isotopy of immersions f_t : S^2 --> R^3 such that f_0(x) = x and f_1(x) = -x
Good, Fargle. :)
Quite counterintuitive, right?
It's a theorem of Smale, yep
My dream job that's not mathematics professor would be to work at Wizards of the Coast. Games are fun. :)
02:28
Kenny: fun example. Determine the Jacobson radical of the ring of 2x2 matrices over your favorite field. Then determine whether such a ring contains nilpotents.
@Fargle are they good? The ones at my school are supposed to be good at reading resumes but bad at basically anything else
You're not the only one with games as his dream, Fargle.
@Balarka: very. Beautiful result
I only care about the Jacobson radical in a local ring :3
Cute, Balarka :)
02:29
@Daminark Well, the latter part is more something I'll be approaching in January. Right now, just my brother, who has a lot of experience with both his own and many students' resumes/CVs.
I see, nice!
Good to know you have a less-than-useless brother, Fargle
Or is that more-than-useless?
In the history of this chat there has never been greater cause to post this gif than after the "more than useless" question
I have no idea what you're doing, as usual, Demonark.
@TedShifrin He's a veritable genius. I couldn't be prouder of a blood relative.
02:31
Cool, Fargle :)
...well, maybe if he had become a math professor instead of a medievalist. ;)
He's a much older brother?
About a decade, yeah.
(Some further food for thought, @Kenny: what's going wrong? You might be familiar with the result that in a commutative ring, the nilradical is the intersection of prime ideals. But in a noncommutative ring, the nilradical is almost never an ideal, let alone the intersection of prime ideals. This brings up another interesting question: what is the right definition of ''prime ideal'' in a noncommutative ring? Lots of fun to be had here.)
Alex needs to meet Mathein
02:33
Another fan of algebra, Ted? =P
He's the German algebra machine
he's still an undergrad in Germany, but very much into algebra ... and understands most of what he does :)
A man after my own heart, then.
Algebra $\neq$ Understanding
But Mathein understands the geometry too
I probably couldn't keep up then, Ted ;)
02:35
when did you become an algebraist, Fargle?
understanding $\subset$ algebra :^)
cough
@AlexWertheim please be my senpai
I've just sort of slowly realized that I tend to prefer algebra to certain aspects of analysis.
Mathei annoys me mightily from time to time with his myopic viewpoint, but he's a smart dude.
I still love geometry though, and that's weird to rectify.
...no pun intended.
02:36
Fargle's learning from Hatcher now
You will soon be converted
@Danimark: not sure what that means! Haha
The Church Of Hatcher has been witnessed by you
no amount of nice geometric exposition will ever make me an analyst
Analyst? Yes, I mean, very nice.
pages Eric
02:37
Oh shit
OK, time for me to cook dinner. Bye, all.
I think it literally translates to "master" or "teacher" @AlexWertheim? Though in America it's mostly used by weebs to address someone they admire
Take care, @Ted!
Nice to see you both, Fargle and Alex. I hope you'll be back more often
See you @Ted!
02:39
Who knows? (I should be.)
Have a lovely dinner Ted. Nice to see you - hopefully we'll meet up in person again some time soon!
@Daminark: oh, lol. Well, in that case, sure
\('-')/
@Daminark this is gold
@AlexWertheim I see
Bon apettitipepite @Ted
Nailed it
@Kenny: it is true, however, that if $I$ is a (left)-ideal of a ring $R$ which consists of nilpotent elements, then $I \subseteq J(R)$. Pretty amazing! Lam's beautiful book "A First Course in Noncommutative Rings" is a great read, if you find these kinds of results interesting.
02:50
In the commutative context, the nilradical is a subset of J(R), right? ('Cuz the former is intersection of all prime ideals, and the latter is intersection of all maximal ideals)
So that would be obvious, i.e.
Yep, Balarka
What goes wrong in the noncommutative world?
Why am I asking this
end my life pls
Lol, lots of things Balarka. For my money, the biggest problem is that the set of nilpotent elements of a noncommutative ring $R$ need not form an ideal (in fact, I'm guessing this is almost never the case)
Ah
I see, that sum of nilpotent elements is nilpotent breaks down because rip binomial theorem.
Yep! You could try to fix this by taking the ideal generated by the set of all nilpotent elements, but this could be quite large. (In particular, if you look at the preceding example of 2x2 matrix rings over a field: [0, 0; 1, 0] and [0, 1; 0, 0] are both nilpotent elements, but their sum, [0, 1; 1, 0] is a unit, so any ideal containing even these two elements is the whole ring)
02:57
Wow
03:08
@AlexWertheim yikes
@Daminark: crazy stuff!
I got the vibe that non-commutative rings were jank but I didn't think they were this jank
jank x $\infty$ = junk
non-commutative rings are trashy
Oh by the way so, I know that it is possible to put a product on a cohomology group and get a ring. How it's done is over my head, but whatever the case, are those non-commutative?
Yes, but not that badly
It has the anticommutativity property
Namely, if $\alpha \in H^p(X; R)$ and $\beta \in H^q(X; R)$ then $\alpha \smile \beta$ (the product) that's in $H^{p+q}(X; R)$ satisfies $\alpha \smile \beta = (-1)^{pq} \beta \smile \alpha$
03:23
isee.jpg
03:36
graded commutative, woo
yup
Honestly the cohomology ring is only interesting as a graded ring
04:12
@Eric Want to post an answer here?
I'd like to see it
ill look at it later maybe
have to do a dinner thing
04:25
Last night dream involve some kind of strange derivative:
On the blackboard the following is written
$$u, \downarrow \!\!u = \frac{\partial \downarrow \!\!u}{\partial x}$$
$$(forgot), \frac{\partial v}{\partial u}$$
Hi all; I've been trying to deal with the following Number Theory question for an hour
$\downarrow\!\! u$ denotes that u is decreasing as the derivative is taken. The equation to be solved seemed to be a cross between proportionality problems in high school and differential equation with variation features
I've had only one good idea so far, which is to treat said quadruple (a,b,c,d) as a bunch of factors.
Each of these factors are under 2017, so their max value is around 1.3E23
We know the sum of these factors is exactly 2017.
In that maths lesson in the dream, the teacher asked us to start putting down arrows and see how the other functions and variables will respond as a first step towards some unspecified optimisation problem
Now for some reality check:
Perhaps $({ a }^{ 0 }+{ a }^{ 1 }+{ a }^{ 2 })(b^{ 0 })({ c }^{ 0 }+{ c }^{ 1 })({ d }^{ 0 }+{ d }^{ 2 }+...+{ d }^{ 6 }+d^{ 7 })=2017$
Any help is greatly appreciated
04:39
Based on what is said in the dream, it appears such derivative is basically the derivative of some function u(x) restricted to a domain such that u(x) is decreasing. If a point p is specified, it is basically the set of all derivatives such that u(x) x>p is decreasing
Whoa I'm talking to myselfa
Amazing
(Back to responding mode) you need to wait for someone else, I suck at number theoric questions. What I can say though is b^0=1 thus b can be anything
@Secret Yup; thanks
So you really have only three variables to deal with, which that I cannot help much as it is some deg 7 diophataine equation
Well, I have a 1 in 999 chance of being right
04:52
So basically you're trying to find the last three digits of how many solutions there are...yikes.
@DarkRunner one very simple point is just that $b^0=1$, so it's really $a^2+c^1+d^7=2016$
with $b$ now being any number from 1 to 2016
and then you can shift $c^1$ over, to get $a^2+d^7=2016-c^1$ where the RHS is some integer from 0 to 2015.
I guess you could now note that 3^7=2187, which is too big for any solutions to be possible
so you can only have d=1,2
so now you're to $a^2=2016-c^1-d^7=2016-1-c=2015-c$ or $a^2=2016-2^7-c=1888-c$
i guess it's better to just focus on the fact that $a^2+c$ must be either $2015$ or $1888$.
well
wow
and then the fact that 44^2=1936 and 43^2=1849 comes in handy
I guess trail for d^7 works simply due to the exponent. Nice
thanks for the idea!
05:02
when d=1, there are 44 possible values for a; each determines a value of c. when d=2, there's only 43 possible values.
since b isn't constrained, it can be anything from 1 to 2016. so there's 2016*(44+43) outcomes possible.
but you only care about it mod 1000, so that's 2016*87=16*87 = some number that i'm too lazy to do the hand computation for
How do I find the number of integer solutions to $a+b+c+d = 18$ where $0\le a,b,c,d \le 6$ ?
If there was no constraint answer would be $\dbinom{21}3$
The only way that comes to mind immediately isn't very nice
it's the coefficient of $x^{18}$ in $(1+x+x^2+x^3+x^4+x^5+x^6)^4$
Combinatorics solution? Constrained stars and bars?
nah. expand out that polynomial and see what the coefficient of $x^{18}$ is
as I said, not very nice :/
why not constrained stars and bars?
It'd be interesting to solve it that way.
05:16
it might work. I just don't remember enough about that to say.
Okay, what about finding all numbers and then excluding the cases of 7 and above?
but need someone's help with that. don't know how to proceed.
that's an interesting thought. problem is you need to exclude cases that have any of them being at least 7
yes
05:20
not obvious to me how that would be done
For google purposes, what you're trying to count are restricted integer compositions of 18 in four parts
though, actually, integer compositions usually don't worry about the number of parts...hrm
not sure that's a good lead
i dunno :/
@abcd for reference, WA gives the coefficient of x^18 in (1+x+x^2+x^3+x^4+x^5+x^6)^4 as 84: wolframalpha.com/input/…
so that's the answer. but there has to be a better solution than that :/
Yes.
I am thinking.
I have been racking my brains since yesterday night.
@Semiclassical I found this!
Could you explain what he has done?
05:38
neat
hah, Eleven-Eleven's answer is what I did
Yeah.
I don't understand what has been done in the linked answer.
$\dbinom {21}{3} $ is the total number of ways.
I don't either. Not my wheelhouse
That's why it's a low quality answer.
At least he should've explained what he has done. I am disappointed :(.
true blue snail is applying the Principle of Inclusion-Exclusion @Semiclassical @Abcd
i gathered that much
05:50
@anon But how?
i think i see what he's doing, but i'm not really interested in working out the details
I mean, you just do it
How?
You want me to explain what inclusion-exclusion is?
PIE states that $|AUB|= |A|+|B|- |A B|$... |AB| means intersection of A and B.
05:56
@Abcd that's just two sets
@anon No, it's application in this problem.
@anon I think knowledge of PIE for 2 sets only would help in this problem, won't it?
There are four bins, so four sets of things. Namely, $A_i$ for $i=1,2,3,4$ is the set of solutions to $a_1+a_2+a_3+a_4=18$ in which $a_i\ge7$.
Oh,4 sets.
0 is allowed too @anon
What do you mean by "0 is allowed?"
You mean for the variables in the original problem? Yeah, and?
$a_i \in \{0,1,2,3,4,5,6\}$
06:00
That's the original problem, not the definition of my four sets.
For a specific $i\in \{1,2,3,4\}$, the set $A_i$ is the set of all solutions to $a_1+a_2+a_3+a_4=18$ with the specific variable $a_i$ bigger than $6$
Let $A$ be the set of all solutions with no restrictions. Then you're computing $|A\setminus (A_1\cup A_2\cup A_3\cup A_4)|$ with inclusion-exclusion
$|A|=\dbinom{21}{3}$
Which means you get $$ |A| ~-~ \big( |A_1|+|A_2|+|A_3|+|A_4|\big) ~+~ \big( |A_1\cap A_2|+\cdots\big)-\cdots $$
which equals $$ \binom{21}{3}-\binom{4}{1}\binom{14}{3}+\binom{4}{2}\binom{7}{3}-\cdots $$ (the unwritten terms all being $0$)
@anon how?
Well, you already got $|A|=\binom{21}{3}$. And there are four set sets $|A_1|,\cdots,|A_4|$ of size $\binom{14}{3}$ each. And so on.
how did you determine the size of the remaining 4 sets?
06:06
standard stars-and-bars trick: solutions $(a_1,a_2,a_3,a_4)$ to $a_1+a_2+a_3+a_4=18$ satisfying $a_1\ge 7$ correspond to solutions $(b_1,b_2,b_3,b_4)$ satisfying $b_1+b_2+b_3+b_4=11$ with no restrictions, via just subtracting $7$ from $a_1$ to get $b_1$ (and leaving all the other variables the same value)
Similarly, there will be $\binom{4}{2}$-many intersections like $|A_1\cap A_2|$ (picking two indices from $\{1,2,3,4\}$ after all), and $|A_1\cap A_2|$ counts solutions $(a_1,a_2,a_3,a_4)$ with $a_1,a_2\ge7$, so you can subtract $7$ from two variables instead there
see, this is why I like generating functions: I don't have to know what I'm doing :P
just multiply stuff out
(note: this is not an attitude to be imitated.)
@Semiclassical your way: use geo sum formula on 1+x+...+x^6, then newton binomial series on both 1-x^7 and 1-x, and proceed from there.
you can get the coefficient by hand
$$ [x^{18}] (1-x^7)^4 (1-x)^{-4} = [x^{18}] \left( 1-\binom{4}{1} x^7 + \binom{4}{2} x^{14} \right) \left( 1 - \binom{-4}{1} x + \binom{-4}{2} x^2 -
\cdots \right) $$
$$ = \binom{-4}{18}-\binom{4}{1}\binom{-4}{11}+\binom{4}{2}\binom{-4}{4} $$ (which actually matches the PIE thing after rewriting)
jeez, wasn't even anything wrong with my latex, just needed spaces
that's neat, yeah
06:17
I didn't get you @anon ...
I tried hard but couldn't
nice to see the PIE result come out in that way. though in some sense it's none too surprising: it would seem weird to me if you could to rewrite the result in a simple way that didn't have a combinatorial interpretation
@Abcd which part?
@anon this.
the very definition of the sets!?
it also generalizes nicely
06:19
why did you take 4 sets?
Are those 4 solution sets?
One for a, another for b.....till d?
because there are four possible variables to break the restriction $\le 6$
$a+b+c+d = 18$
$$ A_1 \quad=\{(a_1,a_2,a_3,a_4):~ a_1+a_2+a_3+a_4=18,~ a_1\ge7, ~a_2,a_3,a_4\ge0\}$$
and similarly for $A_2,A_3,A_4$.
i.e. $A_1$ is the set of all (nonnegative) solutions to $a_1+a_2+a_3+a_4=18$ in which $a_1\ge7$
@anon then this?
that's the principle of inclusion exclusion
For two sets, it would be $|A\setminus(B\cup C)|=|A|-|B|-|C|+|B\cap C|$
06:23
What does "\" operator mean?
For three sets, $$ |A\setminus (B\cup C\cup D)| =\quad |A|~-\big( |B|+|C|+|D|\big) ~+\big(|B\cap C|+|C\cap D|+|D\cap B|\big) ~-|B\cap C\cap D| $$
@Abcd relative complement, $A\setminus B=\{a: a\in A, a\not\in B\}$
it also goes by the notation $A-B$
(here I am assuming $B,C,D$ are subsets of $A$ of course)
@anon this?
why does that trick work?
Take any solution $(a_1,a_2,a_3,a_4)$ to the equation $a_1+a_2+a_3+a_4=18$ in which $a_1\ge7$. If you subtract $7$ from $a_1$, now it's any of the nonnegative solutions to $a_1+a_2+a_3+a_4=11$.
Hey guys..can someone explain this:
66
A: Calculating the integral $\int_{0}^{\infty} \frac{\cos x}{1+x^2}\mathrm{d}x$ without using complex analysis

AryabhataThis can be done by the useful technique of differentiating under the integral sign. In fact, this is exercise 10.23 in the second edition of "Mathematical Analysis" by Tom Apostol. Here is the brief sketch (as laid out in the exercise itself). Let $$ F(y) = \int\limits_{0}^{\infty} \frac{\sin...

@anon why to subtract? (Reallly sorry for disturbing)
06:35
How did he do the step "$\displaystyle F''(y) - F(y) + \pi/2 = 0$ and hence deduce that $\displaystyle F(y) = \frac{\pi(1-e^{-y})}{2}$"?
@Abcd Because $a_1\ge7\iff (a_1-7)\ge 0$
@Rick what's the second derivative of $\sin(xy)$ with respect to $y$?
@anon $-x^2sin(xy)$
@Rick Right. So when you combine the integrals for $F''(y)$ and $F(y)$ together, what does the integrand become?
@anon this?
well, you sum $|A_i\cap A_j|$ for each choice of $i,j$ and there are $\binom{4}{2}$ such choices
taking for instance $|A_1\cap A_2|$, that counts solutions $(a_1,a_2,a_3,a_4)$ to $a_1+a_2+a_3+a_4=18$ in which both $a_1,a_2\ge7$. Well, guess what happens when you subtract $7$ from both of them...
06:46
@Semiclassical This illustrates why I am bad at physics. I suck at handling special cases that only arises for certain values. Whenever I solve problems, I am often greedy and tried to solve the general case and then enumerate the specific cases from it, but it seems such method does not always work
@anon $b_1+b_2+b_3+b_4 = 4$

« first day (2705 days earlier)      last day (2611 days later) »