Saurabh
Reputation
2,010
Next privilege 2,500 Rep.
Create tag synonyms
 Nov 30 awarded Popular Question Jun 16 awarded Popular Question Apr 16 awarded Popular Question Mar 1 awarded Yearling Dec 11 awarded Caucus Nov 12 awarded Popular Question Sep 30 awarded Explainer Jul 23 awarded Popular Question Jul 2 awarded Curious Apr 1 awarded Popular Question Mar 1 awarded Yearling Feb 24 accepted Number of way to move form $(1,1)$ to $(n,n)$ in a square grid taking exactly $k$ turns Feb 7 comment Number of way to move form $(1,1)$ to $(n,n)$ in a square grid taking exactly $k$ turns There will be $(k+1)/2$ vertical and $k/2 + 1$ horizontal segments. Can you please elaborate more? Feb 7 comment Number of way to move form $(1,1)$ to $(n,n)$ in a square grid taking exactly $k$ turns no k=1 is also valid for example RRRR...R(n times)DDDD....D(n times) that is you are only turning once at top right corner. Feb 7 comment Number of way to move form $(1,1)$ to $(n,n)$ in a square grid taking exactly $k$ turns @user92774 moves available are right and down. I am naming the top left corner as (1,1) and bottom right corner as (n,n). Feb 7 asked Number of way to move form $(1,1)$ to $(n,n)$ in a square grid taking exactly $k$ turns Feb 5 awarded Popular Question May 18 awarded Constituent May 11 revised Proving that if $n$ is odd and $\gcd(m, n) = 1$, then $\gcd(2m + n, 2n) = 1$ added 26 characters in body May 11 revised Proving that if $n$ is odd and $\gcd(m, n) = 1$, then $\gcd(2m + n, 2n) = 1$ added 47 characters in body