# David Marquis

 Jun 22 awarded Enthusiast May 8 awarded Supporter Apr 29 awarded Supporter Jul 2 awarded Curious Feb 2 accepted Distinct pairs with equal sum mod p Feb 2 comment Distinct pairs with equal sum mod pThe title refers to my question about $T_2$. Feb 1 revised Distinct pairs with equal sum mod pAdded second question, which the title is referring to. Feb 1 asked Distinct pairs with equal sum mod p Jul 4 awarded Yearling Jul 4 awarded Revival Jul 4 awarded Yearling Apr 4 awarded Supporter Mar 26 comment how to find co-prime numbersFor any positive integer $n$ given $\phi(n)$ the factorization of $n$ can be found in probabilistic polynomial time or deterministically under the Extended Riemann Hypothesis. See for example rjlipton.wordpress.com/2011/12/10/a-lemma-on-factoring for the main idea. Mar 13 asked Representing an element mod $n$ as a product of two primes Mar 2 accepted Largest power of a prime dividing $q^m-1$ Mar 2 comment Largest power of a prime dividing $q^m-1$@Gerry. Thanks. From the binomial expansion I can see that $v_l(q^m-1) \geq v_l(q-1)+v_l(m)$. Any advice for $v_l(q^m-1) \leq v_l(q-1)+v_l(m)$? I can't see why for $l=2$ the result would be different. Mar 2 revised Largest power of a prime dividing $q^m-1$deleted 20 characters in body Mar 2 asked Largest power of a prime dividing $q^m-1$ Nov 2 revised Efficiently determining if a discrete log existsadded 114 characters in body Nov 2 answered Efficiently determining if a discrete log exists