gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i18n,learn): processed translations (#45333)

Browse Source
This commit is contained in:
camperbot
2022-03-04 19:46:29 +05:30
committed by GitHub
parent e24c8abc7f
commit 3d3972f2dd
113 changed files with 1394 additions and 1111 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-467-superinteger.md
View File

@ -1,6 +1,6 @@
---
id: 5900f5411000cf542c510052
title: 'Problem 467: Superinteger'
title: 'Problema 467: Superinteri'
challengeType: 5
forumTopicId: 302142
dashedName: problem-467-superinteger
@ -8,26 +8,32 @@ dashedName: problem-467-superinteger
# --description--
An integer s is called a superinteger of another integer n if the digits of n form a subsequence of the digits of s.
Un intero $s$ è chiamato un superintero di un altro intero $n$ se le cifre di $n$ formano una sottosequenza delle cifre di $s$.
For example, 2718281828 is a superinteger of 18828, while 314159 is not a superinteger of 151.
Ad esempio, 2718281828 è un superintero di 18828, mentre 314159 non è un superintero di 151.
Let p(n) be the nth prime number, and let c(n) be the nth composite number. For example, p(1) = 2, p(10) = 29, c(1) = 4 and c(10) = 18. {p(i) : i ≥ 1} = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, ...} {c(i) : i ≥ 1} = {4, 6, 8, 9, 10, 12, 14, 15, 16, 18, ...}
Sia $p(n) l'$n$° numero primo, e sia $c(n)$ l'$n$° numero composto. Per esempio, $p(1) = 2$, $p(10) = 29$, $c(1) = 4$ e $c(10) = 18$.
Let PD the sequence of the digital roots of {p(i)} (CD is defined similarly for {c(i)}): PD = {2, 3, 5, 7, 2, 4, 8, 1, 5, 2, ...} CD = {4, 6, 8, 9, 1, 3, 5, 6, 7, 9, ...}
$$\begin{align} & \\{p(i) : i ≥ 1\\} = \\{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, \ldots \\} \\\\ & \\{c(i) : i ≥ 1\\} = \\{4, 6, 8, 9, 10, 12, 14, 15, 16, 18, \ldots \\} \end{align}$$
Let Pn be the integer formed by concatenating the first n elements of PD (Cn is defined similarly for CD). P10 = 2357248152 C10 = 4689135679
Sia $P^D$ la sequenza delle radici digitali di $\\{p(i)\\}$ ($C^D$ è definita in modo simile per $\\{c(i)\\}$):
Let f(n) be the smallest positive integer that is a common superinteger of Pn and Cn. For example, f(10) = 2357246891352679, and f(100) mod 1 000 000 007 = 771661825.
$$\begin{align} & P^D = \\{2, 3, 5, 7, 2, 4, 8, 1, 5, 2, \ldots \\} \\\\ & C^D = \\{4, 6, 8, 9, 1, 3, 5, 6, 7, 9, \ldots \\} \end{align}$$
Find f(10 000) mod 1 000 000 007.
Sia $P_n$ il numero intero formato concatenando i primi $n$ elementi di $P^D$ ($C_n$ è definito allo stesso modo per $C^D$).
$$\begin{align} & P_{10} = 2\\,357\\,248\\,152 \\\\ & C_{10} = 4\\,689\\,135\\,679 \end{align}$$
Sia $f(n)$ il più piccolo intero positivo che è un superintero comune di $P_n$ e $C_n$. Per esempio, $f(10) = 2\\,357\\,246\\,891\\,352\\,679$, and $f(100)\bmod 1\\,000\\,000\\,007 = 771\\,661\\,825$.
Trova $f(10\\,000)\bmod 1\\,000\\,000\\,007$.
# --hints--
`euler467()` should return 775181359.
`superinteger()` dovrebbe restituire `775181359`.
```js
assert.strictEqual(euler467(), 775181359);
assert.strictEqual(superinteger(), 775181359);
```
# --seed--
@ -35,12 +41,12 @@ assert.strictEqual(euler467(), 775181359);
## --seed-contents--
```js
function euler467() {
function superinteger() {
return true;
}
euler467();
superinteger();
```
# --solutions--