@cairdcoinheringaahing Well I'm doing group theory with one of the professors at the University of Waterloo who volunteers some time to teach us non-boring math
@cairdcoinheringaahing my school "doesn't" either but they had to deal with 4 people from the same grade 8 class bothering them for over 2 months straight so they eventually gave up resisting
@HyperNeutrino In the last math exam, I got 100% without having to show my working, even when the question asks you to. Our school system is messed up.
I once managed to derail a lesson by asking my teacher a question about dimensional maths and he couldn't prove that I was wrong. He just gave the rest of the class a worksheet and spent the rest of the lesson trying to disprove my proof
@LeakyNun some perspective thing about 4 dimensional tetrahedrons. I think the proof was that it is impossible to rotate it completely through once so that it turned itself inside out, but still being able to see all internal and external faces.
@ASCII-only I didn't say I proved it, I just said that my Maths teacher couldn't disprove it. I have a feeling that if I found the "proof" later in life, I'd laugh at how bad it was
remainder 1 mod p seems something in the direction of fermat's little theorem, but I don't know what the purpose of doing it for all divisors of n is, at least at the moment
for example, the geometric mean of [1, 2, ..., 100]
with the root method you have to compute the 100th root of 100!
@ASCII-only what is the 100th root of 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000?
and this only gets worse with bigger numbers
with 1..100000 I just have to do one log per input number and sum
meanwhile you have to find out algorithms to accurately find the 100000th root from 100000 factorial
Do the line segments cross?
Description: Today, we're going to do some geometry: We have two line segments and want to find out where they cross! A point is a pair of two integers being the x and y coordiantes of said point. If your calculations result in non-integers, you continue with the inte...
Prime Number Locator
Given a prime number p > 1, determine at what index p appears in A000040.
You may 0 or 1 index, meaning 2 can return 0 or 1.
If you are given a non-prime number you must return -1.
If you are 1-indexing you may return 0 instead, or still return -1.
Your time complexity ...
The \@ generally just occurs in look(ahead|behind)s
*/\@<!*
\@<! Matches with zero width if the preceding atom does NOT match just
before what follows. Thus this matches if there is no position in the
current or previous line where the atom matches such that it ends just
before what follows. |/zero-width| {not in Vi}
Like "(?<!pattern)" in Perl, but Vim allows non-fixed-width patterns.
The match with the preceding atom is made to end just before the match
with what follows, thus an atom that ends in ".*" will work.
Warning: This can be slow (because many positions need to be checked
And \@! is a not match (with zero-width) but at the current position
> Hi {leadfirstName}, I want to touch base with you to see if {companyname} would be willing to have a 15 minute face to face on {date}, to talk about your long-term storage needs?
Spam email I just received. I think someone doesn't know how to mail merge.
Hi so i got an assingment to do a mathimatical game in school and i would need some help cause i started programming c++ 4 days ago and im not that experienced yet to do something likes this.
basicly its
Make a program using c++ that manages a calculation game where two people compete against ...
How do these people a) find this site and b) think it's a good place to post this stuff? Maybe I'm just too cautious myself and lurk a lot before posting anything.
Yeah, I linked to a commented version on gist because it's ridiculously long
> I have a detailed explanation, but it's about 6 thousand characters long, so I think it would not be wise to paste the entire thing into this answer. You can read through it here if you want. I'll add a shorter explanation here.
Don't you ever want to know if your code golf score is "good enough" for the language you're using? How can you measure which golf is better when one is in Jelly and one is in JS? Well, now we can!
Task
Take two programming language names as input. Find 40 code-golf questions that have at least...
I'm one of the author of Gimli. We already have a tweetable (280 chars) version in C but I would like to see how small it can get.
Gimli (paper,website) is a high speed with high security level cryptographic permutation design that will be presented at the Conference on Cryptographic Hardware an...