Timeline for Are there infinitely many primes $p$, positive integers $ k, n $ such that $1 \le n < p$ and $p^k > n.rad(p^{k+1}−n)$?

9 events

when toggle format	what		by	license	comment
Sep 12, 2019 at 1:16	comment	added	Đào Thanh Oai		Dear @GregMartin $k \ge 2$ and $k+1 \ge 3$, In the caculatation, I take only $k=2, 3, 4, 5$
Sep 11, 2019 at 16:49	comment	added	Greg Martin		You're allowing $k=1$? Surely there are lots of examples where $p>2n$ and $p^2-n$ is a power of $2$.
Sep 11, 2019 at 15:27	comment	added	Đào Thanh Oai		@user142929 I use matlab to test the idea
Sep 11, 2019 at 15:21	comment	added	Đào Thanh Oai		Maybe, there are more and more inequalities in question 1 with the 168 primes. Because for fast test, In my calculation when I take first $n$ such that the inequality. I omit the number bigger $n$.
Sep 11, 2019 at 9:30	comment	added	user142929		If you need it, one can to write the central dot of a product $a\cdot b$ if one type in the corresponding formula \cdot , also is required a blank space between the string cdot and the second operand if the second operand is a string of letters \cdot rad
Sep 11, 2019 at 8:53	history	edited	Đào Thanh Oai	CC BY-SA 4.0	added 3 characters in body
Sep 11, 2019 at 8:39	history	edited	Đào Thanh Oai	CC BY-SA 4.0	added 110 characters in body
Sep 11, 2019 at 8:24	history	edited	Đào Thanh Oai	CC BY-SA 4.0	added 9 characters in body
Sep 11, 2019 at 8:16	history	asked	Đào Thanh Oai	CC BY-SA 4.0