Related changes

Enter a page name to see changes on pages linked to or from that page. (To see members of a category, enter Category:Name of category). Changes to pages on your Watchlist are in bold.

Recent changes options Show last 50 | 100 | 250 | 500 changes in last 1 | 3 | 7 | 14 | 30 days
Hide registered users | Hide anonymous users | Hide my edits | Show bots | Hide minor edits
Show new changes starting from 00:56, 11 April 2025

List of abbreviations:

N: This edit created a new page (also see list of new pages)
m: This is a minor edit
b: This edit was performed by a bot
(±123): The page size changed by this number of bytes

8 April 2025

m 21:41

Book:Richard Earl/The Concise Oxford Dictionary of Mathematics/Sixth Edition‎ diffhist −1‎ Prime.mover talk contribs

20:59

Definition:Attractor‎ diffhist +268‎ Prime.mover talk contribs

			N 20:58		Definition:Attracting Fixed Point‎‎ 2 changes history +1,394‎ [Prime.mover‎ (2×)]
			m		20:58 (cur \| prev) 0‎ Prime.mover talk contribs
			N		20:55 (cur \| prev) +1,394‎ Prime.mover talk contribs (Created page with "== Definition == <onlyinclude> Let $x_{n + 1} = \map \phi {x_n}$ be a direct iteration for the purpose of finding a solution to the equation: :$x = \map \phi x$ for some real function $\phi: \R \to \R$. Let $\alpha$ be such that $\alpha = \map \phi \alpha$. Let $\sequence {\map \phi {x_n} }$ converge to $\alpha$ for $\size {x_0 - \alpha}$ Defin...")

N 04:59

Definition:Attainable Set‎ diffhist +1,033‎ Prime.mover talk contribs (Created page with "== Definition == <onlyinclude> Let $G = \struct {V, A}$ be a digraph. Let $u \in V$. The '''attainable set''' of $u$ is the set of all vertices of $G$ which are reachable from $u$. </onlyinclude> == Also see == * Definition:Reachable * Definition:Reachability Relation {{Link-to-category|Attainable Sets|attainable sets}} == Source...")