« first day (3987 days earlier)      last day (1033 days later) » 
00:00 - 23:0023:00 - 00:00

12:06 AM
I prefer drinking over smoking. Smoking makes me want to puke a lot. With drinking I can make cool cocktails
 
when i need a break from reality i look at some attempts at the Reimann hypothesis.
 
who's reimann
 
^ this guy
 
mi ydsexlic
 
12:18 AM
england's goalie is really good. nobody writes about him.
i don't even know what his name is.
he was amazing against germany.
 
what about Unai Simón stopping 2 penalties v Switzerland
Italy 2 stronk tho
I think Italy is taking it
 
it's hardly fair to include italy.
 
what do you mean good sir?
 
they're too good and they play a different game.
why not just include a shark in the fish contest.
 
Well they're in the tournament
that's not my fault
 
12:33 AM
i think it is your fault and i would like an apology.
 
The queue for apologies is kind of long but we're doing our best.
 
haha. your opinion is very important to us. please stay on the line for assistance.
the ideal hold music is morning dance by spyro gyra. no alternatives.
 
that's a name I hadn't heard in 15 years
 
i saw them live the night princess diana died in a car accident. front row.
 
I don't even know how I found out about them
freetime is the song I had on my ipod touch when I was 12
 
12:43 AM
it was, i don't even mean this ironically, a very good show.
 
well, I'm 25 so 13 years I guess
 
they were LOUD and had a great bassist.
it was an outdoor event, people were on blankets like they were picnicking, very hippie vibe. i was the youngest person there by 40 years.
my friend worked for the venue and i went to concerts for free that whole summer and fall. i didn't care who was performing.
 
the only concert I went for free was halfway to EDC
because I went with a friend that had to deliver some stuff for another event
 
when i lived in iowa city i knew someone who worked at the englert theater who let me in for free a lot of the time. i'm very much a fan of just showing up and hearing whatever is there that day. i heard some cool music.
 
And then we got drunk and shut off the light and no one could get to their car
cuz u couldn't see anything
 
12:49 AM
i don't remember half of the best shows i've been to.
 
I think that's the meta
 
my favorite show ever was a mitch hedberg standup comedy set. i have never laughed harder in my life and each joke was dumber than the last one.
god, he was funny.
 
Bill Cosby got out of jail
 
probably good news for fans of due process and bad news for everybody else.
 
I think I'm a fan of due process
But I wish he didn't get out haha
 
12:55 AM
i am abstractly in favor of almost any development in favor of less punishment and less incarceration. and yet i wonder why they had to let him out.
it's tough.
america is addicted to incarceration and it is expensive and counterproductive. but if you let me pick and choose i could identify large numbers of people who deserve it
 
maybe some of them aren't even in jail
 
that's part of it. yeah
 
EM4
1:23 AM
yo yo yo yo
 
what is updog
 
EM4
just enjoying life, you?
 
I'm enjoying the new dark mode I created for this site
it doesn't look terrible imho
 
EM4
congrats!!!!
 
it only works on chrome though
because css works differently on the html tag on firefox vs chrome
 
1:53 AM
Hi @robjohn. Busy day for me. Just finished homemade potato salad and cole slaw (2 1/2 hrs) for BBQ tomorrow. How you?
 
2:19 AM
mmm, potatoes
 
2:31 AM
@copper.hat ever the Irish. Lots vinegar, olive oil, other veggies, and a bit of mayo and sour cream with cayenne and dill. Not German, French, or American.
 
Sounds good to me :-)
Mollie Katzen had a recipe that I liked (modified to suit tastes).
 
2:46 AM
@TedShifrin Doing okay. Getting prepared for tomorrow. I will be manning the grill for 2 dozen people.
 
are beers allowed for the grillmaster?
 
@LadiesandGents they would be
 
they would be?
I'm confused
oh, you don't like beer
 
@robjohn: I think it's only 9 where I am. I think I've been assigned grilling, despite my herculean efforts tonight.
 
I will see how many will actually be there, but pre-covid, 2 dozen was about right.
 
2:55 AM
ah, well, have fun :)
 
Yeah, I will look forward to ice cream and fireworks when I am finished.
 
Homemade ice cream (but not fireworks)?
 
No, not homemade, but I think I will like anything cold ;-)
 
3:32 AM
the problem now is that i smell a glass of wine and i am ready for a nap. used to take a bottle or so to get to this stage. so, tomorrow will be a sequence of carefully timed sips.
 
my wife and i just had a restaurant dinner. first in 1.5 years. i am very happy that our favorite place did not go out of business.
no thanks to us, i guess. haha
i had a cheeseburger, fries, and two old fashioneds. i am now immune to criticism.
 
Sounds like Saturday Night Live fodder.
 
i am the only one in my American family that likes to eat out :-(
 
4:03 AM
they're doing some kind of firework show nearby and it is keeping my daughter from going to sleep and disturbing the cat.
also, it isn't july 4th.
 
happens around here with great regularity.
 
they used to do impromptu car events in my neighborhood in oakland. you'd hear tires screeching as someone did donuts in an intersection.
 
i suspect some are related to games somewhere, but there is much firework noise from the el c/richmond directions.
 
4:20 AM
-1
Q: Suppose that $\int_a^b f(t)d\alpha(t)=0$ for all $\alpha(t)$. What can we conclude about f?

MarianaLet f be a continuous function on [a,b]. Suppose that $\int_a^b f(t)d\alpha(t)=0$ for all $\alpha(t)$. What can we conclude about f? The question has a hint: consider a piecewise constant function $\alpha(t)$. But I still have no idea to do this question.

how does one use the hint?
 
@LadiesandGents choose $\alpha$ so that the support of the measure is something like $[x_0,x_1]$ where $x_0,x_1$ are chosen so that $f(t) \ge \delta$ on that interval.
 
so that allows us to solve it for piecewise constants
?
 
No. It allows you to conclude that $f=0$.
Let $\alpha$ be the integral of the characteristic function of $[x_0,x_1]$.
 
5:05 AM
the support of the measure?
 
Hello. Is (a^(b mod m))mod m same as (a^b) mod m ?
 
I think not
have you tried a bunch of values?
 
Just did. Failed at my 3rd try. Thank you. Sometimes I should use brute force.
 
glad it all worked out at the end
 
5:51 AM
@Shobhit Try $a^{b\bmod\phi(m)}\bmod m$ as long as $(a,m)=1$
 
6:09 AM
@LadiesandGents Did you see how $f=0$?
 
6:22 AM
@LadiesandGents Consider $\int_a^bf(x)\,\mathrm{d}[x\gt c]$ where $a\lt c\lt b$ and $[\dots]$ are Iverson brackets
 
7:08 AM
@Shobhit Yes, always try simple cases and small values. Anyway, you should learn Euler's phi theorem, which robjohn mentioned. Its proof is actually very easy: Let f(x) = (a·x)%m, for each x∈S where "%" stands for modulo and S = { x : x∈[1..m] ∧ gcd(x,m)=1 }, and prove that f is a bijection from S to S, and so the product Prod[x∈S] x ≡ Prod[x∈S] f(x) ≡ a^#(S) · Prod[x∈S] x (mod m), so cancelling yields a^#(S) ≡ 1 (mod m). Note that the key is that each member of S has an inverse mod m.
If m is a prime then you get Fermat's little theorem.
 
Hello I'm searching the definition of Borel measure can someone help me?
 
In mathematics, specifically in measure theory, a Borel measure on a topological space is a measure that is defined on all open sets (and thus on all Borel sets). Some authors require additional restrictions on the measure, as described below. == Formal definition == Let X {\displaystyle X} be a locally compact Hausdorff space, and let B ( X ) {\displaystyle {\mathfrak {B}}(X)} be the smallest σ-algebra that contains the open sets of...
 
lmao
sniped
 
@robjohn I found on which says F increasing and left continuous then $\mu([a,b))=F(b)-F(a)$
is it right ?
 
to what are you referring?
the measure of an interval? I guess so.
 
7:35 AM
a book in arabic can we have an equivalence between what is written in W that is F increasing and right continuous with increasing and left continuous
see the part on real line
 
@robjohn @user21820 Thank you for the insights and help. Much appreciated :)
 
@robjohn have you an idea
 
@Shobhit You're welcome!
 
8:00 AM
@user21820 I was actually writing a program for something which needed calculation of power and that also modulo a prime. Fermat theorem helped very much.
 
 
1 hour later…
9:04 AM
@robjohn Congrats on the new profile picture! :)
 
 
1 hour later…
10:10 AM
@A-LevelStudent It's actually the same avatar I used on Memorial Day (Last Monday in May).
@Shobhit Square and Multiply is also useful for large exponentials mod $m$
this answer goes over a couple of methods for large exponentials mod $m$
 
 
2 hours later…
12:44 PM
Hello
A student has to write an exam in which there are two questions. The
likelihood of any question on the exam being seen before by the student is
60%.
The student finds out somehow that one of the questions on the exam
is an unseen question. What is the probability that the other question has
been seen by the student before?
This question came in a quiz. When creating the answer key, our teacher referenced the boy girl problem
 
if the answer isn't 60% i give up
 
However, I feel that in the boy girl problem, its assumed that the parent knows the gender of both of his kids.
 
what's the boy girl problem?
 
But, here, there is a probability that the source of "at least one unseen" had infact only seen the unseen question, but never the whole question paper. This changes the probability of the problem
 
nvm found it
 
12:50 PM
The instructor claims that I'm unnecessarily introducing ambiguity where there isn't any. Is that so?
@leslietownes aka Mr Smith's children
should I elaborate further?
 
i'm literal minded. if the likelihood of a question being seen before by the student is 60%, then that's what it is. the 'being seen before' events are presumably independent of one another, so learning about some does not tell you anything about the others.
wikipedia describes the boy or girl problem in a way that suggests it contains ambiguity.
 
@leslietownes yeah. but the consensus is that answer isn't 1/2
 
i don't see that in your question, but i dunno. it strikes me like the monty hall problem.
it's an interesting problem.
nobody has replaced martin gardner as a popularizer of mathematics.
i had several of his books growing up. still have some of them.
every once in a while the NYT publishes something mathematical. steve strogatz i see a lot. he is good but he is no martin gardner.
i think it helped martin gardner that he didn't have an advanced degree. he wrote more simply and was more interested in interesting things. too much education can lead you down rabbit holes.
maybe i'm just saying that because i live in a rabbit hole
 
 
1 hour later…
2:01 PM
@robjohn that does not work !
 
2:14 PM
yes, I read real-analytic, but your definition of real-entire is different
 
2:25 PM
36% that both are seen, 16% that both are unseen, 48% that one and not the other has been seen. Knock out the 16% that both are seen, that gives $\frac47$ that one is seen and one is unseen.
 
2:38 PM
0
Q: Method of acyclic models and Eilenberg-Zilber theorem

love_sodamI'm currently reading Spanier's AT. Theorem (Eilenberg-Zilber theorem) On the category of ordered pairs of topological spaces $X$ and $Y$, there is a natural chain equivalence of the functor $\Delta(X\times Y)$ with the functor $\Delta(X)\otimes \Delta(Y)$. Proof outline: Both functors are free...

 
i have spanier's copy of halmos, a hilbert space problem book.
 
Hard time reading Spanier's AT. I studied first two part of AT using Hatcher.
 
i couldn't understand spanier either. i learned out of hatcher.
 
My professor doesn't like hatcher's cohomology part. He said the textbook concentrate too much on general topology and not much contents of cohomology.
 
i faked cohomology. toplogy was the minor topic on my qualifying exam. i completely faked it
 
2:53 PM
@love_sodam That's a new critique for hatcher. I have never heard that. I for one quite enjoyed the way he calculates cohomology for the projective spaces
Hatcher is very chatty. Like Vakil, which I can never get myself to read because he just chit-chats too much.
 
what are the contents of cohomology
 
I don't know. He just said like that
 
3:59 PM
I don't suppose y'all would accept this question on your site? (never mind, it got deleted after closure)
 
4:45 PM
@FitzWatson was the probability $\frac37$? oh, they want the probability that one is and one isn't. so $\frac47$.
 
5:14 PM
Happy Day! Feel free to delete whenever it gets too annoying!!
 
5:53 PM
Hi, guys! I'm trying to build a function (polynomial?) f(x,y) for a set of known pairs of values and function values, but wolfram mathematica outputs "The interpolation points are not poised, so an interpolating polynomial of total degree # could not be found". However, it seems like there is a clear pattern in the data. Any ideas on what math package can help here?
 
@AskT are you looking for an exact polynomial or just a curve to roughly fit your data
 
@hyper-neutrino it would be great to find an exact polynomial (Is it even possible in automatic mode? From what I read on the web, it seems like that can be a tough task). I have the ability to generate function values for any (x;y) with an algorithm, but it is very expensive (BFS-based), so that's why I'm looking for simplifying it with polynomial operations.
 
6:13 PM
@robjohn The answer is 3/4, using the Bayes' conditional probability theorem
 
Using the $60\%$ probability, I got
5 hours ago, by robjohn
36% that both are seen, 16% that both are unseen, 48% that one and not the other has been seen. Knock out the 16% that both are seen, that gives $\frac47$ that one is seen and one is unseen.
$\frac{48}{84}=\frac47$
 
@AskT this seems potentially like an XY problem. can you describe your algorithm (or just link the source code, if you're computing it via a script)? if you want to make that faster or turn it into a polynomial it's probably easier to examine the algorithm itself
rather than trying to fit a polynomial to a bunch of arbitrary data points
i'm not sure that's necessarily even possible in the general case, and even if it is, it has no guarantee to be correct for other data points
there might be another closed form that isn't just a polynomial that you wouldn't find by trying to fit a curve
 
6:43 PM
I have one confusion
In the definition of a vector space, is it not true that scaler multiplication is commutative
?
That is, given a field F and an abelian group (V), and let the mapping *:$F\times V\to V$ be such that (a+b)*v=a * v+b * v, where $a,b \in F$ and $v\in V$ and all other vector space axioms hold. Then my question is: by definition can something be said about v*(a+b) or it is not defined?
 
7:05 PM
tell me what the expression v*(a+b) means
 
@Thorgott: it means nothing
Ahh it’s that simple, I was thinking too much about $R^n$
 
Hello!

I have quick question please if you don't mind. A professor writes 40 discrete mathematics true/false
questions. Of the statements in these questions, 17 are
true. If the questions can be positioned in any order, how
many different answer keys are possible?

My answer: I assumed that $C(40,17)$ for true answers since their order does not matter as long as he/she got it right and then I multiplied them by $C(40,23)$ for false questions, so it would be $C(40,17) \times C(40,23)$ since I did not see or understand from the answer that it's meant correct answers. Please correct me if I a
 
$\lambda (a,b,c)= (\lambda a, \lambda b, \lambda c)\in R^3$. And now that I think more about this we never really write $a \lambda $ here also.
Thanks @Thorgott
 
7:21 PM
it is a bit complicated to share an algorithm, but here is data from it (both visual and parameters/function values text): https://gist.github.com/dummyco/d69aa23827bec34e99024d8733b6fdbe
Probably polynomials can't really help here indeed, but there are clear patterns in data. I wonder what is a best practice to approach this type of problem..?
 
I didn't do much
 
@AskT if that table of values at the bottom there is the exact data (and not like a fit/approximateion or anything) then it's pretty easy to design a program that just outputs all of those values and keeps extending the pattern
it wouldn't be a closed form though
 
It's more like group action than ring.
Spanier is the most ungeometric treatment possible.
Formsl algebra and not much intuition at all.
 
@Avra consider this similar problem: a professor writes 2 true/false questions. 1 is true, and 1 is false. how many different answer keys are possible?
 
When do line bundles admit linearizations? A linearization on a line bundle on some variety $X$, is the extension of a reductive group action from $G$ to a group action on $L$, such that projection map remains compatible under the group action on fibers, and $L_x \to L_{gx}$ is a linear map. In some ways then we are asking of a principal G bundle but with the free and transitive conditions removed.
 
7:28 PM
PrincipAL
 
@TedShifrin: Professor Ted, Hi
 
Howdy, Koro
 
formAL
 
Ipad typing
 
i should try that book, it sounds like i would like it.
 
7:29 PM
You said you did try it!
 
@hyper-neutrino. Thank you. What is meant please by "different answer keys"?
 
well, for real. i mostly used hatcher.
 
It’s often said that derivative of a function $f$ at a point $x_0$ is slope of tangent at the point $(x_0, f(x_0))$. I find this statement misleading.
 
i like having ed's copy of a hilbert space problem book. i also have bill bade's copy of a differential equations text. i accumulate books owned by other people.
 
@Avra like, unique sequences of T/F with the appropriate numbers. so for example, if there are three problems and two are T, then the three answer keys would be TTF, TFT, FTT
 
7:31 PM
My bad @Ted. Also how do linearizations affect GIT quotients explicitly. Like if I take a projective variety then I can keep embedding it in various projective varieties (veronese embeddings) all giving me different line bundles. Then even a simple $\Bbb{C}^*$ action could end up giving me several GIT quotients. Are they finite in number? Is there some birational classification for them?
 
@Sayan what about tautologicsl bundles on Projective space? I have no idea.
 
Hello, @TedShifrin! Thanks for the mail!
 
Better statement is this: Tangent of a line at $x_0$ that is best linear approximation of f(x) in deleted neighbourhood of $x_0$.
 
koro, as 'misleading' statements go, it's fairly leading. :)
 
@hyper-neutrino. So in this case $C(40,17)$ would be exactly the same as $C(40,23)$ based on this context, which means I duplicated the answer? Hopefully this is good reasoning!
 
7:34 PM
it's perfectly true that $f^{\prime}(x_0)$ is the slope of the tangent line to the graph of $f$ at $x_0$ and also that that tangent line is the graph of the best linear approximation to $f$ at $x_0$
 
@Avra yep, in fact, $C(N,A)=C(N,N-A)$ for all values. if you write out the formula (using factorials) it should become clear why this is true
 
@leslietownes I say so because of the example $ f(x)=x^2 \sin (\frac 1x)$ when $x\ne 0$ and $f(x)=0$ when $x=0$
 
counterexamples schmounterexamples.
 
Tangent at x=0 isn’t very intuitive here.
:’(
 
it's asking too much of any 'intuitive' explanation to cover corner cases.
 
7:35 PM
@hyper-neutrino. This logic applies only to this question and questions similar. Other questions I saw were clearer about combinations/permutations though.
 
@Ted So most reductive groups that one considers in GIT come are subgroups of $SL(n+1, \Bbb{C})$, so you could just take the natural action on $C^{n+1}$ and restrict them to the tautological bundle I think
 
you may not find it intuitive, but it's still perfectly true
 
my daughter would like more food. she's yelling about this.
 
@Avra what do you mean by that?
 
and I'm pretty sure that if you find the best linear approximation to $x^2\sin(1/x)$ at $x=0$ intuitive, then you find the slope of the tangent line intuitive too, it's pretty much the same thing
 
7:38 PM
i don't accept the existence of x^2 sin(1/x).
 
@hyper-neutrino. This is the only questions that confused as to how to apply combinations on it. Others were less vague compared to this one. I don't know if this makes sense anyway. Thanks.
 
@vitamind sure.
@leslietownes we don’t accept existence of you.
 
i will haunt you all anyway from the netherworld.
i have a question about optoelectronic tweezers and am trying to decide if physics or mechanical engineering stack exchange is the more natural home.
 
I tried tacos for the first time today @Leslie
 
how were they?
 
7:44 PM
I found them tasty :-)
 
i haven't had tacos since last sunday. they were delicious.
 
@Thorgott I do. It’s just I don’t know how to explain to a kid that y=0 is a tangent to the function stated above at x=0
Suppose that the kid doesn’t know Limits.
 
you shouldn't be telling kids about x^2 sin(1/x) in the first place.
 
Hahaha 🤣
Ok. My question is dismissed.
I take my question back. Cheers!
 
not everything has to be understood by a hypothetical kid
 
7:53 PM
:)
 
I'm trying to prove something for a Code Golf problem and I'm wondering - is it possible to find two disjoint sets of Fibonacci numbers of the same cardinality that sum to the same value? Intuitively I think it isn't, and I've reduced my proof of impossibility to this step, but I'm wondering if there's some super obvious counter-case I'm missing before I waste more time solving this :P
 
@FitzWatson explain that to me when you get back.
 
13+1+1=8+2+5?
may depend on how you initialize the sequence.
 
@Thorgott :-)
 
oh sorry, i didn't make it clear - my sequence only has one $1$ because i explicitly cut it out in my code
 
8:01 PM
the growth of the sequence would seem to rule this out for large numbers.
 
{2, 3, 21}, {5, 8, 13}. I missed another constraint that applies to my specific problem - the first set will not haev any adjacent fibonacci numbers (no guarantees about the second set though)
 
3+5+34=8+13+21
keep adding constraints on us...
 
this is starting to sound like a bit of an XY problem. i'll just give the idea itself - basically, what I am trying to prove is that the lexicographically least sequence of fibonacci numbers that sums to N will not have any adjacent fibonacci numbers
or sorry, shortest (tie-break by lexicographically least)
and so my idea for proving that is to assume there is a set of fibonacci numbers that sums to N of the same size as the (unique) set of non-adjacent fibonacci numbers that sums to N, and show that a contradiction arises
 
you have weird goals.
 
it's for computing the fibonacci product, and I have an 18-byte solution that beats caird coinheringaahing's 24-byte solution, except it's only correct I can prove that the shortest sequence of fibonacci numbers that sums to N will not have adjacent fibonacci numbers
so yes, I have weird goals, but I am a mod on code golf, so you could say pretty much everything about me is weird
 
8:08 PM
this is very clever, i just wonder if it works. :)
 
i'll take a look, thanks
wait, it's probably easier to show that for any sequence of fibonacci numbers where two are consecutive, you can reduce it to a shorter sequence with the same sum, and that would work too rather than proving via contradiction
 
That's basically the algorithm that Fibonacci coding uses. Pairs of adjacent Fib numbers "condense" to the next higher Fib number. And if that has a higher neighbour, they condense. Etc, until you run into a gap.
 
yeah, this approach makes it super easy. thanks for the help all :)
@PM2Ring yeah, that page helped me see this approach, thanks
 
No worries.
 
8:16 PM
@robjohn When does the burning of meat for massive numbers of people commemce?
 
@TedShifrin probably about 6:00 or 6:30. I have to leave here about 4:30 to get there and set up.
people will start getting there at 5:30
 
Oh, late. Gotcha. Not at your house, I now gather.
 
we were already on the way to your house. we will need new coordinates.
 
i placed another bounty again. hope it helps
why do people insist to have proven the riemann hypothesis ? lol happens every year.
people who argue " because primes are random or random walks " should be punished :p
 
someone will get there eventually.
i don't plan on vetting any attempts
 
8:26 PM
really , im tired of the " random " arguments in math
a 10 yo can tell its fishy
but the worst is , the more people adress concerns or mistakes the harder they yell it is correct :p
 
@mick because 1 milllion dollars are looking tasty, no?
 
@vitamind not if you realise you have no chance of getting it.
 
That's the problem. Some people don't.
 
right
but it is surprising if they are actual mathematicians
i suggest they try my open problems first before trying the riemann hypothesis.
At least they get some respect from it instead of making themselves look silly :p
 
The only famous attempt I know is from Atiyah but as far as I know it ruined his reputation in the sense that he's now widely known as the guy, who published a wrong proof for the RH
 
8:41 PM
If primes were truly random, Borel-Cantelli says there would be a $100\%$ chance that there are finitely many twin primes. I find it mildly comical that someone would use a probabilistic argument to show that there are infinitely many twin primes.
 
right
confusing proof with argument is already weird
 
I think the only people who know Atiyah primarily for his RH attempt are those who have no business judging anyhow
 
also true
but it was his last big thing , so ppl remember that
 
I knew only about the complex structure on $S^6$ debacle.
 
all he had to do is let ppl look at it more before publishing publicly
do mathematicians play chess ? It that myth true ? Im in a chess club and most are not mathematicians ... Im not in a math club so :p
 
8:51 PM
even if all mathematicians played chess it would not mean all chess players are mathematicians, just like how not all rectangles are squares
 
true
however the cardinality is very different :)
 
and "do mathematicians play chess" is a question with multiple interpretations - by definition, no, mathematicians do math - by inserting "all", no, not all mathematicians play chess - by inserting "some", yes, surely, some mathematicians play chess
 
I mean, people have looked, he just didn't listen
 
yeah
 
now, I think the interesting question is do a higher ratio of mathematicians play chess than non-mathematicians, and that, I do not know :P
 
8:53 PM
@hyper-neutrino ofcourse that is what i meant
 
Yes, with the $S^6$ issue, expert superstars tried to stop it.
 
what is $S^6$ ?
something in dimension 6 ?
has anything of great math value been done in 2021 btw ?
 
Speaking of prime random walks, here's an image I just made from the residues mod 5 of the primes <10,000,000. Start at (0, 0). Then if the next residue is 1 increase x, if it's 4 decrease x, if it's 2 increase y, if it's 3 decrease y. Count the times you visit each point, and convert that to a color. I do a log(1 + k) transform (where k is the visit count) to make the pattern more visible.
 
ok so primes are not random but broccoli
 
what if the residue is 0 /s
 
9:01 PM
@hyper-neutrino never divide by it !
 
Well, then you don't move. But that only happens once. :)
 
@hyper-neutrino a prime 0 mod 5 is just 5
 
I intended that as sarcasm and only afterwards remembered 5 itself was a prime, lol.
could you do that but modulo 7 on a hex/triangular grid?
 
mod 15 solves the problem :)
 
also @PM2Ring what language/software did you use to do this?
 
9:03 PM
alhough you get 3 and 5 mod 15 a few times :)
my mentor always says :

random means you do not understand.
maybe if they rewrite their argments like RH is true because we do not understand primes , they might see how silly they are
 
S^6 is the 6-dimensional sphere
 
ok what about that sphere ?
is it round ? :)
 
it's been an open problem, dating back to Hopf, that has stood for almost 75 years at this point, whether S^6 admits the structure of a complex manifold
 
@hyper-neutrino I used Sage / Python. It's mostly pure Python, but I used a handy Sage function to generate the primes. And to do the plotting, but Sage uses Matplotlib for that.
 
ah, cool. I should learn some basics with how to use matplotlib - I know python but not really how to do graphics stuff
 
9:07 PM
Atiyah had published an erroneous negative answer to this problem back in 2016(?)
 
I'll post a link to a live version that runs on the SageMathCell server...
Oops. It's a bit big. I'll have to resort to trickery...
You can see a gallery of the colormaps here: matplotlib.org/stable/gallery/color/colormap_reference.html
 
oh, nice, that's cool :)
 
@hyper-neutrino Thanks! That version only goes up to 1,000,000, you have to edit it for larger sizes. I tried going upto 100 million, but the server terminated the job after a couple of minutes. :)
 
ah, I see :) well, if I'm interested, I will run it locally, and maybe try out that hex grid thing I mentioned when I have the time
 
9:17 PM
# 1000 : -2 2 4 : -1 5 5
# 1_000_000 : -46 24 49 : -59 -43 50
# 10_000_000 : -134 72 117 : -91 -18 115
# 100_000_000 : -324 112 424 : -319 22 286
That table show (low, current, high) values for x & y, respectively for various m values (calculated with another script). You can use that info to set the grid size & origin.
@hyper-neutrino I don't really know matplotlib. Just a couple of bits that "poke through" Sage's thin wrapper. I have used a couple of GUI frameworks in Python, though. I learned Tkinter, mostly to answer SO questions about it. Before that, I learned GTK+, but I'm a bit rusty with it these days.
 
I see. yeah, I haven't really worked with much GUI stuff with python at all TBH
I learned how to use turtle :D and that's about it
i know how to use java swing and maybe a bit of awt, but since then i mostly use html/css/js whenever i have anything that really needs graphics, so never really learned how to do it in other languages
 
One fun thing to do if you want to draw stuff without needing it to interact with Python is to use SVG. I used Python to create the SVG diagrams in this answer about catenaries: physics.stackexchange.com/a/421965/123208
Well, html/css/js is very handy, since everyone has a browser. :)
 
not me, I connect directly to the internet with my brain /s
@PM2Ring oh, that's cool.
tbh never really used svgs but they look cool :P
 
And if you can do that stuff, it's easy to enhance it with a bit of SVG when you want the power of vector graphics. SVG use CSS for styling. And it can contain embedded JS, although that can reduce its portability.
That's a tiny SVG + JavaScript thingy I wrote for this answer: physics.stackexchange.com/a/648786/123208 (which explains what it's for).
 
9:33 PM
wait you can do that? that's cool :o I didn't know svgs could interact like that
 
Most SVG is created using editors that can't deal well with JavaScript. But it's a piece of cake if you're hand-coding the SVG.
 
oh okay, I see
also i did the hyperbolic red thing - that was pretty interesting
 
SVG also has an intriguing way of doing animation. It makes simple animation effects easy, but it can get a bit mind-boggling when you do complicated things with it. :)
 
well, I haven't seem to have run into a need to know how to do SVGs in the past, but if I do, hopefully i'll be able to figure it out :P
 
Here's a Fibonacci-related one I posted here a little while ago:
Apr 18 at 5:14, by PM 2Ring
user image
 
9:41 PM
:o nice
 
Which illustrates that 5×13 = 8×8 :)
 
hmmm. :P
 
checks out visually. i'm for it
 
10:07 PM
@vitamind lmao
 
Happy 4th
 
10:33 PM
Happy 4th to you too @copper.hat, any good barbecues going on on your neck of the woods?
 
10:52 PM
@OliverDiaz Thanks very much! Heading over to my brother-in-law's shortly for BBQ :-). Also celebrating my son turning 18 last Friday!
Unfortunately my 20 yo daughter is 'stuck' in London, so can't join us.
 
i could use some barbecue. i'll be right over. in maybe 8 hours.
 
00:00 - 23:0023:00 - 00:00

« first day (3987 days earlier)      last day (1033 days later) »