# Zvpunry

less info
reputation
427
bio website location age 21 member for 2 years, 1 month seen 2 days ago profile views 278

 Jun16 revised Checking an inductive proof on a combinatorial product added 10 characters in body Jun16 comment Checking an inductive proof on a combinatorial product @coffeemath when you say "yes" are you confirming that I do indeed have this right? I have added the $k \geq 2$ condition thanks for this input. Regards. Jun14 asked Checking an inductive proof on a combinatorial product Jun13 answered Introductory books on complex analysis? Jun13 comment Binomial coefficients equal to a prime squared Never mind, I now see that you would need $2p \cdot (2p - 1) \cdots (p)(p-1)\cdots$. Thanks again Jun13 comment Binomial coefficients equal to a prime squared I accepted Jyrki's answer, but I want to thank you for the referral to the paper, this is useful for the more general aspects of my project Jun13 comment Binomial coefficients equal to a prime squared many thanks for this response. A neat proof! However I wonder if you could elaborate on why it is necessary that $2p \leq m$, and not the more trivial bound that $p^2 \leq m$? Jun13 accepted Binomial coefficients equal to a prime squared Jun12 asked Binomial coefficients equal to a prime squared Jun5 comment Trying to prove an identity about a product I will go down that route, thanks for your suggestions @wece Jun5 comment Trying to prove an identity about a product @wece I thought that I should induct on $p$ and then perhaps have a "nested" induction on $n$ inside the proof. How can I induct on $n$ but still establish that it is only those above tuples that give me the desired dimension? Jun4 revised Trying to prove an identity about a product added 32 characters in body Jun4 answered Suggest an Antique Math Book worth reading? Jun4 asked Trying to prove an identity about a product Jun3 accepted Number of possible pairs from $\{1,\dots, n\}$ with $i < j$ May30 comment Number of possible pairs from $\{1,\dots, n\}$ with $i < j$ My mistake, it is in fact simply ${n \choose 2}$ May30 asked Number of possible pairs from $\{1,\dots, n\}$ with $i < j$ May23 accepted How to find instances when $d(a,b) = p^2$ for $p$ a prime. May23 comment How to find instances when $d(a,b) = p^2$ for $p$ a prime. @MarkBennet it appears after looking at your answer and the original problem more closely that there are no such $(a,b) \in \Bbb N$ that satisfy this for $p$ a prime. Do you know how I might find the integral points on the surface $F(a,b,n) = 0 = d(a,b) - n$ for $n \in \Bbb N$? May23 comment How to find instances when $d(a,b) = p^2$ for $p$ a prime. @AmireBendjeddou $a, b \in \Bbb N$, sorry I should have mentioned these constraints. @ Mark Bennet: I'm sorry I think I may have misunderstood you. So your comment is that there are no pairs of the form $(1, b)$ satisfying the above equality?