You are not logged in.
That's just ln|x-k|.
It is correct that it will have the digit 2, but what's more imortant is that it will always have a 1. Compare that to a double of a number from the sequence.
Hm, you have the correct answer for Q1?
Hm, I think we would be able to help you more if you tell us where this problem comes from.
Well, it's not primarily time that's making the matter hard. It's the concept of aging and also the concept of the speed of aging.
I have no idea... We should test that somehow.
Wonder when we will be the same age...
I do not know. Free will?
How do you know he is not?
Well, I guess that, as I get older and you get younger, such things will start to happen.
I don't think that is true. The problem is quite hard.
That is correct.
Now, think about what a sum of two such number looks like and what twice a such number looks like.
Also, did you see post #25?
Hmm, okay then.
Hi bobbym
Hi cooljackiec
I found that these numbers satisfy Q2.
I have been able to prove that fact, unless I make a mistake somewhere. I will post my proof, if needed.
Hi bobbym
Hi cooljackiec
I found that these numbers satisfy Q2.
Hi bobbym
Hi Bob
I got the same thing you did, but I am blind. I thought 1 was the a) option. ![]()
Hi bobbym
Hi bobbym
Hi bobbym
Hi niharika_kumar
Ok, we have N_b. Let's say N_b is in form of
. We want
Hm, unfortunately, just as I thought. This will be harder.
Hi bobbym
Oh, sorry, misread it. It seems like a mighty hard job counting them all.
Hi phanthanhtom