Wikipedia:Reference desk/Archives/Mathematics/2008 June 14

Mathematics desk
< June 13 << May | June | Jul >> June 15 >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


June 14

edit

Shift registers

edit

Would someone like to check whether Fibonacci registers with taps in this table [Xilinx table] for 12 13 14 16 or 19 bits are maximal as claimed? (Question posed at Talk:Linear feedback shift register) Cuddlyable3 (talk) 12:15, 14 June 2008 (UTC)[reply]

I need more help translating currency

edit

What is the difference of L500,000.00UGSP and L450,000.00GSP ? —Preceding unsigned comment added by 151.213.231.202 (talk) 15:44, 14 June 2008 (UTC)[reply]

I don't recognise those abbreviations. What does the L stand for, and what do UGSP and GSP stand for? If you aren't sure either, could you describe the context you found these numbers in? --Tango (talk) 16:18, 14 June 2008 (UTC)[reply]

50,000 L ? Lira? GSP more context needed please...87.102.86.73 (talk) 19:41, 14 June 2008 (UTC)[reply]

hypergeometric series??

edit

I mentioned in an earlier question a differential equation I was having problems with..

I found the solution to this in terms of an infinte polynomial in x where the coefficients were:

an+2(n+2)(n+3)=pan+1+qan

p and q are any number in general. (In general I'm aware of solutions such as e-x/n , e-x/n(1-x/n), and further solutions such as e-x/nf(x) where f(x) is a finite polynomial..)

The nearest thing I could find to this was hypergeometric series - except those seem to only have an+1 and an terms. Is there an article on such things? Can anyone give links to anything that deals with the resultant polynomials? To be more specific - it looks like I should be finding a way to evaluate the polynomial as x tends to infinty in the general case.. —Preceding unsigned comment added by 87.102.86.73 (talk) 19:32, 14 June 2008 (UTC)[reply]