I would use a language, such as Perl, with which I could easily link to the web page for the Online Encyclopedia of Integer Sequences, using the URL http://www.research.att.com/~njas/sequences/index.html?q=2,4,6,8,10,12&language=english&go=Search (note that the sequence is imbeded in the URL) and output the response, which in this case includes 164 different sequences containing this sequence, the first few of which are the even numbers, the products of the digits of n, Values taken by totient function phi (m), n + product of nonzero digits of n, n + reversal of digits of n, and so forth.
Dave On Oct 29, 7:19 am, Pawandeep <[email protected]> wrote: > hello everyone , > you are given a series of numbers like > > 2,4,6,8,10,12............this is simple though > > nd u hve to identify that f(x) = x+ 2 for this series .. > > now can you write a program to identify the f(x) for any series of > numbers.. > > // i know it is tough but don't say its not possible --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
