Hacker News new | past | comments | ask | show | jobs | submit | colinodell's comments login

Thank you! We've been surprised by how few solutions for this exist today, so I'd be excited to see what y'all open-source.


Whoops, this oversight has been fixed! Appreciate you mentioning this.


This seems like a partial outage, likely region-based. We have a large number of sites routed through Cloudflare and I can access all of them from home, but our HTTP monitoring software reports the sites as down.


pull_request_template.md also works.


>Issue template filenames are not case sensitive, and can have an extension such as .md or .txt.


colinodell posted that before the blog announcement when we only knew about issue_template.md. It was to point out that you can do this with pull requests as well, not that it was case insensitive.


It supports procedural, functional, and object-oriented programming. You could even mix-and-match styles if needed.

Sure, it might not do them all 100% perfectly, but it does them well enough to get things done.


So why does this work?


...There was another answer here that seemed close.

I'm not sure the best way to express it, but here's what I've got:

Allow me to use a shorthand, N = AB where AB is shorthand for 10 * A + B, and B is the least significant digit. IF N is divisible by 7, then AB = 0 (mod 7). This allows us to do the following manipulations:

  AB = 0 (mod 7)
  10*A + B = 0 (mod 7)
  3*A + B = 0 (mod 7)
  5*(3*A + B) = 5*0 (mod 7) // EDIT: had -2 on the RHS, that was correct but confusing
  A + 5*B = 0 (mod 7)
  A - 2*B = 0 (mod 7)
So we've arrived at drfuchs' method. You only need to repeat the process until you've proven to yourself that A - 2 * B is divisible by 7 or not.

That's all I've got. I ran a half-marathon yesterday, and I've been up for 16 hours today. My brain might work better tomorrow.

EDIT: changed the steps a bit, had some unneeded ones. Also, this shows that you can use addition instead of subtraction, but you won't be moving towards 0, but you still have to be able to recognize that the new number is divisible by 7.


Thanks for this explanation! I was about to post something similar after working the math out, but I'm sure my answer would have been twice as long and less clear.


50 years from now this will be called "drfuchs last theorem"


with the scribble "but it took decades for me to realize why it obviously works" somewhere in the margins and stating that there wasn't enough room to write that down though..


You are subtracting enough 21s (ie: X * 21) to make the last digit zero. Since 21 is obviously a factor of 7, subtracting those should yield a factor of 7.

You can then divide by zero because if X is a factor of 7 and ends in zero, X / 10 is a factor of 7 as well.


21=3*7

you are subtracting multiples of 21, then dividing by 10, which is coprime with 7


The examples subtracted 10, 16, etc... Those aren't multiples of 21.


Since you scratched off the last digit, 10 is really 100, plus 5 for the digit you scratched off = 105.

105 is a multiple of 21.


I sometimes stumble upon old answers I posted to questions I currently have - is that a bad or good thing?


I see that as a good thing. I've bookmarked a fair few of my own answers to questions about programmatic management of IIS and .NET obscuria.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: