@Lakshya Sinha
–
I've heard of this before, so I just looked up Truncatable Primes. But I don't think it's particularly difficult to prove that there's only a limited number, so that a quick computer search can find all of them.
–
Michael Mendrin
·
1 year ago

## Comments

Sort by:

TopNewestNext largest such prime is \(59393339\). There are only \(83\) such right-truncatable primes. – Michael Mendrin · 1 year ago

Log in to reply

– Lakshya Sinha · 1 year ago

Sir did you proved it or searched it internetLog in to reply

Truncatable Primes. But I don't think it's particularly difficult to prove that there's only a limited number, so that a quick computer search can find all of them. – Michael Mendrin · 1 year ago

I've heard of this before, so I just looked upLog in to reply

– Lakshya Sinha · 1 year ago

Oh, can you suggest me some ways to do my RMO wellLog in to reply

I think it is difficult to calculate that without using coding. – Surya Prakash · 1 year ago

Log in to reply

I think one can get such primes by coding. If its a number theory problem , its way too difficult for me... – Nihar Mahajan · 1 year ago

Log in to reply

– Aditya Kumar · 1 year ago

Do give it a try :)Log in to reply

This is so far from me. Maybe one day, but not today. – Marco Antonio · 1 year ago

Log in to reply

\(23\) – Akshat Sharda · 1 year ago

Log in to reply

– Aditya Kumar · 1 year ago

Something bigger?Log in to reply

– Akshat Sharda · 1 year ago

\(29\ddot \smile\)Log in to reply

– Aditya Kumar · 1 year ago

Read the note carefully!Log in to reply