Saurabh
Reputation
1,940
Next privilege 2,000 Rep.
1 6 28
Impact
~55k people reached

# 313 Actions

 Apr16 awarded Popular Question Mar1 awarded Yearling Dec11 awarded Caucus Nov12 awarded Popular Question Sep30 awarded Explainer Jul23 awarded Popular Question Jul2 awarded Curious Apr1 awarded Popular Question Mar1 awarded Yearling Feb24 accepted Number of way to move form $(1,1)$ to $(n,n)$ in a square grid taking exactly $k$ turns Feb7 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? Feb7 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. Feb7 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). Feb7 asked Number of way to move form $(1,1)$ to $(n,n)$ in a square grid taking exactly $k$ turns Feb5 awarded Popular Question May18 awarded Constituent May11 revised Proving that if $n$ is odd and $\gcd(m, n) = 1$, then $\gcd(2m + n, 2n) = 1$ added 26 characters in body May11 revised Proving that if $n$ is odd and $\gcd(m, n) = 1$, then $\gcd(2m + n, 2n) = 1$ added 47 characters in body May11 answered Proving that if $n$ is odd and $\gcd(m, n) = 1$, then $\gcd(2m + n, 2n) = 1$ May10 awarded Informed