User Portlet
Featured Contributor
| Discussions |
|---|
| Here is an idea to display a [CellularAutomaton][1] evolution where every updated cell shows the neighborhood above it. This might be helpful when explaining to someone how it works. ![plot of rule 30 for 4 steps][2] ECAPlot[history_,... |
| There are many different kinds of groups, and some have better ways of doing them in Wolfram Language. For finite groups there are permutation representations (see the [tutorial][1]) For continuous groups with matrix representations, you could go... |
| Here's an idea for a new function. I don't know what its name should be but it would be nice to make some of the graphics you see in [A New Kind of Science (Wolfram 2002)][1] like this one of rule 1599 ![code 1599][2] like the one found on... |
| Thanks Mark for posting this summary of the World Cup. I wonder about kids and passing, because I have seen them do it in practice. Maybe because the reliable distance of their passes is smaller, they need more players on the field. In the above... |
| Unfortunately this neat idea is unlikely to work. The parameters are the values of each letter and the base value, which would be 27 variables (or maybe a few more letters used in languages besides English), but the number of equations that would... |
| Good work! Glad to see you've done another Mentorships project. Sounds like you found that having more data makes it work better. |
| I think you probably want to define your own function, because the builtin functions (that I am aware of) behave differently. For example, it could be (to get n bits) Two[n_,x_]:=IntegerDigits[2^n-x,2,n] Note that BaseForm is good for... |
| I was thinking this could be a classroom discussion idea, but I would also be interested in what people think (or what any machine thinks). How much of a pie is a slice of pie? or what is the maximum before any more pie counts as too much pie. ... |
| Your syntax is a little unusual, but it did work. The error message is coming from the rule, which gets evaluated before being applied. It is at the lowest level, the second part of ReplaceAll[string, rule] where the rule has its right... |
| Thanks for sharing this sequence. I wonder if this isn't obvious somehow, but the blocks of size larger than 1 are not equally distributed. For size 2, it is about twice as likely to not have a repeat, n = 15; ko = Prepend[Nest[ ... |