Computer Science
Saurabh's user avatar
Saurabh's user avatar
Saurabh's user avatar
Saurabh
  • Member for 11 years, 2 months
  • Last seen more than 1 year ago
  • NA
  • India
Profile Activity
Stats
899
reputation
87k
reached
0
answers
6
questions
Communities
View all
Badges
View all badges
2
gold badges
10
silver badges
15
bronze badges
Top tags
View all tags
0
Score
3
Posts
50
Posts %
0
Score
2
Posts
33
Posts %
0
Score
1
Posts
17
Posts %
0
Score
1
Posts
17
Posts %
0
Score
1
Posts
17
Posts %
0
Score
1
Posts
17
Posts %
Top posts
All Questions Answers
Score Newest
question
39
Algorithm that finds the number of simple paths from $s$ to $t$ in $G$
Aug 7, 2012
question
16
Prove that every two longest paths have at least one vertex in common
Jul 4, 2012
question
9
Solving the recurrence relation $T(n) = 2T(\lfloor n/2 \rfloor) + n$
Jul 31, 2012
question
7
Low-degree nodes in sparse graphs
May 22, 2012
question
6
A good introductory book on cryptography
Mar 31, 2013
question
1
Approximate time for selection operation using index when equality is on nonkey
Apr 14, 2013
Top network posts
View all network posts
16
If $\gcd(a,35)=1$ then show that $a^{12} \equiv 1 \pmod{35}$
15
Prove that , any primitive root $r$ of $p^n$ is also a primitive root of $p$
14
Prove $\gcd(a+b,a^2+b^2)$ is $1$ or $2$ if $\gcd(a,b) = 1$
12
Prove if $n$ has a primitive root, then it has exactly $\phi(\phi(n))$ of them
10
If $\gcd(a,35)=1$ then show that $a^{12} \equiv 1 \pmod{35}$

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.