Let 2012^2 = a2014^2 = b2013^2 = ca%%c = -2*2013 + 1 ---(1)b%%c = 2*2013 + 1. ---(2)We need to prove (a^1007 - b^1006)%%c =0(1-2*2013*1007 - 1 - 1006*2*2013)%%c = 0Edited.

What is the next number in this series?1, 1, 1,2,2,3,2,4,0,0,3,3,2,?Clue: This series is generated Based on this Matrix brain teaser solution

<r>QuoteOriginally posted by: CuchulainnQuoteOriginally posted by: UltravioletAlternatively <E>:-)</E>[$]dF(x)/dx = \rho(x)[$][$]E[F(X)] = \int_{-\infty}^{\infty} F(x)\rho(x) dx = \int_0^1 F(x) dF(x) = \int_0^1 t dt = 1/2[$]Is it possible to get the answer using geometry?When F(x) is plotted against...

<t>QuoteOriginally posted by: CuchulainnQuoteOriginally posted by: Traden4AlphaQuoteOriginally posted by: CuchulainnQuoteOriginally posted by: bearish[...] it is hard to improve on EBal's brevity.You could try removing the question mark. 0.5And the zero..5Yes, how sloppy.Yeah....he could have answer...

<r>Here is one paper (Year 2004) which is close to the solution I proposed. Even though the author's claim the complexity is O(x*y) = O(n)...I am not sure about that after reading the paper. There is some "staircase" work involved at each cell, which will add to the complexity, which is ignored as n...

Few feed back comments received saying the earlier post was very cryptic.Pls find an attachment of an example, how this algo works. Edited earlier post to map to this example at each step.

<t>I don't know if this is a dumb question..Among various jobs related to quant domain(quant trading, HF trading, quant developer etc), is there a thumb rule for which of the following is required most, or to what degree?a) Quant knowledge, say math PhD from a reputed university would haveb) Quantit...

Thanks T4A for suggesting to debug, found a minor bug(length of tValidWidth should have been nCol and not nRow), which I edited in my earlier post.Please find the algorithm for the code below.

<t>I had followed a similar approach for the solutions posted earlier, with {Q1, Q2, Q3, Q4, WQ1, WQ2, WQ3, WQ4}, but wrote a program to solve it as I found that more convenient.This reduced it to following 5 equations, and we can choose any values for Q4, WQ3 & WQ4(free variables) within the bo...

<t>True....another drawback is that this algo is extremely complex in terms of difficulty in understanding the logic behind. Not all code get executed in each iteration though, it falls into different if else cases.It prints intermediate largeSubMatrices correctly during it's search, so I believe it...

<t>Here is an algorithm, which is verified to be working. In worst case, it is slower by a factor of log2(min(nRow, nCol)). It find the largest mXn submatrix within a nRowXnCol matrix where nRow >= mnCol >= n.Please find the RScript attached, where you can configure nRow and nCol, and run the script...

<t>When we use ADF test for checking stationarity between two stocks for pairs trading, what is the ideal lag we should be trying?I tried simulating stationary data series of length 5000, and added a few significant +ve jumps(making it's mean increase) at every 500 data points. I find the ADF test r...

<t>I wrote a software to solve for {Q1, Q2, Q3, Q4, WQ1, WQ2, WQ3, WQ4}, pls find a few below.During this, I realized we have 3 degrees of freedom, and not 2. Can anyone tell me why?Solutions::solution1 = (0.7743, 0.0829, 0.0829,0.0600,0.3786,0.0071,0.0500,0.0500)solution2 = (0.7757,0.0671,0.1171,0....

Made an edit , replaced "Matrix multiplication" with "Hadamard product"

<t>Data givena) A series of real numbers "S" of length "N"b) A real number "x"c) A boolean "greaterThan"############################You are allowed to use the following math operators only(All operators operate on entire vector), you can't walk through each element in the series(Like by using a for ...