1,885 reputation
1522
bio website NA
location India
age 21
visits member for 2 years, 1 month
seen Apr 7 at 16:18

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
May
11
answered Proving that if $n$ is odd and $\gcd(m, n) = 1$, then $\gcd(2m + n, 2n) = 1$
May
10
awarded  Informed
May
7
asked Does Miller Rabin algorithm becomes faster if $a$ is choosen from the set $\mathbb{Z}_n^*-(\mathbb{Z}_n-\{0\})$ rather than randomly
May
7
awarded  Caucus
Apr
21
revised Is my proof correct? $p_1p_2p_3\cdots p_n+1)$ cannot be the square of an integer
Formatting
Apr
21
suggested suggested edit on Is my proof correct? $p_1p_2p_3\cdots p_n+1)$ cannot be the square of an integer
Apr
10
comment Mod question: $2^{-1} \bmod 5 = 3$
$\mathbb{Z}_p - \{ 0 \}$ is a group, so every element has an inverse. So to find 2's inverse find $x$ such that $2x \equiv 1 \pmod 5$.
Mar
31
comment Number of solutions to $z^2 \equiv p^fb \pmod{p^e}$?
I cannot understand your answer since I donot know any advance number theory. I have studied only upto primitive roots, quadratic residues, reciprocity law etc(means the typical undergrad course on number theory) and this is the question from that. So, it must have some elementary solution.
Mar
31
revised Number of solutions to $z^2 \equiv p^fb \pmod{p^e}$?
deleted 1 characters in body