On the pi function and its arguments in geometric progressions

30 views
Skip to first unread message

Tomasz Ordowski

unread,
Jun 15, 2026, 7:46:41 AM (9 days ago) Jun 15
to seq...@googlegroups.com
Hello SeqFans! 

Find all numbers n such that 
pi(2n)^2 = pi(n)*pi(4n).
Are there only finitely many n such that 
pi(2n)^2 >= pi(n)*pi(4n) ? 
If so, find the largest such n = N. 
Conjecture: pi(2n)^2 < pi(n)*pi(4n) for n > N. 

Best, 

Tom Ordo 

Jack Brennen

unread,
Jun 15, 2026, 10:44:28 AM (9 days ago) Jun 15
to seq...@googlegroups.com
It appears that the largest such n might be 51342.
There are no other such numbers between 51343 and 10^8.




--
You received this message because you are subscribed to the Google Groups "SeqFan" group.
To unsubscribe from this group and stop receiving emails from it, send an email to seqfan+un...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAF0qcNPFoEHwOWLPt82nZ4FtUYYjD1mojO5qw-ih%2Byhm6pm2CQ%40mail.gmail.com.

M F Hasler

unread,
Jun 15, 2026, 10:55:41 AM (9 days ago) Jun 15
to seq...@googlegroups.com

On Mon, Jun 15, 2026 at 7:46 AM Tomasz Ordowski <tomaszo...@gmail.com> wrote:
Hello SeqFans! 

Find all numbers n such that 
pi(2n)^2 = pi(n)*pi(4n).

For me, n=867 gives the last  p2^2-p1*p4 =  0, 
with  [p2=pi(2*n), p1=pi(n), p4=pi(4*n)]   =  [270, 150, 486]
 
Are there only finitely many n such that 
pi(2n)^2 >= pi(n)*pi(4n) ? 

On Mon, Jun 15, 2026 at 10:44 AM 'Jack Brennen' via SeqFan <seq...@googlegroups.com> wrote:
It appears that the largest such n might be 51342.

I agree.
 
If so, find the largest such n = N. 
Conjecture: pi(2n)^2 < pi(n)*pi(4n) for n > N. 

Well, that's exactly the definition of N, right?

- Maximilian

Tomasz Ordowski

unread,
Jun 15, 2026, 11:51:02 AM (9 days ago) Jun 15
to seq...@googlegroups.com
Right, thanks!

--
You received this message because you are subscribed to the Google Groups "SeqFan" group.
To unsubscribe from this group and stop receiving emails from it, send an email to seqfan+un...@googlegroups.com.
Reply all
Reply to author
Forward
0 new messages