Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
daef
10 months ago
|
parent
|
context
|
favorite
| on:
Where do those undergraduate divisibility problems...
i couldnt come up with a proof for the initial problem (n^6+n^3+2n^2 is a multiple of 6 for every n)
because it's not true (simply insert 1, 2, 4 or 5)
goldencoralefan
10 months ago
[–]
You’re missing a term: n^6+n^3+2n^2+2n
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
because it's not true (simply insert 1, 2, 4 or 5)