Padé approximant of \$\exp(x)\$
code-golf math sequence polynomials
In mathematics, a Padé approximant (Wikipedia, MathWorld) is the "best" approximation of a function by a rational function. For a function \$f(x)\$, the Padé approximant of order \$[m/n]\$ is a rational function of the form
$$R(...
Draw a string as a binary tree
The string abcdefghijklmno, with length 24-1, can be formatted as such:
h
/ \
/ \
/ \
d l
/ \ / \
b f j n
a c e g i k m o
Each letter should be kept in the same column, but raised up by the right amount to form the ...
CMQ I have an 8 by 8 binary matrix. A move is to add two rows mod 2. Is there a clever way to work out the minimum number of 1s in the matrix I can get to with up to 8 moves?
Random challenge idea which I'm putting here because it needs a lot of work: this but in reverse - design a language that's obviously Turing-Complete and can easily perform certain tasks, but where it's extremely difficult to e.g. add two numbers
where "partition" takes two lists of the same length where the first is of integers and islands of identical numbers have the function applied to corresponding items in the second list
The string abcdefghijklmno, with length 24-1, can be formatted as such:
h
/ \
/ \
/ \
d l
/ \ / \
b f j n
a c e g i k m o
Each letter should be kept in the same column, but raised up by the right amount to form the above tree structure. Then, sla...
the satire paper I write for made a joke about an andrew carnegie onlyfans as a source of funding and long story short I now own industrialistfeet.net as a redirect to our homepage lmao
A little embarrassed how long it took me to realize BỊḄ works for "the largest integer with strictly fewer bits than twice the input"... I previously had æḟ2Ḥ’
oh yeah I'm like never going to take an intro to CS class, I'm just going to do this for all of them and beg for prereq waivers for the ones that have them
If I end up doing an electrical and computee engineering major, I'm going to have to take 15-122, which appears to be a very tame CS course but people talk about it like it's the hardest class to ever have existed and it (and its professor) are infamous
From the syllabus it just looks like data structures and stuff
I'm so mad that I'm going to have to waste my time with that class tho...it's one of the few that you can do over the summer, so if I ever have a free summer I could do that ig
@emanresuA yeah I'm really living that xkcd joke about getting a PhD in undeclared
One option I'm considering is trying to get one major and/or minor from every college in CMU :p
Idk how it works at CMU but here you can often get courses waived even for degree requirements provided you've done stuff depending on them or sufficient other work
I haven't heard about anything like that here, but maybe I could ask my advisor
(My advisor's awesome)
I go back and forth between "I want to collect as many majors/minors as possible" and "I want to take whatever the fuck I want and then just declare whatever major makes me take the least other stuff I don't really care about"
I'm in the former phase right now
Harvard has a combined MD-JD program, and it would be pretty funny IMO to speedrun the quintuplet of doctor, lawyer, engineer, politician, pilot
There're MD+JD programs, MD+PhD programs, and PhD+JD programs, I wonder if anyone offers the full triad
CMC: Find the rotation of an array of non-negative integers which is "Most Sorted". An array's "Sortedness" is the number of adjacent pairs in which the first is smaller than the next.
Draw a string as a binary tree
The string abcdefghijklmno, with length 24-1, can be formatted as such:
h
/ \
/ \
/ \
d l
/ \ / \
b f j n
a c e g i k m o
Each letter should be kept in the same column, but raised up by the right amount to form the ...
