@Mego When it should be "don't make hard challenges unless you can accept the fact that they will get less activity simply because they're hard". Whether you blame "the users" or not, easy things will get more attention basically anywhere, because it takes less time and effort.
@Upgoat I still don't see why you think mine was insincere. Transposing is useful.
@El'endiaStarman that sounds like an easy bug to fix... unfortunately in node, it cannot cope with cyclic dependencies so my entire cheese is messed up ;-;
@Upgoat I avoid the problem of circular dependencies in Python by doing stuff like import pytek_nodes as pn and then putting all references to pn.* inside classes and functions.
I don't know if something similar is possible for node.
Pytek is intended to be an actual, mainstream language that aims to reduce the amount of programmer work, largely by identifying and leveraging common patterns, such as nested loops. There are two overarching goals: 1) make the computer do as much of the programming work as possible, and 2) succinctness is power - there are great benefits to saying much with few words.
@El'endiaStarman i have different problem. I have String class, and I have it's properties in seperate file. how to have each require eachother is idk, because node doesn't support cyclic dependencies
@El'endiaStarman the standard library is seperated from the string class because A) the string class is buried within Cheddar's internals B) stdlib is very interdependent on other stdlib modules
Application Developer at Harvard Medical School - Department of Biomedical Informatics (Boston, MA) http://stackoverflow.com/jobs/118924/application-developer-harvard-medical-school
@El'endiaStarman You can rename that branch to develop. And create a blank master branch with just like a README, etc. and use that on GH. that's my suggestion
@bkul I asked dennis. I'll ask for follow up
@Dennis update on Cheddar for TIO? :3
@bkul hm, I might work on a REPL. If I can get a nice syntax-highlighted terminal/textbox thing
Definition
Define the nth term of the CRAU sequence as follows.
Begin with the singleton array A = [n].
Do the following n times:
For each integer k in A, replace the entry k with k natural numbers, counting from 1 to k.
Compute the sum of all integers in A.
For example, if n = 3, we start ...
I'm calling it a dupe of a previous (disguised) binomial challenge. Maybe you can instead have the output be the full list without summing? — xnor1 min ago
I was going to ask for the full list initially, but I thought the sum would be easier to verify...
What do I do now? Changing to full lists invalidates all answers...
@xnor I'd be interested in hearing an alternative explanation - the only one I have in mind is taking the simplicial polytopic numbers formula and subbing d=n+1
in ti 84, logBASE(16,2 creates a magical number 4 whose integer part is 3 and fractional/decimal part ise one. So, flooring this magic four yields three. This is the only such integer I can find
Definition
Define the nth array of the CURR sequence as follows.
Begin with the singleton array A = [n].
For each integer k in A, replace the entry k with k natural numbers, counting up from 1 to k.
Repeat the previous step n - 1 more times.
For example, if n = 3, we start with the array [3]...
@Sp3000 Let's represent the evolving list as a tree whose nodes (including internal ones) are labelled by numbers. Each time you replace a number k with 1..k, you put those as the leaves of the k node. We start with just the node n. The question is then the sum of the leaf values after n replacement steps, or equivalently, the number of leaves after n+1 replacements steps.
@Sp3000 Now, note that each leaf corresponds to a non-decreasing sequence of numbers as you walk down to it from the root. It starts at n and has at most n+2 values. In fact, each such sequence corresponds to a leaf. So, it remains to show there are choose(2*n,n+1) such sequences.
@Sp3000 Let's remove the root n at the start of each sequence, and pad them all to length exactly n+1 with 0's at the end. Then, each sequence is produced by starting at n and performing operations of either print or decrement, with print happening n+1 times and decrement happening n-1 times. These are 2*n total operations, and we need to choose which n+1 are print.
An alternating sign matrix is an n by n matrix consisting of the numbers -1, 0, 1, such that:
The sum of each row and column is 1
The nonzero entries in each row and column alternate in sign
These matrices generalise permutation matrices, and the number of such matrices for a given n was of i...
@Sp3000 This also gives a strange method of solving the revised challenge: Take all lists of n numbers in [1..n], filter for sortedness, take the first elements
Definition
Define the nth term of the CRAU sequence as follows.
Begin with the singleton array A = [n].
Do the following n times:
For each integer k in A, replace the entry k with k natural numbers, counting from 1 to k.
Compute the sum of all integers in A.
For example, if n = 3, we start ...
MATL, 5 bytes
EGqXn
Try it online!
An alternating sign matrix is an n by n matrix consisting of the numbers -1, 0, 1, such that:
The sum of each row and column is 1
The nonzero entries in each row and column alternate in sign
These matrices generalise permutation matrices, and the number of such matrices for a given n was of i...
