« first day (1890 days earlier)      last day (3118 days later) » 
00:00 - 22:0022:00 - 00:00

12:09 AM
I have a question of something I am confused about in topology
A subbasis for a topology on X is collection of subsets of X whose union equals X.
if we have a concrete example let X = {a,b}
what would be a subbases o X
why is the following a subbases
S = S` U {X} where S` subset P(X)
 
oh thats really tiring, feeling already asleep
 
according to the definition
lets take S` = {{a}}
so S = {{a}} U {{a,b}}
do we take the elements inside our S or the normal union
that is do we take {a,b} U {a}
or {{a}} U {{a,b}}
 
gd night mathers. keep doing maths for good health
 
12:34 AM
@KarimMansour that's not the definition of subbase
 
that is how it is defined in munkres
 
the "whose union equals X" part doesn't even say the sets are open!
give a verbatim quote of munkres' definition
 
ok 1 sec
 
the definition you're quoting builds topologies from subbases, rather than defines subbases of a given topology
it's a bit backwards
 
I thought it would be elements
of X
but according to the definition nothing is a subbases since collection of subsets of X is elements of the powerset
so how can we get X out of it
 
12:38 AM
Does anyone have any experience with constructing Lyapunov functions? :)
 
I am very confused
 
{{a},{b}} is a subbase for X
because the union of {a} and {b} is X
 
oh so its union of elements of the collection
 
yes
 
because according to how they write it
it is akward
 
12:40 AM
given any collection $C$ of sets, the union $\bigcup C$ means $\bigcup_{c\in C}c$
it's set theory shorthand
 
ohh
oke
I didn't know
yeah this seems the case because the way I thought about it at first wouldn't made any sense at all because they would be elements of the power set not of X
just wanted to make sure
 
 
1 hour later…
1:46 AM
Hey, can anyone help me clear something up with the statement of this problem? Suppose n in N. Given a pair of polynomials f_n, g_n s.t. deg(g_n) < deg(f_n) and deg(g_n) < n , the Euclidian Algorithm for computing gcd(f_n,g_n) takes at least n steps.

I'm making an example with f=x^3, g=x^2, so deg(g)=2 < deg(f)=3, but how does this part look: deg(g) < n ?
 
 
1 hour later…
MGA
3:00 AM
I need a hint on how to get started on this problem: let U be a subspace of polynomials of degree 4 or less such that p(2) = p(5). Find a basis of U.
 
3:40 AM
hi.
So, do you suppose that you can find any arbitrary number of digits from pi, in the decimal form of $\sqrt 2$?
$\sqrt$2
just a funny thing I was going to ask on SE, but thought I'd try chat.
 
 
1 hour later…
4:44 AM
@anon here?
 
just got here
 
So this question just occured in my mind
Suppose you have topology $T_1$ on X
is there a way to get construct a sequence of topologies $T_n$ such that $T_{n - 1} \subset T{n}$ in which there is no finer topologies in between ?
@anon?
 
@theDoctor there are multiple ways to interpret your question, but they all have the same response: whether or not pi is a "normal number" (keyword to search) is an open question
 
Did you just make up that term?
 
no
(which you would have found out by searching the keyword)
@KarimMansour hard to say. I'll have to think about it more later.
my guess would be not in general
 
4:59 AM
yeah I think so too
 
I've not found "searching" completely reliable.
Has anyone else ever heard of pi being a "normal" number or not?
 
People talk about that an infinite, non-repeating sequence (i.e. an irrational number) will have every number possible of finite length. I'm just wondering if you can interpret my question about whether pi can be found in the irrational number sqrt(2).
change "will have" to "will possess" for clarity.
 
if pi is a normal number, in any base it contains any finite string of digits in that base. which would mean any finite segment in sqrt(2)'s representation in that base can be found somewhere in pi's representation in that base.
beyond that idea, you'll be out of luck
 
thank you, that is what I was looking for.
Now, what the heck did that have to do with some concept of "normal number"?
 
Huy
5:11 AM
@anon any reason why you'd say no? I feel like there should be a way, but can't come up with a construction
 
if we take the poset of all topologies on a set, ordered by inclusion, we're essentially saying the upward-closed open intervals all contain a minimum, which seems too orderly.
@theDoctor if you read what I wrote, you will understand
 
Huy
@Karim: Do you want to post on main?
 
Yeah I will
 
Huy
Ping me when you did please.
 
Huy
5:18 AM
thx
 
 
3 hours later…
8:50 AM
@Chris'ssistheartist Nice. The last part is even better in languages with more letters.
 
@TobiasKildetoft hehe, right, in Romanian language 31 letters. :-)
 
wow, that's a lot. We only have 29 (and there are a few we hardly ever use anyway, such as w)
 
Yeah, compared with other languages, there is a lot.
 
I've run out of colored pens... I can always open a vein...
7
 
Hello@TobiasKildetoft
 
8:54 AM
@Rememberme Hi
 
9:12 AM
I am starting to really appreciate how powerful a theorem the Perron-Frobenius theorem for totally positive matrices is.
 
9:23 AM
@robjohn Ouch!
 
10:11 AM
This is the world we live in, for many it is very convenient that you are on the left side of that page, to convince you to stay there, to be controlled a whole life, to stay in their shadows, and never dare to excel and try to be far beyond all of them in terms of performance.
From my experience, those that like to control the others (only) are also very poor in terms of performance, they excel by controlling, not by worthy deeds. A performant system never keeps them there up, but the environments, systems are not the way I wish them be.
to be
Back to my research.
 
@Chris'ssistheartist you wrote this ?
 
@Agawa001 It seems so. It was related to the picture above.
 
@Chris'ssistheartist im talking about the picture
 
@Agawa001 No, I didn't, but I received it from a friend.
 
@Chris'ssistheartist because the calligraphy seems to come from an artist
 
10:25 AM
@Agawa001 :D
 
yes, its so consistent and perfect, a mather would never handwrite like this
oh, lets not bring out doctors
 
dunno actually what to do, either finalizing my last answer or go face some stupid problems outside
maybe i would let this for the weekend , see ya friends!
 
11:03 AM
Now I understand why this question has received a lot of attention. Unfortunately only one of the answers is shown there.
I never noticed that that answer had the wrong value for $e$ :-)
 
Anybody want a reasonably easy mechanics question that I can't solve?
 
@Newb Just ask. If someone can help, they will probably chime in :-)
 
Okay, suppose you've got a car that needs to cover a distance of 1km as quickly as possible. It starts with a velocity of 0 and must stop at the end of the track.
It can accelerate at a rate of 0.1ms^2 and decelerate at a rate of -0.5ms^2
How quickly can the car cover the track? N.B. it has no top speed.
I've been trying to plug this in to the equations of motion and to use my normal bag of tricks from calculus to minimize the time, but to no avail
 
@Newb Note that the top speed needs to be braked for $\frac15$ the time it takes to accelerate to it.
 
@robjohn I noticed this just now.
As in: I noticed this half an hour ago, tried it, but accidentally used a 1:4 ratio rather than 1:5
no wonder the arithmetic never worked out
 
11:18 AM
$\overbrace{\frac12(.1)t^2}^{\text{accelerating}} +\overbrace{\frac12(.5)\frac{t^2}{25}}^{\text{decelerating}} =1000$
where $t$ is the time to accelerate to top speed
I get somewhere near $154.9$ seconds
 
in the decelerating brace, where did you get the denominator from?
the 25
 
@Newb the time spent decelerating is $\frac15$ the time spent accelerating
 
yes, but I'm still not sure why that gives you \frac...{25}
 
See the LaTeX link if you don't have ChatJax installed.
@Newb the distance taken to accelerate is $\frac12(.1)t^2$, the distance taken to decelerate is $\frac12(.5)\frac{t^2}{25}$
using $d=\frac12at^2$
 
11:34 AM
running ChatJax now, thanks
It's still not clear to me why you have $\frac{t^2}{25}$ as opposed to \$\frac{t^2}{5}$
 
@Newb You are squaring $\frac t5$
 
oh, of course.
in the equations of motion that I'm referring to, this seems most closely related to $r = r_0 + v_0t + \frac12 at^2$
and what I'm curious about is why we can do without the $v_0t$ in the decelerating step
in acceleration that's easy: we start from rest. But in the decelerating step, we're already travelling at some velocity.
@robjohn
 
@Newb because we are starting and ending at rest
@Newb we are decelerating to rest
 
sure, but in the decelerating step, what's implicitly going on is that we're "starting" halfway through the track with some velocity, right?
the way I think about it is that for the accelerating step, we get $r = 0 + 0t + \frac{0.1t^2}{2}$
 
11:49 AM
@Newb not halfway, but part way
 
and for the decelerating step, we get $1000 = r + v_0t - (.5)\frac{t^2}{25}$
sorry, I meant partway. tired.
 
the acceleration constant "a" is a negative number, right?
 
@Newb look at the decelerating step backwards. you end at $0$ m/s and so it takes a distance of $\frac12(.5)\frac{t^2}{25}$
 
Oops, wrong. Sorry :(
 
12:24 PM
Hello
I have a number theory question
 
12:48 PM
My research just reveals another amazing result ...
 
1:00 PM
congrats :)
 
I wonder where integrals like x^m log (sin x) come from and how one would know to study it ijpam.eu/contents/2014-91-1/11/11.pdf
 
 
1 hour later…
2:11 PM
Hello there
I can't figure out how you call an operator that has this property: $T: X \to X$, $T$ is linear and $(X, \leq)$ is a partially ordered space. Now $T$ has this property $T(Y) \leq Y$ for all $Y$. Should I call this a contraction?
 
@PantelisSopasakis It would sort of depend on the context, but it certainly seems like it might fit.
 
can your Mathematica find the closed form of this one? $$\int_0^1 \int_0^1 \int_0^1 \frac{1}{(1 + x) (1 + y) (1 + z) (1 - x - y - z + x y + x z + y z + 7 x y z)}
\ dx \ dy \ dz$$
 
@Chris'ssistheartist I will try when I go to that computer.
 
@robjohn K
@robjohn My Mathematica suggests one closed form when using numerical approximation, and another value when using the symbolic approach.
 
2:38 PM
I have to prove that a compact complex submanifold of $\mathbb{C}^n$ is discrete, could someone help me get started?
I have no idea where to start on things like this
 
@Krijn Think about the coordinate functions.
 
Aren't they just identity functions?
 
@Krijn They are functions from the submanifold to $\mathbb{C}$. What else do you know about them?
 
They are holomorphic
 
Good. And?
 
2:43 PM
And have some compatibility between them
 
Well, that's not important, look at each on its own.
 
Okay, so just a map from an open subset of the submanifold to $\mathbb{C}$ thats holomorphic?
 
@Krijn From which open subset?
 
Well, for every point on the submanifold, some open subset containing it
Let's call the coordinate function of $x$ $\psi_x: U_x \to \mathbb{C}$
But I would say that $\psi_x$ just maps every point in $y \in U_x$ to $y \in \mathbb{C}$?
 
@Krijn Well. I didn't mean coordinate charts. I meant the coordinate functions $(z_1,\dotsc,z_n) \mapsto z_k$.
 
2:47 PM
Oh sorry, yeah okay.
The course is in Dutch, so I sometimes confuse English terminology
 
No need to be sorry, it wasn't unambiguous.
 
I feel that because the submanifold is compact, this should tell me something about these functions
Some sort of boundedness
 
Yes, the manifold being compact tells you something about the image of these functions.
 
Obviously, at least one coordinate function is not surjective, because $\mathbb{C}^n$ is not compasct
compact*
 
What do we know about the functions $\pi_k \colon M \to \mathbb{C},\; \pi_k(z_1,\dotsc,z_n) = z_k$?
 
2:56 PM
They are injective, holomorphic, ...
No nevermind, not injective
But I 'm not feeling in which direction you want me to think :(
 
Holomorphic $\implies$ continuous, so?
 
Well, yeah, they are continuous of course
 
And $M$ is compact.
 
So their image is compact
 
Aha.
Part 1.
Now, what do you know about non-constant holomorphic functions whose domain is connected?
 
2:59 PM
Ahhh
A holomorphic map cannot be unbounded on a compact set
So these maps must be constant holomorphic maps
 
@Krijn Right (well, constant on each connected component of $M$), but your argument for that is not yet complete.
 
At least on all the connected parts in $M$ these functions are constant, right?
So every connected part is just one point, which means that it is discrete
 
@Krijn Right. But we need a complete proof of that.
 
Yeah, that's true
But I thought that this was sort of Heine-Borel-y
And somehow, this should be different between $\mathbb{C}$ and $\mathbb{R}$ but I don't see why
Ah I just noticed the difference lies in the holomorphicness of the maps
Okay, let $x \in M$ and $U$ be a closed subset containing $x$, then the coordinate function $\pi_k$ from $U$ to $\mathbb{C}$ is holomorphic and continuous and therefore $\pi_k(U)$ is compact and therefore $\pi_k: U \to \mathbb{C}$ is bounded thus constant. So $U = \{ x \}$.
 
3:20 PM
If you choose $U$ to be closed and nothing else, you don't get the desired conclusion.
 
Connected also?
 
That, but that's not enough, $\overline{\mathbb{D}}$ is a connected closed subset of $\mathbb{C}$, but the identity isn't constant on that.
What theorem do you want to apply to conclude the functions are constant?
 
Liouvilles
 
That deals only with entire functions, doesn't apply here.
 
Ahh, yes, thats the fallacy.
But somehow it works if its compact
Atleast, that was sort of the proof that there were no non-constant elliptic functions, in this class
 
3:26 PM
hmmm, it would be awesome to have my own journal (dedicated to the stuff I like) ...
 
But I guess those were entire functions
 
@Krijn Non-constant holomorphic functions on a connected set. Does that ring a bell?
 
Ringing is a strong word for this
It somehow reminds me of the open mapping theorem
 
@Krijn That sounds like something useful.
 
Let me check wikipedia to freshen up my memory of that
Bu the open mapping theorem deals with open maps, while I was working with closed connected sets.
It probably has some smart application here, but it's not quite clear to me
 
3:48 PM
So we're taking a connected subset $U$ of $M$ and looking at its coordinate function, and we know that $\pi_k(U)$ is compact. Then we are trying to prove that it is constant, so we assume that it isnt, then be the open mapping theorem, $\pi_k$ is an open map, i.e. sends open sets to open sets.
 
It would be useful if the connceted components of $M$ were known to be open (in $M$), wouldn't it?
 
Ha, I was just typing that, but wasnt sure of that
It seems pretty logical to me, but then, topology usually has some nasty counterexamples
 
@Krijn Well, but $M$ is a manifold, those tend to have some nice properties. What properties of a topological space guarantee that the connected components are open?
 
If there are only finitely many connected components I would guess that they are open in $M$
 
@Krijn Right. Unfortunately, compact alone doesn't imply finitely many components.
 
3:54 PM
Probably a manifold has open connected components
 
Yes. Why?
 
a compact manifold*
Hmm, let me think about that
 
Compact isn't relevant for that.
Need not even be a differentiable manifold, topological manifold is enough.
 
I do not really have enough feeling for this
Manifolds are quite nice, so connected components are quite nice
Because they are manifold, cant we just take the inverse image of the open ball in their charts
 
@robjohn after I've written up the solutions to the triple integral (the old version) I'll send it the file to you.
 
4:00 PM
Sorry, thats written really confusing, that I mean is:
Let $x \in M_i$ where $M_i$ is the connected component. Then we have a continuous chart to $\mathbb{C}$ and in $\mathbb{C}^n$ we can just take a small enough open ball around $x$, then its original in $M_i$ is open.
The first $\mathbb{C}$ should be $\mathbb{C}^n$
 
I'll send the file to you.
 
@Krijn To use a few bigger words, manifolds are locally (path-)connected. And the connected components of locally connected spaces are open.
 
Yeah, I'll have to check the details for that... But that will be fine. I'll think about what happens if $\pi_k(M_i)$ is open and compact
 
So, the connected components of $M$ are open (in $M$). Thus you can apply the open mapping theorem to the component $M_i$. They are also closed (connected components are always closed), hence compact.
@Krijn Well, since it's compact (and nonempty), it's not open.
And thus the open mapping theorem says?
 
That it is open and compact, which is contradictory
So $\pi_k$ is constant on connected components
Therefore all connected components are single points
And in turn $M$ is discrete
 
4:09 PM
@Krijn Not quite. If a $\pi_k$ were non-constant on $M_i$, then $\pi_k(M_i)$ would be open. So it follows that all $\pi_k$ are constant on $M_i$.
 
Isnt that what I said?
It was atleast what I meant, but my wording may come of wrong
 
@Krijn Well, the first line said something different. The rest is correct.
 
Ah yeah thats worded quite confusingly
Thanks for your great help, you really are an amazing addition to this site
5
 
4:31 PM
he's an additional priceless feature
 
@BalarkaSen I am very excited. A copy of Dummit and Foote has arrived in my school library
 
4:48 PM
Could someone of you take a look at my question:
0
Q: Signed curvatures

Mary StarLet $\textbf{$\gamma$}$ and $\textbf{$\tilde{\gamma}$}$ be two plane curves. Show that, if $\textbf{$\tilde{\gamma}$}$ is obtained from $\gamma$ by applying an isometry $M$ of $\mathbb{R}^2$, the signed curvatures $κ_s$ and $\tilde{κ}_s$ of $\textbf{$\gamma$}$ and $\textbf{$\tilde{\gamma}$}$ ar...

?
 
@Chris'ssistheartist The one that Mathematica could reduce to PolyLogs?
 
5:06 PM
@Alizter Cool!
Let me know if you have any questions.
 
5:30 PM
@robjohn Yeah. Sorry, I was away for some jogging.
Today I also had to give up 3 puppies, and now all my day is somewhat ruined. There was a strong connection amongst us, but I couldn't keep more dogs.
 
@Chris'ssistheartist You raise dogs ?
 
@Ramanewbie I have some dogs but I cannot say I do it as a job.
 
@Chris'ssistheartist So you don't earn money for keeping them ?
@Chris'ssistheartist Or are those your dogs
 
@Ramanewbie Never, the last time I paid for the puppies to be taken, that is today.
 
@Chris'ssistheartist Ok...
 
Huy
5:35 PM
@Chris'ssis: What kind of dogs do you have?
 
@Huy stray dog (is it the right way to say it?)
 
Huy
I'm not sure what you mean and I wouldn't know either in English. I meant like what breed are they?
 
@Huy They are from mixed breed.
 
Huy
ah, ok
I'm sorry that you have to give up puppies. I love dogs.
 
cross-breed dogs
 
Huy
5:39 PM
yes, mixed breed and cross breed are the same I think
 
@Huy Yeah, it's very hard to give them up, especially after a certain connection to them is established.
 
Huy
yes, I can imagine. I've never had dogs because my father didn't want any. after I am done with my degree, I will probably get a dog sooner or later.
 
@Huy It will change your perspective on life. We'll talk about it after you have bought one. :-)
 
Huy
it will probably not be before 2-3 years from now, but I am sure you and I will still be doing maths then. :)
 
:D
I often think that the problems of the real life are so hard, even in the case with the puppies, I wasn't able to find a solution that makes me happy, they cannot ever be compared with the hardest math problems I ever met.
 
Huy
5:44 PM
yes, real life problems often don't have a solution that is even remotely satisfying, unfortunately.
 
I didn't have better solutions.
I'm unhappy without them and they are unhappy without me. Hope they will be fine sooner than me.
 
Huy
I hope you will both be fine soon.
 
6:11 PM
i saw another answer which differs lil bit from mine. maybe i chose a longer way
 
good evening everybody
 
gd evening
 
@AlecTeal turns out that when people ping you as @Ale they ping me instead! (but you were in the chatroom when it happened yesterday so you didn't miss any message that was addressed to you)
 
@Alessandro I heard the noise yesterday and in the end thought I imagined it
Today, I got it, but no alert. If someone pings you please forward it to me.
 
I wonder how it decides who to ping, since your name comes before mine in alphabetical order and I was pinged instead of the user called "Alex"
it happened only once so far, but I'll forward the messages to you if that happens again in the future
 
6:50 PM
thus , one cant ping himself
 
no, I tried it too earlier ahah
 
7:15 PM
oh dear, the most torturing geometrical dilema i v ever encountered, the other answer is just two lines :S
 
what's the question?
 
need another dose of capuccino,bbl
 
@anon you here?
 
Let $F$ be a field and let $G = F \times F$. Define multiplication and addition on $G$ by setting $(a, b)+(c, d) = (a+c, b+d)$ and $(a, b) \cdot (c, d) = (ac, bd)$. I want to check whether these operation define a field structure on G. But how do I check associativity for example?
 
8:10 PM
@Chris'ssistheartist There was a stray cat outside, one that we'd seen before around our house. It was really being friendly towards me and my wife, but we have three cats already, so we really can't bring in another. It is not around every day, so it probably lives somewhere else. It may have been locked out this morning and that is why it was so friendly to us today.
It was hard not to bring it in, but it did not seem to want to come near our dog anyway.
I put a small dish of water out in case it needed some.
 
@robjohn My dogs don't like the cats at all either. :-)
@robjohn The thing that hurts me more is somewhat a metaphysical one and it's related to the fact that we are limited to do the good (or I'm limited to see the ways to do the good in all circumstances - I failed with the puppies).
@robjohn not all people here are careful with the dogs, so this is an important detail. When you give them up you never know how they are going to be treated.
 
I am looking at my question from yesterday:

Does the following inequality hold?

$$|-\frac{5}{24}h^2f^{(4)}(x_1)+\frac{64}{24}h^2f^{(4)}(x_2)-\frac{81}{24}h^2f^{(4)}(x_3)| \\ \leq |-\frac{5}{24}h^2+\frac{64}{24}h^2-\frac{81}{24}h^2|\max_x |f^{(4)}(x)| \\ = |-\frac{22}{24}h^2| ||f^{(4)}||_{\infty}= \frac{22}{24}h^2 ||f^{(4)}||_{\infty}$$

where $h>0$

I used the Taylor expansion three times, once for $f(x+h)$, once for $f(x+2h)$ and once for $f(x+3h)$ and the $f(x_1), f(x_2), f(x_3)$ of the above expression are the remainders of each expansion. Do we know if they have all the same sign? @ro
 
hello @evinda!
 
Hi @Alessandro !!!
How are you?
 
very good thanks, you? The classes at uni are great! @evinda
 
8:23 PM
Fine, thanks :) Oh nice!!! Which subjects do you have now? @Alessandro
 
@MaryStar Please use \left and \right to make the | and \| delimiters match their contents. This will make things much easier to read.
@MaryStar How would we know they have the same sign?
 
@robjohn I thought that they all were positive since they are the remainder of a taylor expansion. Is this wrong?
 
@evinda The courses for this semester are real analysis, linear algebra, intro to informatics and physics (I don't really like physics, but I can't avoid it).
 
@MaryStar Why would that be? There is no reason to think that is true.
 
@Alessandro Aha... Nice :)
 
8:27 PM
@robjohn Ok... Does the above inequality stand in any case?
Or does it only stand if we knew that all the terms have the same sign? @robjohn
 
@MaryStar not even if they have the same sign. Take for instance $f^{(4)}(x_1)=f^{(4)}(x_3)=1$ and $f^{(4)}(x_2)=0$ and $h=1$. Then the left side is $\frac{86}{24}$ and the right side is $\frac{22}{24}$.
 
8:44 PM
Do you still the bunnies @robjohn?
 
@Rigor we still have the bunnies, yes
 
*have :(
 
who steals poor bunnies !
 
Nice avatar @Agawa001
 
do you like my new dress ?
 
8:54 PM
:-)
 
its better than a simple identicon isnt it
 
Much better
 
i was thinking that @Alessandro' s avatar is just a white blot
optical-illusive
and evinda's is like morphing from time to time, or is it just me ?
 
@Agawa001 who said anything about stealing bunnies?
 
It's just you @Agawa001 she has had the same avatar as long as I can remember :-)
 
9:03 PM
@robjohn i misread do you still, as do you steal.
@Rigor no, the image is changing, like a png
just meditate ...
 
Ooohmmm
 
i havent said practise yoga, just concentrate
oh just now!
 
:D
 
these white sparks are accentuating from time to time
 
Perhaps
 
9:26 PM
Did anyone hear news about A Beautiful Mind
 
^ i know a movie entitled so
 
@Agawa001 In fact I'm talking about a MSE user...
Who I haven't seen for months
 
@Ramanewbie he keeps in touch with some of the users in the English Language & Usage chatroom.
 
@Rigor And do you know how I can search people pseudos in stackexchange ?
I see no rubrik for that at http://stackexchange.com/ ...
 
MGA
I'm doing an exercise and I think I've solved it but I'm wondering if there's an easier way ...
Let U be the subspace of polynomials of order 4 or less, such that p(2) = p(5)
Find a basis of U
 
9:44 PM
I don't think there is any rubric for that kind of search @Ramanewbie What do you mean by pseudos?
Their previous username?
 
@rigor just their name. For instance yours is 'Rigor'.
 
@Ramanewbie what is it you want to find?
 
Just use the "User" search at the top of the main page @Ramanewbie
 
@Robjohn I would like a way to find a user's profile page by giving his/her name
 
@Ramanewbie usernames are not unique. You can only find someone uniquely by their ID.
@Ramanewbie You can search on the Users page...
 
9:49 PM
@robjohn Then I enter a username and it returns all people with this username
What is the Users page ?
 
@robjohn Thanks
 
Too bad Brian M. Scott doesn't come here anymore @rob
Wow! Only 30k behind André
and he has more medals!
 
00:00 - 22:0022:00 - 00:00

« first day (1890 days earlier)      last day (3118 days later) »