Problem 35 » 履歴 » バージョン 1
Noppi, 2024/01/14 05:09
| 1 | 1 | Noppi | [ホーム](https://redmine.noppi.jp) - [[Wiki|Project Euler]] |
|---|---|---|---|
| 2 | # [[Problem 35]] |
||
| 3 | |||
| 4 | ## Circular Primes |
||
| 5 | The number, $197$, is called a circular prime because all rotations of the digits: $197$, $971$, and $719$, are themselves prime. |
||
| 6 | |||
| 7 | There are thirteen such primes below $100$: $2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79$, and $97$. |
||
| 8 | |||
| 9 | How many circular primes are there below one million? |
||
| 10 | |||
| 11 | ## 巡回素数 |
||
| 12 | 197は巡回素数と呼ばれる. 桁を回転させたときに得られる数 197, 971, 719 が全て素数だからである. |
||
| 13 | |||
| 14 | 100未満には巡回素数が13個ある: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, および97である. |
||
| 15 | |||
| 16 | 100万未満の巡回素数はいくつあるか? |
||
| 17 | |||
| 18 | ```scheme |
||
| 19 | ``` |