« first day (1832 days earlier)      last day (3013 days later) » 

8:22 AM
I don't know computer science. Can someone who does please tell me whether I can take the bonus −20% for
0
A: Divisor sum from prime-power factorisation

msh210Perl 5, 100 bytes Obviously this is nonwinning, but I decided to write it for kicks. It's a completely different solution from the preexisting ones here. It's a subroutine: ($b,$e)=@_;$s=1;map$s*=$b->[$_]**$e->[$_],0..@$b-1;$_=1x$s;for$j(0..$s){$i+=($j+1)*/^(.+)\1{$j}$/}$i See it in action ...

?
 
Anonymous
@msh210 Does it take forever to run for larger inputs?
 
@Mego More prime factors, or higher exponents, or both?
 
Anonymous
@msh210 Higher exponents, primarily. I'm mainly asking because I'm tempted to get an estimate using empirical testing, and I don't want larger inputs to take hours.
 
@Mego Well, when I tried it on [2,3,5,7],[7,7,7,7] it said "Out of memory!" and when I tried it on [2,3,5],[17,17,17] it said "Range iterator outside integer range". :-)
 
Anonymous
Making some notes now...
 
8:30 AM
[2,3,5],[10,10,10] --> "Out of memory!"
 
Anonymous
I'd say it's at least O(product of exponents), based on empirical timing
 
@Mego Thanks!
 
Anonymous
[4,1,1] S=6 P=4 0.042s
[2,1,3] S=6 P=6 1.468s
 
Anonymous
Same sum but greater product led to ~30x longer runtime
 
Anonymous
Ok, as far as i understood, you create the number, whose factorisation is given and continue with that one. Then it can't be the requested complexity. Otherwise RSA would be screwed ;-) — Moartem 26 secs ago
 
8:36 AM
@Mego Well, it has a loop with N iterations where N is the composite number (base^exponent * base^exponent * ...). That should be somewhere between sum of exponents and product of exponents, I'd think, no?
 
2
Q: Tips for golfing in vim

DJ McGoathemI've recently realized how vim works great for golfing, especially for kolmogorov-complexity. Also, according to meta vim is a perfectly acceptable 'programming language' at least, for the scope of this site, that is. What general tips do you have for golfing in Vim? I'm looking for ideas which ...

 
Anonymous
@msh210 That's much worse than product of exponents. It's at least as bad as O((product of bases)*(product of exponents))
 
@Mego Oh... okay.
@Mego Thanks for your help.
 
Anonymous
No problemo
 
Anonymous
Consider the following
 
Anonymous
8:40 AM
If all the exponents were 1, it'd be O(product of bases). If all the bases were equivalent, it'd be O(base^(sum of exponents)).
 
@Mego s/product of exponents/sum of exponents/
 
Anonymous
You saw nothing :P
 
:-)
@Mego Because of that big-O form for the equal-bases cases, I guessed the general case was between sum of exponents and product of exponents.
Anyway, I should go. Have a good timezone. Thanks again; I've edited the answer to remove the possibility of claiming the bonus.
 
Anonymous
Glad to help :)
 
9:28 AM
-1
Q: PigLatin translator

BálintWhat you need to do: The player can enter amy words in english, and your program needs to output the piglatin version of it Piglatin: If a word starts wirth a consonent sound, then the letters befire the vowel gets translated to the end of the word, and finally, we add an "ay" to it Book -> o...

 
 
1 hour later…
Anonymous
10:39 AM
@Dennis Something broke on TIO with Seriously
 
11:22 AM
0
Q: Display powers of Phi with Fibonacci precision

CJ DennisWrite some code that takes a single non-negative integer n and outputs the nth power of Phi (ϕ, the Golden Ratio, approximately 1.61803398874989) with the same number of decimal digits as the nth Fibonacci number. Your code must produce the correct sequence of digits for all inputs up to at leas...

 
 
1 hour later…
12:29 PM
0
Q: Electrical outlet

Pål GDThis is a problem from NCPC 2005. Roy has an apartment with only electrical outlet, but he has a bunch of power strips. Compute the maximum number of outlets he can have using the power strips he has. The number of outlets per power strip is given as input. It turns out that if the number of o...

 
1:29 PM
0
Q: On scoring imported functions

OgadayThere are lots of questions about whether to count the bytes in an import statement, etc. This question is not about that. Instead, this question is more inline with this question but I think it would be considered off topic/distinct. Again, assume standard library imports are allowed at least, ...

 
1:50 PM
0
Q: Determine whether simple equations are solvable or not

CJ DennisTake a series of simple mathematical identities as inputs, followed by a list of variables that have known values. Your code must output whether the remaining variables can be worked out from the known information. Each variable will be a single upper or lower case letter. Each identity will con...

 
Apparently chat has been taken over by bots ...
 
2:20 PM
@TimmyD That's what happens when you don't thank them properly
 
in PPCG Code Snippet Chat Bot, yesterday, by Data
I am a dumb bot and suck at everything.
 
2:33 PM
hi all
 
.o/
 
I have a new challenge idea (after the disaster of my last one)
given an indirected graph and a start node, there is an expected time to reach all possible nodes if you walk at random
this is called the cover time
we can estimate it by just setting off 1000 walks at random and talking the average
but... you can also set off two independent random walks at once and see how long it takes for every node to be visited by at least one of them
and clearly you can do this with more than two as well
 
2
A: Symbolic Integration of Polynomials

senegromMathematica 478 * 0.9 = 430.2 φ=(α=ToExpression;Π=StringReplace;σ="Cannot integrate "<>#1;Λ=DeleteDuplicates@StringCases[#1,RegularExpression["[a-df-zA-Z]+"]];μ=Length@Λ;If[μ>1,σ,If[μ<1,Λ="x",Λ=Λ[[1]]];Ψ=α@Π[#1,{"e"->" E ","π"->" π "}];Φ=α@Λ;Θ=α@Π[#1,{"e"->" 2 ","π"->" 2 "}];λ=Exponent[Θ,Φ,List]...

@Lembik Sandbox it. ;P
 
@VoteToClose I am :)
@VoteToClose let me know what you think.. please
 
2:51 PM
@Lembik I'm in class right now, so no promises for speediness. c:
 
:P)
:)
 
any comments before posting?
2
A: Sandbox for Proposed Challenges

randomraWhat language is this word? Your should write a program or function that determines the language of a given word. The task is to recognize some of the 5000 most common words in 4 languages: English German Italian Hungarian The word lists can be found in this GitHub repository. You are allo...

 
0
A: Sandbox for Proposed Challenges

LembikMaximum cover time ratio Given an undirected graph and a start node, there is an expected time to reach all possible nodes if you walk at random. This time will depend on which node you start from. For a given graph and starting node, let us call the time to visit all nodes in the graph the cove...

 
3:13 PM
1
Q: We Built a Programming Language... right?

VoteToCloseRecently, Mego, quartata, CᴏɴᴏʀO'Bʀɪᴇɴ and I (VoteToClose) (building upon the work of ProgramFOX et al.) built a chat bot named Data that can run code for several different esoteric languages (and maybe, in the future, other languages). Now, after a conversation with overactor, one of the devs fo...

 
2
Q: What language is this word?

randomraYour should write a program or function that determines the language of a given word. The task is to recognize some of the 5000 most common words in 4 languages: English German Italian Hungarian The word lists can be found in this GitHub repository. You are allowed to make mistakes in 40% o...

 
@Mego Ugh, Windows line endings.
 
I cannot help but giggle at that "ugh". It's a royal pain in the ass, and I'm still not sure which line ending I "prefer"
 
The one that goes with your OS of course, since it will not understand the other one.
 
I just don't get why Windows insists on CRLF ... it's just extraneous. Think of how many terabytes of superfluous storage are wasted.
 
3:21 PM
@TimmyD cough.... how many GBs does Word now require?
I use it to type letters to people :)
 
@Mego I've changed the wrapper to call the interpreter as python seriously.py (the CR is only a problem for the shebang), but it doesn't recognize the -i switch anymore.
 
@Dennis Just run fromdos on the script and carry on as usual.
 
@mınxomaτ I cannot modify the script without git barking at me when the next update comes.
 
@Dennis Make a wrapper shell script outside of the local repo.
 
That's what I was already doing, but it called the interpreter as /opt/bin/seriously.py.
 
3:25 PM
if anyone get's a chance.. please do look at meta.codegolf.stackexchange.com/a/8289/9206 so it doesn't end up a disaster like last time :)
 
@Dennis I mean the script takes all arguments(, copies the interpreter files and runs fromdos on them if the file dates have changed,) and passes them to the clean interpreter.
 
Too much work. ;) I need a wrapper anyway to convert the source code of UTF-8 to CP437. Writing python in front of the interpreter name is less trouble.
 
3:46 PM
@VoteToClose Outgolfed by a sock: codegolf.stackexchange.com/a/71082/14215
 
@Geobits A sock? Like sock-puppet? =P
 
Well, he looks like a sock puppet at least.
 
hi @Geobits
I have never understood the motivation of sock puppets on PPCG :)
 
Some of them seem to have no purpose. Some are used to cheat rep. Some are used for chatbots. Some (esp from high-rep users) are to test lower-level privileges and stuff.
 
can you explain the cheat rep part?
is it to upvote their own answers?
 
3:58 PM
Yea, something like that. I don't know how well the scripts detect it, but I assume at least some people get away with it.
I guess you'd have to keep it low-activity, though.
 
ok.. but then why would post an answer under this false id?
 
@Geobits We're constantly watching though.
 
@Lembik To get enough rep to upvote?
 
ah. I forgot you need rep to upvote
it all seems quite harmless to me
unless there is really something bad you can do
 
Upvoting your own posts comes with a free suspension.
 
4:00 PM
It is unless taken to extremes. I'm pretty sure anything "extreme" would be easily detected.
 
unless people make 500 fake ids I suppose
right
in fact I have a controversial view on the other side
 
@Dennis Cool, I've been meaning to get my suspension checked out. My car's been a bit bouncy.
 
I share a computer with other people and it's really annoying how hard *.SE tries to remember the ID of someone who used to be logged in
 
I don't share a computer, and it's really really convenient :P
 
it will randomly change my id when I am in the middle of doing something to that of someone who used the computer before!
@Geobits :) how does it help you?
 
4:02 PM
Because I never have to log in here. Ever.
 
oh I see.. well that's fine
 
On my phone, or any of several computers, I'm just automatically in.
 
but I suspect now that *.SE is remembering IP addresses because it remembers id even when you have cleared cookies sometimes.. it's very annoying!
or doing something sneaky
@Geobits but making it really hard to log out isn't helping you
 
I dunno. I've only hit the logout button a few times I can recall, but I don't remember it not working.
 
@Geobits that's because you didn't then log in as someone else I assume
you really should be able to log out as one person and then log in as another
that is more or less the definition of logging out/in :)
 
4:05 PM
I guess there's a reason all major OSs have easily usable user profiles ;)
I mean, I do actually share this computer, but not my profile on it.
 
Chrome too, by now
 
@Roujo what does chrome have?
I am about to learn something :)
 
Sessions
With separate cookies and logins and all
 
I don't know about this!
how do access a new session?
 
Click the little person thing in the upper right
Then "Switch person"
Then profit =)
 
4:06 PM
I have the three horizontal bars
but no person
 
Yea, I don't have a person icon either.
 
maybe that is an add-on?
 
Besides incognito, but I assume you don't mean that.
 
Further up, left of the minimize button
 
oh I see!!
 
4:07 PM
My minimize button is on the left already ;)
The only thing to the left is close.
 
Oh =P
 
@Geobits My car had the opposite problem. One of the shock absorbers was completely stuck.
 
that is completely new to me !:)
thank you
 
@Lembik No problem ^^
 
but now what can I whinge about??
 
4:08 PM
@Dennis Ouch.
@Lembik How there aren't enough challenges dealing with large matrices of 0s and 1s?
 
@Geobits good point!!
despite its having been there for MINUTES already :)
I feel there could be a rep system for helping on the sandbox
 
I've looked, but I can't really provide an insight when timing is involved.
 
@Dennis there is no timing involved!!
let me fix the ambiguity immediately
@Dennis is it clearer now?
 
Oh, yes.
Completely misread that first paragraph.
 
that is was my fault
thank you for pointing out the problem!
what do you think about it now?
 
4:12 PM
I don't get it. Is this a speed-optimization thing? Otherwsie, why would two programs' k-cover/cover be significantly different?
Or are we trying to find the best starting node to optimize cover time?
 
@Geobits ah sorry. no it's not related to speed. Two programs will find different graphs, starting nodes and k's
we are trying to find the best graph, starting node and k
it's a lot to find :)
so the hard part is to determinate a good search strategy
 
If the score is k-cover/cover time, wouldn't the "best" graph be very... linear?
 
the k-cover time is going to be smaller than the cover time
but linear could well be the best
 
If it ends up being a straight line, it will be very disappointing ;)
 
the most exciting part is to get a score over 1
which I think is possible, counter intuitively
even if it is straight line, which start node should it be?
and how long should the line be?
 
4:16 PM
Why would over one be possible? On any given trial, sure, but I don't see an average of 1000 going over 1.
@Lembik The longer the better, and one of the ends.
 
hmm.. maybe my score is backwards... hold on :)
 
My graph: nodes A and B, one edge between them. Cover time = 1, k-cover time (for any k) = 1. Score 1 :D
 
@Geobits Nice =P
 
@Geobits I reversed the score
but you are right I think I need to add another complication :(
I want it to be possible to get a score over 1
@Geobits imagine three nodes in a line A, B, C and k = 2
 
Ok. I'm totally imagining that right now.
So your k-cover:cover ratio will be lower if the start is B than either end.
 
4:24 PM
right!
you are very quick :)
 
-1
Q: find user define prime no

prashant//We have to find those elemets whos is self dividual in user's given string import java.util.*; class Newprime { public static void main(String str[]) { int Prime[]=new int[5]; int i,count=0; Scanner s=new Scanner(System.in); System.out.println("please enter the no of el...

 
I still think if it's either that or reversed, the "optimal" graph will be a straight line, or a fully connected one.
 
@Geobits ok and where do you think the optimal start node will be?
and which value of k?
and how long a straight line?
:)
I don't mind if the challenge is not impossibly hard.. it will make a change :)
 
I don't mean it's not impossibly hard. If I can choose any graph, k, and start, why does the one I posted (Just A and B) not work?
 
it has ratio 1
is there a higher ratio
?
I feel there should be
 
4:27 PM
Why would there be? If you have k walks at the same time, on any normal graph they're going to finish before a single one would (on average).
 
yes.. what I mean is that for k =2, I suspect that you can get cover time x and k-cover time < x/2
although I may be wrong of course
 
Oh sure, just starting in the middle should do that in most cases.
 
then you get a score > 1
so your trivial solution is no longer optimal
 
Right, since the scoring changed :P
 
exactly!
:)
 
4:32 PM
But I feel there's still a simple optimal answer.
 
ah ok
I just don't know what it is :)
I was wondering if some variant might be even more exciting :) Like allowing directed graphs or different walks to start in different places
but I didn't want to overcomplicate what is already reasonably complicated
 
Brainstorming: Imagine a central point, with spokes connecting out to n single points. Similar to the three-point line case, you start in the middle. Somewhere around k=n, I think you'd get a good ratio.
 
interesting!
we need some code and some numbers now :)
 
One problem is this: The contest in general isn't looking for code, it's looking for a graph. The code is auxillary, and realistically, you could just award it to whoever has the most CPU time on hand :(
 
@Geobits I don't agree you could give it to the most person with the most CPU on hand
@Geobits the challenge is to write clever code .It's an optimization challenge or at least it is meant to be
 
4:36 PM
No, the challenge as I read it is to find the best graph, irregardless of the code used to find it.
 
It's not very obvious how to search different graphs
 
You could probably find one without writing any code, assuming you knew graph theory well enough.
 
@Geobits ah I see your angle. it's like codegolf.stackexchange.com/questions/65876/…
I have posed a lot of questions like this
which are optimization challenges which just need a single answer
 
I haven't looked closely, but that one has a hard cut-off time. I don't see anything like that on the sandboxed post.
However, I think the "optimal" graph might be something like "as n it goes to infinity...", so it will just end up a race for that instead of clever searching.
 
@Geobits ah.. a cut off time Good point!
thanks
you might be right there there is some formula for graph,k and starting node
but I have no idea what it is :)
@Geobits ok question improved :)
please take a look
I haven't addressed your " a genius will find a general solution" point :)
 
4:45 PM
I don't know if it takes a genius, just someone who knows more about graphs than I do :P
 
:)
If Peter Taylor came to chat we could ask him
he is the closest we have to a genius
actually he has made a confusing comment already to the question#
@Geobits but apart from that.. is it improved with the hard cut-off added?
 
Hard to tell. In general, yea, I think so. It won't matter much if the challenge has a general solution though.
 
true... any idea who else to ask about a general solution?
 
Dammit I missed the Electrical Outlet challenge
 
It misses you, too. Go do it.
 
4:50 PM
I mean I missed the easy Jelly answer for it
Ooh MATL hasn't been done yet
 
Oh. Well that's not my fault. I prefer jam.
 
When a challenge has already been golfed pretty hard (down to <10 bytes), is it acceptable to submit a longer answer in a language that hasn't been used yet, or is that reserved to catalogues?
(Assuming that there's no chance of the answer being competitive at that point)
 
Completely acceptable.
 
@Roujo That's allowed and encouraged.
 
Cool! =)
Thanks ^^
 
4:52 PM
the more answers the better :)
 
Rats MATL doesn't have increment/decrement
5 bytes when it could have been 3
 
@quartata I think it does. At least I remember seeing them in an explanation.
 
@Zgarb wait really
 
@Lembik can you repeat the executive summary of the graph problem? I missed too much...
 
4:59 PM
Q is increment
According to that table at least.
And q is decrement.
 
!
@Zgarb thanks that's new
 
0
Q: Golf: Build a chessboard

BrunoSaw this in a PHP challenge. The objective is to make a chessboard with 64 squares (8*8) with the minimum amount of code. Simple enough, I made mine in PHP in 374 bytes (not impressive, I know) and I would like to see some other aproaches. This can be made in a language of your choice, as long as...

 
So just qsQ
MATL has so many nice new shiny things
 
5:18 PM
Solved the Electrical Fire Hazard question, if not beating MATL, Jelly and the like =P
 
I should learn those some time, would be a nice exercise =)
 
11
Q: Electrical outlet

Pål GDThis is a problem from NCPC 2005. Roy has an apartment with only one single electrical outlet, but he has a bunch of power strips. Compute the maximum number of outlets he can have using the power strips he has. The number of outlets per power strip is given as input. It turns out that if the ...

 
5:47 PM
@MartinBüttner How do I implement a loop to do something n times in Retina? My replace stages do multiple replacements, so I can't figure out how to also have a counter going that will stop at zero.
 
@Dennis I was sooo tempted to answer that challenge in Sclipting
 
@mbomb007 put a string n otherwise unused characters at the start or end, remove one during each iteration and ensure that the other replacements fail when there are no more of those characters to be found. kinda depends on your exact stages.
I'm afraid there's no better way yet
 
@MartinBüttner It's for Say What You See.
((\d)\2*)(?!\2)
$1,$2;
(\d)+,
$#1
;
<empty>
 
Can Pyth execute system/shell commands?
 
@Doorknob don't think so
The only thing like that in Pyth is ' which reads files
 
5:51 PM
@MartinBüttner Your Retina answer to the electrical cord challenge is devilishly clever. Nice.
 
@MartinBüttner I guess I could have the counter between each digit to allow multiple replacements...
:/
 
> Any programming language can be used, even Pyth, MathL and Jelly.
> MathL
I'm not sure what they even mean by that. Do they mean MATL or MATLab?
also I detect a slight hint of salt
 
Probably MATL
 
@quartata What are you waiting for?
@Doorknob Pyth can execute arbitrary Python code, so yes.
 
JSFUCK esoteric language in real world (blackhat) use:
3
 
5:58 PM
@Dennis can't find an interpreter
says it's in esoteric IDE though
 
$ pyth/pyth.py -c '$import os;os.system("echo Hello, World!")$'
Hello, World!
 
@Dennis ohh good point I forgot about that
 
Prohibitively long. Oh well.
 
Not very golfy, no.
What are you trying to do?
 
2
Q: Build a chessboard

BrunoSaw this in a PHP challenge. The objective is to make a chessboard with 64 squares (8*8) with the minimum amount of code. Simple enough, I made mine in PHP in 356 bytes (not impressive, I know) and I would like to see some other aproaches. This can be made in a language of your choice, as long as...

 
6:00 PM
@Doorknob you already got beaten to a Pyth answer anyways:
0
A: Build a chessboard

muddyfishPyth, 22 bytes .wmsm*50]*255%+kd2U8U8 Try it here (just the colour values)

 
@quartata yeah I saw
Ah whatever, I'll just do it in Ruby with PBM output :P
 
@TimmyD thanks :)
dat glitchy connection...
@mbomb007 Maybe something like (?(1)\1|\d)+ --> $#1$1?
 
sigh OS X autokills python before it finds a prime larger than 30 something digits.
 
@RikerW You could find an exploit that runs the python code in Ring 0, that might help
 
This is why you shouldn't OS X.
 
6:13 PM
@Doorknob 47-byte vim answer ;)
 
6:38 PM
@itsjeyd Greenspun's Tenth Rule Of Programming: "Any sufficiently complicated C or Fortran program contains an ad-hoc, informally-specified, bug-ridden, slow implementation of half of CommonLisp." — Joshua Taylor Mar 25 '14 at 17:38
 
There are 10 types of people in the world: those who expect this statement is in base 10, those who expect it to be in base 2, those who expect base 3, those who expect base 4, those who expect base 5, those who expect base 6, those who expect base 7, those who expect base 8, those who expect base 9, and everyone else. It turns out the people of the first type were correct.
5
 
6:59 PM
There are 11 types: Those who star things for no reason, those who star things for petty reasons, those who star for pretty good reasons, and me.
 
@Geobits You, of course, do not star until there is a downstar function.
;)
 
 
@MartinBüttner What's the ? for? Also, I tried similar ideas, but I can't get it to work.
Like this:
 
7:14 PM


4
 
((\d)\2*|\d)
$#2$2
The counting isn't quite right...
 
Say & pushes 0 and 1 to a stack. If | is 1-(pop bitAND pop), can I obtain a single zero on the stack?
 
@Zgarb Hah, now the starboard looks like this has two upvotes despite the downvote.
 
^
Also, the "downvote" icon is the same as the "More options..." button next to a starred post.
 
I'm confusing everyone! evil laugh
 
7:25 PM
farting bear - ʕ⁎̯͡⁎ʔ༄
 
._.
Well, goodbye.
 
@TimmyD People love downvotes. This is well known :P
 
@mbomb007 it's a conditional
oh, but I forgot another set of parentheses
((?(1)\1|\d))+
 
Is there a tool that takes a Unicode string and gives the names of the symbols?
 
Google usually does it pretty well.
 
7:29 PM
@randomra It's actually whitehat use, since they are security researchers demonstrating a proof of concept to ebay.
 
@Geobits Well, it does well when putting in a single character anyway.
 
@Geobits Combining characters pose a problem.
 
True. It always poses a problem, though ;)
 
I think we had a challenge for outputting the name of an ASCII character. Let's see if anyone used a builtin that works for Unicode characters...
 
I think Java has one
 
7:36 PM
Apparently, so does Python.
unicodedata.name
It's not often that I find a solution in PPCG but not by Googling.
 
7:50 PM
@Zgarb Yeah, I used the Python one. :D
 
8:04 PM
0
Q: The PPCG Handicap System

sanchisesAs we all know, meta is overflowing with complaints about scoring code-golf between languages (yes, each word is a seperate link, and these may be just the tip of the iceberg). With so much jealousy towards those who actually bothered to look up the Pyth documentation, I thought it would be nice...

 
hi all.. would anyone be so kind to sanity test meta.codegolf.stackexchange.com/a/8289/9206 ?
pleae
hi @MartinBüttner I sadly had to delete my multiplication challenge :(
 
@MartinBüttner Got it to work with a unary counter: codegolf.stackexchange.com/a/71119/34718
 
8:33 PM
@Geobits Alright...?
 
-3
Q: How do you create a program like this

Rufaro NyamaharoWrite a program that allows the use to enter 25 numbers in any order and then display the numbers in a 5 x 5 matrix. When the row is printed the sum of each number in the row should then be printed to the right. When the matrix has been printed the sum of each column should be printed at the bott...

 
Can a parabola be drawn between any arbitrary points? I don't think this is the case, but I wouldn't really know
 
@ZachGates how many points?
 
@KevinW. two
 
@ZachGates Does it have to open upward or downward?
 
8:43 PM
@Zgarb Any direction
 
Then you can do it.
 
So, if I generate 2 random points, I will always be able to form a parabola?
 
Yes.
 
Oh, that's pretty sweet
Thank you!
 
Three, even.
Two points does not uniquely determine a parabola.
 
8:46 PM
@El'endiaStarman Well yeah, but you could mirror either point across the other to get a third point
 
That'd work.
What's the application?
 
Just exploring
 
@ZachGates Then you get a straight line, which is a parabola, but may not be what you want.
 
I actually thought he meant mirroring along the x-axis only.
Which is more interesting.
 
8:53 PM
@VoteToClose Dunno, just thought you might want to see the new answer, since you had one (and were helping on another) in the same language. Nothing serious or anything.
 
user image
9
 
Hmm. pythex.org is down...
@flawr Story of my life.
 
@Geobits How do you know that's a sock?
 
@flawr ES6 compatibility table. Look at IE 10 and 11...
(You may need to check "Show obsolete platforms" to see IE 10)
 

« first day (1832 days earlier)      last day (3013 days later) »