New user? Sign up

Existing user? Log in

I found this somewhere. I thought of sharing with everyone. Do try finding out numbers of such kind! (bigger than this)

Note by Aditya Kumar 3 years, 2 months ago

Easy Math Editor

*italics*

_italics_

**bold**

__bold__

- bulleted- list

1. numbered2. list

paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)

> This is a quote

This is a quote

# I indented these lines # 4 spaces, and now they show # up as a code block. print "hello world"

2 \times 3

2^{34}

a_{i-1}

\frac{2}{3}

\sqrt{2}

\sum_{i=1}^3

\sin \theta

\boxed{123}

Sort by:

Next largest such prime is \(59393339\). There are only \(83\) such right-truncatable primes.

Log in to reply

Sir did you proved it or searched it internet

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 – Oh, can you suggest me some ways to do my RMO well

I think it is difficult to calculate that without using coding.

I think one can get such primes by coding. If its a number theory problem , its way too difficult for me...

Do give it a try :)

This is so far from me. Maybe one day, but not today.

\(23\)

Something bigger?

\(29\ddot \smile\)

@Akshat Sharda – Read the note carefully!

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestNext largest such prime is \(59393339\). There are only \(83\) such right-truncatable primes.

Log in to reply

Sir did you proved it or searched it internet

Log in to reply

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.

Log in to reply

Log in to reply

I think it is difficult to calculate that without using coding.

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...

Log in to reply

Do give it a try :)

Log in to reply

This is so far from me. Maybe one day, but not today.

Log in to reply

\(23\)

Log in to reply

Something bigger?

Log in to reply

\(29\ddot \smile\)

Log in to reply

Log in to reply