|
Home > Archive > Unix Programming > January 2004 > Number sequences, programming, preparing for Programming Competition
You are viewing an archived Text-only version of the thread.
To view this thread in it's original format and/or if you want to reply to
this thread please [click here]
| Author |
Number sequences, programming, preparing for Programming Competition
|
|
| Peteris Krumins 2004-01-23, 5:13 pm |
|
Hello,
As programmers are very smart and mostly well educated
with a strong mathematical background, I ask this question
here as well as sci.math and sci.math.num-analysis by posting
a this message to each of those groups.
I am preparing for a student programming competition and from
the previous year experience I know that there are 2 'simply
programming' problems and a single one which involves strong
mathematics.
I am very experienced programmer (6years +) so
those 2 'simply programming'
are not problems for me. But to win the competition I have
to solve all three problems.
So I post to ask the math questions I would like get explanation
for and an advice on resources for further reading. (Yes, I know
google but I dont know what to search for, suggest me after looking
at the problem. At least I was not able to found suiting
papers(docs)).
One of the problems I don't know answer is:
A sequence of number powers of 2 starting from 1 is given,
find the Nth digit of the sequence.
Example:
1 2 4 9 16 25 36 49 64 81 100 121 144 ...
7th digit is 2, 14th is 4, etc.
Thanks,
P.Krumins
|
|
|
|
|