Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
0
votes
0
answers
98
views
Possible shifts in finite elementary cellular automata
I investigated the long term behaviour of a pair of black cells ■■ on a circle of $N$ cells under the action of each of Wolfram's rules $R$. For each combination $(R,N)$ I determined the first occurre …
1
vote
0
answers
372
views
Astonishing affinity of Wolfram's rule 110 to the numbers 2 and 7
I investigated the evolution of a single black cell on 1-dimensional grids with periodic boundary conditions of variable sizes $N$ under Wolfram's rule 110 which is the only one for which Turing compl …
5
votes
1
answer
494
views
Explaining patterns in modular multiplication graphs
Let the multiplication graph $n/m$ be the graph with $m$ points distributed evenly on a circle and a line between two points $a$, $b$ when $an \equiv b\operatorname{mod} m$.
These graphs often look s …
6
votes
3
answers
678
views
When is $2\varphi(n) > n$ – and how to prove it?
When coloring the squares of the Ulam spiral not only by black and white (for being prime or non-prime) but by shades of grey representing the normalized totient function $\varphi(n)/n$
and display …
2
votes
When is $2\varphi(n) > n$ – and how to prove it?
I'd like to sum up some specific parts of Wojowu's answer:
The smallest odd $n$ with $\varphi(n)/n = \prod_{p|n}(1-1/p) \leq 1/2$ is $105 = 3\cdot 5\cdot 7$
$\varphi(n)/n < 1/2$ also for
$3 \cdot …
1
vote
1
answer
374
views
Why is $n_{n^2-1}$ the smallest graph that clearly shows the structure of multiplication by ...
Initially, I wanted to ask this question as a puzzle.
Consider a regular $m$-gon. Let $0$ be the lower corner and count the corners clockwise.
Let $n_m$ be the multiplication-by-$n$-graph of …
3
votes
0
answers
236
views
Visualization of hidden structures in numbers
[Please allow me a note: The way desribed below allows to depict functions $f:X^2 \rightarrow Y$ completely in two dimensions (without hiding or omitting any information). This allows for depicting fu …