diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-the-keys-of-an-object-with-a-for...in-statement.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-the-keys-of-an-object-with-a-for...in-statement.md index 3e17725fc96..9ae0bbf1994 100644 --- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-the-keys-of-an-object-with-a-for...in-statement.md +++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-the-keys-of-an-object-with-a-for...in-statement.md @@ -1,6 +1,6 @@ --- id: 587d7b7d367417b2b2512b1d -title: Iterare attraverso le chiavi di un oggetto con l'istruzione for...in +title: Iterare sulle chiavi di un oggetto con l'istruzione for...in challengeType: 1 forumTopicId: 301162 dashedName: iterate-through-the-keys-of-an-object-with-a-for---in-statement @@ -8,7 +8,7 @@ dashedName: iterate-through-the-keys-of-an-object-with-a-for---in-statement # --description-- -Sometimes you need to iterate through all the keys within an object. You can use a for...in loop to do this. The for...in loop looks like: +A volte è necessario iterare su tutte le chiavi di un oggetto. Per questo puoi usare un loop for...in. Un loop for...in ha questo aspetto: ```javascript const refrigerator = { @@ -21,15 +21,15 @@ for (const food in refrigerator) { } ``` -This code logs `milk 1` and `eggs 12`, with each key-value pair on its own line. +Questo codice mostra `milk 1` e `eggs 12`, con ogni coppia chiave-valore sulla propria riga. -We defined the variable `food` in the loop head and this variable was set to each of the object's keys on each iteration, resulting in each food's name being printed to the console. +Abbiamo definito la variabile `food` nella testa del loop e questa variabile è stata impostata su ciascuna delle chiavi dell'oggetto in ogni iterazione, ottenendo come risultato il nome di ciascun alimento stampato sulla console. -**NOTA:** Gli oggetti non mantengono un ordine sulle chiavi memorizzate come fanno gli arrays; di conseguenza la posizione di una chiave in un oggetto, o l'ordine relativo in cui appare, è irrilevante quando ci si riferisce a tale chiave o vi si accede. +**NOTA:** Gli oggetti non mantengono un ordine sulle chiavi memorizzate come fanno gli array; di conseguenza la posizione di una chiave in un oggetto, o l'ordine relativo in cui appare, è irrilevante quando ci si riferisce a tale chiave o vi si accede. # --instructions-- -We've defined a function `countOnline` which accepts one argument, `allUsers`. Use a for...in statement inside this function to loop through the `allUsers` object and return the number of users whose online property is set to `true`. An example of an object which could be passed to `countOnline` is shown below. Each user will have an `online` property set to either `true` or `false`. +Abbiamo definito una funzione `countOnline` che accetta un argomento, `allUsers`. Usa un'istruzione for...in all'interno di questa funzione per iterare sull'oggetto `allUsers` e restituire il numero di utenti la cui proprietà online è impostata su `true`. Un esempio di oggetto che potrebbe essere passato a `countOnline` è mostrato di sotto. Ogni utente avrà una proprietà `online` con un valore impostato su `true` o `false`. ```js { @@ -47,7 +47,7 @@ We've defined a function `countOnline` which accepts one argument, `allUsers`. U # --hints-- -La funzione `countOnline` dovrebbe utilizzare un'istruzione `for in` per iterare attraverso le chiavi dell'oggetto passato come argomento. +La funzione `countOnline` dovrebbe utilizzare un'istruzione `for in` per iterare sulle le chiavi dell'oggetto passato come argomento. ```js assert( diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/testing-objects-for-properties.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/testing-objects-for-properties.md index 03572828503..38dc30a48d4 100644 --- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/testing-objects-for-properties.md +++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/testing-objects-for-properties.md @@ -8,7 +8,7 @@ dashedName: testing-objects-for-properties # --description-- -To check if a property on a given object exists or not, you can use the `.hasOwnProperty()` method. `someObject.hasOwnProperty(someProperty)` returns `true` or `false` depending on if the property is found on the object or not. +Per verificare se una proprietà di un dato oggetto esista o meno, puoi utilizzare il metodo `.hasOwnProperty()`. `someObject.hasOwnProperty(someProperty)` restituisce `true` o `false` a seconda che la proprietà sia trovata sull'oggetto oppure no. **Esempio** @@ -21,11 +21,11 @@ checkForProperty({ top: 'hat', bottom: 'pants' }, 'top'); // true checkForProperty({ top: 'hat', bottom: 'pants' }, 'middle'); // false ``` -The first `checkForProperty` function call returns `true`, while the second returns `false`. +La prima chiamata della funzione `checkForProperty` restituisce `true`, mentre la seconda restituisce `false`. # --instructions-- -Modify the function `checkObj` to test if the object passed to the function parameter `obj` contains the specific property passed to the function parameter `checkProp`. If the property passed to `checkProp` is found on `obj`, return that property's value. If not, return `Not Found`. +Modifica la funzione `checkObj` per verificare se un oggetto passato al parametro di funzione `obj` contiene la specifica proprietà passata al parametro di funzione `checkProp`. Se la proprietà passata a `checkProp` si trova su `obj`, restituisci il valore di quella proprietà. In caso contrario, restituisci `Not Found`. # --hints-- diff --git a/curriculum/challenges/italian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-f.md b/curriculum/challenges/italian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-f.md index 62ea2171aa7..d778e7e8bdc 100644 --- a/curriculum/challenges/italian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-f.md +++ b/curriculum/challenges/italian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-f.md @@ -1,18 +1,18 @@ --- id: 63ee353e0d8d4841c3a7091f videoId: LGQuIIv2RVA -title: CSS Foundations Question F +title: Fondamenti di CSS Domanda F challengeType: 15 dashedName: css-foundations-question-f --- # --description-- -Ok, hai visto parecchie cose finora. The only thing left for now is to go over how to add all this CSS to your HTML. There are three methods to do so. +Ok, hai visto parecchie cose finora. L'unica cosa rimasta da fare ora è vedere come aggiungere tutto il CSS al tuo HTML. Ci sono tre metodi per farlo. Il CSS esterno è il metodo più comune che incontrerai, e prevede la creazione di un file separato per il CSS e il collegamento nell'HTML all'interno dei tag `` di apertura e chiusura tramite un elemento `` a chiusura automatica: -Innanzitutto, aggiungi un elemento `` a chiusura automatica all'interno dei tag `` del file HTML. The `href` attribute is the location of the CSS file, either an absolute URL or, what you’ll be utilizing, a URL relative to the location of the HTML file. Nell'esempio precedente, si suppone che entrambi i file si trovino nella stessa directory. L'attributo `rel` è obbligatorio e specifica la relazione tra il file HTML e il file collegato. +Innanzitutto, aggiungi un elemento `` a chiusura automatica all'interno dei tag `` del file HTML. L'attributo `href` è la posizione del file CSS, sia un URL assoluto o, quello che utilizzerai, un URL relativo alla posizione del file HTML. Nell'esempio precedente, si suppone che entrambi i file si trovino nella stessa directory. L'attributo `rel` è obbligatorio e specifica la relazione tra il file HTML e il file collegato. All'interno del file `styles.css` appena creato, c'è il selettore (`div` e `p`), seguito da un paio di parentesi graffe, che creano un “blocco di dichiarazione”. Infine, all'interno del blocco di dichiarazione ci sono le dichiarazioni. `color: white;` è una dichiarazione, dove `color` è la proprietà e `white` è il valore, e `background-color: black;` è un'altra dichiarazione. diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-103-special-subset-sums-optimum.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-103-special-subset-sums-optimum.md index 48b4bf152ea..90eec7c267c 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-103-special-subset-sums-optimum.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-103-special-subset-sums-optimum.md @@ -1,6 +1,6 @@ --- id: 5900f3d61000cf542c50fee7 -title: 'Problem 103: Special subset sums: optimum' +title: 'Problema 103: somme speciali dei subset: ottimali' challengeType: 1 forumTopicId: 301727 dashedName: problem-103-special-subset-sums-optimum @@ -8,29 +8,29 @@ dashedName: problem-103-special-subset-sums-optimum # --description-- -Sia $S(A)$ la somma degli elementi in un insieme A di dimensione n. Lo chiamiamo un insieme di somma speciale se per ogni due sottoinsiemi non vuoti e distinti, B e C, le seguenti proprietà sono vere: +Sia $S(A)$ la somma degli elementi in un set A di dimensione n. Lo chiamiamo un set di somma speciale se per ogni due subset non vuoi e distinti, B e C, sono vere le seguenti proprietà: -1. $S(B) ≠ S(C)$, cioè le somme dei sottoinsiemi non possono essere uguali. +1. $S(B) ≠ S(C)$, cioè le somme dei subset non possono essere uguali. 2. Se B contiene più elementi di C allora $S(B) > S(C)$. -If $S(A)$ is minimised for a given n, we shall call it an optimum special sum set. The first five optimum special sum sets are given below. +Se $S(A)$ è minimizzata per un dato n, la chiameremo somma speciale di un set ottimale. Le prime cinque somme speciali di un set ottimale sono date sotto. $$\begin{align} & n = 1: \\{1\\} \\\\ & n = 2: \\{1, 2\\} \\\\ & n = 3: \\{2, 3, 4\\} \\\\ & n = 4: \\{3, 5, 6, 7\\} \\\\ & n = 5: \\{6, 9, 11, 12, 13\\} \\\\ \end{align}$$ -It seems that for a given optimum set, $A = \\{a_1, a_2, \ldots, a_n\\}$, the next optimum set is of the form $B = \\{b, a_1 + b, a_2 + b, \ldots, a_n + b\\}$, where b is the "middle" element on the previous row. +Sembra che per un dato set ottimale, $A = \\{a_1, a_2, \ldots, a_n\\}$, il successivo set ottimale è della forma $B = \\{b, a_1 + b, a_2 + b, \ldots, a_n + b\\}$, dove b è l'elemento "centrale" della riga precedente. -By applying this "rule" we would expect the optimum set for $n = 6$ to be $A = \\{11, 17, 20, 22, 23, 24\\}$, with $S(A) = 117$. However, this is not the optimum set, as we have merely applied an algorithm to provide a near optimum set. The optimum set for $n = 6$ is $A = \\{11, 18, 19, 20, 22, 25\\}$, with $S(A) = 115$ and corresponding set string: `111819202225`. +Applicando la "regola" ci aspetteremmo il set ottimale per $n = 6$ sia $A = \\{11, 17, 20, 22, 23, 24\\}$, con $S(A) = 117$. Invece, questo non è il set ottimale, visto che abbiamo semplicemente applicato un algoritmo per ottenere un set quasi ottimale. Il set ottimale per $n = 6$ è $A = \\{11, 18, 19, 20, 22, 25\\}$, con $S(A) = 115$ e la stringa set corrispondente: `111819202225`. -Given that A is an optimum special sum set for $n = 7$, find its set string. +Dato che A è un set ottimale di somma speciale per for $n = 7$, trova la sua stringa. -**Note:** This problem is related to Problem 105 and Problem 106. +**Nota:** questo problema è legato al Problema 105 e al Problema 106. # --hints-- -`optimumSpecialSumSet()` should return the string `20313839404245`. +`optimumSpecialSumSet()` dovrebbe restituire la stringa `20313839404245`. ```js assert.strictEqual(optimumSpecialSumSet(), '20313839404245'); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-104-pandigital-fibonacci-ends.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-104-pandigital-fibonacci-ends.md index baa7dcbfdbd..c7c2614842d 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-104-pandigital-fibonacci-ends.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-104-pandigital-fibonacci-ends.md @@ -1,6 +1,6 @@ --- id: 5900f3d51000cf542c50fee6 -title: 'Problem 104: Pandigital Fibonacci ends' +title: 'Problema 104: finali di Fibonacci pandigitali' challengeType: 1 forumTopicId: 301728 dashedName: problem-104-pandigital-fibonacci-ends @@ -8,17 +8,17 @@ dashedName: problem-104-pandigital-fibonacci-ends # --description-- -The Fibonacci sequence is defined by the recurrence relation: +La sequenza di Fibonacci è definita dalla relazione ricorsiva: $F_n = F_{n − 1} + F_{n − 2}$, where $F_1 = 1$ and $F_2 = 1$ -It turns out that $F_{541}$, which contains 113 digits, is the first Fibonacci number for which the last nine digits are 1 - 9 pandigital (contain all the digits 1 to 9, but not necessarily in order). And $F_{2749}$, which contains 575 digits, is the first Fibonacci number for which the first nine digits are 1 - 9 pandigital. +Si scopre che $F_{541}$, il quale contiene 113 cifre, è il primo numero di Fibonacci per cui le ultime dieci cifre sono 1-9 pandigitali (contengono tutte le cifre da 1 a 9, ma non necessariamente in ordine). E $F_{2749}$, lungo 575 cifre, è il primo numero di Fibonacci per cui le prime nove cifre sono 1-9 pandigitali. -Given that $F_k$ is the first Fibonacci number for which the first nine digits AND the last nine digits are 1 - 9 pandigital, find `k`. +Dato che $F_k$ è il primo numero di Fibonacci per cui le prime nove cifre E le ultime nove cifre sono 1-9 pandigitali, trova `k`. # --hints-- -`pandigitalFibonacciEnds()` should return `329468`. +`pandigitalFibonacciEnds()` dovrebbe restituire `329468`. ```js assert.strictEqual(pandigitalFibonacciEnds(), 329468); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-105-special-subset-sums-testing.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-105-special-subset-sums-testing.md index 1636463728d..c36873dfa0e 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-105-special-subset-sums-testing.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-105-special-subset-sums-testing.md @@ -1,6 +1,6 @@ --- id: 5900f3d61000cf542c50fee8 -title: 'Problem 105: Special subset sums: testing' +title: 'Problema 105: somme di subset speciali: testing' challengeType: 1 forumTopicId: 301729 dashedName: problem-105-special-subset-sums-testing @@ -8,20 +8,20 @@ dashedName: problem-105-special-subset-sums-testing # --description-- -Let $S(A)$ represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true: +Sia $S(A)$ la somma degli elementi in un set A di dimensione n. Lo chiamiamo un set di somma speciale se per ogni due subset non vuoi e distinti, B e C, sono vere le seguenti proprietà: -1. $S(B) ≠ S(C)$; that is, sums of subsets cannot be equal. -2. If B contains more elements than C then $S(B) > S(C)$. +1. $S(B) ≠ S(C)$, cioè le somme dei subset non possono essere uguali. +2. Se B contiene più elementi di C allora $S(B) > S(C)$. -For example, {81, 88, 75, 42, 87, 84, 86, 65} is not a special sum set because 65 + 87 + 88 = 75 + 81 + 84, whereas {157, 150, 164, 119, 79, 159, 161, 139, 158} satisfies both rules for all possible subset pair combinations and $S(A) = 1286$. +Per esempio, {81, 88, 75, 42, 87, 84, 86, 65} non è un set a somma speciale perché 65 + 87 + 88 = 75 + 81 + 84, mentre 157, 150, 164, 119, 79, 159, 161, 139, 158} soddisfa entrambe le regole per tutte le possibili combinazioni di coppie di subset e $S(A) = 1286$. -Using `sets`, an array with one-hundred sets, containing seven to twelve elements (the two examples given above are the first two sets), identify all the special sum sets, $A_1, A_2, \ldots, A_k$, and find the value of $(A_1) + S(A_2) + \cdots + S(A_k)$. +Usando `sets`, un array con cento set che contengono tra 7 e 12 elementi (i due esempi dati sopra sono i primi due set), identifica tutti i set a somma speciale, $A_1, A_2, \ldots, A_k$, e trova il valore di $(A_1) + S(A_2) + \cdots + S(A_k)$. -**Note:** This problem is related to Problem 103 and Problem 106. +**Nota:** questo problema è legato ai problemi 103 e 106. # --hints-- -`testingSpecialSubsetSums(testSets)` should return `73702`. +`testingSpecialSubsetSums(testSets)` dovrebbe restituire `73702`. ```js assert.strictEqual(testingSpecialSubsetSums(_testSets), 73702); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-106-special-subset-sums-meta-testing.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-106-special-subset-sums-meta-testing.md index 67638b56e90..4c0808fc780 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-106-special-subset-sums-meta-testing.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-106-special-subset-sums-meta-testing.md @@ -1,6 +1,6 @@ --- id: 5900f3d71000cf542c50fee9 -title: 'Problem 106: Special subset sums: meta-testing' +title: 'Problema 106: somme di subset speciali: meta-testing' challengeType: 1 forumTopicId: 301730 dashedName: problem-106-special-subset-sums-meta-testing @@ -8,22 +8,22 @@ dashedName: problem-106-special-subset-sums-meta-testing # --description-- -Let $S(A)$ represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true: +Sia $S(A)$ la somma degli elementi in un set A di dimensione n. Lo chiamiamo un set di somma speciale se per ogni due subset non vuoi e distinti, B e C, sono vere le seguenti proprietà: -1. $S(B) ≠ S(C)$; that is, sums of subsets cannot be equal. -2. If B contains more elements than C then $S(B) > S(C)$. +1. $S(B) ≠ S(C)$, cioè le somme dei subset non possono essere uguali. +2. Se B contiene più elementi di C allora $S(B) > S(C)$. -For this problem we shall assume that a given set contains n strictly increasing elements and it already satisfies the second rule. +Per questo problema supponiamo che un dato set contenga n elementi in ordine strettamente crescente e soddisfi la seconda regola. -Surprisingly, out of the 25 possible subset pairs that can be obtained from a set for which n = 4, only 1 of these pairs need to be tested for equality (first rule). Similarly, when n = 7, only 70 out of the 966 subset pairs need to be tested. +Sorprendentemente, delle 25 possibili coppie di subset che possono essere ottenute da un set per cui n = 4, solo una di queste coppie deve essere testata per l'uguaglianza (prima regola). Similmente, quando n = 7, solo 70 delle 966 coppie di subset hanno bisogno di essere testate. -For n = 12, how many of the 261625 subset pairs that can be obtained need to be tested for equality? +Per n = 12, quante delle 261625 coppie di subset che possono essere ottenute devono essere testate per l'uguaglianza? -**Note:** This problem is related to Problem 103 and Problem 105. +**Nota:** questo problema è legato ai problemi 103 e 105. # --hints-- -`subsetSumsMetaTesting()` should return `21384`. +`subsetSumsMetaTesting()` dovrebbe restituire `21384`. ```js assert.strictEqual(subsetSumsMetaTesting(), 21384); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-107-minimal-network.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-107-minimal-network.md index 3b69363096d..3f8739af978 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-107-minimal-network.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-107-minimal-network.md @@ -1,6 +1,6 @@ --- id: 5900f3d91000cf542c50feea -title: 'Problem 107: Minimal network' +title: 'Problema 107: rete minimale' challengeType: 1 forumTopicId: 301731 dashedName: problem-107-minimal-network @@ -8,11 +8,11 @@ dashedName: problem-107-minimal-network # --description-- -The following undirected network consists of seven vertices and twelve edges with a total weight of 243. +La seguente rete non orientata è costituita da sette vertici e dodici archi con un peso totale di 243. -Network with seven vertices and twelve edges +Rete con sette vertici e dodici archi -The same network can be represented by the matrix below. +La stessa rete può essere rappresentata dalla matrice sottostante. | | A | B | C | D | E | F | G | | - | -- | -- | -- | -- | -- | -- | -- | @@ -25,15 +25,15 @@ The same network can be represented by the matrix below. | G | - | - | - | 23 | 11 | 27 | - | -However, it is possible to optimise the network by removing some edges and still ensure that all points on the network remain connected. The network which achieves the maximum saving is shown below. It has a weight of 93, representing a saving of 243 − 93 = 150 from the original network. +Tuttavia, è possibile ottimizzare la rete rimuovendo alcuni archi, garantendo ancora che tutti i punti della rete rimangano connessi. La rete per cui il risparmio è massimo è mostrata di seguito. Ha un peso di 93, che rappresenta un risparmio di 243 − 93 = 150 rispetto alla rete originale. -Network with seven vertices and left six edges: AB, BD, CA, DE, DF, EG +Rete con sette vertici e sei archi rimanenti: AB, BD, CA, DE, DF, EG -Using `network`, an 2D array representing network in matrix form, find the maximum saving which can be achieved by removing redundant edges whilst ensuring that the network remains connected. Vertices not having connection will be represented with `-1`. +Utilizzando `network`, un array 2D che rappresenta la rete in forma di matrice, trova il massimo risparmio che può essere ottenuto rimuovendo gli archi ridondanti, garantendo al contempo che la rete rimanga connessa. I vertici che non hanno connessione saranno rappresentati con `-1`. # --hints-- -`minimalNetwork(testNetwork)` should return `259679`. +`minimalNetwork(testNetwork)` dovrebbe restituire `259679`. ```js assert.strictEqual(minimalNetwork(_testNetwork), 259679); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-108-diophantine-reciprocals-i.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-108-diophantine-reciprocals-i.md index 56fbe532238..fc1b488c735 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-108-diophantine-reciprocals-i.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-108-diophantine-reciprocals-i.md @@ -1,6 +1,6 @@ --- id: 5900f3d91000cf542c50feeb -title: 'Problem 108: Diophantine Reciprocals I' +title: 'Problema 108: reciproci diofantini I' challengeType: 1 forumTopicId: 301732 dashedName: problem-108-diophantine-reciprocals-i @@ -8,21 +8,21 @@ dashedName: problem-108-diophantine-reciprocals-i # --description-- -In the following equation x, y, and n are positive integers. +Nella seguente equazione x, y e n sono interi positivi. $$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$ -For `n` = 4 there are exactly three distinct solutions: +Per `n` = 4 ci sono esattamente tre distinte soluzioni: $$\begin{align} & \frac{1}{5} + \frac{1}{20} = \frac{1}{4}\\\\ \\\\ & \frac{1}{6} + \frac{1}{12} = \frac{1}{4}\\\\ \\\\ & \frac{1}{8} + \frac{1}{8} = \frac{1}{4} \end{align}$$ -What is the least value of `n` for which the number of distinct solutions exceeds one-thousand? +Qual è il valore più piccolo di `n` per cui il numero di soluzioni distinte supera mille? # --hints-- -`diophantineOne()` should return `180180`. +`diophantineOne()` dovrebbe restituire `180180`. ```js assert.strictEqual(diophantineOne(), 180180); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-109-darts.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-109-darts.md index 5064f7e146c..bc471b85cf4 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-109-darts.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-109-darts.md @@ -1,6 +1,6 @@ --- id: 5900f3db1000cf542c50feec -title: 'Problem 109: Darts' +title: 'Problema 109: freccette' challengeType: 1 forumTopicId: 301733 dashedName: problem-109-darts @@ -8,17 +8,17 @@ dashedName: problem-109-darts # --description-- -In the game of darts a player throws three darts at a target board which is split into twenty equal sized sections numbered one to twenty. +Nel gioco delle freccette un giocatore lancia tre freccette a un bersaglio che è diviso in venti sezioni di dimensioni uguali, numerate da uno a venti. -Darts board +Bersaglio da freccette -The score of a dart is determined by the number of the region that the dart lands in. A dart landing outside the red/green outer ring scores zero. The black and cream regions inside this ring represent single scores. However, the red/green outer ring and middle ring score double and treble scores respectively. +Il punteggio di un lancio è determinato dal numero della regione colpita dalla freccetta. Un tiro fuori dall'anello rosso/verde esterno vale zero. Le regioni nere e color crema all'interno di questo anello rappresentano punteggi singoli. Tuttavia, gli anelli rosso/verde all'esterno e nel mezzo contano rispettivamente come punteggio doppio e triplo. -At the center of the board are two concentric circles called the bull region, or bulls-eye. The outer bull is worth 25 points and the inner bull is a double, worth 50 points. +Al centro del tabellone ci sono due cerchi concentrici. Il cerchio esterno vale 25 punti e il cerchio interno è un doppio che vale 50 punti. -There are many variations of rules but in the most popular game the players will begin with a score of 301 or 501 and the first player to reduce their running total to zero is a winner. However, it is normal to play a "doubles out" system, which means that the player must land a double (including the double bulls-eye at the center of the board) on their final dart to win; any other dart that would reduce their running total to one or lower means the score for that set of three darts is "bust". +Ci sono molte variazioni di regole ma nel gioco più popolare i giocatori iniziano con un punteggio di 301 o 501 e il primo giocatore che riduce il suo punteggio a zero vince. Comunque, è normale giocare un sistema a "finale doppio", che significa che il giocatore deve colpire un doppio (incluso il doppio al centro del tabellone) con la sua freccetta finale per vincere; per qualsiasi altra freccetta che ridurrebbe il punteggio a 1 o inferione, il set di tre freccette è "sprecato". -When a player is able to finish on their current score it is called a "checkout" and the highest checkout is 170: T20 T20 D25 (two treble 20s and double bull). There are exactly eleven distinct ways to checkout on a score of 6: +Quando un giocare finisce sul proprio punteggio, si dice che ha fatto "checkout" e il checkout più alto è 170: T20 T20 D25 (due tripli 20 e un doppio centro). Ci sono esattamente 11 modi distinti per fare checkout con un punteggio di 6: $$\begin{array} \text{D3} & & \\\\ D1 & D2 & \\\\ S2 & D2 & \\\\ @@ -27,11 +27,11 @@ $$\begin{array} \text{D3} & & \\\\ S1 & S3 & D1 \\\\ D1 & D1 & D1 \\\\ D1 & S2 & D1 \\\\ S2 & S2 & D1 \end{array}$$ -Note that D1 D2 is considered different from D2 D1 as they finish on different doubles. However, the combination S1 T1 D1 is considered the same as T1 S1 D1. In addition, we shall not include misses in considering combinations; for example, D3 is the same as 0 D3 and 0 0 D3. Incredibly there are 42336 distinct ways of checking out in total. How many distinct ways can a player checkout with a score less than 100? +Nota che D1 D2 è considerato diverso da D2 D1 visto che finiscono su doppi diversi. Invece, la combinazione S1 T1 D1 è considerata uguale a T1 S1 D1. In aggiunta, non includiamo lanci mancati considerando le combinazioni; per esempio, D3 è la stessa cosa di 0 D3 e 0 0 D3. Incredibilmente ci sono 42336 modi diversi per fare checkout in totale. Quanti modi distinti ci sono per un giocatore di fare checkout con un punteggio inferiore a 100? # --hints-- -`darts()` should return `38182`. +`darts()` dovrebbe restituire `38182`. ```js assert.strictEqual(darts(), 38182); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-110-diophantine-reciprocals-ii.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-110-diophantine-reciprocals-ii.md index 9bbeb3dd075..6bc3e22b956 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-110-diophantine-reciprocals-ii.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-110-diophantine-reciprocals-ii.md @@ -1,6 +1,6 @@ --- id: 5900f3db1000cf542c50feed -title: 'Problem 110: Diophantine Reciprocals II' +title: 'Problema 110: reciproci diofantini II' challengeType: 1 forumTopicId: 301735 dashedName: problem-110-diophantine-reciprocals-ii @@ -8,19 +8,19 @@ dashedName: problem-110-diophantine-reciprocals-ii # --description-- -In the following equation x, y, and n are positive integers. +Nella seguente equazione x, y e n sono interi positivi. $$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$ -It can be verified that when `n` = 1260 there are 113 distinct solutions and this is the least value of `n` for which the total number of distinct solutions exceeds one hundred. +Si può verificare che quando `n` = 1260 ci sono 113 soluzioni distinte e questo è il valore minimo di `n` per il quale il numero totale di soluzioni distinte supera cento. -What is the least value of `n` for which the number of distinct solutions exceeds four million? +Qual è il valore minimo di `n` per il quale il numero di soluzioni distinte supera i quattro milioni? -**Note:** This problem is a much more difficult version of Problem 108 and as it is well beyond the limitations of a brute force approach it requires a clever implementation. +**Nota:** questo problema è una versione molto più difficile del Problema 108 e poiché è ben al di là dei limiti di un approccio a forza bruta richiede un'implementazione ingegnosa. # --hints-- -`diophantineTwo()` should return `9350130049860600`. +`diophantineTwo()` dovrebbe restituire `9350130049860600`. ```js assert.strictEqual(diophantineTwo(), 9350130049860600); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-111-primes-with-runs.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-111-primes-with-runs.md index 7f22fbffb6c..aba5e90b65e 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-111-primes-with-runs.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-111-primes-with-runs.md @@ -1,6 +1,6 @@ --- id: 5900f3db1000cf542c50feee -title: 'Problem 111: Primes with runs' +title: 'Problema 111: numeri primi con cifre ripetute' challengeType: 1 forumTopicId: 301736 dashedName: problem-111-primes-with-runs @@ -8,15 +8,15 @@ dashedName: problem-111-primes-with-runs # --description-- -Considering 4-digit primes containing repeated digits it is clear that they cannot all be the same: 1111 is divisible by 11, 2222 is divisible by 22, and so on. But there are nine 4-digit primes containing three ones: +Considerando i numeri primi a 4 cifre contenenti cifre ripetute è chiaro che non possono essere tutte uguali: 1111 è divisibile per 11, 2222 è divisibile per 22, e così via. Ma ci sono nove primi a 4 cifre contenenti tre uno: $$1117, 1151, 1171, 1181, 1511, 1811, 2111, 4111, 8111$$ -We shall say that $M(n, d)$ represents the maximum number of repeated digits for an n-digit prime where d is the repeated digit, $N(n, d)$ represents the number of such primes, and $S(n, d)$ represents the sum of these primes. +Diciamo che $M(n, d)$ rappresenta il numero massimo di cifre ripetute per un numero primo di n cifre in cui d è la cifra ripetuta, $N(n, d)$ rappresenta il numero di tali primi e $S(n, d)$ rappresenta la loro somma. -So $M(4, 1) = 3$ is the maximum number of repeated digits for a 4-digit prime where one is the repeated digit, there are $N(4, 1) = 9$ such primes, and the sum of these primes is $S(4, 1) = 22275$. It turns out that for d = 0, it is only possible to have $M(4, 0) = 2$ repeated digits, but there are $N(4, 0) = 13$ such cases. +Quindi $M(4, 1) = 3$ è il numero massimo di cifre ripetute per un primo a 4 cifre dove la cifra ripetuta è uno, ci sono $N(4, 1) = 9$ di questi primi e la loro somma è $S(4, 1) = 22275$. Si scopre che per d = 0, è possibile avere solo $M(4, 0) = 2$ cifre ripetute, ma ci sono $N(4, 0) = 13$ casi simili. -In the same way we obtain the following results for 4-digit primes. +Allo stesso modo otteniamo i seguenti risultati per i primi a 4 cifre. | Digit, d | $M(4, d)$ | $N(4, d)$ | $S(4, d)$ | | -------- | --------- | --------- | --------- | @@ -31,11 +31,11 @@ In the same way we obtain the following results for 4-digit primes. | 8 | 3 | 1 | 8887 | | 9 | 3 | 7 | 48073 | -For d = 0 to 9, the sum of all $S(4, d)$ is 273700. Find the sum of all $S(10, d)$. +Per d = 0 a 9, la somma di tutti gli $S(4, d)$ è di 273700. Trova la somma di tutti gli $S(10, d)$. # --hints-- -`primesWithRuns()` should return `612407567715`. +`primesWithRuns()` dovrebbe restituire `612407567715`. ```js assert.strictEqual(primesWithRuns(), 612407567715); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-112-bouncy-numbers.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-112-bouncy-numbers.md index 7599de29978..867d7a6f537 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-112-bouncy-numbers.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-112-bouncy-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f3dd1000cf542c50feef -title: 'Problem 112: Bouncy numbers' +title: 'Problema 112: numeri dinamici' challengeType: 1 forumTopicId: 301738 dashedName: problem-112-bouncy-numbers @@ -8,21 +8,21 @@ dashedName: problem-112-bouncy-numbers # --description-- -Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468. +Andando da sinistra a destra, se nessuna cifra viene superata dalla cifra alla sua sinistra, il numero viene detto crescente; ad esempio, 134468. -Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420. +Allo stesso modo, se ogni cifra non viene superata dalla cifra alla sua destra il numero è detto decrescente; per esempio, 66420. -We shall call a positive integer that is neither increasing nor decreasing a "bouncy" number; for example, 155349. +Chiameremo dinamico un numero intero positivo che non sia né crescente né decrescente; per esempio, 155349. -Clearly there cannot be any bouncy numbers below one-hundred, but just over half of the numbers below one-thousand (525) are bouncy. In fact, the least number for which the proportion of bouncy numbers first reaches 50% is 538. +Chiaramente non ci possono essere numeri dinamici sotto il cento, ma poco più della metà dei numeri sotto il mille (525) è dinamico. Infatti, il numero minimo per il quale la proporzione di numeri dinamici raggiunge il 50% è 538. -Surprisingly, bouncy numbers become more and more common and by the time we reach 21780 the proportion of bouncy numbers is equal to 90%. +Sorprendentemente, i numeri dinamici diventano sempre più comuni e dal momento in cui raggiungiamo 21780 la proporzione di numeri dinamici è pari al 90%. -Find the least number for which the proportion of bouncy numbers is exactly 99%. +Trova il numero più basso per il quale la proporzione di numeri dinamici è esattamente 99%. # --hints-- -`bouncyNumbers()` should return `1587000`. +`bouncyNumbers()` dovrebbe restituire `1587000`. ```js assert.strictEqual(bouncyNumbers(), 1587000); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-113-non-bouncy-numbers.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-113-non-bouncy-numbers.md index 868909ef6b2..ccc39ac2eda 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-113-non-bouncy-numbers.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-113-non-bouncy-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f3dd1000cf542c50fef0 -title: 'Problem 113: Non-bouncy numbers' +title: 'Problema 113: numeri non dinamici' challengeType: 1 forumTopicId: 301739 dashedName: problem-113-non-bouncy-numbers @@ -8,19 +8,19 @@ dashedName: problem-113-non-bouncy-numbers # --description-- -Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468. +Andando da sinistra a destra, se nessuna cifra viene superata dalla cifra alla sua sinistra, il numero viene detto crescente; ad esempio, 134468. -Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420. +Allo stesso modo, se ogni cifra non viene superata dalla cifra alla sua destra il numero è detto decrescente; per esempio, 66420. -We shall call a positive integer that is neither increasing nor decreasing a "bouncy" number; for example, 155349. +Chiameremo dinamico un numero intero positivo che non sia né crescente né decrescente; per esempio, 155349. -As n increases, the proportion of bouncy numbers below n increases such that there are only 12951 numbers below one-million that are not bouncy and only 277032 non-bouncy numbers below ${10}^{10}$. +All'aumentare di n, la proporzione di numeri dinamici sotto n aumenta in modo che ci sono solo 12951 numeri sotto un milione che non sono dinamici e solo 277032 numeri non dinamici sotto ${10}^{10}$. -How many numbers below a googol (${10}^{100}$) are not bouncy? +Quanti numeri sotto un googol (${10}^{100}$) non sono dinamici? # --hints-- -`nonBouncyNumbers()` should return `51161058134250`. +`nonBouncyNumbers()` dovrebbe restituire `51161058134250`. ```js assert.strictEqual(nonBouncyNumbers(), 51161058134250); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-114-counting-block-combinations-i.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-114-counting-block-combinations-i.md index 3e1b2f85927..b45ab8f4029 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-114-counting-block-combinations-i.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-114-counting-block-combinations-i.md @@ -1,6 +1,6 @@ --- id: 5900f3e01000cf542c50fef2 -title: 'Problem 114: Counting block combinations I' +title: 'Problema 114: conteggio delle combinazioni di blocchi I' challengeType: 1 forumTopicId: 301740 dashedName: problem-114-counting-block-combinations-i @@ -8,17 +8,17 @@ dashedName: problem-114-counting-block-combinations-i # --description-- -A row measuring seven units in length has red blocks with a minimum length of three units placed on it, such that any two red blocks (which are allowed to be different lengths) are separated by at least one black square. There are exactly seventeen ways of doing this. +Una fila lunga sette unità presenta blocchi rossi con una lunghezza minima di tre unità posti su di essa, in modo che due blocchi rossi (che possono avere lunghezze diverse) siano separati da almeno un quadrato nero. Ci sono esattamente diciassette modi per farlo. -Possible ways of placing block with a minimum length of three units, on a row with length of seven units +Possibili modi di posizionare un blocco con una lunghezza minima di tre unità, su una fila con lunghezza di sette unità -How many ways can a row measuring fifty units in length be filled? +In quanti modi può essere riempita una fila di cinquanta unità di lunghezza? -**Note:** Although the example above does not lend itself to the possibility, in general it is permitted to mix block sizes. For example, on a row measuring eight units in length you could use red (3), black (1), and red (4). +**Nota:** anche se l'esempio di cui sopra non si presta alla possibilità, in generale è consentito mescolare le dimensioni dei blocchi. Ad esempio, su una fila che misura otto unità di lunghezza è possibile utilizzare rosso (3), nero (1), e rosso (4). # --hints-- -`countingBlockOne()` should return `16475640049`. +`countingBlockOne()` dovrebbe restituire `16475640049`. ```js assert.strictEqual(countingBlockOne(), 16475640049); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-115-counting-block-combinations-ii.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-115-counting-block-combinations-ii.md index a659ea34ad1..9a415b286c3 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-115-counting-block-combinations-ii.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-115-counting-block-combinations-ii.md @@ -1,6 +1,6 @@ --- id: 5900f3df1000cf542c50fef1 -title: 'Problem 115: Counting block combinations II' +title: 'Problema 115: conteggio delle combinazioni di blocchi II' challengeType: 1 forumTopicId: 301741 dashedName: problem-115-counting-block-combinations-ii @@ -8,23 +8,23 @@ dashedName: problem-115-counting-block-combinations-ii # --description-- -A row measuring `n` units in length has red blocks with a minimum length of `m` units placed on it, such that any two red blocks (which are allowed to be different lengths) are separated by at least one black square. +Una fila di `n` unità di lunghezza presenta blocchi rossi con una lunghezza minima di `m` unità posti su di essa, in modo che due blocchi rossi (che possono essere lunghezze diverse) siano separati da almeno un quadrato nero. -Let the fill-count function, $F(m, n)$, represent the number of ways that a row can be filled. +Lascia che la funzione di conteggio del riempimento, $F(m, n)$, rappresenti il numero di modi in cui una riga può essere riempita. -For example, $F(3, 29) = 673135$ and $F(3, 30) = 1089155$. +Per esempio, $F(3, 29) = 673135$ e $F(3, 30) = 1089155$. -That is, for m = 3, it can be seen that n = 30 is the smallest value for which the fill-count function first exceeds one million. +Cioè, per m = 3, si può osservare che n = 30 è il valore più piccolo per il quale la funzione di riempimento supera per la prima volta un milione. -In the same way, for m = 10, it can be verified that $F(10, 56) = 880711$ and $F(10, 57) = 1148904$, so n = 57 is the least value for which the fill-count function first exceeds one million. +Allo stesso modo, per m = 10, si può verificare che $F(10, 56) = 880711$ e $F(10, 57) = 1148904$, quindi n = 57 è il valore minimo per il quale la funzione di riempimento supera per la prima volta un milione. -For m = 50, find the least value of `n` for which the fill-count function first exceeds one million. +Per m = 50, trovare il valore minimo di `n` per il quale la funzione di riempimento è superiore a un milione. -**Note:** This is a more difficult version of Problem 114. +**Nota:** questa è una versione più difficile del Problema 114. # --hints-- -`countingBlockTwo()` should return `168`. +`countingBlockTwo()` dovrebbe restituire `168`. ```js assert.strictEqual(countingBlockTwo(), 168); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-116-red-green-or-blue-tiles.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-116-red-green-or-blue-tiles.md index b0b1969a3df..402193262f2 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-116-red-green-or-blue-tiles.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-116-red-green-or-blue-tiles.md @@ -1,6 +1,6 @@ --- id: 5900f3e01000cf542c50fef3 -title: 'Problem 116: Red, green or blue tiles' +title: 'Problema 116: piastrelle rosse, verdi o blu' challengeType: 1 forumTopicId: 301742 dashedName: problem-116-red-green-or-blue-tiles @@ -8,27 +8,27 @@ dashedName: problem-116-red-green-or-blue-tiles # --description-- -A row of five black square tiles is to have a number of its tiles replaced with coloured oblong tiles chosen from red (length two), green (length three), or blue (length four). +In una fila di cinque piastrelle quadrate nere un certo numero di piastrelle deve essere sostituito con piastrelle oblunghe colorate scelte tra rosso (lunghezza due), verde (lunghezza tre) o blu (lunghezza quattro). -If red tiles are chosen there are exactly seven ways this can be done. +Se si scelgono piastrelle rosse ci sono esattamente sette modi per farlo. -Possible ways to placing red oblong on a row with length of five units +Possibili modi di posizionare piastrelle oblunghe rosse su una fila con lunghezza di cinque unità -If green tiles are chosen there are three ways. +Se si scelgono piastrelle verdi ci sono tre modi. -Possible ways of placing green oblong on a row with length of five units +Possibili modi di posizionare piastrelle oblunghe verdi su una fila con lunghezza di cinque unità -And if blue tiles are chosen there are two ways. +E se si scelgono piastrelle blu ci sono due modi. -Possible ways of placing blue oblong on a row with length of five units +Possibili modi di posizionare piastrelle oblunghe blu su una fila con lunghezza di cinque unità -Assuming that colors cannot be mixed there are 7 + 3 + 2 = 12 ways of replacing the black tiles in a row measuring five units in length. How many different ways can the black tiles in a row measuring fifty units in length be replaced if colors cannot be mixed and at least one colored tile must be used? +Supponendo che i colori non possano essere mescolati ci sono 7 + 3 + 2 = 12 modi per sostituire le piastrelle nere in una riga che misura cinque unità di lunghezza. In quanti modi diversi si possono sostituire le piastrelle nere in una fila di cinquanta unità di lunghezza se i colori non possono essere mescolati e si deve usare almeno una piastrella colorata? -**Note:** This is related to Problem 117. +**Nota:** questo problema è correlato al problema 117. # --hints-- -`redGreenBlueOne()` should return `20492570929`. +`redGreenBlueOne()` dovrebbe restituire `20492570929`. ```js assert.strictEqual(redGreenBlueOne(), 20492570929); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-117-red-green-and-blue-tiles.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-117-red-green-and-blue-tiles.md index 4a4873aac95..f55cdd91f37 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-117-red-green-and-blue-tiles.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-117-red-green-and-blue-tiles.md @@ -1,6 +1,6 @@ --- id: 5900f3e21000cf542c50fef4 -title: 'Problem 117: Red, green, and blue tiles' +title: 'Problema 117: piastrelle rosse, verdi o blu' challengeType: 1 forumTopicId: 301743 dashedName: problem-117-red-green-and-blue-tiles @@ -8,17 +8,17 @@ dashedName: problem-117-red-green-and-blue-tiles # --description-- -Using a combination of black square tiles and oblong tiles chosen from: red tiles measuring two units, green tiles measuring three units, and blue tiles measuring four units, it is possible to tile a row measuring five units in length in exactly fifteen different ways. +Utilizzando una combinazione di piastrelle quadrate nere e piastrelle oblunghe scelte tra: piastrelle rosse che misurano due unità, piastrelle verdi che misurano tre unità, e piastrelle blu che misurano quattro unità, è possibile piastrellare una fila che misura cinque unità di lunghezza in esattamente quindici modi diversi. -Possible ways of placing red, green and blue oblongs on a row with length of five units +Possibili modi di posizionare piastrelle oblunghe rosse, verdi e blu su una fila con lunghezza di cinque unità -How many ways can a row measuring fifty units in length be tiled? +In quanti modi può essere riempita una fila di cinquanta unità di lunghezza? -**Note**: This is related to Problem 116. +**Nota:** questo problema è correlato al problema 116. # --hints-- -`redGreenBlueTilesTwo()` should return `100808458960497`. +`redGreenBlueTilesTwo()` dovrebbe restituire `100808458960497`. ```js assert.strictEqual(redGreenBlueTilesTwo(), 100808458960497); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-118-pandigital-prime-sets.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-118-pandigital-prime-sets.md index 195d39136ed..64a555626b4 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-118-pandigital-prime-sets.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-118-pandigital-prime-sets.md @@ -1,6 +1,6 @@ --- id: 5900f3e21000cf542c50fef5 -title: 'Problem 118: Pandigital prime sets' +title: 'Problema 118: set di numeri primi pandigitali' challengeType: 1 forumTopicId: 301744 dashedName: problem-118-pandigital-prime-sets @@ -8,13 +8,13 @@ dashedName: problem-118-pandigital-prime-sets # --description-- -Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can be formed. Interestingly with the set $\\{2, 5, 47, 89, 631\\}$, all of the elements belonging to it are prime. +Usando tutte le cifre da 1 a 9 e concatenandole liberamente per formare numeri interi decimali, possono essere formati diversi insiemi. È interessante notare che nel set $\\{2, 5, 47, 89, 631\\}$, tutti gli elementi che vi appartengono sono primi. -How many distinct sets containing each of the digits one through nine exactly once contain only prime elements? +Quanti insiemi distinti che contengono ciascuna delle cifre da uno a nove esattamente una volta contengono solo elementi primi? # --hints-- -`pandigitalPrimeSets()` should return `44680`. +`pandigitalPrimeSets()` dovrebbe restituire `44680`. ```js assert.strictEqual(pandigitalPrimeSets(), 44680); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-119-digit-power-sum.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-119-digit-power-sum.md index 87bf836b33a..4d839e18193 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-119-digit-power-sum.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-119-digit-power-sum.md @@ -1,6 +1,6 @@ --- id: 5900f3e41000cf542c50fef6 -title: 'Problem 119: Digit power sum' +title: 'Problema 119: somma delle potenze delle cifre' challengeType: 1 forumTopicId: 301745 dashedName: problem-119-digit-power-sum @@ -8,17 +8,17 @@ dashedName: problem-119-digit-power-sum # --description-- -The number 512 is interesting because it is equal to the sum of its digits raised to some power: $5 + 1 + 2 = 8$, and $8^3 = 512$. Another example of a number with this property is $614656 = 28^4$. +Il numero 512 è interessante perché è uguale alla somma delle sue cifre elevata a un certa potenza: $5 + 1 + 2 = 8$, e $8^3 = 512$. Un altro esempio di numero con questa proprietà è $614656 = 28^4$. -We shall define $a_n$ to be the $n-th$ term of this sequence and insist that a number must contain at least two digits to have a sum. +Definiremo $a_n$ come termine ennesimo $n-th$ di questa sequenza e insisteremo affinché un numero contenga almeno due cifre per avere una somma. -You are given that $a_2 = 512$ and $a_{10} = 614656$. +Ti viene dato che $a_2 = 512$ e $a_{10} = 614656$. -Find $a_{30}$. +Trova $a_{30}$. # --hints-- -`digitPowerSum()` should return `248155780267521`. +`digitPowerSum()` dovrebbe restituire `248155780267521`. ```js assert.strictEqual(digitPowerSum(), 248155780267521); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-120-square-remainders.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-120-square-remainders.md index d42c224e3db..c8f40967f1c 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-120-square-remainders.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-120-square-remainders.md @@ -1,6 +1,6 @@ --- id: 5900f3e41000cf542c50fef7 -title: 'Problem 120: Square remainders' +title: 'Problema 120: resti di quadrati' challengeType: 1 forumTopicId: 301747 dashedName: problem-120-square-remainders @@ -8,15 +8,15 @@ dashedName: problem-120-square-remainders # --description-- -Let `r` be the remainder when ${(a − 1)}^n + {(a + 1)}^n$ is divided by $a^2$. +Sia `r` il resto quando ${(a − 1)}^n + {(a + 1)}^n$ viene diviso per $a^2$. -For example, if $a = 7$ and $n = 3$, then $r = 42: 6^3 + 8^3 = 728 ≡ 42 \\ \text{mod}\\ 49$. And as `n` varies, so too will `r`, but for $a = 7$ it turns out that $r_{max} = 42$. +Per esempio, se $a = 7$ e $n = 3$, allora $r = 42: 6^3 + 8^3 = 728 ≡ 42 \\ \text{mod}\\ 49$. E se `n` varia, allora anche `r` varia, ma per $a = 7$ risulta che $r_{max} = 42$. -For $3 ≤ a ≤ 1000$, find $\sum{r}_{max}$. +Per $3 ≤ a ≤ 1000$, trova $\sum{r}_{max}$. # --hints-- -`squareRemainders()` should return `333082500`. +`squareRemainders()` dovrebbe restituire `333082500`. ```js assert.strictEqual(squareRemainders(), 333082500); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-121-disc-game-prize-fund.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-121-disc-game-prize-fund.md index 0f23b7fdd50..f24d2131d12 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-121-disc-game-prize-fund.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-121-disc-game-prize-fund.md @@ -1,6 +1,6 @@ --- id: 5900f3e51000cf542c50fef8 -title: 'Problem 121: Disc game prize fund' +title: 'Problema 121: fondo premio per il gioco del disco' challengeType: 1 forumTopicId: 301748 dashedName: problem-121-disc-game-prize-fund @@ -8,17 +8,17 @@ dashedName: problem-121-disc-game-prize-fund # --description-- -A bag contains one red disc and one blue disc. In a game of chance a player takes a disc at random and its colour is noted. After each turn the disc is returned to the bag, an extra red disc is added, and another disc is taken at random. +Una sacca contiene un disco rosso e un disco blu. In un gioco di probabilità un giocatore prende un disco a caso e il suo colore viene annotato. Dopo ogni giro il disco viene rimesso nel sacchetto, viene aggiunto un disco rosso in più e un altro disco viene prelevato a caso. -The player pays £1 to play and wins if they have taken more blue discs than red discs at the end of the game. +Il giocatore paga £1 per giocare e vince se ha preso più dischi blu rispetto ai dischi rossi alla fine del gioco. -If the game is played for four turns, the probability of a player winning is exactly 11/120, and so the maximum prize fund the banker should allocate for winning in this game would be £10 before they would expect to incur a loss. Note that any payout will be a whole number of pounds and also includes the original £1 paid to play the game, so in the example given the player actually wins £9. +Se il gioco prosegue per quattro turni, la probabilità di una vittoria di un giocatore è esattamente 11/120 e quindi il fondo premio massimo che il banchiere dovrebbe assegnare per vincere in questo gioco sarebbe 10£ prima di aspettarsi di poter incorrere in una perdita. Nota che qualsiasi pagamento sarà un numero intero di sterline e comprende anche l'originale £1 pagato per giocare il gioco, così nell'esempio dato il giocatore vince effettivamente £9. -Find the maximum prize fund that should be allocated to a single game in which fifteen turns are played. +Trova il fondo premio massimo che dovrebbe essere assegnato a una singola partita in cui sono giocati quindici turni. # --hints-- -`discGamePrize()` should return `2269`. +`discGamePrize()` dovrebbe restituire `2269`. ```js assert.strictEqual(discGamePrize(), 2269); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-122-efficient-exponentiation.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-122-efficient-exponentiation.md index 78c29aa7952..5302295f689 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-122-efficient-exponentiation.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-122-efficient-exponentiation.md @@ -1,6 +1,6 @@ --- id: 5900f3e61000cf542c50fef9 -title: 'Problem 122: Efficient exponentiation' +title: 'Problema 122: esponenziazione efficiente' challengeType: 1 forumTopicId: 301749 dashedName: problem-122-efficient-exponentiation @@ -8,30 +8,30 @@ dashedName: problem-122-efficient-exponentiation # --description-- -The most naive way of computing $n^{15}$ requires fourteen multiplications: +Il modo più semplice di calcolare $n^{15}$ richiede quattordici moltiplicazioni: $$n × n × \ldots × n = n^{15}$$ -But using a "binary" method you can compute it in six multiplications: +Ma usando un metodo "binario" è possibile calcolarlo in sei moltiplicazioni: -$$\begin{align} & n × n = n^2\\\\ +$$$\start{align} & n × n = n^2\\\\ & n^2 × n^2 = n^4\\\\ & n^4 × n^4 = n^8\\\\ & n^8 × n^4 = n^{12}\\\\ & n^{12} × n^2 = n^{14}\\\\ & n^{14} × n = n^{15} \end{align}$$ -However it is yet possible to compute it in only five multiplications: +Tuttavia è possibile calcolarlo anche in sole cinque moltiplicazioni: $$\begin{align} & n × n = n^2\\\\ & n^2 × n = n^3\\\\ & n^3 × n^3 = n^6\\\\ & n^6 × n^6 = n^{12}\\\\ & n^{12} × n^3 = n^{15} \end{align}$$ -We shall define $m(k)$ to be the minimum number of multiplications to compute $n^k$; for example $m(15) = 5$. +Definiremo $m(k)$ in modo che sia il numero minimo di moltiplicazioni per calcolare $n^k$; per esempio $m(15) = 5$. -For $1 ≤ k ≤ 200$, find $\sum{m(k)}$. +Per $1 ≤ k ≤ 200$, trova $\sum{m(k)}$. # --hints-- -`efficientExponentation()` should return `1582`. +`efficientExponentation()` dovrebbe restituire `1582`. ```js assert.strictEqual(efficientExponentation(), 1582); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-123-prime-square-remainders.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-123-prime-square-remainders.md index 743089b64e3..0e5075552ca 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-123-prime-square-remainders.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-123-prime-square-remainders.md @@ -1,6 +1,6 @@ --- id: 5900f3e71000cf542c50fefa -title: 'Problem 123: Prime square remainders' +title: 'Problema 123: resti di quadrati primi' challengeType: 1 forumTopicId: 301750 dashedName: problem-123-prime-square-remainders @@ -8,17 +8,17 @@ dashedName: problem-123-prime-square-remainders # --description-- -Let $p_n$ be the $n$th prime: 2, 3, 5, 7, 11, ..., and let $r$ be the remainder when ${(p_n−1)}^n + {(p_n+1)}^n$ is divided by ${p_n}^2$. +Sia $p_n$ l'$n$-esimo primo: 2, 3, 5, 7, 11, ... e sia $r$ il resto quando ${(p_n−1)}^n + {(p_n+1)}^n$ è diviso per ${p_n}^2$. -For example, when $n = 3, p_3 = 5$, and $4^3 + 6^3 = 280 ≡ 5\\ mod\\ 25$. +Per esempio, quando $n = 3, p_3 = 5$, e $4^3 + 6^3 = 280 ≡ 5\\ mod\\ 25$. -The least value of $n$ for which the remainder first exceeds $10^9$ is 7037. +Il valore minimo di $n$ per il quale il resto supera per primo $10^9$ è 7037. -Find the least value of $n$ for which the remainder first exceeds $10^{10}$. +Trova il valore minimo di $n$ per il quale il resto supera per primo $10 ^{10}$. # --hints-- -`primeSquareRemainders()` should return `21035`. +`primeSquareRemainders()` dovrebbe restituire `21035`. ```js assert.strictEqual(primeSquareRemainders(), 21035); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-124-ordered-radicals.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-124-ordered-radicals.md index 899171a9731..6007d5aadc7 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-124-ordered-radicals.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-124-ordered-radicals.md @@ -1,6 +1,6 @@ --- id: 5900f3e81000cf542c50fefb -title: 'Problem 124: Ordered radicals' +title: 'Problema 124: radicali ordinati' challengeType: 1 forumTopicId: 301751 dashedName: problem-124-ordered-radicals @@ -8,17 +8,17 @@ dashedName: problem-124-ordered-radicals # --description-- -The radical of $n$, $rad(n)$, is the product of the distinct prime factors of $n$. For example, $504 = 2^3 × 3^2 × 7$, so $rad(504) = 2 × 3 × 7 = 42$. +Il radicale di $n$, $rad(n)$, è il prodotto dei fattori primi distinti di $n$. Per esempio, $504 = 2^3 × 3^2 × 7$, quindi $rad(504) = 2 × 3 × 7 = 42$. -If we calculate $rad(n)$ for $1 ≤ n ≤ 10$, then sort them on $rad(n)$, and sorting on $n$ if the radical values are equal, we get: +Se calcoliamo $rad(n)$ for $1 ≤ n ≤ 10$, quindi ordiniamo su $rad(n)$, e ordiniamo su $n$ se i valori dei radicali sono uguali, otteniamo:
- + - + @@ -112,11 +112,11 @@ If we calculate $rad(n)$ for $1 ≤ n ≤ 10$, then sort them on $rad(n)$, and s
$Unsorted$$non ordinati$ $Sorted$$ordinati$
$n$

-Let $E(k)$ be the $k$th element in the sorted $n$ column; for example, $E(4) = 8$ and $E(6) = 9$. If $rad(n)$ is sorted for $1 ≤ n ≤ 100000$, find $E(10000)$. +Sia $E(k)$ l'elemento $k$-esimo nella colonna $n$ ordinata; per esempio, $E(4) = 8$ e $E(6) = 9$. Se $rad(n)$ è ordinato per $1 ≤ n ≤ 100000$, trova $E(10000)$. # --hints-- -`orderedRadicals()` should return `21417`. +`orderedRadicals()` dovrebbe restituire `21417`. ```js assert.strictEqual(orderedRadicals(), 21417); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-125-palindromic-sums.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-125-palindromic-sums.md index eb499c13931..f44bfe9f7b4 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-125-palindromic-sums.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-125-palindromic-sums.md @@ -1,6 +1,6 @@ --- id: 5900f3e91000cf542c50fefc -title: 'Problem 125: Palindromic sums' +title: 'Problema 125: somme palindrome' challengeType: 1 forumTopicId: 301752 dashedName: problem-125-palindromic-sums @@ -8,14 +8,14 @@ dashedName: problem-125-palindromic-sums # --description-- -The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: $6^2 + 7^2 + 8^2 + 9^2 + 10^2 + 11^2 + 12^2$. +Il numero palindromo 595 è interessante perché può essere scritto come la somma dei quadrati consecutivi: $6^2 + 7^2 + 8^2 + 9^2 + 10^2 + 11^2 + 12^2$. -There are exactly eleven palindromes below one-thousand that can be written as consecutive square sums, and the sum of these palindromes is 4164. Note that $1 = 0^2 + 1^2$ has not been included as this problem is concerned with the squares of positive integers. +Ci sono esattamente undici palindromi sotto il mille che possono essere scritti come somma di quadrati consecutivi, e la somma di questi palindromi è 4164. Nota che $1 = 0^2 + 1^2$ non è stato incluso in quanto questo problema riguarda i quadrati degli interi positivi. -Find the sum of all the numbers less than the `limit` that are both palindromic and can be written as the sum of consecutive squares. +Trova la somma di tutti i numeri inferiori a `limit` che allo stesso tempo sono palindromi e possono essere scritti come la somma di quadrati consecutivi. # --hints-- -`palindromicSums(100000000)` should return `2906969179`. +`palindromicSums(100000000)` dovrebbe restituire `2906969179`. ```js @@ -23,13 +23,13 @@ assert.strictEqual(palindromicSums(100000000), 2906969179); ``` -`palindromicSums(100)` should return `137`. +`palindromicSums(100)` dovrebbe restituire `137`. ```js assert.strictEqual(palindromicSums(100), 137); ``` -`palindromicSums(1000)` should return `4164`. +`palindromicSums(1000)` dovrebbe restituire `4164`. ```js assert.strictEqual(palindromicSums(1000),4164); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-126-cuboid-layers.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-126-cuboid-layers.md index d089c18aff0..a4bc97b00af 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-126-cuboid-layers.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-126-cuboid-layers.md @@ -1,6 +1,6 @@ --- id: 5900f3ea1000cf542c50fefd -title: 'Problem 126: Cuboid layers' +title: 'Problema 126: strati cuboidi' challengeType: 1 forumTopicId: 301753 dashedName: problem-126-cuboid-layers @@ -8,23 +8,23 @@ dashedName: problem-126-cuboid-layers # --description-- -The minimum number of cubes to cover every visible face on a cuboid measuring 3 x 2 x 1 is twenty-two. +Il numero minimo di cubi per coprire ogni faccia visibile su un cuboide che misura 3 x 2 x 1 è ventidue. -3x2x1 cuboid covered by twenty-two 1x1x1 cubes +Un cuboide 3x2x1 ricoperto con ventidue cubi 1x1x1 -If we add a second layer to this solid it would require forty-six cubes to cover every visible face, the third layer would require seventy-eight cubes, and the fourth layer would require one-hundred and eighteen cubes to cover every visible face. +Se aggiungessimo un secondo strato a questo solido occorrerebbero quarantasei cubi per coprire ogni faccia visibile, il terzo strato richiederebbe settantotto cubi, mentre il quarto strato richiederebbe centodiciotto cubi per coprire ogni faccia visibile. -However, the first layer on a cuboid measuring 5 x 1 x 1 also requires twenty-two cubes; similarly, the first layer on cuboids measuring 5 x 3 x 1, 7 x 2 x 1, and 11 x 1 x 1 all contain forty-six cubes. +Tuttavia, anche il primo strato di un cuboide misurante 5 x 1 x 1 richiede ventidue cubi; in modo simile, il primo strato di cuboidi misuranti 5 x 3 x 1, 7 x 2 x 1 e 11 x 1 x 1 contengono tutti quarantasei cubi. -We shall define $C(n)$ to represent the number of cuboids that contain $n$ cubes in one of its layers. So $C(22) = 2$, $C(46) = 4$, $C(78) = 5$, and $C(118) = 8$. +Definiamo $C(n)$ per rappresentare il numero di cuboidi che contengono $n$ cubi in uno dei propri strati. Quindi $C(22) = 2$, $C(46) = 4$, $C(78) = 5$, e $C(118) = 8$. -It turns out that 154 is the least value of $n$ for which $C(n) = 10$. +Viene fuori che 154 è il valore più basso di $n$ per cui $C(n) = 10$. -Find the least value of $n$ for which $C(n) = 1000$. +Trova il valore più piccolo di $n$ per cui $C(n) = 1000$. # --hints-- -`cuboidLayers()` should return `18522`. +`cuboidLayers()` dovrebbe restituire `18522`. ```js assert.strictEqual(cuboidLayers(), 18522); diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-127-abc-hits.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-127-abc-hits.md index 2f7f927858e..6df86c6df48 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-127-abc-hits.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-101-to-200/problem-127-abc-hits.md @@ -1,6 +1,6 @@ --- id: 5900f3ec1000cf542c50fefe -title: 'Problem 127: abc-hits' +title: 'Problema 127: abc-hit' challengeType: 1 forumTopicId: 301754 dashedName: problem-127-abc-hits @@ -8,7 +8,7 @@ dashedName: problem-127-abc-hits # --description-- -The radical of $n$, $rad(n)$, is the product of distinct prime factors of $n$. For example, $504 = 2^3 × 3^2 × 7$, so $rad(504) = 2 × 3 × 7 = 42$. +Il radicale di $n$, $rad(n)$, è il prodotto dei fattori primi distinti di $n$. For example, $504 = 2^3 × 3^2 × 7$, so $rad(504) = 2 × 3 × 7 = 42$. We shall define the triplet of positive integers (a, b, c) to be an abc-hit if: diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-the-keys-of-an-object-with-a-for...in-statement.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-the-keys-of-an-object-with-a-for...in-statement.md index 47fc59ba910..e414f684ee5 100644 --- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-the-keys-of-an-object-with-a-for...in-statement.md +++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-the-keys-of-an-object-with-a-for...in-statement.md @@ -8,7 +8,7 @@ dashedName: iterate-through-the-keys-of-an-object-with-a-for---in-statement # --description-- -Sometimes you need to iterate through all the keys within an object. You can use a for...in loop to do this. The for...in loop looks like: +Às vezes, você precisa iterar através de todas as chaves dentro de um objeto. Você pode usar um laço for... in para fazer isso. O laço for...in tem esta aparência: ```javascript const refrigerator = { @@ -21,15 +21,15 @@ for (const food in refrigerator) { } ``` -This code logs `milk 1` and `eggs 12`, with each key-value pair on its own line. +Este código registra `milk 1` e `eggs 12`, com cada par de chave-valor em sua própria linha. -We defined the variable `food` in the loop head and this variable was set to each of the object's keys on each iteration, resulting in each food's name being printed to the console. +Definimos a variável `food` no início do laço e essa variável foi definida com cada uma das chaves do objeto em cada iteração, resultando na impressão do nome de cada comida no console. **Observação:** objetos não mantém uma ordem para as chaves armazenadas como arrays fazem. Portanto, a posição de uma chave em um objeto, ou a ordem relativa na qual ela aparece, é irrelevante quando referenciando ou acessando aquela chave. # --instructions-- -We've defined a function `countOnline` which accepts one argument, `allUsers`. Use a for...in statement inside this function to loop through the `allUsers` object and return the number of users whose online property is set to `true`. An example of an object which could be passed to `countOnline` is shown below. Each user will have an `online` property set to either `true` or `false`. +Definimos uma função `countOnline`, a qual aceita um argumento, `allUsers`. Use a declaração for...in dentro dessa função para iterar pelo objeto `allUsers` e retorne o número de usuários que possuam a propriedade `online` definida como `true`. Um exemplo de um objeto que pode ser passado para `countOnline` é mostrado abaixo. Cada usuário terá a propriedade `online` definida como `true` ou `false`. ```js { diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/testing-objects-for-properties.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/testing-objects-for-properties.md index ebcfd1bd2ac..fd23eaea282 100644 --- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/testing-objects-for-properties.md +++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/testing-objects-for-properties.md @@ -8,7 +8,7 @@ dashedName: testing-objects-for-properties # --description-- -To check if a property on a given object exists or not, you can use the `.hasOwnProperty()` method. `someObject.hasOwnProperty(someProperty)` returns `true` or `false` depending on if the property is found on the object or not. +Para verificar se uma propriedade em um determinado objeto existe ou não, você pode usar o método `.hasOwnProperty()`. `someObject.hasOwnProperty(someProperty)` retorna `true` ou `false`, dependendo de a propriedade ser encontrada no objeto ou não. **Exemplo** @@ -21,11 +21,11 @@ checkForProperty({ top: 'hat', bottom: 'pants' }, 'top'); // true checkForProperty({ top: 'hat', bottom: 'pants' }, 'middle'); // false ``` -The first `checkForProperty` function call returns `true`, while the second returns `false`. +A primeira função `checkForProperty` retorna `true`, enquanto a segunda retorna `false`. # --instructions-- -Modify the function `checkObj` to test if the object passed to the function parameter `obj` contains the specific property passed to the function parameter `checkProp`. If the property passed to `checkProp` is found on `obj`, return that property's value. If not, return `Not Found`. +Modifique a função `checkObj` para testar se um objeto passado para o parâmetro da função `obj` contém a propriedade específica passada para o parâmetro da função `checkProp`. Se a propriedade passada para `checkProp` for encontrada em `obj`, retorne o valor dessa propriedade. Se não, retorne `Not Found`. # --hints-- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63507ebb0c50ce3b9d669cd9.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63507ebb0c50ce3b9d669cd9.md index 57b7cf64b53..d5d349e73db 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63507ebb0c50ce3b9d669cd9.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63507ebb0c50ce3b9d669cd9.md @@ -15,7 +15,7 @@ array.map().filter(); O método `.map()` é chamado no array. Depois, o método `.filter()` é chamado no resultado do método `.map()`. Chamamos isso de encadeamento de métodos. -Following that example, remove your `filtered` variable, and chain your `.filter()` call to your `.map()` call above. Não remova nenhuma das funções de callback. +Seguindo esse exemplo, remova a variável `filtered` e encadeie a chamada de `.filter()` à chamada de `.map()` acima. Não remova nenhuma das funções de callback. # --hints-- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6350805fe0fe283dd347b0dc.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6350805fe0fe283dd347b0dc.md index b28037ffcb8..4054ce57dd5 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6350805fe0fe283dd347b0dc.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6350805fe0fe283dd347b0dc.md @@ -1,31 +1,31 @@ --- id: 6350805fe0fe283dd347b0dc -title: Step 10 +title: Passo 10 challengeType: 0 dashedName: step-10 --- # --description-- -The mean is the average value of all numbers in a list. The first step in calculating the mean is to take the sum of all numbers in the list. Arrays have another method, called `.reduce()`, which is perfect for this situation. The `.reduce()` method takes an array and applies a callback function to condense the array into a single value. +A média é o valor médio de todos os números de uma lista. O primeiro passo para calcular a média é obter a soma de todos os números da lista. Arrays têm outro método, chamado `.reduce()`, que é perfeito para essa situação. O método `.reduce()` recebe um array e aplica uma função de callback para sintetizar o array em um único valor. -Declare a `sum` variable and assign `array.reduce()` to it. +Declare uma variável `sum` e atribua a ela `array.reduce()`. # --hints-- -Your `getMean` function should have a `sum` variable. +A função `getMean` deve ter uma variável `sum`. ```js assert.match(getMean.toString(), /sum/); ``` -Your `getMean` function should use the `.reduce()` method of the `array` argument. +A função `getMean` deve usar o método `.reduce()` do argumento `array`. ```js assert.match(getMean.toString(), /array\.reduce\(\)/); ``` -You should assign the result of `array.reduce()` to the `sum` variable. +Você deve atribuir à variável `sum` o resultado de `array.reduce()`. ```js assert.match(getMean.toString(), /sum\s*=\s*array\.reduce\(\)/); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635080d80b72803e973841da.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635080d80b72803e973841da.md index 196a32559cd..381ee334b0d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635080d80b72803e973841da.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635080d80b72803e973841da.md @@ -1,13 +1,13 @@ --- id: 635080d80b72803e973841da -title: Step 11 +title: Passo 10 challengeType: 0 dashedName: step-11 --- # --description-- -Like the other methods, `.reduce()` takes a callback. This callback, however, takes at least two parameters. The first is the accumulator, and the second is the current element in the array. The return value for the callback becomes the value of the accumulator on the next iteration. +Como os outros métodos, `.reduce()` recebe uma função de callback. Essa função, no entanto, requer, pelo menos, dois parâmetros. O primeiro é o acumulador. O segundo é o elemento atual do array. O valor da callback torna-se o valor do acumulador na iteração seguinte. ```js array.reduce((acc, el) => { @@ -15,17 +15,17 @@ array.reduce((acc, el) => { }); ``` -For your `sum` variable, pass a callback to `.reduce()` that takes the accumulator and the current element as parameters. The callback should return the sum of the accumulator and the current element. +Para a variável `sum`, passe uma função de callback para `.reduce()` que recebe o acumulador e o elemento atual como parâmetros. A callback deve retornar a soma do acumulador e o elemento atual. # --hints-- -Your `reduce` method should have a callback function which takes an `acc` and an `el` argument. +O método `reduce` deve ter uma função de callback que recebe um argumento `acc` e um argumento `el`. ```js assert.match(getMean.toString(), /(array\.reduce\(\(acc\s*,\s*el\s*\)\s*=>|array\.reduce\(function\s*\(acc\s*,\s*el\)\s*\{)/) ``` -Your `reduce` method should return the sum of `acc` and `el`. +O método `reduce` deve retornar a soma de `acc` e `el`. ```js assert.match(getMean.toString(), /(array\.reduce\(\(acc\s*,\s*el\s*\)\s*=>|array\.reduce\(function\s*\(acc\s*,\s*el\)\s*\{)\s*(return)?\s*acc\s*\+\s*el/) diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63508577f69f41409275f877.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63508577f69f41409275f877.md index 4839e059df3..e2dd16e76f5 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63508577f69f41409275f877.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63508577f69f41409275f877.md @@ -1,25 +1,25 @@ --- id: 63508577f69f41409275f877 -title: Step 13 +title: Passo 13 challengeType: 0 dashedName: step-13 --- # --description-- -The next step in calculating the mean is to divide the sum of numbers by the count of numbers in the list. +O próximo passo para calcular a média é dividir a soma dos números pela contagem de números na lista. -Declare a `mean` variable and assign it the value of `sum` divided by the length of `array`. +Declarar uma variável `mean` e atribua a ela o valor de `sum` dividido pelo comprimento do `array`. # --hints-- -Your `getMean` function should have a `mean` variable. +A função `getMean` deve ter uma variável `mean`. ```js assert.match(getMean.toString(), /mean\s*=/); ``` -You should assign the value of `sum` divided by `array.length` to the `mean` variable. +Você deve atribuir o valor de `sum` dividido por `array.length` à variável `mean`. ```js assert.match(getMean.toString(), /mean\s*=\s*sum\s*\/\s*array\.length/); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635085da54fc2041e0303e75.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635085da54fc2041e0303e75.md index 0fdb7eebe6f..ee7c2eb97c4 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635085da54fc2041e0303e75.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635085da54fc2041e0303e75.md @@ -7,17 +7,17 @@ dashedName: step-14 # --description-- -Finally, you need to return the value of `mean`. +Por fim, você precisa retornar o valor de `mean`. # --hints-- -Your `getMean` function should use the `return` keyword. +A função `getMean` deve usar a palavra-chave `return`. ```js assert.match(getMean.toString(), /return/); ``` -Your `getMean` function should return the value of `mean`. +A função `getMean` deve retornar o valor de `mean`. ```js assert.match(getMean.toString(), /return\s*mean\s*/); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635085f80bd9b5429faa40c4.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635085f80bd9b5429faa40c4.md index d15924ec709..f8a70e2ab45 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635085f80bd9b5429faa40c4.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635085f80bd9b5429faa40c4.md @@ -1,6 +1,6 @@ --- id: 635085f80bd9b5429faa40c4 -title: Step 15 +title: Passo 15 challengeType: 0 dashedName: step-15 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6350866cce4c6d43bdf607c8.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6350866cce4c6d43bdf607c8.md index 443f0323e73..8be2feed1c3 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6350866cce4c6d43bdf607c8.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6350866cce4c6d43bdf607c8.md @@ -1,6 +1,6 @@ --- id: 6350866cce4c6d43bdf607c8 -title: Step 16 +title: Passo 16 challengeType: 0 dashedName: step-16 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63508750f040a348a440a0bf.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63508750f040a348a440a0bf.md index 3180484e3eb..15771b9bd19 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63508750f040a348a440a0bf.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63508750f040a348a440a0bf.md @@ -1,6 +1,6 @@ --- id: 63508750f040a348a440a0bf -title: Step 17 +title: Passo 17 challengeType: 0 dashedName: step-17 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635089e3bd3e144f2db4094f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635089e3bd3e144f2db4094f.md index f526d6e8f70..ccf1ad29772 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635089e3bd3e144f2db4094f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635089e3bd3e144f2db4094f.md @@ -1,6 +1,6 @@ --- id: 635089e3bd3e144f2db4094f -title: Step 18 +title: Passo 18 challengeType: 0 dashedName: step-18 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63508c898d753754757bd5e3.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63508c898d753754757bd5e3.md index edb42afc1bf..97bee76ac18 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63508c898d753754757bd5e3.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/63508c898d753754757bd5e3.md @@ -1,6 +1,6 @@ --- id: 63508c898d753754757bd5e3 -title: Step 21 +title: Passo 21 challengeType: 0 dashedName: step-21 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e79d15aae30fac58f48e.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e79d15aae30fac58f48e.md index 0f80bd629be..0617dc391c9 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e79d15aae30fac58f48e.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e79d15aae30fac58f48e.md @@ -1,31 +1,31 @@ --- id: 6352e79d15aae30fac58f48e -title: Step 24 +title: Passo 24 challengeType: 0 dashedName: step-24 --- # --description-- -Like you did with your `getMean` function, you need to add your `getMedian` function to your `calculate` logic. +Do mesmo modo que você fez com a função `getMean`, adicione a função `getMedian` à lógica de `calculate`. -Declare a variable `median` and assign it the value of `getMedian(numbers)`. Then, query the DOM for the `#median` element and set the `textContent` to `median`. +Declare uma variável `median` e atribua a ela o valor de `getMedian(numbers)`. Então, consulte o DOM para encontrar o elemento `#median` e defina `textContent` como `median`. # --hints-- -Your `calculate` function should have a `median` variable. +A função `calculate` deve ter uma variável `median`. ```js assert.match(calculate.toString(), /median\s*=/); ``` -Your `median` variable should be assigned the value of `getMedian(numbers)`. +A variável `median` deve ser atribuída ao valor de `getMedian(numbers)`. ```js assert.match(calculate.toString(), /median\s*=\s*getMedian\(numbers\)/); ``` -Your `calculate` function should query the DOM for the `#median` element and set the `textContent` to `median`. +A função `calculate` deve consultar o DOM para encontrar o elemento `#median` e definir `textContent` como `median`. ```js assert.match(calculate.toString(), /document\.querySelector\(('|")#median\1\)\.textContent\s*=\s*median/); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e80e024e89111600edfb.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e80e024e89111600edfb.md index 8a691bd9d5c..a2e5a5d9aa9 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e80e024e89111600edfb.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e80e024e89111600edfb.md @@ -1,6 +1,6 @@ --- id: 6352e80e024e89111600edfb -title: Step 25 +title: Passo 25 challengeType: 0 dashedName: step-25 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e93db104661305c5f658.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e93db104661305c5f658.md index 8473932561c..ae3ca854118 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e93db104661305c5f658.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e93db104661305c5f658.md @@ -1,23 +1,23 @@ --- id: 6352e93db104661305c5f658 -title: Step 26 +title: Passo 26 challengeType: 0 dashedName: step-26 --- # --description-- -In your new function, declare an empty `counts` object. You will use this to track the number of times each number appears in the list. +Na nova função, declare um objeto vazio `counts`. Você o usará para acompanhar o número de vezes que cada número aparece na lista. # --hints-- -Your `getMode` function should have a `counts` variable. +A função `getMode` deve ter uma variável `counts`. ```js assert.match(getMode.toString(), /counts\s*=/); ``` -Your `counts` variable should be an empty object. +A variável `counts` deve ser um objeto vazio. ```js assert.match(getMode.toString(), /counts\s*=\s*\{\s*\};/); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e96d2604f813c656750b.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e96d2604f813c656750b.md index 8f07fdfe9ee..24536dab102 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e96d2604f813c656750b.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352e96d2604f813c656750b.md @@ -1,6 +1,6 @@ --- id: 6352e96d2604f813c656750b -title: Step 27 +title: Passo 27 challengeType: 0 dashedName: step-27 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ea3a5b79e614ee2282fd.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ea3a5b79e614ee2282fd.md index fec7d654aa5..a85e68ab361 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ea3a5b79e614ee2282fd.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ea3a5b79e614ee2282fd.md @@ -1,6 +1,6 @@ --- id: 6352ea3a5b79e614ee2282fd -title: Step 28 +title: Passo 28 challengeType: 0 dashedName: step-28 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ec8b9c70fd17b8c7ba3f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ec8b9c70fd17b8c7ba3f.md index cc699ca81f3..6a3bd178fe2 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ec8b9c70fd17b8c7ba3f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ec8b9c70fd17b8c7ba3f.md @@ -1,6 +1,6 @@ --- id: 6352ec8b9c70fd17b8c7ba3f -title: Step 30 +title: Passo 30 challengeType: 0 dashedName: step-30 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ecef9f045519063da9b3.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ecef9f045519063da9b3.md index 381683844e0..0b32462de43 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ecef9f045519063da9b3.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ecef9f045519063da9b3.md @@ -1,6 +1,6 @@ --- id: 6352ecef9f045519063da9b3 -title: Step 31 +title: Passo 31 challengeType: 0 dashedName: step-31 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352edee8a4de01ad693f0e4.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352edee8a4de01ad693f0e4.md index fa1ae3702f8..b39924913b7 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352edee8a4de01ad693f0e4.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352edee8a4de01ad693f0e4.md @@ -1,6 +1,6 @@ --- id: 6352edee8a4de01ad693f0e4 -title: Step 32 +title: Passo 32 challengeType: 0 dashedName: step-32 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ee566a59d31d24bde74b.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ee566a59d31d24bde74b.md index 41d854b50bc..ed2cd40327d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ee566a59d31d24bde74b.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ee566a59d31d24bde74b.md @@ -1,6 +1,6 @@ --- id: 6352ee566a59d31d24bde74b -title: Step 33 +title: Passo 33 challengeType: 0 dashedName: step-33 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352f09b1e53a420e7873344.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352f09b1e53a420e7873344.md index 9ef808c7073..33871e78b7a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352f09b1e53a420e7873344.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352f09b1e53a420e7873344.md @@ -1,6 +1,6 @@ --- id: 6352f09b1e53a420e7873344 -title: Step 34 +title: Passo 34 challengeType: 0 dashedName: step-34 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352f179bdca23221298a5ba.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352f179bdca23221298a5ba.md index c88ce39ce83..7c770c8a533 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352f179bdca23221298a5ba.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352f179bdca23221298a5ba.md @@ -1,6 +1,6 @@ --- id: 6352f179bdca23221298a5ba -title: Step 35 +title: Passo 35 challengeType: 0 dashedName: step-35 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352f2a24eb71b24284ca2b6.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352f2a24eb71b24284ca2b6.md index c19384026eb..fca60539232 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352f2a24eb71b24284ca2b6.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352f2a24eb71b24284ca2b6.md @@ -1,6 +1,6 @@ --- id: 6352f2a24eb71b24284ca2b6 -title: Step 37 +title: Passo 37 challengeType: 0 dashedName: step-37 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fbb93a91a8272f838d42.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fbb93a91a8272f838d42.md index 97df312aae6..5d9e0078271 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fbb93a91a8272f838d42.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fbb93a91a8272f838d42.md @@ -1,6 +1,6 @@ --- id: 6352fbb93a91a8272f838d42 -title: Step 39 +title: Passo 39 challengeType: 0 dashedName: step-39 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fcb156834128001ea945.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fcb156834128001ea945.md index a2b550ebf67..f9ed6f0ba83 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fcb156834128001ea945.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fcb156834128001ea945.md @@ -1,37 +1,37 @@ --- id: 6352fcb156834128001ea945 -title: Step 40 +title: Passo 40 challengeType: 0 dashedName: step-40 --- # --description-- -Next, you need to take the sum of the squared differences. +Em seguida, você precisa calcular a soma das diferenças quadradas. -Declare a `sumSquaredDifferences` variable, and assign it the value of `squaredDifferences.reduce()`. For the callback, return the sum of `acc` and `el`. Remember to set the initial value to `0`. +Declare uma variável `sumSquaredDifferences` e atribua a ela o valor de `squaredDifferences.reduce()`. Para a função de callback, retorne a soma de `acc` e `el`. Lembre-se de definir o valor inicial como `0`. # --hints-- -You should have a `sumSquaredDifferences` variable. +Você deve ter uma variável `sumSquaredDifferences`. ```js assert.match(getVariance.toString(), /sumSquaredDifferences\s*=/); ``` -Your `sumSquaredDifferences` variable should use the `squaredDifferences.reduce()` method. +A variável `sumSquaredDifferences` deve usar o método `squaredDifferences.reduce()`. ```js assert.match(getVariance.toString(), /sumSquaredDifferences\s*=\s*squaredDifferences\.reduce\(/); ``` -Your `sumSquaredDifferences` variable should use the `acc` and `el` parameters in the callback function. +A variável `sumSquaredDifferences` deve usar os parâmetros `acc` e `el` na função de callback. ```js assert.match(getVariance.toString(), /sumSquaredDifferences\s*=\s*squaredDifferences\.reduce\(function\s*\(?\s*acc\s*,\s*el\s*\)?/); ``` -Your `reduce` callback should return the sum of `acc` and `el`. +O método `reduce` da função de callback deve retornar a soma de `acc` e `el`. ```js console.log(getVariance.toString()); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fce75b2d3b2924930f1e.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fce75b2d3b2924930f1e.md index a9de0de327d..61fc8d800ff 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fce75b2d3b2924930f1e.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fce75b2d3b2924930f1e.md @@ -1,6 +1,6 @@ --- id: 6352fce75b2d3b2924930f1e -title: Step 41 +title: Passo 41 challengeType: 0 dashedName: step-41 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fe473d53592a40ae403b.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fe473d53592a40ae403b.md index 2a4c44726d9..25dc75d4013 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fe473d53592a40ae403b.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fe473d53592a40ae403b.md @@ -1,6 +1,6 @@ --- id: 6352fe473d53592a40ae403b -title: Step 42 +title: Passo 42 challengeType: 0 dashedName: step-42 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fed209792d2b89e92ea1.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fed209792d2b89e92ea1.md index c028581116d..6d370e188d6 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fed209792d2b89e92ea1.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352fed209792d2b89e92ea1.md @@ -1,6 +1,6 @@ --- id: 6352fed209792d2b89e92ea1 -title: Step 43 +title: Passo 43 challengeType: 0 dashedName: step-43 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ff27e0e51b2c7dce0010.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ff27e0e51b2c7dce0010.md index 2d2caf9b81e..63d871026b2 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ff27e0e51b2c7dce0010.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ff27e0e51b2c7dce0010.md @@ -1,6 +1,6 @@ --- id: 6352ff27e0e51b2c7dce0010 -title: Step 44 +title: Passo 44 challengeType: 0 dashedName: step-44 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ffe4cfafa72d595a0007.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ffe4cfafa72d595a0007.md index 40bae5a85aa..ec975483097 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ffe4cfafa72d595a0007.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6352ffe4cfafa72d595a0007.md @@ -1,6 +1,6 @@ --- id: 6352ffe4cfafa72d595a0007 -title: Step 45 +title: Passo 45 challengeType: 0 dashedName: step-45 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6353004b235d7a2e0b913f2b.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6353004b235d7a2e0b913f2b.md index daa8ca0fda1..b59ec6eaf6b 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6353004b235d7a2e0b913f2b.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6353004b235d7a2e0b913f2b.md @@ -1,6 +1,6 @@ --- id: 6353004b235d7a2e0b913f2b -title: Step 46 +title: Passo 46 challengeType: 0 dashedName: step-46 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6353024f5eab012fa2f57eec.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6353024f5eab012fa2f57eec.md index 0effb1d2fe9..724f8283210 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6353024f5eab012fa2f57eec.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6353024f5eab012fa2f57eec.md @@ -1,6 +1,6 @@ --- id: 6353024f5eab012fa2f57eec -title: Step 47 +title: Passo 47 challengeType: 0 dashedName: step-47 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6353028147d3c7309017216a.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6353028147d3c7309017216a.md index 760063659a1..1b3fa6ea2b8 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6353028147d3c7309017216a.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6353028147d3c7309017216a.md @@ -1,17 +1,17 @@ --- id: 6353028147d3c7309017216a -title: Step 48 +title: Passo 48 challengeType: 0 dashedName: step-48 --- # --description-- -Return your `standardDeviation` variable. +Retorne a variável `standardDeviation`. # --hints-- -Your `getStandardDeviation` function should return the `standardDeviation` variable. +A função `getStandardDeviation` deve retornar a variável `standardDeviation`. ```js assert.match(getStandardDeviation.toString(), /return\s*standardDeviation;/); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635302be760d6031d11a06cd.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635302be760d6031d11a06cd.md index 015e50b74a6..5f7eab201af 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635302be760d6031d11a06cd.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/635302be760d6031d11a06cd.md @@ -1,23 +1,23 @@ --- id: 635302be760d6031d11a06cd -title: Step 49 +title: Passo 49 challengeType: 0 dashedName: step-49 --- # --description-- -Now update the `calculate` function to include the standard deviation logic, like you did with your other functions. +Agora atualize a função `calculate` para incluir a lógica do desvio padrão, como você fez com as outras funções. # --hints-- -Your `calculate` function should have a `standardDeviation` variable set to the result of `getStandardDeviation(numbers)`. +A função `calculate` deve definir uma variável `standardDeviation` para o resultado de `getStandardDeviation(numbers)`. ```js assert.match(calculate.toString(), /standardDeviation\s*=\s*getStandardDeviation\(numbers\)/); ``` -You should update the `textContent` of the `#standardDeviation` element to be the `standardDeviation` variable. +Você deve atualizar o `textContent` do elemento `#standardDeviation` para que ele seja a variável `standardDeviation`. ```js assert.match(calculate.toString(), /document\.querySelector\(('|")#standardDeviation\1\)\.textContent\s*=\s*standardDeviation/); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6374249d3fbf2a5b079ba036.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6374249d3fbf2a5b079ba036.md index 6ff38ec6626..006ab91d3f3 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6374249d3fbf2a5b079ba036.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-advanced-array-methods-by-building-a-statistics-calculator/6374249d3fbf2a5b079ba036.md @@ -1,6 +1,6 @@ --- id: 6374249d3fbf2a5b079ba036 -title: Step 50 +title: Passo 50 challengeType: 0 dashedName: step-50 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64061a98f704a014b44afdb2.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64061a98f704a014b44afdb2.md index 190c2ed141e..04e2a2afb37 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64061a98f704a014b44afdb2.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64061a98f704a014b44afdb2.md @@ -1,13 +1,13 @@ --- id: 64061a98f704a014b44afdb2 -title: Step 1 +title: Passo 1 challengeType: 0 dashedName: step-1 --- # --description-- -In this project, you will be building a number sorter. The HTML and CSS have been provided for you. Feel free to explore them. +In this project, you will be building a number sorter. O HTML e o CSS foram fornecidos para você. Feel free to explore them. When you are ready, declare a `sortButton` variable and assign it the value of `.getElementById()` with the argument `sort`. diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64067c1041a80c366b852407.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64067c1041a80c366b852407.md index d50d904feea..140606d4e9a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64067c1041a80c366b852407.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64067c1041a80c366b852407.md @@ -1,6 +1,6 @@ --- id: 64067c1041a80c366b852407 -title: Step 2 +title: Passo 2 challengeType: 0 dashedName: step-2 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406a71d2b35103a340dba06.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406a71d2b35103a340dba06.md index 5cbbf56b6ed..32210132fd1 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406a71d2b35103a340dba06.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406a71d2b35103a340dba06.md @@ -1,6 +1,6 @@ --- id: 6406a71d2b35103a340dba06 -title: Step 3 +title: Passo 3 challengeType: 0 dashedName: step-3 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406a9945fa5d23c225d31cc.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406a9945fa5d23c225d31cc.md index aff0f01b51b..d7a9927884a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406a9945fa5d23c225d31cc.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406a9945fa5d23c225d31cc.md @@ -1,6 +1,6 @@ --- id: 6406a9945fa5d23c225d31cc -title: Step 4 +title: Passo 4 challengeType: 0 dashedName: step-4 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406adbca6b41d3d7cef85ab.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406adbca6b41d3d7cef85ab.md index 046e6ab37cd..0be319e3d7e 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406adbca6b41d3d7cef85ab.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406adbca6b41d3d7cef85ab.md @@ -1,6 +1,6 @@ --- id: 6406adbca6b41d3d7cef85ab -title: Step 5 +title: Passo 5 challengeType: 0 dashedName: step-5 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406bb32f9ed593f26c33b2b.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406bb32f9ed593f26c33b2b.md index 8f7df60d313..e030a06e0fc 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406bb32f9ed593f26c33b2b.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6406bb32f9ed593f26c33b2b.md @@ -1,6 +1,6 @@ --- id: 6406bb32f9ed593f26c33b2b -title: Step 6 +title: Passo 6 challengeType: 0 dashedName: step-6 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407b940b8983005578d0824.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407b940b8983005578d0824.md index a3e273cd5b4..d94d66c7e18 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407b940b8983005578d0824.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407b940b8983005578d0824.md @@ -1,6 +1,6 @@ --- id: 6407b940b8983005578d0824 -title: Step 7 +title: Passo 7 challengeType: 0 dashedName: step-7 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c303b4272606c019f338.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c303b4272606c019f338.md index 77e77b395f9..b19ce1dc4af 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c303b4272606c019f338.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c303b4272606c019f338.md @@ -1,6 +1,6 @@ --- id: 6407c303b4272606c019f338 -title: Step 8 +title: Passo 8 challengeType: 0 dashedName: step-8 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c4abf5be6d07d8c12ade.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c4abf5be6d07d8c12ade.md index e8163807e50..242113e2219 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c4abf5be6d07d8c12ade.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c4abf5be6d07d8c12ade.md @@ -1,6 +1,6 @@ --- id: 6407c4abf5be6d07d8c12ade -title: Step 9 +title: Passo 9 challengeType: 0 dashedName: step-9 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c627ddc93708c8dee796.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c627ddc93708c8dee796.md index 2c5d47b2578..3a1176a0860 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c627ddc93708c8dee796.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c627ddc93708c8dee796.md @@ -1,6 +1,6 @@ --- id: 6407c627ddc93708c8dee796 -title: Step 10 +title: Passo 10 challengeType: 0 dashedName: step-10 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c6a2c2159309994779a5.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c6a2c2159309994779a5.md index 4821ca6d0cb..63b1c82d429 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c6a2c2159309994779a5.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c6a2c2159309994779a5.md @@ -1,6 +1,6 @@ --- id: 6407c6a2c2159309994779a5 -title: Step 11 +title: Passo 10 challengeType: 0 dashedName: step-11 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c6d3f19c4e0a7ba320bb.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c6d3f19c4e0a7ba320bb.md index e8484393948..a78e24a016b 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c6d3f19c4e0a7ba320bb.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c6d3f19c4e0a7ba320bb.md @@ -1,6 +1,6 @@ --- id: 6407c6d3f19c4e0a7ba320bb -title: Step 12 +title: Passo 12 challengeType: 0 dashedName: step-12 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c722498bc80b76d29073.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c722498bc80b76d29073.md index 5dbf3c2389f..bb4d792534b 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c722498bc80b76d29073.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6407c722498bc80b76d29073.md @@ -1,6 +1,6 @@ --- id: 6407c722498bc80b76d29073 -title: Step 13 +title: Passo 13 challengeType: 0 dashedName: step-13 --- @@ -19,7 +19,7 @@ You should use `const` to declare a `bubbleSort` variable. assert.match(code, /const\s+bubbleSort\s*=/); ``` -`bubbleSort` should be a function. +`bubbleSort` deve ser uma função. ```js assert.isFunction(bubbleSort); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410da6df463a606dfade96f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410da6df463a606dfade96f.md index c29b8ab41fd..09da9914692 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410da6df463a606dfade96f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410da6df463a606dfade96f.md @@ -1,6 +1,6 @@ --- id: 6410da6df463a606dfade96f -title: Step 14 +title: Passo 14 challengeType: 0 dashedName: step-14 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410dfb965c72108196ef24a.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410dfb965c72108196ef24a.md index 02662b68c30..5a8da7589dc 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410dfb965c72108196ef24a.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410dfb965c72108196ef24a.md @@ -1,6 +1,6 @@ --- id: 6410dfb965c72108196ef24a -title: Step 15 +title: Passo 15 challengeType: 0 dashedName: step-15 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410e1b58efc2c091a13bcd9.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410e1b58efc2c091a13bcd9.md index da0a4869be8..6c7eb05267b 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410e1b58efc2c091a13bcd9.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410e1b58efc2c091a13bcd9.md @@ -1,6 +1,6 @@ --- id: 6410e1b58efc2c091a13bcd9 -title: Step 16 +title: Passo 16 challengeType: 0 dashedName: step-16 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410e3c19c21cd09c32dc7c6.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410e3c19c21cd09c32dc7c6.md index 5d6ceddfbd7..d9836c9e6ee 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410e3c19c21cd09c32dc7c6.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410e3c19c21cd09c32dc7c6.md @@ -1,6 +1,6 @@ --- id: 6410e3c19c21cd09c32dc7c6 -title: Step 17 +title: Passo 17 challengeType: 0 dashedName: step-17 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410e70c84bb660b4d2a5ea1.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410e70c84bb660b4d2a5ea1.md index dd24c24ed82..0bf62529c24 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410e70c84bb660b4d2a5ea1.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410e70c84bb660b4d2a5ea1.md @@ -1,6 +1,6 @@ --- id: 6410e70c84bb660b4d2a5ea1 -title: Step 18 +title: Passo 18 challengeType: 0 dashedName: step-18 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410edb33eeaf50dd9a22ab4.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410edb33eeaf50dd9a22ab4.md index 7318c7fd6ef..19091215f65 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410edb33eeaf50dd9a22ab4.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410edb33eeaf50dd9a22ab4.md @@ -1,6 +1,6 @@ --- id: 6410edb33eeaf50dd9a22ab4 -title: Step 19 +title: Passo 19 challengeType: 0 dashedName: step-19 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410efff0ae97c0f06856511.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410efff0ae97c0f06856511.md index 4d3522a57e9..f726a6fdc45 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410efff0ae97c0f06856511.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410efff0ae97c0f06856511.md @@ -1,6 +1,6 @@ --- id: 6410efff0ae97c0f06856511 -title: Step 20 +title: Passo 20 challengeType: 0 dashedName: step-20 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410f149110ec60fd40fcfe1.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410f149110ec60fd40fcfe1.md index d55a9a3fb01..cce36a84186 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410f149110ec60fd40fcfe1.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410f149110ec60fd40fcfe1.md @@ -1,6 +1,6 @@ --- id: 6410f149110ec60fd40fcfe1 -title: Step 22 +title: Passo 22 challengeType: 0 dashedName: step-22 --- @@ -19,7 +19,7 @@ You should use `const` to declare a `selectionSort` variable. assert.match(code, /const\s+selectionSort\s*=/); ``` -`selectionSort` should be a function. +`selectionSort` deve ser uma função. ```js assert.isFunction(selectionSort); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410f97a721cd1144804b7a8.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410f97a721cd1144804b7a8.md index 5b16143979d..be9a854092b 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410f97a721cd1144804b7a8.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410f97a721cd1144804b7a8.md @@ -1,6 +1,6 @@ --- id: 6410f97a721cd1144804b7a8 -title: Step 24 +title: Passo 24 challengeType: 0 dashedName: step-24 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410f9a443d57414ee50fada.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410f9a443d57414ee50fada.md index 82503bb02ba..ce3a0a97db2 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410f9a443d57414ee50fada.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410f9a443d57414ee50fada.md @@ -1,6 +1,6 @@ --- id: 6410f9a443d57414ee50fada -title: Step 21 +title: Passo 21 challengeType: 0 dashedName: step-21 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410fb3b68429716a810ea4b.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410fb3b68429716a810ea4b.md index 9d0f2ed1b78..6447e4cd914 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410fb3b68429716a810ea4b.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410fb3b68429716a810ea4b.md @@ -1,6 +1,6 @@ --- id: 6410fb3b68429716a810ea4b -title: Step 25 +title: Passo 25 challengeType: 0 dashedName: step-25 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410fcd1f731fd17cdb101a7.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410fcd1f731fd17cdb101a7.md index 66e5c569719..89438140a23 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410fcd1f731fd17cdb101a7.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6410fcd1f731fd17cdb101a7.md @@ -1,6 +1,6 @@ --- id: 6410fcd1f731fd17cdb101a7 -title: Step 26 +title: Passo 26 challengeType: 0 dashedName: step-26 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411024727181d190ef03166.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411024727181d190ef03166.md index 08526189ffd..46686325aa4 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411024727181d190ef03166.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411024727181d190ef03166.md @@ -1,6 +1,6 @@ --- id: 6411024727181d190ef03166 -title: Step 27 +title: Passo 27 challengeType: 0 dashedName: step-27 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110377201e7b1a0de0d558.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110377201e7b1a0de0d558.md index d844250f982..801ce4c1de8 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110377201e7b1a0de0d558.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110377201e7b1a0de0d558.md @@ -1,6 +1,6 @@ --- id: 64110377201e7b1a0de0d558 -title: Step 23 +title: Passo 23 challengeType: 0 dashedName: step-23 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110727cefd3d1d9bdb0128.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110727cefd3d1d9bdb0128.md index cc545450dce..797f2aec43e 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110727cefd3d1d9bdb0128.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110727cefd3d1d9bdb0128.md @@ -1,6 +1,6 @@ --- id: 64110727cefd3d1d9bdb0128 -title: Step 28 +title: Passo 28 challengeType: 0 dashedName: step-28 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411083020a3101e9514a0f5.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411083020a3101e9514a0f5.md index 6af94911cb2..0ba1bdc2382 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411083020a3101e9514a0f5.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411083020a3101e9514a0f5.md @@ -1,6 +1,6 @@ --- id: 6411083020a3101e9514a0f5 -title: Step 29 +title: Passo 29 challengeType: 0 dashedName: step-29 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110998bc00321fd8052ab5.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110998bc00321fd8052ab5.md index c9c0a649022..06fd715e75d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110998bc00321fd8052ab5.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110998bc00321fd8052ab5.md @@ -1,13 +1,13 @@ --- id: 64110998bc00321fd8052ab5 -title: Step 30 +title: Passo 30 challengeType: 0 dashedName: step-30 --- # --description-- -The last sorting algorithm you will implement is the insertion sort. This algorithm works by building up a sorted array at the beginning of the list. It begins the sorted array with the first element. Then it inspects the next element and swaps it backward into the sorted array until it is in a sorted position, and so on. +The last sorting algorithm you will implement is the insertion sort. This algorithm works by building up a sorted array at the beginning of the list. Ele inicia o array ordenado com o primeiro elemento. Then it inspects the next element and swaps it backward into the sorted array until it is in a sorted position, and so on. Start by declaring an `insertionSort` variable and assigning it an arrow function which takes an `array` parameter. @@ -19,7 +19,7 @@ You should use `const` to declare an `insertionSort` variable. assert.match(code, /const\s+insertionSort\s*=/); ``` -`insertionSort` should be a function. +`insertionSort` deve ser uma função. ```js assert.isFunction(insertionSort); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110a03f6a450209b01f45c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110a03f6a450209b01f45c.md index d9b898256ba..55ef4d012e1 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110a03f6a450209b01f45c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110a03f6a450209b01f45c.md @@ -1,6 +1,6 @@ --- id: 64110a03f6a450209b01f45c -title: Step 31 +title: Passo 31 challengeType: 0 dashedName: step-31 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110b1849454521871243ca.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110b1849454521871243ca.md index f675ce133c8..64188886d6b 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110b1849454521871243ca.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64110b1849454521871243ca.md @@ -1,6 +1,6 @@ --- id: 64110b1849454521871243ca -title: Step 32 +title: Passo 32 challengeType: 0 dashedName: step-32 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411108bc8b9c324f66aab4c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411108bc8b9c324f66aab4c.md index 0cb92af7d64..e8829d156b9 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411108bc8b9c324f66aab4c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411108bc8b9c324f66aab4c.md @@ -1,6 +1,6 @@ --- id: 6411108bc8b9c324f66aab4c -title: Step 33 +title: Passo 33 challengeType: 0 dashedName: step-33 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/641110e4fb696b259dbf0bcf.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/641110e4fb696b259dbf0bcf.md index 03885122d22..123e770ac4d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/641110e4fb696b259dbf0bcf.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/641110e4fb696b259dbf0bcf.md @@ -1,6 +1,6 @@ --- id: 641110e4fb696b259dbf0bcf -title: Step 34 +title: Passo 34 challengeType: 0 dashedName: step-34 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411135e9ee2fa26c882eb02.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411135e9ee2fa26c882eb02.md index 8a179fb1bd6..c550fbfb4e2 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411135e9ee2fa26c882eb02.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/6411135e9ee2fa26c882eb02.md @@ -1,6 +1,6 @@ --- id: 6411135e9ee2fa26c882eb02 -title: Step 35 +title: Passo 35 challengeType: 0 dashedName: step-35 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112c9cf53d632910ea2f9b.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112c9cf53d632910ea2f9b.md index 024478b8757..65dc3e19352 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112c9cf53d632910ea2f9b.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112c9cf53d632910ea2f9b.md @@ -1,6 +1,6 @@ --- id: 64112c9cf53d632910ea2f9b -title: Step 36 +title: Passo 36 challengeType: 0 dashedName: step-36 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112cea9e6ac22a314628b0.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112cea9e6ac22a314628b0.md index fac5cceaf01..dc43c43c756 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112cea9e6ac22a314628b0.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112cea9e6ac22a314628b0.md @@ -1,6 +1,6 @@ --- id: 64112cea9e6ac22a314628b0 -title: Step 37 +title: Passo 37 challengeType: 0 dashedName: step-37 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112d0943e1bb2aef11e2d1.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112d0943e1bb2aef11e2d1.md index 288667b1296..90a60a3be5c 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112d0943e1bb2aef11e2d1.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112d0943e1bb2aef11e2d1.md @@ -1,6 +1,6 @@ --- id: 64112d0943e1bb2aef11e2d1 -title: Step 38 +title: Passo 38 challengeType: 0 dashedName: step-38 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112fa63a0f812c66499a54.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112fa63a0f812c66499a54.md index 4bf4b58a7ab..931ba04e1a6 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112fa63a0f812c66499a54.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64112fa63a0f812c66499a54.md @@ -1,6 +1,6 @@ --- id: 64112fa63a0f812c66499a54 -title: Step 39 +title: Passo 39 challengeType: 0 dashedName: step-39 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/641130423e5f512d8972dae1.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/641130423e5f512d8972dae1.md index 85f5b0d97bd..45a004de119 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/641130423e5f512d8972dae1.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/641130423e5f512d8972dae1.md @@ -1,6 +1,6 @@ --- id: 641130423e5f512d8972dae1 -title: Step 40 +title: Passo 40 challengeType: 0 dashedName: step-40 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64113124efd2852edafaf25f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64113124efd2852edafaf25f.md index 7f52accaf7d..fb637a81062 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64113124efd2852edafaf25f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64113124efd2852edafaf25f.md @@ -1,6 +1,6 @@ --- id: 64113124efd2852edafaf25f -title: Step 41 +title: Passo 41 challengeType: 0 dashedName: step-41 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64113249bab9952fb2ce4469.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64113249bab9952fb2ce4469.md index 54887899f4d..95e3eb447c7 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64113249bab9952fb2ce4469.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-algorithmic-thinking-by-building-a-number-sorter/64113249bab9952fb2ce4469.md @@ -1,6 +1,6 @@ --- id: 64113249bab9952fb2ce4469 -title: Step 42 +title: Passo 42 challengeType: 0 dashedName: step-42 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec14d1c216aa063f0be4af.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec14d1c216aa063f0be4af.md index d65212aca6b..3db2bf50e76 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec14d1c216aa063f0be4af.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec14d1c216aa063f0be4af.md @@ -1,6 +1,6 @@ --- id: 63ec14d1c216aa063f0be4af -title: Step 1 +title: Passo 1 challengeType: 0 dashedName: step-1 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec19978a066607e23439f8.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec19978a066607e23439f8.md index 98110e0bc8a..a5381a5a7f5 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec19978a066607e23439f8.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec19978a066607e23439f8.md @@ -1,6 +1,6 @@ --- id: 63ec19978a066607e23439f8 -title: Step 2 +title: Passo 2 challengeType: 0 dashedName: step-2 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec1a16f930b108b8a76806.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec1a16f930b108b8a76806.md index b3616baccb4..e0a8478ce1b 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec1a16f930b108b8a76806.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec1a16f930b108b8a76806.md @@ -1,6 +1,6 @@ --- id: 63ec1a16f930b108b8a76806 -title: Step 3 +title: Passo 3 challengeType: 0 dashedName: step-3 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec1bbf5584390a7d08d41f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec1bbf5584390a7d08d41f.md index a973654d0d6..36b9798b162 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec1bbf5584390a7d08d41f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec1bbf5584390a7d08d41f.md @@ -1,6 +1,6 @@ --- id: 63ec1bbf5584390a7d08d41f -title: Step 4 +title: Passo 4 challengeType: 0 dashedName: step-4 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec1cb59f2a4c0be5b6dfa0.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec1cb59f2a4c0be5b6dfa0.md index 172acaf6e3f..481945997e4 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec1cb59f2a4c0be5b6dfa0.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec1cb59f2a4c0be5b6dfa0.md @@ -1,6 +1,6 @@ --- id: 63ec1cb59f2a4c0be5b6dfa0 -title: Step 5 +title: Passo 5 challengeType: 0 dashedName: step-5 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec20a06fff670d37befbd9.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec20a06fff670d37befbd9.md index 0815e4ecb06..c2ca94d9034 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec20a06fff670d37befbd9.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec20a06fff670d37befbd9.md @@ -1,6 +1,6 @@ --- id: 63ec20a06fff670d37befbd9 -title: Step 6 +title: Passo 6 challengeType: 0 dashedName: step-6 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec3287b182ec0efe8a3135.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec3287b182ec0efe8a3135.md index 30754019c8c..badfceb7b81 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec3287b182ec0efe8a3135.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec3287b182ec0efe8a3135.md @@ -1,6 +1,6 @@ --- id: 63ec3287b182ec0efe8a3135 -title: Step 7 +title: Passo 7 challengeType: 0 dashedName: step-7 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec3427fc3e9214c9ed2a14.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec3427fc3e9214c9ed2a14.md index 2a000e8614e..65e0c70baee 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec3427fc3e9214c9ed2a14.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec3427fc3e9214c9ed2a14.md @@ -1,6 +1,6 @@ --- id: 63ec3427fc3e9214c9ed2a14 -title: Step 8 +title: Passo 8 challengeType: 0 dashedName: step-8 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec36f6133df7160be3ec66.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec36f6133df7160be3ec66.md index e9a2c069456..361b152e2c5 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec36f6133df7160be3ec66.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec36f6133df7160be3ec66.md @@ -1,6 +1,6 @@ --- id: 63ec36f6133df7160be3ec66 -title: Step 9 +title: Passo 9 challengeType: 0 dashedName: step-9 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec47b454495519739486a7.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec47b454495519739486a7.md index 4add604d105..0bc01e7fc74 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec47b454495519739486a7.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ec47b454495519739486a7.md @@ -1,6 +1,6 @@ --- id: 63ec47b454495519739486a7 -title: Step 10 +title: Passo 10 challengeType: 0 dashedName: step-10 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5d38a5d29d0696f8d820.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5d38a5d29d0696f8d820.md index 02a59b523b4..0c666171967 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5d38a5d29d0696f8d820.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5d38a5d29d0696f8d820.md @@ -1,6 +1,6 @@ --- id: 63ee5d38a5d29d0696f8d820 -title: Step 11 +title: Passo 10 challengeType: 0 dashedName: step-11 --- @@ -11,7 +11,7 @@ In your template literal, create a `div` element with a class of `dessert-card`. # --hints-- -You should create a `div` element. +Você deve criar um elemento `div`. ```js assert.isAtLeast(document.querySelectorAll('div')?.length, 12); @@ -23,7 +23,7 @@ Your `div` element should have a class of `dessert-card`. assert.equal(document.querySelectorAll('.dessert-card')?.length, 12); ``` -You should create an `h2` element. +Você deve criar um elemento `h2`. ```js assert.isAtLeast(document.querySelectorAll('h2')?.length, 12); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5d8f9e7168076e932fe2.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5d8f9e7168076e932fe2.md index 96485328760..f063ba17cc8 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5d8f9e7168076e932fe2.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5d8f9e7168076e932fe2.md @@ -1,6 +1,6 @@ --- id: 63ee5d8f9e7168076e932fe2 -title: Step 12 +title: Passo 12 challengeType: 0 dashedName: step-12 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5e0f08e82208364c4128.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5e0f08e82208364c4128.md index 6092f597046..56b5864d506 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5e0f08e82208364c4128.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5e0f08e82208364c4128.md @@ -1,6 +1,6 @@ --- id: 63ee5e0f08e82208364c4128 -title: Step 13 +title: Passo 13 challengeType: 0 dashedName: step-13 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5ea8be892e0955ab346c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5ea8be892e0955ab346c.md index 44ba9af32dc..55cd9689a41 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5ea8be892e0955ab346c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5ea8be892e0955ab346c.md @@ -1,6 +1,6 @@ --- id: 63ee5ea8be892e0955ab346c -title: Step 14 +title: Passo 14 challengeType: 0 dashedName: step-14 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5fc113bcb20a5db9214b.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5fc113bcb20a5db9214b.md index 87839e53275..536f48cf175 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5fc113bcb20a5db9214b.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee5fc113bcb20a5db9214b.md @@ -1,6 +1,6 @@ --- id: 63ee5fc113bcb20a5db9214b -title: Step 15 +title: Passo 15 challengeType: 0 dashedName: step-15 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee611d478dca0b77f6a393.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee611d478dca0b77f6a393.md index 4f7a2390687..e3595ffff19 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee611d478dca0b77f6a393.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee611d478dca0b77f6a393.md @@ -1,13 +1,13 @@ --- id: 63ee611d478dca0b77f6a393 -title: Step 16 +title: Passo 16 challengeType: 0 dashedName: step-16 --- # --description-- -The `this` keyword in JavaScript is used to refer to the current object. Depending on where `this` is used, what it references changes. In the case of a class, it refers to the instance of the object being constructed. You can use the `this` keyword to set the properties of the object being instantiated. Here is an example: +The `this` keyword in JavaScript is used to refer to the current object. Depending on where `this` is used, what it references changes. In the case of a class, it refers to the instance of the object being constructed. You can use the `this` keyword to set the properties of the object being instantiated. Aqui está um exemplo: ```js class Computer { diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee7c664f9b65137d925c8a.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee7c664f9b65137d925c8a.md index 86c81b0332a..7b0a067e365 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee7c664f9b65137d925c8a.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63ee7c664f9b65137d925c8a.md @@ -1,6 +1,6 @@ --- id: 63ee7c664f9b65137d925c8a -title: Step 17 +title: Passo 17 challengeType: 0 dashedName: step-17 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eea5cea403a81a68ae493c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eea5cea403a81a68ae493c.md index 88900979e4b..974aa619306 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eea5cea403a81a68ae493c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eea5cea403a81a68ae493c.md @@ -1,6 +1,6 @@ --- id: 63eea5cea403a81a68ae493c -title: Step 18 +title: Passo 18 challengeType: 0 dashedName: step-18 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eea817673c8e1c22927fa6.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eea817673c8e1c22927fa6.md index fa4bbc91e2f..3a1e9264137 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eea817673c8e1c22927fa6.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eea817673c8e1c22927fa6.md @@ -1,6 +1,6 @@ --- id: 63eea817673c8e1c22927fa6 -title: Step 19 +title: Passo 19 challengeType: 0 dashedName: step-19 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eea8e1e143ae1d098c8c9d.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eea8e1e143ae1d098c8c9d.md index 21089f88380..0d1e0a766ae 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eea8e1e143ae1d098c8c9d.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eea8e1e143ae1d098c8c9d.md @@ -1,6 +1,6 @@ --- id: 63eea8e1e143ae1d098c8c9d -title: Step 20 +title: Passo 20 challengeType: 0 dashedName: step-20 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eeb8e86becbf1e75c2cb0d.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eeb8e86becbf1e75c2cb0d.md index f1583334ed8..848ac0a2309 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eeb8e86becbf1e75c2cb0d.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eeb8e86becbf1e75c2cb0d.md @@ -1,6 +1,6 @@ --- id: 63eeb8e86becbf1e75c2cb0d -title: Step 21 +title: Passo 21 challengeType: 0 dashedName: step-21 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eedebb0ec0231ff1cede1a.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eedebb0ec0231ff1cede1a.md index af217952d82..0b11ae05d09 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eedebb0ec0231ff1cede1a.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eedebb0ec0231ff1cede1a.md @@ -1,6 +1,6 @@ --- id: 63eedebb0ec0231ff1cede1a -title: Step 22 +title: Passo 22 challengeType: 0 dashedName: step-22 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63efdbc22a0c56070beabed7.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63efdbc22a0c56070beabed7.md index 24c1ac26daf..44bd1bbdb08 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63efdbc22a0c56070beabed7.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63efdbc22a0c56070beabed7.md @@ -1,6 +1,6 @@ --- id: 63efdbc22a0c56070beabed7 -title: Step 23 +title: Passo 23 challengeType: 0 dashedName: step-23 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63efe370bbfc4a08d500118e.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63efe370bbfc4a08d500118e.md index cba3963dbee..2fb15102ee8 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63efe370bbfc4a08d500118e.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63efe370bbfc4a08d500118e.md @@ -1,6 +1,6 @@ --- id: 63efe370bbfc4a08d500118e -title: Step 24 +title: Passo 24 challengeType: 0 dashedName: step-24 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eff02f00e69a0b2ac10b43.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eff02f00e69a0b2ac10b43.md index 5e3da866f36..f1b4fe69710 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eff02f00e69a0b2ac10b43.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eff02f00e69a0b2ac10b43.md @@ -1,6 +1,6 @@ --- id: 63eff02f00e69a0b2ac10b43 -title: Step 25 +title: Passo 25 challengeType: 0 dashedName: step-25 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eff98ffb1d5a0d24ec79cb.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eff98ffb1d5a0d24ec79cb.md index a1b63e599ad..7125bacad8f 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eff98ffb1d5a0d24ec79cb.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63eff98ffb1d5a0d24ec79cb.md @@ -1,6 +1,6 @@ --- id: 63eff98ffb1d5a0d24ec79cb -title: Step 26 +title: Passo 26 challengeType: 0 dashedName: step-26 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63effe558c87a70e7072e447.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63effe558c87a70e7072e447.md index 4573e021ac0..0f5bba25823 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63effe558c87a70e7072e447.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63effe558c87a70e7072e447.md @@ -1,6 +1,6 @@ --- id: 63effe558c87a70e7072e447 -title: Step 27 +title: Passo 27 challengeType: 0 dashedName: step-27 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0165121a9181342d5bc66.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0165121a9181342d5bc66.md index aebdaf9a24f..98895da20e2 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0165121a9181342d5bc66.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0165121a9181342d5bc66.md @@ -1,6 +1,6 @@ --- id: 63f0165121a9181342d5bc66 -title: Step 28 +title: Passo 28 challengeType: 0 dashedName: step-28 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f017b4ad028a148eb713c0.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f017b4ad028a148eb713c0.md index b6f14c6ae69..9290a8154cc 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f017b4ad028a148eb713c0.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f017b4ad028a148eb713c0.md @@ -1,6 +1,6 @@ --- id: 63f017b4ad028a148eb713c0 -title: Step 29 +title: Passo 29 challengeType: 0 dashedName: step-29 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f01861f813e01564c95315.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f01861f813e01564c95315.md index dd3815162fa..98e22973a02 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f01861f813e01564c95315.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f01861f813e01564c95315.md @@ -1,6 +1,6 @@ --- id: 63f01861f813e01564c95315 -title: Step 30 +title: Passo 30 challengeType: 0 dashedName: step-30 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f018f04e487e164dc27bd9.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f018f04e487e164dc27bd9.md index da747a73c32..274d7021938 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f018f04e487e164dc27bd9.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f018f04e487e164dc27bd9.md @@ -1,6 +1,6 @@ --- id: 63f018f04e487e164dc27bd9 -title: Step 31 +title: Passo 31 challengeType: 0 dashedName: step-31 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f01c9791a0aa1751c73760.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f01c9791a0aa1751c73760.md index 852ac25d2b7..f6381aa04c1 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f01c9791a0aa1751c73760.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f01c9791a0aa1751c73760.md @@ -1,6 +1,6 @@ --- id: 63f01c9791a0aa1751c73760 -title: Step 32 +title: Passo 32 challengeType: 0 dashedName: step-32 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0224ceb16dc196d2c860a.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0224ceb16dc196d2c860a.md index c2590b8a8ea..bf3242874f2 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0224ceb16dc196d2c860a.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0224ceb16dc196d2c860a.md @@ -1,6 +1,6 @@ --- id: 63f0224ceb16dc196d2c860a -title: Step 33 +title: Passo 33 challengeType: 0 dashedName: step-33 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f026d041bc6c1a3d5cba0f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f026d041bc6c1a3d5cba0f.md index fd0129e37ca..b9ecf81045c 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f026d041bc6c1a3d5cba0f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f026d041bc6c1a3d5cba0f.md @@ -1,6 +1,6 @@ --- id: 63f026d041bc6c1a3d5cba0f -title: Step 34 +title: Passo 34 challengeType: 0 dashedName: step-34 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0284532742c1b26c7a052.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0284532742c1b26c7a052.md index cae3ba72dbe..1607dc59bfe 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0284532742c1b26c7a052.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0284532742c1b26c7a052.md @@ -1,6 +1,6 @@ --- id: 63f0284532742c1b26c7a052 -title: Step 35 +title: Passo 35 challengeType: 0 dashedName: step-35 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0289df84a581bbdbd29b7.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0289df84a581bbdbd29b7.md index c27e13717f0..8aaa32a7aaa 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0289df84a581bbdbd29b7.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0289df84a581bbdbd29b7.md @@ -1,6 +1,6 @@ --- id: 63f0289df84a581bbdbd29b7 -title: Step 36 +title: Passo 36 challengeType: 0 dashedName: step-36 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0295e673b661ccb299e8a.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0295e673b661ccb299e8a.md index 4b53ebc3ff1..e801d9321eb 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0295e673b661ccb299e8a.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0295e673b661ccb299e8a.md @@ -1,6 +1,6 @@ --- id: 63f0295e673b661ccb299e8a -title: Step 41 +title: Passo 41 challengeType: 0 dashedName: step-41 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f029b96b9e9e1df93be951.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f029b96b9e9e1df93be951.md index b75a16738ae..e53472de887 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f029b96b9e9e1df93be951.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f029b96b9e9e1df93be951.md @@ -1,6 +1,6 @@ --- id: 63f029b96b9e9e1df93be951 -title: Step 42 +title: Passo 42 challengeType: 0 dashedName: step-42 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02a4ef92d711ec1ff618c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02a4ef92d711ec1ff618c.md index ff8d5d86a2e..f65b3afe10a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02a4ef92d711ec1ff618c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02a4ef92d711ec1ff618c.md @@ -1,6 +1,6 @@ --- id: 63f02a4ef92d711ec1ff618c -title: Step 43 +title: Passo 43 challengeType: 0 dashedName: step-43 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02b22cce1c11fe9604381.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02b22cce1c11fe9604381.md index 8d4036f7ea6..cac69012758 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02b22cce1c11fe9604381.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02b22cce1c11fe9604381.md @@ -1,6 +1,6 @@ --- id: 63f02b22cce1c11fe9604381 -title: Step 44 +title: Passo 44 challengeType: 0 dashedName: step-44 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02bdeb9b428208b97eb6b.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02bdeb9b428208b97eb6b.md index 82d277b0ab0..5277945b9eb 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02bdeb9b428208b97eb6b.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02bdeb9b428208b97eb6b.md @@ -1,6 +1,6 @@ --- id: 63f02bdeb9b428208b97eb6b -title: Step 45 +title: Passo 45 challengeType: 0 dashedName: step-45 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02c6e18773921ba50aa53.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02c6e18773921ba50aa53.md index 0954c9b4ac6..2b73caabf96 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02c6e18773921ba50aa53.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f02c6e18773921ba50aa53.md @@ -1,6 +1,6 @@ --- id: 63f02c6e18773921ba50aa53 -title: Step 46 +title: Passo 46 challengeType: 0 dashedName: step-46 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0311f5ea9382388d6124f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0311f5ea9382388d6124f.md index d925dca7812..73cff319d07 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0311f5ea9382388d6124f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0311f5ea9382388d6124f.md @@ -1,6 +1,6 @@ --- id: 63f0311f5ea9382388d6124f -title: Step 47 +title: Passo 47 challengeType: 0 dashedName: step-47 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f033fdb1fbcc254999fcc3.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f033fdb1fbcc254999fcc3.md index b0527ca7c31..971cbc092f8 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f033fdb1fbcc254999fcc3.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f033fdb1fbcc254999fcc3.md @@ -1,6 +1,6 @@ --- id: 63f033fdb1fbcc254999fcc3 -title: Step 37 +title: Passo 37 challengeType: 0 dashedName: step-37 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03446c2ed3e264be6c7fc.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03446c2ed3e264be6c7fc.md index 48e1daa6e0e..cd8841c5727 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03446c2ed3e264be6c7fc.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03446c2ed3e264be6c7fc.md @@ -1,6 +1,6 @@ --- id: 63f03446c2ed3e264be6c7fc -title: Step 38 +title: Passo 38 challengeType: 0 dashedName: step-38 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0348a54a177272071a595.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0348a54a177272071a595.md index 1e9f9959098..b50972587c4 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0348a54a177272071a595.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0348a54a177272071a595.md @@ -1,6 +1,6 @@ --- id: 63f0348a54a177272071a595 -title: Step 39 +title: Passo 39 challengeType: 0 dashedName: step-39 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f034d012f74627ce538d3a.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f034d012f74627ce538d3a.md index 3fcf304cca6..f1d6dfa233b 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f034d012f74627ce538d3a.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f034d012f74627ce538d3a.md @@ -1,6 +1,6 @@ --- id: 63f034d012f74627ce538d3a -title: Step 40 +title: Passo 40 challengeType: 0 dashedName: step-40 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03686c5ea863533ec71f4.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03686c5ea863533ec71f4.md index a4c481b5796..a6a1af825eb 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03686c5ea863533ec71f4.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03686c5ea863533ec71f4.md @@ -1,6 +1,6 @@ --- id: 63f03686c5ea863533ec71f4 -title: Step 48 +title: Passo 48 challengeType: 0 dashedName: step-48 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f036ec91fdf238c90665f5.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f036ec91fdf238c90665f5.md index 936b8a7add9..6c6a24de03f 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f036ec91fdf238c90665f5.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f036ec91fdf238c90665f5.md @@ -1,6 +1,6 @@ --- id: 63f036ec91fdf238c90665f5 -title: Step 49 +title: Passo 49 challengeType: 0 dashedName: step-49 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0370b340915399d31e5eb.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0370b340915399d31e5eb.md index cba09f5a3e6..555fbf4f5fe 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0370b340915399d31e5eb.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0370b340915399d31e5eb.md @@ -1,6 +1,6 @@ --- id: 63f0370b340915399d31e5eb -title: Step 50 +title: Passo 50 challengeType: 0 dashedName: step-50 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0374d5351223a747c301d.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0374d5351223a747c301d.md index 37c08222320..9e6d02ce70c 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0374d5351223a747c301d.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0374d5351223a747c301d.md @@ -1,6 +1,6 @@ --- id: 63f0374d5351223a747c301d -title: Step 51 +title: Passo 51 challengeType: 0 dashedName: step-51 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0378e173e3c3b7638b528.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0378e173e3c3b7638b528.md index 56336e0263e..8fee2a9dce8 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0378e173e3c3b7638b528.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f0378e173e3c3b7638b528.md @@ -1,6 +1,6 @@ --- id: 63f0378e173e3c3b7638b528 -title: Step 52 +title: Passo 52 challengeType: 0 dashedName: step-52 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f038a0ae041d3c5b0cdf23.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f038a0ae041d3c5b0cdf23.md index db0f9862452..edbb1cc8475 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f038a0ae041d3c5b0cdf23.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f038a0ae041d3c5b0cdf23.md @@ -1,6 +1,6 @@ --- id: 63f038a0ae041d3c5b0cdf23 -title: Step 54 +title: Passo 54 challengeType: 0 dashedName: step-54 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f038e671d3f73d5a041973.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f038e671d3f73d5a041973.md index 50339959f43..0f1a393743e 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f038e671d3f73d5a041973.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f038e671d3f73d5a041973.md @@ -1,6 +1,6 @@ --- id: 63f038e671d3f73d5a041973 -title: Step 55 +title: Passo 55 challengeType: 0 dashedName: step-55 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f039dbcef7673e4e758fa3.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f039dbcef7673e4e758fa3.md index 23f034e9067..fe8bbdf980a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f039dbcef7673e4e758fa3.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f039dbcef7673e4e758fa3.md @@ -1,6 +1,6 @@ --- id: 63f039dbcef7673e4e758fa3 -title: Step 56 +title: Passo 56 challengeType: 0 dashedName: step-56 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03a7143a6ef3f7f3344f0.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03a7143a6ef3f7f3344f0.md index be4fde050a5..402f5f42441 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03a7143a6ef3f7f3344f0.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03a7143a6ef3f7f3344f0.md @@ -1,6 +1,6 @@ --- id: 63f03a7143a6ef3f7f3344f0 -title: Step 57 +title: Passo 57 challengeType: 0 dashedName: step-57 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03ac2b428b2404a5a7518.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03ac2b428b2404a5a7518.md index 3b6705168d8..db033c9ec91 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03ac2b428b2404a5a7518.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03ac2b428b2404a5a7518.md @@ -1,6 +1,6 @@ --- id: 63f03ac2b428b2404a5a7518 -title: Step 58 +title: Passo 58 challengeType: 0 dashedName: step-58 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03af535682e4138fdb915.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03af535682e4138fdb915.md index 5a1e7f099f3..692205938e2 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03af535682e4138fdb915.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03af535682e4138fdb915.md @@ -1,6 +1,6 @@ --- id: 63f03af535682e4138fdb915 -title: Step 59 +title: Passo 59 challengeType: 0 dashedName: step-59 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03b1ed5ab15420c057463.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03b1ed5ab15420c057463.md index 913c5c53bdb..95fe1a48727 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03b1ed5ab15420c057463.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f03b1ed5ab15420c057463.md @@ -1,6 +1,6 @@ --- id: 63f03b1ed5ab15420c057463 -title: Step 60 +title: Passo 60 challengeType: 0 dashedName: step-60 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f6721d5110af243ef8f3d9.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f6721d5110af243ef8f3d9.md index c33ce088a1c..41dec774f4f 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f6721d5110af243ef8f3d9.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-data-structures-by-building-a-shopping-cart/63f6721d5110af243ef8f3d9.md @@ -1,6 +1,6 @@ --- id: 63f6721d5110af243ef8f3d9 -title: Step 53 +title: Passo 53 challengeType: 0 dashedName: step-53 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641d9a19bff38d34d5a5edb8.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641d9a19bff38d34d5a5edb8.md index 99b441c6e33..1a4d8f564e8 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641d9a19bff38d34d5a5edb8.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641d9a19bff38d34d5a5edb8.md @@ -1,6 +1,6 @@ --- id: 641d9a19bff38d34d5a5edb8 -title: Step 1 +title: Passo 1 challengeType: 0 dashedName: step-1 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da3c6b6fbd742bff6ee40.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da3c6b6fbd742bff6ee40.md index 0e15f84dd7a..f4e14dd446c 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da3c6b6fbd742bff6ee40.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da3c6b6fbd742bff6ee40.md @@ -1,6 +1,6 @@ --- id: 641da3c6b6fbd742bff6ee40 -title: Step 2 +title: Passo 2 challengeType: 0 dashedName: step-2 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da42481d90c4314c99e94.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da42481d90c4314c99e94.md index ad5ad0532fe..c9732f38735 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da42481d90c4314c99e94.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da42481d90c4314c99e94.md @@ -1,6 +1,6 @@ --- id: 641da42481d90c4314c99e94 -title: Step 3 +title: Passo 3 challengeType: 0 dashedName: step-3 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da465273051435d332b15.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da465273051435d332b15.md index 7fec2d783a4..db5bfbc2b6b 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da465273051435d332b15.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da465273051435d332b15.md @@ -1,6 +1,6 @@ --- id: 641da465273051435d332b15 -title: Step 4 +title: Passo 4 challengeType: 0 dashedName: step-4 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da4b16937be43ba24c63d.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da4b16937be43ba24c63d.md index a9459eaf14d..3ccd368256d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da4b16937be43ba24c63d.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da4b16937be43ba24c63d.md @@ -1,6 +1,6 @@ --- id: 641da4b16937be43ba24c63d -title: Step 5 +title: Passo 5 challengeType: 0 dashedName: step-5 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da51a9810e74411262fcc.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da51a9810e74411262fcc.md index 0b4247deead..8cb9f4c1b5e 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da51a9810e74411262fcc.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da51a9810e74411262fcc.md @@ -1,6 +1,6 @@ --- id: 641da51a9810e74411262fcc -title: Step 6 +title: Passo 6 challengeType: 0 dashedName: step-6 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da5462576784453146ec2.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da5462576784453146ec2.md index 60a5b23e01e..f9c52ca19d4 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da5462576784453146ec2.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da5462576784453146ec2.md @@ -1,6 +1,6 @@ --- id: 641da5462576784453146ec2 -title: Step 7 +title: Passo 7 challengeType: 0 dashedName: step-7 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da5abaac81844a54adb03.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da5abaac81844a54adb03.md index b213299f6d4..9b0280273fe 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da5abaac81844a54adb03.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da5abaac81844a54adb03.md @@ -1,6 +1,6 @@ --- id: 641da5abaac81844a54adb03 -title: Step 8 +title: Passo 8 challengeType: 0 dashedName: step-8 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da5dd6cd6db44f58b7787.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da5dd6cd6db44f58b7787.md index 7601728e970..2d7d557975d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da5dd6cd6db44f58b7787.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da5dd6cd6db44f58b7787.md @@ -1,6 +1,6 @@ --- id: 641da5dd6cd6db44f58b7787 -title: Step 9 +title: Passo 9 challengeType: 0 dashedName: step-9 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da615af82bf454215a992.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da615af82bf454215a992.md index 91ab374e795..99b0d403dc2 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da615af82bf454215a992.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da615af82bf454215a992.md @@ -1,6 +1,6 @@ --- id: 641da615af82bf454215a992 -title: Step 10 +title: Passo 10 challengeType: 0 dashedName: step-10 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da6570acf7545931ce477.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da6570acf7545931ce477.md index 06bcd6e8b60..43ade85a50a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da6570acf7545931ce477.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da6570acf7545931ce477.md @@ -1,6 +1,6 @@ --- id: 641da6570acf7545931ce477 -title: Step 11 +title: Passo 10 challengeType: 0 dashedName: step-11 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da6dcb6e4c9463d54c75b.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da6dcb6e4c9463d54c75b.md index 0764afeb790..fe388355c10 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da6dcb6e4c9463d54c75b.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da6dcb6e4c9463d54c75b.md @@ -1,6 +1,6 @@ --- id: 641da6dcb6e4c9463d54c75b -title: Step 12 +title: Passo 12 challengeType: 0 dashedName: step-12 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da7071d0d45467cd59977.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da7071d0d45467cd59977.md index 6d78055c771..6cae77d0a53 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da7071d0d45467cd59977.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da7071d0d45467cd59977.md @@ -1,6 +1,6 @@ --- id: 641da7071d0d45467cd59977 -title: Step 13 +title: Passo 13 challengeType: 0 dashedName: step-13 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da73b09e7f046c758e0ed.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da73b09e7f046c758e0ed.md index aacdc42bf9a..f377d228208 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da73b09e7f046c758e0ed.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da73b09e7f046c758e0ed.md @@ -1,6 +1,6 @@ --- id: 641da73b09e7f046c758e0ed -title: Step 14 +title: Passo 14 challengeType: 0 dashedName: step-14 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da791d0c34a472b8d15b6.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da791d0c34a472b8d15b6.md index 8ae28f085f4..a88bee62d34 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da791d0c34a472b8d15b6.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da791d0c34a472b8d15b6.md @@ -1,6 +1,6 @@ --- id: 641da791d0c34a472b8d15b6 -title: Step 15 +title: Passo 15 challengeType: 0 dashedName: step-15 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da7bfbc7f0f477438ad8a.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da7bfbc7f0f477438ad8a.md index afeba760e74..d8b29a4b558 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da7bfbc7f0f477438ad8a.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da7bfbc7f0f477438ad8a.md @@ -1,6 +1,6 @@ --- id: 641da7bfbc7f0f477438ad8a -title: Step 16 +title: Passo 16 challengeType: 0 dashedName: step-16 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da803d9892447d059804e.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da803d9892447d059804e.md index 237e51097fe..77d5a536ea3 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da803d9892447d059804e.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da803d9892447d059804e.md @@ -1,6 +1,6 @@ --- id: 641da803d9892447d059804e -title: Step 17 +title: Passo 17 challengeType: 0 dashedName: step-17 --- @@ -11,7 +11,7 @@ Now create an image tag and give it the `class` `user-img`. Use template interpo # --hints-- -You should create an `img` element. +Você deve criar um elemento `img`. ```js assert.exists(document.querySelector('img')); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da836581c254815f785fe.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da836581c254815f785fe.md index 1eef6b31025..bb2ece10e3c 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da836581c254815f785fe.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da836581c254815f785fe.md @@ -1,6 +1,6 @@ --- id: 641da836581c254815f785fe -title: Step 18 +title: Passo 18 challengeType: 0 dashedName: step-18 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da86294fd9f485d3c2bf0.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da86294fd9f485d3c2bf0.md index b5f13f13f69..97d71e1e213 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da86294fd9f485d3c2bf0.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da86294fd9f485d3c2bf0.md @@ -1,6 +1,6 @@ --- id: 641da86294fd9f485d3c2bf0 -title: Step 19 +title: Passo 19 challengeType: 0 dashedName: step-19 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da895fb7ec648a5bdf19c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da895fb7ec648a5bdf19c.md index 2cb8442eb5d..56d7acb52e0 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da895fb7ec648a5bdf19c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da895fb7ec648a5bdf19c.md @@ -1,6 +1,6 @@ --- id: 641da895fb7ec648a5bdf19c -title: Step 20 +title: Passo 20 challengeType: 0 dashedName: step-20 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da8db2a036048ebe6999e.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da8db2a036048ebe6999e.md index bfcc82f33c1..88d10c1a622 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da8db2a036048ebe6999e.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da8db2a036048ebe6999e.md @@ -1,6 +1,6 @@ --- id: 641da8db2a036048ebe6999e -title: Step 21 +title: Passo 21 challengeType: 0 dashedName: step-21 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da97c987a514959ada414.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da97c987a514959ada414.md index 456f240c26f..45bd99c43bb 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da97c987a514959ada414.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da97c987a514959ada414.md @@ -1,6 +1,6 @@ --- id: 641da97c987a514959ada414 -title: Step 22 +title: Passo 22 challengeType: 0 dashedName: step-22 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da9aceb788e49a73ebcc9.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da9aceb788e49a73ebcc9.md index 2ca307dc026..463468346e6 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da9aceb788e49a73ebcc9.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da9aceb788e49a73ebcc9.md @@ -1,6 +1,6 @@ --- id: 641da9aceb788e49a73ebcc9 -title: Step 23 +title: Passo 23 challengeType: 0 dashedName: step-23 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da9ea9b847a49fe6ee9b6.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da9ea9b847a49fe6ee9b6.md index 6c610c97896..d88af4c3dd3 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da9ea9b847a49fe6ee9b6.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641da9ea9b847a49fe6ee9b6.md @@ -1,6 +1,6 @@ --- id: 641da9ea9b847a49fe6ee9b6 -title: Step 24 +title: Passo 24 challengeType: 0 dashedName: step-24 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daa5ea050f24a7cade6e6.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daa5ea050f24a7cade6e6.md index 6aaa29790bc..26c8c86daa8 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daa5ea050f24a7cade6e6.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daa5ea050f24a7cade6e6.md @@ -1,6 +1,6 @@ --- id: 641daa5ea050f24a7cade6e6 -title: Step 25 +title: Passo 25 challengeType: 0 dashedName: step-25 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daa8c2c3e364ac3650b37.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daa8c2c3e364ac3650b37.md index 21ca08cbc44..bcdd6028c2b 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daa8c2c3e364ac3650b37.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daa8c2c3e364ac3650b37.md @@ -1,6 +1,6 @@ --- id: 641daa8c2c3e364ac3650b37 -title: Step 26 +title: Passo 26 challengeType: 0 dashedName: step-26 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daabed8d0584b1150c953.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daabed8d0584b1150c953.md index bc2fa142948..b72b726194d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daabed8d0584b1150c953.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daabed8d0584b1150c953.md @@ -1,6 +1,6 @@ --- id: 641daabed8d0584b1150c953 -title: Step 27 +title: Passo 27 challengeType: 0 dashedName: step-27 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daae5e18eae4b562633e4.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daae5e18eae4b562633e4.md index f288cc359bc..bd83e6297a0 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daae5e18eae4b562633e4.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641daae5e18eae4b562633e4.md @@ -1,6 +1,6 @@ --- id: 641daae5e18eae4b562633e4 -title: Step 28 +title: Passo 28 challengeType: 0 dashedName: step-28 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641dab13c1b6f14b9828e6b1.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641dab13c1b6f14b9828e6b1.md index 80288b931fb..4d5cc054690 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641dab13c1b6f14b9828e6b1.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-fetch-and-promises-by-building-an-fcc-authors-page/641dab13c1b6f14b9828e6b1.md @@ -1,13 +1,13 @@ --- id: 641dab13c1b6f14b9828e6b1 -title: Step 29 +title: Passo 29 challengeType: 0 dashedName: step-29 --- # --description-- -One more thing. If you keep clicking the `Load More Authors` button until there's no more data to load and the text changes to `No more data to load`, the cursor value is still `pointer`. Why not change the cursor value to `not-allowed` instead? +Mais uma coisa. If you keep clicking the `Load More Authors` button until there's no more data to load and the text changes to `No more data to load`, the cursor value is still `pointer`. Why not change the cursor value to `not-allowed` instead? Access the `style` property of the `Load More Authors` button and set `cursor` to `not-allowed`. diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/5ddb965c65d27e1512d44d9a.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/5ddb965c65d27e1512d44d9a.md index c3def32154d..ac3c6e8479d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/5ddb965c65d27e1512d44d9a.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/5ddb965c65d27e1512d44d9a.md @@ -1,6 +1,6 @@ --- id: 5ddb965c65d27e1512d44d9a -title: Step 1 +title: Passo 1 challengeType: 0 dashedName: step-1 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b606f09a14cc1781aea1fb.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b606f09a14cc1781aea1fb.md index e938bc8c2e3..5aa2dda7cb8 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b606f09a14cc1781aea1fb.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b606f09a14cc1781aea1fb.md @@ -1,6 +1,6 @@ --- id: 63b606f09a14cc1781aea1fb -title: Step 2 +title: Passo 2 challengeType: 0 dashedName: step-2 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b6075a62883218d282504c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b6075a62883218d282504c.md index fcabad47a30..617be6fa9e6 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b6075a62883218d282504c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b6075a62883218d282504c.md @@ -1,6 +1,6 @@ --- id: 63b6075a62883218d282504c -title: Step 3 +title: Passo 3 challengeType: 0 dashedName: step-3 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b607af6fcdb119aae9b16a.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b607af6fcdb119aae9b16a.md index 5079bde79a8..5d4434e88d9 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b607af6fcdb119aae9b16a.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b607af6fcdb119aae9b16a.md @@ -1,6 +1,6 @@ --- id: 63b607af6fcdb119aae9b16a -title: Step 4 +title: Passo 4 challengeType: 0 dashedName: step-4 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60821c855d01b1eda3c0b.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60821c855d01b1eda3c0b.md index 7de68f5215c..2fdd6882211 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60821c855d01b1eda3c0b.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60821c855d01b1eda3c0b.md @@ -1,6 +1,6 @@ --- id: 63b60821c855d01b1eda3c0b -title: Step 5 +title: Passo 5 challengeType: 0 dashedName: step-5 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b6088bb56e2d1cac364043.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b6088bb56e2d1cac364043.md index f7c617f998e..fb56808c26e 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b6088bb56e2d1cac364043.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b6088bb56e2d1cac364043.md @@ -1,6 +1,6 @@ --- id: 63b6088bb56e2d1cac364043 -title: Step 6 +title: Passo 6 challengeType: 0 dashedName: step-6 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b608ebf40c871d960fc004.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b608ebf40c871d960fc004.md index 911126b33e4..611c77c4495 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b608ebf40c871d960fc004.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b608ebf40c871d960fc004.md @@ -1,6 +1,6 @@ --- id: 63b608ebf40c871d960fc004 -title: Step 7 +title: Passo 7 challengeType: 0 dashedName: step-7 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60a140bf5a321d50a7315.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60a140bf5a321d50a7315.md index 068bea72dfc..8ac0562366a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60a140bf5a321d50a7315.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60a140bf5a321d50a7315.md @@ -1,6 +1,6 @@ --- id: 63b60a140bf5a321d50a7315 -title: Step 8 +title: Passo 8 challengeType: 0 dashedName: step-8 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60aaaa65f8922bfce6b7e.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60aaaa65f8922bfce6b7e.md index c9723d26fcb..0fd3c650484 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60aaaa65f8922bfce6b7e.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60aaaa65f8922bfce6b7e.md @@ -1,6 +1,6 @@ --- id: 63b60aaaa65f8922bfce6b7e -title: Step 9 +title: Passo 9 challengeType: 0 dashedName: step-9 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60af1a0b9f7238a9dd294.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60af1a0b9f7238a9dd294.md index 27f69a473d9..d404b8ee19a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60af1a0b9f7238a9dd294.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60af1a0b9f7238a9dd294.md @@ -1,6 +1,6 @@ --- id: 63b60af1a0b9f7238a9dd294 -title: Step 10 +title: Passo 10 challengeType: 0 dashedName: step-10 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60c09c5039f25a3b2dda9.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60c09c5039f25a3b2dda9.md index 4e28d650816..c8f562d31e8 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60c09c5039f25a3b2dda9.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60c09c5039f25a3b2dda9.md @@ -1,6 +1,6 @@ --- id: 63b60c09c5039f25a3b2dda9 -title: Step 11 +title: Passo 10 challengeType: 0 dashedName: step-11 --- @@ -13,7 +13,7 @@ Then add a `button` with the `id` set to `clear` to clear the form (don't forget # --hints-- -You should create a second `div` element. +Crie um segundo elemento `div`. ```js assert.equal(document.querySelectorAll('form > div')?.length, 2); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60ca38c897f2721b27959.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60ca38c897f2721b27959.md index aaf24c8d8cb..6b8f03ee744 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60ca38c897f2721b27959.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60ca38c897f2721b27959.md @@ -1,6 +1,6 @@ --- id: 63b60ca38c897f2721b27959 -title: Step 12 +title: Passo 12 challengeType: 0 dashedName: step-12 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60cfaca25bb27edd40f62.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60cfaca25bb27edd40f62.md index 17934b0039d..91572e5303a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60cfaca25bb27edd40f62.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60cfaca25bb27edd40f62.md @@ -1,6 +1,6 @@ --- id: 63b60cfaca25bb27edd40f62 -title: Step 13 +title: Passo 13 challengeType: 0 dashedName: step-13 --- @@ -11,7 +11,7 @@ Finally, you need to link your JavaScript file to your HTML. Create a `script` e # --hints-- -You should have a `script` element. +Você deve ter apenas um elemento `script`. ```js assert.isAtLeast(document.querySelectorAll('script')?.length, 1); diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60d3c5048302906962231.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60d3c5048302906962231.md index de3870b44ad..4301e367e87 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60d3c5048302906962231.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b60d3c5048302906962231.md @@ -1,6 +1,6 @@ --- id: 63b60d3c5048302906962231 -title: Step 14 +title: Passo 14 challengeType: 0 dashedName: step-14 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b613f367584d2a5d041b7d.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b613f367584d2a5d041b7d.md index 44e1c274573..319eb89ee51 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b613f367584d2a5d041b7d.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b613f367584d2a5d041b7d.md @@ -1,6 +1,6 @@ --- id: 63b613f367584d2a5d041b7d -title: Step 15 +title: Passo 15 challengeType: 0 dashedName: step-15 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b61490e633a22b4593e62f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b61490e633a22b4593e62f.md index 6cbbeb5ab4a..6a3aaf79590 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b61490e633a22b4593e62f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b61490e633a22b4593e62f.md @@ -1,6 +1,6 @@ --- id: 63b61490e633a22b4593e62f -title: Step 16 +title: Passo 16 challengeType: 0 dashedName: step-16 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b614e6a1f7fe2cef6312dc.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b614e6a1f7fe2cef6312dc.md index 99c1985862c..4480dc866a3 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b614e6a1f7fe2cef6312dc.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b614e6a1f7fe2cef6312dc.md @@ -1,6 +1,6 @@ --- id: 63b614e6a1f7fe2cef6312dc -title: Step 17 +title: Passo 17 challengeType: 0 dashedName: step-17 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b6152e6aff882db819fc1e.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b6152e6aff882db819fc1e.md index 436b65b80d6..24a4e8ba868 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b6152e6aff882db819fc1e.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b6152e6aff882db819fc1e.md @@ -1,6 +1,6 @@ --- id: 63b6152e6aff882db819fc1e -title: Step 18 +title: Passo 18 challengeType: 0 dashedName: step-18 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b61584def8fa2ebcc259e0.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b61584def8fa2ebcc259e0.md index b7de4018e24..ce661339315 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b61584def8fa2ebcc259e0.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63b61584def8fa2ebcc259e0.md @@ -1,6 +1,6 @@ --- id: 63b61584def8fa2ebcc259e0 -title: Step 19 +title: Passo 19 challengeType: 0 dashedName: step-19 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf43be3f969d24d4ed233c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf43be3f969d24d4ed233c.md index a0eaf81fd4e..63dcee6ee4a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf43be3f969d24d4ed233c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf43be3f969d24d4ed233c.md @@ -1,6 +1,6 @@ --- id: 63bf43be3f969d24d4ed233c -title: Step 20 +title: Passo 20 challengeType: 0 dashedName: step-20 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf446945d34d25e6db6e4f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf446945d34d25e6db6e4f.md index db275c224c1..bef9c1f1851 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf446945d34d25e6db6e4f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf446945d34d25e6db6e4f.md @@ -1,6 +1,6 @@ --- id: 63bf446945d34d25e6db6e4f -title: Step 21 +title: Passo 21 challengeType: 0 dashedName: step-21 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf45ce0dc8d4270760c6d0.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf45ce0dc8d4270760c6d0.md index a432c6687d5..7b6c80457ce 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf45ce0dc8d4270760c6d0.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf45ce0dc8d4270760c6d0.md @@ -1,6 +1,6 @@ --- id: 63bf45ce0dc8d4270760c6d0 -title: Step 22 +title: Passo 22 challengeType: 0 dashedName: step-22 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf461011fca327d3b60fa8.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf461011fca327d3b60fa8.md index f74ff636c5b..142f6d51da5 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf461011fca327d3b60fa8.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf461011fca327d3b60fa8.md @@ -1,6 +1,6 @@ --- id: 63bf461011fca327d3b60fa8 -title: Step 23 +title: Passo 23 challengeType: 0 dashedName: step-23 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf47fd40599f29827f484d.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf47fd40599f29827f484d.md index 0f781eb61cf..1ea45ab5d48 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf47fd40599f29827f484d.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf47fd40599f29827f484d.md @@ -1,6 +1,6 @@ --- id: 63bf47fd40599f29827f484d -title: Step 24 +title: Passo 24 challengeType: 0 dashedName: step-24 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf492b6dfb292a79f0e675.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf492b6dfb292a79f0e675.md index 25d6d2447fb..2c5e3011db1 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf492b6dfb292a79f0e675.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf492b6dfb292a79f0e675.md @@ -1,6 +1,6 @@ --- id: 63bf492b6dfb292a79f0e675 -title: Step 25 +title: Passo 25 challengeType: 0 dashedName: step-25 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf4bfe9de3852be51c8f86.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf4bfe9de3852be51c8f86.md index 3b18f0aac60..598475b3668 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf4bfe9de3852be51c8f86.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf4bfe9de3852be51c8f86.md @@ -1,6 +1,6 @@ --- id: 63bf4bfe9de3852be51c8f86 -title: Step 26 +title: Passo 26 challengeType: 0 dashedName: step-26 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf4d351e06432ce9bf3627.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf4d351e06432ce9bf3627.md index 30baf30ed58..de7627ae8cb 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf4d351e06432ce9bf3627.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf4d351e06432ce9bf3627.md @@ -1,13 +1,13 @@ --- id: 63bf4d351e06432ce9bf3627 -title: Step 27 +title: Passo 27 challengeType: 0 dashedName: step-27 --- # --description-- -Regex can also take specific flags to alter the pattern matching behavior. Flags are added after the closing `/`. The `g` flag, which stands for "global", will tell the pattern to continue looking after it has found a match. Here is an example: +Regex can also take specific flags to alter the pattern matching behavior. Flags are added after the closing `/`. The `g` flag, which stands for "global", will tell the pattern to continue looking after it has found a match. Aqui está um exemplo: ```js const helloRegex = /hello/g; diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf511b85b6082e54dc1573.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf511b85b6082e54dc1573.md index 4b35b49f7b9..38ca27e7aff 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf511b85b6082e54dc1573.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf511b85b6082e54dc1573.md @@ -1,6 +1,6 @@ --- id: 63bf511b85b6082e54dc1573 -title: Step 28 +title: Passo 28 challengeType: 0 dashedName: step-28 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5230bccd1c2f5c13e1ce.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5230bccd1c2f5c13e1ce.md index b6eef00a30b..80d35726f9a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5230bccd1c2f5c13e1ce.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5230bccd1c2f5c13e1ce.md @@ -1,6 +1,6 @@ --- id: 63bf5230bccd1c2f5c13e1ce -title: Step 29 +title: Passo 29 challengeType: 0 dashedName: step-29 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf598a4c807930a13a1a27.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf598a4c807930a13a1a27.md index 778a809571e..cedb58ee9ec 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf598a4c807930a13a1a27.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf598a4c807930a13a1a27.md @@ -1,6 +1,6 @@ --- id: 63bf598a4c807930a13a1a27 -title: Step 30 +title: Passo 30 challengeType: 0 dashedName: step-30 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5a518d54f63181ab639a.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5a518d54f63181ab639a.md index 2bf1aa0f9a3..d73dfaea6d0 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5a518d54f63181ab639a.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5a518d54f63181ab639a.md @@ -1,6 +1,6 @@ --- id: 63bf5a518d54f63181ab639a -title: Step 31 +title: Passo 31 challengeType: 0 dashedName: step-31 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5a92fd148d3264d5322b.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5a92fd148d3264d5322b.md index 19873a84492..31ba8d7bfdd 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5a92fd148d3264d5322b.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5a92fd148d3264d5322b.md @@ -1,6 +1,6 @@ --- id: 63bf5a92fd148d3264d5322b -title: Step 32 +title: Passo 32 challengeType: 0 dashedName: step-32 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5adfe2981b332eb007b6.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5adfe2981b332eb007b6.md index 75477ddd763..4b7990fb85f 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5adfe2981b332eb007b6.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5adfe2981b332eb007b6.md @@ -1,6 +1,6 @@ --- id: 63bf5adfe2981b332eb007b6 -title: Step 33 +title: Passo 33 challengeType: 0 dashedName: step-33 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5bcfebff0734593fad19.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5bcfebff0734593fad19.md index 95686b3c3a0..bdd6f7e446d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5bcfebff0734593fad19.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5bcfebff0734593fad19.md @@ -1,6 +1,6 @@ --- id: 63bf5bcfebff0734593fad19 -title: Step 34 +title: Passo 34 challengeType: 0 dashedName: step-34 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5c438f523a359769106c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5c438f523a359769106c.md index f6f61282ce9..b38d890297f 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5c438f523a359769106c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5c438f523a359769106c.md @@ -1,6 +1,6 @@ --- id: 63bf5c438f523a359769106c -title: Step 35 +title: Passo 35 challengeType: 0 dashedName: step-35 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5cf03b50bf36cfbe94ea.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5cf03b50bf36cfbe94ea.md index 228f3503303..e6d77717bb7 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5cf03b50bf36cfbe94ea.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63bf5cf03b50bf36cfbe94ea.md @@ -1,6 +1,6 @@ --- id: 63bf5cf03b50bf36cfbe94ea -title: Step 36 +title: Passo 36 challengeType: 0 dashedName: step-36 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1dfbd56c71e278800010c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1dfbd56c71e278800010c.md index 1bc417c8bbb..c2f58a4b7f4 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1dfbd56c71e278800010c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1dfbd56c71e278800010c.md @@ -1,6 +1,6 @@ --- id: 63c1dfbd56c71e278800010c -title: Step 37 +title: Passo 37 challengeType: 0 dashedName: step-37 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e0af28078f2dfad9eb3e.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e0af28078f2dfad9eb3e.md index 413b5f76d84..de84f2e972a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e0af28078f2dfad9eb3e.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e0af28078f2dfad9eb3e.md @@ -1,6 +1,6 @@ --- id: 63c1e0af28078f2dfad9eb3e -title: Step 38 +title: Passo 38 challengeType: 0 dashedName: step-38 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e1965a898d302e0af4e3.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e1965a898d302e0af4e3.md index 06e5ac50cec..c9c692fe497 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e1965a898d302e0af4e3.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e1965a898d302e0af4e3.md @@ -1,6 +1,6 @@ --- id: 63c1e1965a898d302e0af4e3 -title: Step 39 +title: Passo 39 challengeType: 0 dashedName: step-39 --- @@ -9,7 +9,7 @@ dashedName: step-39 JavaScript has a feature called template literals, which allow you to interpolate variables directly within a string. Template literals are denoted with backticks ` `` `, as opposed to single or double quotes. Variables can be passed in to a template literal by surrounding the variable with `${}` – the value of the variable will be inserted into the string. -For example: +Por exemplo: ```js const name = "Naomi"; diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e5b4b3c8a031def3bd65.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e5b4b3c8a031def3bd65.md index 6aeab26c100..a357f0a7f52 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e5b4b3c8a031def3bd65.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e5b4b3c8a031def3bd65.md @@ -1,6 +1,6 @@ --- id: 63c1e5b4b3c8a031def3bd65 -title: Step 40 +title: Passo 40 challengeType: 0 dashedName: step-40 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e704ee12703347625900.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e704ee12703347625900.md index b658496aeee..2db28ec14f3 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e704ee12703347625900.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c1e704ee12703347625900.md @@ -1,6 +1,6 @@ --- id: 63c1e704ee12703347625900 -title: Step 41 +title: Passo 41 challengeType: 0 dashedName: step-41 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2164c0df38a382062c4af.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2164c0df38a382062c4af.md index 15622f17e14..08d314b2865 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2164c0df38a382062c4af.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2164c0df38a382062c4af.md @@ -1,6 +1,6 @@ --- id: 63c2164c0df38a382062c4af -title: Step 42 +title: Passo 42 challengeType: 0 dashedName: step-42 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c216da562fbb3957b9cb2c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c216da562fbb3957b9cb2c.md index a7c1e1d3e7b..3d79a788f5b 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c216da562fbb3957b9cb2c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c216da562fbb3957b9cb2c.md @@ -1,6 +1,6 @@ --- id: 63c216da562fbb3957b9cb2c -title: Step 43 +title: Passo 43 challengeType: 0 dashedName: step-43 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2171c1e5b6e3aa51768d0.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2171c1e5b6e3aa51768d0.md index e8ced7f3436..496c2a6bb85 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2171c1e5b6e3aa51768d0.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2171c1e5b6e3aa51768d0.md @@ -1,6 +1,6 @@ --- id: 63c2171c1e5b6e3aa51768d0 -title: Step 44 +title: Passo 44 challengeType: 0 dashedName: step-44 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21774193de43bbc6a769f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21774193de43bbc6a769f.md index f78a3d0252c..0ce13d14555 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21774193de43bbc6a769f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21774193de43bbc6a769f.md @@ -1,6 +1,6 @@ --- id: 63c21774193de43bbc6a769f -title: Step 45 +title: Passo 45 challengeType: 0 dashedName: step-45 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c217ccd939053ce4fa16d6.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c217ccd939053ce4fa16d6.md index 42ee9b19109..3b18301d59d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c217ccd939053ce4fa16d6.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c217ccd939053ce4fa16d6.md @@ -1,6 +1,6 @@ --- id: 63c217ccd939053ce4fa16d6 -title: Step 46 +title: Passo 46 challengeType: 0 dashedName: step-46 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21839f56eaf3ef4e027c4.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21839f56eaf3ef4e027c4.md index cfeec0927c4..dfe64d81c81 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21839f56eaf3ef4e027c4.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21839f56eaf3ef4e027c4.md @@ -1,6 +1,6 @@ --- id: 63c21839f56eaf3ef4e027c4 -title: Step 47 +title: Passo 47 challengeType: 0 dashedName: step-47 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2187f55eb0f400269568f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2187f55eb0f400269568f.md index f0fa5f37c19..df98d5a752d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2187f55eb0f400269568f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2187f55eb0f400269568f.md @@ -1,6 +1,6 @@ --- id: 63c2187f55eb0f400269568f -title: Step 48 +title: Passo 48 challengeType: 0 dashedName: step-48 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c218c028c56a411b2a379a.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c218c028c56a411b2a379a.md index 36835a69413..0f38a7e70a5 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c218c028c56a411b2a379a.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c218c028c56a411b2a379a.md @@ -1,6 +1,6 @@ --- id: 63c218c028c56a411b2a379a -title: Step 49 +title: Passo 49 challengeType: 0 dashedName: step-49 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2194dce265f429300c8b1.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2194dce265f429300c8b1.md index ebb6b922e2b..fc300851222 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2194dce265f429300c8b1.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c2194dce265f429300c8b1.md @@ -1,6 +1,6 @@ --- id: 63c2194dce265f429300c8b1 -title: Step 51 +title: Passo 51 challengeType: 0 dashedName: step-51 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21c17fa8fd6447ff0389d.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21c17fa8fd6447ff0389d.md index 2d0ccd9e339..d46e78bb0fa 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21c17fa8fd6447ff0389d.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21c17fa8fd6447ff0389d.md @@ -1,6 +1,6 @@ --- id: 63c21c17fa8fd6447ff0389d -title: Step 52 +title: Passo 52 challengeType: 0 dashedName: step-52 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21cd2c34541469f5700a9.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21cd2c34541469f5700a9.md index 78b1d7d6116..e1bd2c1b866 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21cd2c34541469f5700a9.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21cd2c34541469f5700a9.md @@ -1,6 +1,6 @@ --- id: 63c21cd2c34541469f5700a9 -title: Step 53 +title: Passo 53 challengeType: 0 dashedName: step-53 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21d4f48267a47c2946788.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21d4f48267a47c2946788.md index 501371edf5e..fca5d722b71 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21d4f48267a47c2946788.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21d4f48267a47c2946788.md @@ -1,6 +1,6 @@ --- id: 63c21d4f48267a47c2946788 -title: Step 54 +title: Passo 54 challengeType: 0 dashedName: step-54 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21dea919c8e4adb0df8e8.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21dea919c8e4adb0df8e8.md index b4f31e92cea..53b8216bde7 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21dea919c8e4adb0df8e8.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c21dea919c8e4adb0df8e8.md @@ -1,6 +1,6 @@ --- id: 63c21dea919c8e4adb0df8e8 -title: Step 50 +title: Passo 50 challengeType: 0 dashedName: step-50 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8ab51214c8c1f1b9a49f7.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8ab51214c8c1f1b9a49f7.md index 8d47f896df1..601d4279fa5 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8ab51214c8c1f1b9a49f7.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8ab51214c8c1f1b9a49f7.md @@ -1,6 +1,6 @@ --- id: 63c8ab51214c8c1f1b9a49f7 -title: Step 55 +title: Passo 55 challengeType: 0 dashedName: step-55 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8ad0cd8f1e5201c4ef2e4.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8ad0cd8f1e5201c4ef2e4.md index 4da040ed199..b973d560e2c 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8ad0cd8f1e5201c4ef2e4.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8ad0cd8f1e5201c4ef2e4.md @@ -1,6 +1,6 @@ --- id: 63c8ad0cd8f1e5201c4ef2e4 -title: Step 56 +title: Passo 56 challengeType: 0 dashedName: step-56 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8b0187cceff21c8389543.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8b0187cceff21c8389543.md index 645fcaa4d24..fe4b66e4ca3 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8b0187cceff21c8389543.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8b0187cceff21c8389543.md @@ -1,6 +1,6 @@ --- id: 63c8b0187cceff21c8389543 -title: Step 57 +title: Passo 57 challengeType: 0 dashedName: step-57 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8be904ffff922f3c6f8d0.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8be904ffff922f3c6f8d0.md index ae8ef40dd20..0f0c294f96d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8be904ffff922f3c6f8d0.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8be904ffff922f3c6f8d0.md @@ -1,6 +1,6 @@ --- id: 63c8be904ffff922f3c6f8d0 -title: Step 58 +title: Passo 58 challengeType: 0 dashedName: step-58 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8c00bfb671b23f9de4159.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8c00bfb671b23f9de4159.md index a994632ff24..7c2339a3ec0 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8c00bfb671b23f9de4159.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8c00bfb671b23f9de4159.md @@ -1,6 +1,6 @@ --- id: 63c8c00bfb671b23f9de4159 -title: Step 59 +title: Passo 59 challengeType: 0 dashedName: step-59 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8c15fd337ad24b9b68049.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8c15fd337ad24b9b68049.md index 57c63d650b8..21ecadfcb3e 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8c15fd337ad24b9b68049.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c8c15fd337ad24b9b68049.md @@ -1,6 +1,6 @@ --- id: 63c8c15fd337ad24b9b68049 -title: Step 60 +title: Passo 60 challengeType: 0 dashedName: step-60 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bc53735149084390e5d0.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bc53735149084390e5d0.md index c5beb8876e8..2d6e7003eee 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bc53735149084390e5d0.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bc53735149084390e5d0.md @@ -1,6 +1,6 @@ --- id: 63c9bc53735149084390e5d0 -title: Step 61 +title: Passo 61 challengeType: 0 dashedName: step-61 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bcc26219e7090da0f549.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bcc26219e7090da0f549.md index 8857c49a4af..681b1b7ac4a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bcc26219e7090da0f549.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bcc26219e7090da0f549.md @@ -1,6 +1,6 @@ --- id: 63c9bcc26219e7090da0f549 -title: Step 62 +title: Passo 62 challengeType: 0 dashedName: step-62 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bce376ca4f09c15a3768.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bce376ca4f09c15a3768.md index 9e327dd56a4..a43f4c1d35e 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bce376ca4f09c15a3768.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bce376ca4f09c15a3768.md @@ -1,6 +1,6 @@ --- id: 63c9bce376ca4f09c15a3768 -title: Step 63 +title: Passo 63 challengeType: 0 dashedName: step-63 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bdd916e0c10af01ed8d7.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bdd916e0c10af01ed8d7.md index ba37342ef6c..404a90e03de 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bdd916e0c10af01ed8d7.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bdd916e0c10af01ed8d7.md @@ -1,6 +1,6 @@ --- id: 63c9bdd916e0c10af01ed8d7 -title: Step 64 +title: Passo 64 challengeType: 0 dashedName: step-64 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9be334f4a050c0b94bc93.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9be334f4a050c0b94bc93.md index 2a4f6d26012..6c88f97a15b 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9be334f4a050c0b94bc93.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9be334f4a050c0b94bc93.md @@ -1,6 +1,6 @@ --- id: 63c9be334f4a050c0b94bc93 -title: Step 65 +title: Passo 65 challengeType: 0 dashedName: step-65 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bef7fec05c0d38853828.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bef7fec05c0d38853828.md index 13d558d532c..0a6708f076f 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bef7fec05c0d38853828.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bef7fec05c0d38853828.md @@ -1,6 +1,6 @@ --- id: 63c9bef7fec05c0d38853828 -title: Step 66 +title: Passo 66 challengeType: 0 dashedName: step-66 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bf80558d780e848b2987.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bf80558d780e848b2987.md index 4e4da977f9e..677923e668d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bf80558d780e848b2987.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9bf80558d780e848b2987.md @@ -1,6 +1,6 @@ --- id: 63c9bf80558d780e848b2987 -title: Step 67 +title: Passo 67 challengeType: 0 dashedName: step-67 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c09a7daa4f0ff92c4023.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c09a7daa4f0ff92c4023.md index 84fd6422b00..8780a4c226e 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c09a7daa4f0ff92c4023.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c09a7daa4f0ff92c4023.md @@ -1,6 +1,6 @@ --- id: 63c9c09a7daa4f0ff92c4023 -title: Step 68 +title: Passo 68 challengeType: 0 dashedName: step-68 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c0d0857f0a10a57af936.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c0d0857f0a10a57af936.md index 8868dc1350c..e38faa9b9ca 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c0d0857f0a10a57af936.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c0d0857f0a10a57af936.md @@ -1,6 +1,6 @@ --- id: 63c9c0d0857f0a10a57af936 -title: Step 69 +title: Passo 69 challengeType: 0 dashedName: step-69 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c11a0a090311dff55564.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c11a0a090311dff55564.md index dd2be81cbc5..5592f40f62d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c11a0a090311dff55564.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c11a0a090311dff55564.md @@ -1,6 +1,6 @@ --- id: 63c9c11a0a090311dff55564 -title: Step 70 +title: Passo 70 challengeType: 0 dashedName: step-70 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c16dd75dd212dc12363c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c16dd75dd212dc12363c.md index 779bb1a2aed..15034b94cf8 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c16dd75dd212dc12363c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c16dd75dd212dc12363c.md @@ -1,6 +1,6 @@ --- id: 63c9c16dd75dd212dc12363c -title: Step 71 +title: Passo 71 challengeType: 0 dashedName: step-71 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c1ef134f3513e751c975.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c1ef134f3513e751c975.md index 4bd18bc353f..64afe885be9 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c1ef134f3513e751c975.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9c1ef134f3513e751c975.md @@ -1,6 +1,6 @@ --- id: 63c9c1ef134f3513e751c975 -title: Step 72 +title: Passo 72 challengeType: 0 dashedName: step-72 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e3a83bb3e61a80eea564.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e3a83bb3e61a80eea564.md index 3df7e192a70..a0146d735c2 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e3a83bb3e61a80eea564.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e3a83bb3e61a80eea564.md @@ -1,6 +1,6 @@ --- id: 63c9e3a83bb3e61a80eea564 -title: Step 73 +title: Passo 73 challengeType: 0 dashedName: step-73 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e45519caf31b987fbb5f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e45519caf31b987fbb5f.md index c49004bbebb..27a72eceec2 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e45519caf31b987fbb5f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e45519caf31b987fbb5f.md @@ -1,6 +1,6 @@ --- id: 63c9e45519caf31b987fbb5f -title: Step 74 +title: Passo 74 challengeType: 0 dashedName: step-74 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e4d2ff41811dd640504f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e4d2ff41811dd640504f.md index 4f917ca49a0..1e310ccf781 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e4d2ff41811dd640504f.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e4d2ff41811dd640504f.md @@ -1,6 +1,6 @@ --- id: 63c9e4d2ff41811dd640504f -title: Step 75 +title: Passo 75 challengeType: 0 dashedName: step-75 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e51b3a007a1eba1cd0f6.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e51b3a007a1eba1cd0f6.md index 81b19870fd2..77084fe4f93 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e51b3a007a1eba1cd0f6.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e51b3a007a1eba1cd0f6.md @@ -1,6 +1,6 @@ --- id: 63c9e51b3a007a1eba1cd0f6 -title: Step 76 +title: Passo 76 challengeType: 0 dashedName: step-76 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e55b4b06c11fff555c64.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e55b4b06c11fff555c64.md index bc911d3b831..fafa6895351 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e55b4b06c11fff555c64.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e55b4b06c11fff555c64.md @@ -1,6 +1,6 @@ --- id: 63c9e55b4b06c11fff555c64 -title: Step 77 +title: Passo 77 challengeType: 0 dashedName: step-77 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e5eea8261d22856ead1c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e5eea8261d22856ead1c.md index 01ebba201d2..7c2d7b4fe30 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e5eea8261d22856ead1c.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e5eea8261d22856ead1c.md @@ -1,6 +1,6 @@ --- id: 63c9e5eea8261d22856ead1c -title: Step 78 +title: Passo 78 challengeType: 0 dashedName: step-78 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e63bb1e32d23b6adbe44.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e63bb1e32d23b6adbe44.md index 5711b833a42..97229c781c8 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e63bb1e32d23b6adbe44.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e63bb1e32d23b6adbe44.md @@ -1,6 +1,6 @@ --- id: 63c9e63bb1e32d23b6adbe44 -title: Step 79 +title: Passo 79 challengeType: 0 dashedName: step-79 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e6b7c0303524af2d0bc2.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e6b7c0303524af2d0bc2.md index ee4568c97d6..e2a1355507e 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e6b7c0303524af2d0bc2.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e6b7c0303524af2d0bc2.md @@ -1,6 +1,6 @@ --- id: 63c9e6b7c0303524af2d0bc2 -title: Step 80 +title: Passo 80 challengeType: 0 dashedName: step-80 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e769df38c92635c158ba.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e769df38c92635c158ba.md index cec54f93795..6e97cc99a4d 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e769df38c92635c158ba.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e769df38c92635c158ba.md @@ -1,6 +1,6 @@ --- id: 63c9e769df38c92635c158ba -title: Step 81 +title: Passo 81 challengeType: 0 dashedName: step-81 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e7d5b21eee2776ecc226.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e7d5b21eee2776ecc226.md index d341d5e62bf..c86894e1a85 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e7d5b21eee2776ecc226.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e7d5b21eee2776ecc226.md @@ -1,6 +1,6 @@ --- id: 63c9e7d5b21eee2776ecc226 -title: Step 82 +title: Passo 82 challengeType: 0 dashedName: step-82 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e84c9fe8ca28c4101189.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e84c9fe8ca28c4101189.md index ba1da012290..95cde17645a 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e84c9fe8ca28c4101189.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e84c9fe8ca28c4101189.md @@ -1,6 +1,6 @@ --- id: 63c9e84c9fe8ca28c4101189 -title: Step 83 +title: Passo 83 challengeType: 0 dashedName: step-83 --- diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e8fe3a6f022a05a04675.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e8fe3a6f022a05a04675.md index 6b28d6282ad..5a9c55da81e 100644 --- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e8fe3a6f022a05a04675.md +++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-form-validation-by-building-a-calorie-counter/63c9e8fe3a6f022a05a04675.md @@ -1,6 +1,6 @@ --- id: 63c9e8fe3a6f022a05a04675 -title: Step 84 +title: Passo 84 challengeType: 0 dashedName: step-84 --- @@ -25,7 +25,7 @@ const htmlString = code.split(/output\s*\.\s*innerHTML\s*=\s*/)[1].split(/`/)[1] assert.match(htmlString, /\n\s*

15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. +215 = 32768. A soma destes algarismos é 3 + 2 + 7 + 6 + 8 = 26. -What is the sum of the digits of the number 2exponent? +Qual é a soma dos algarismos do número 2exponent? # --hints-- -`powerDigitSum(15)` should return a number. +`powerDigitSum(15)` deve retornar um número. ```js assert(typeof powerDigitSum(15) === 'number'); ``` -`powerDigitSum(15)` should return 26. +`powerDigitSum(15)` deve retornar 26. ```js assert.strictEqual(powerDigitSum(15), 26); ``` -`powerDigitSum(128)` should return 166. +`powerDigitSum(128)` deve retornar 166. ```js assert.strictEqual(powerDigitSum(128), 166); ``` -`powerDigitSum(1000)` should return 1366. +`powerDigitSum(1000)` deve retornar 1366. ```js assert.strictEqual(powerDigitSum(1000), 1366); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-17-number-letter-counts.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-17-number-letter-counts.md index c64e9f073f6..d82e99fc70b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-17-number-letter-counts.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-17-number-letter-counts.md @@ -1,6 +1,6 @@ --- id: 5900f37d1000cf542c50fe90 -title: 'Problem 17: Number letter counts' +title: 'Problema 17: Contador de letras' challengeType: 1 forumTopicId: 301804 dashedName: problem-17-number-letter-counts @@ -8,33 +8,33 @@ dashedName: problem-17-number-letter-counts # --description-- -If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total. +Considere os números de 1 a 5 escritos em palavras em inglês: one, two, three, four, five. Se você somar a quantidade de letras, terá 3 + 3 + 5 + 4 + 4 = 19. -If all the numbers from 1 to given `limit` inclusive were written out in words, how many letters would be used? +Se todos os números entre 1 e o parâmetro `limit` (inclusive) fossem escritos em palavras, quantas letras seriam usadas? -**Note:** Do not count spaces or hyphens. For example, 342 (three hundred and forty-two) contains 23 letters and 115 (one hundred and fifteen) contains 20 letters. The use of "and" when writing out numbers is in compliance with British usage. +**Observação:** não conte espaços ou hífens. Por exemplo, 342 (three hundred and forty-two) contém 23 letras e 115 (one hundred and fifteen) contém 12 letras. O uso de "and" ao escrever números está em conformidade com a utilização britânica. Lembre-se de que o teste considera apenas números escritos em inglês. # --hints-- -`numberLetterCounts(5)` should return a number. +`numberLetterCounts(5)` deve retornar um número. ```js assert(typeof numberLetterCounts(5) === 'number'); ``` -`numberLetterCounts(5)` should return 19. +`numberLetterCounts(5)` deve retornar 19. ```js assert.strictEqual(numberLetterCounts(5), 19); ``` -`numberLetterCounts(150)` should return 1903. +`numberLetterCounts(150)` deve retornar 1903. ```js assert.strictEqual(numberLetterCounts(150), 1903); ``` -`numberLetterCounts(1000)` should return 21124. +`numberLetterCounts(1000)` deve retornar 21124. ```js assert.strictEqual(numberLetterCounts(1000), 21124); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-19-counting-sundays.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-19-counting-sundays.md index 5a3e24cc431..90a696ce34c 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-19-counting-sundays.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-19-counting-sundays.md @@ -1,6 +1,6 @@ --- id: 5900f37f1000cf542c50fe92 -title: 'Problem 19: Counting Sundays' +title: 'Problema 19: Contando domingos' challengeType: 1 forumTopicId: 301827 dashedName: problem-19-counting-sundays @@ -8,37 +8,37 @@ dashedName: problem-19-counting-sundays # --description-- -You are given the following information, but you may prefer to do some research for yourself. +Você recebeu as seguintes informações, mas se preferir, pode pesquisar por si mesmo.

-How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)? +Quantos domingos caíram no primeiro dia do mês durante o século 20 (1 de janeiro de 1901 a 31 de dezembro de 2000)? # --hints-- -`countingSundays(1943, 1946)` should return a number. +`countingSundays(1943, 1946)` deve retornar um número. ```js assert(typeof countingSundays(1943, 1946) === 'number'); ``` -`countingSundays(1943, 1946)` should return 6. +`countingSundays(1943, 1946)` deve retornar 6. ```js assert.strictEqual(countingSundays(1943, 1946), 6); ``` -`countingSundays(1995, 2000)` should return 10. +`countingSundays(1995, 2000)` deve retornar 10. ```js assert.strictEqual(countingSundays(1995, 2000), 10); ``` -`countingSundays(1901, 2000)` should return 171. +`countingSundays(1901, 2000)` deve retornar 171. ```js assert.strictEqual(countingSundays(1901, 2000), 171); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-20-factorial-digit-sum.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-20-factorial-digit-sum.md index a109ff5f9b2..05a57f68a44 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-20-factorial-digit-sum.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-20-factorial-digit-sum.md @@ -1,6 +1,6 @@ --- id: 5900f3801000cf542c50fe93 -title: 'Problem 20: Factorial digit sum' +title: 'Problema 20: Soma dos algarismos de um fatorial' challengeType: 1 forumTopicId: 301839 dashedName: problem-20-factorial-digit-sum @@ -8,46 +8,46 @@ dashedName: problem-20-factorial-digit-sum # --description-- -`n`! means `n` × (`n` − 1) × ... × 3 × 2 × 1 +`n`! significa `n` × (`n` - 1) × ... × 3 × 2 × 1 -For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800, -and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27. +Por exemplo: 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800. +A soma dos algarismos no número 10! é 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27. -Find the sum of the digits `n`! +Encontre a soma dos algarismos de `n`! # --hints-- -`sumFactorialDigits(10)` should return a number. +`sumFactorialDigits(10)` deve retornar um número. ```js assert(typeof sumFactorialDigits(10) === 'number'); ``` -`sumFactorialDigits(10)` should return 27. +`sumFactorialDigits(10)` deve retornar 27. ```js assert.strictEqual(sumFactorialDigits(10), 27); ``` -`sumFactorialDigits(25)` should return 72. +`sumFactorialDigits(25)` deve retornar 72. ```js assert.strictEqual(sumFactorialDigits(25), 72); ``` -`sumFactorialDigits(50)` should return 216. +`sumFactorialDigits(50)` deve retornar 216. ```js assert.strictEqual(sumFactorialDigits(50), 216); ``` -`sumFactorialDigits(75)` should return 432. +`sumFactorialDigits(75)` deve retornar 432. ```js assert.strictEqual(sumFactorialDigits(75), 432); ``` -`sumFactorialDigits(100)` should return 648. +`sumFactorialDigits(100)` deve retornar 648. ```js assert.strictEqual(sumFactorialDigits(100), 648); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-21-amicable-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-21-amicable-numbers.md index df19c7d7c20..5c4d9bf65b5 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-21-amicable-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-21-amicable-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f3811000cf542c50fe94 -title: 'Problem 21: Amicable numbers' +title: 'Problema 21: Números amigos' challengeType: 1 forumTopicId: 301851 dashedName: problem-21-amicable-numbers @@ -8,41 +8,41 @@ dashedName: problem-21-amicable-numbers # --description-- -Let d(`n`) be defined as the sum of proper divisors of `n` (numbers less than `n` which divide evenly into `n`). +Considere d(`n`) sendo igual à soma dos divisores próprios de `n` (divisores próprios de um número positivo `n` são todos os divisores inteiros positivos exceto o próprio `n`). -If d(`a`) = `b` and d(`b`) = `a`, where `a` ≠ `b`, then `a` and `b` are an amicable pair and each of `a` and `b` are called amicable numbers. +Se d(`a`) = `b` e d(`b`) = `a`, onde `a` ≠ `b`, então, `a` e `b` são um par amigável e tanto `a` quanto `b` são chamados de números amigos. -For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220. +Por exemplo, os divisores próprios de 220 são 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 e 110. Portanto, d(220) = 284. Os divisores próprios de 284 são 1, 2, 4, 71 e 142. Então d(284) = 220. -Evaluate the sum of all the amicable numbers under `n`. +Calcule a soma de todos os números amigos abaixo de `n`. # --hints-- -`sumAmicableNum(1000)` should return a number. +`sumAmicableNum(1000)` deve retornar um número. ```js assert(typeof sumAmicableNum(1000) === 'number'); ``` -`sumAmicableNum(1000)` should return 504. +`sumAmicableNum(1000)` deve retornar 504. ```js assert.strictEqual(sumAmicableNum(1000), 504); ``` -`sumAmicableNum(2000)` should return 2898. +`sumAmicableNum(2000)` deve retornar 2898. ```js assert.strictEqual(sumAmicableNum(2000), 2898); ``` -`sumAmicableNum(5000)` should return 8442. +`sumAmicableNum(5000)` deve retornar 8442. ```js assert.strictEqual(sumAmicableNum(5000), 8442); ``` -`sumAmicableNum(10000)` should return 31626. +`sumAmicableNum(10000)` deve retornar 31626. ```js assert.strictEqual(sumAmicableNum(10000), 31626); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-22-names-scores.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-22-names-scores.md index 4c8df4383a7..30374f07b1a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-22-names-scores.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-22-names-scores.md @@ -1,6 +1,6 @@ --- id: 5a51eabcad78bf416f316e2a -title: 'Problem 22: Names scores' +title: 'Problema 22: Pontuações de nomes' challengeType: 1 forumTopicId: 301862 dashedName: problem-22-names-scores @@ -8,33 +8,33 @@ dashedName: problem-22-names-scores # --description-- -Using `names`, an array defined in the background containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score. +Usando `names`, um array em segundo plano contendo mais de 5 mil nomes, a primeira coisa que você precisa fazer é ordenar estes nomes alfabeticamente. Em seguida, descubra a posição de cada letra do nome e some todas as posições. Após calcular a soma, multiplique este valor pela posição do nome dentro do array de nomes. -For example, when the list is sorted into alphabetical order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So, COLIN would obtain a score of 938 × 53 = 49714. +Por exemplo, após ordenar a lista alfabeticamente, o nome COLIN, cujas letras valem 3 + 15 + 12 + 9 + 14 = 53, é o 938º nome na lista. Portanto, o nome COLIN obteria a pontuação de 938 × 53 = 49714. -What is the total of all the name scores in the array? +Qual é o total de todas as pontuações no array de nomes? # --hints-- -`namesScores(test1)` should return a number. +`namesScores(test1)` deve retornar um número. ```js assert(typeof namesScores(test1) === 'number'); ``` -`namesScores(test1)` should return 791. +`namesScores(test1)` deve retornar 791. ```js assert.strictEqual(namesScores(test1), 791); ``` -`namesScores(test2)` should return 1468. +`namesScores(test2)` deve retornar 1468. ```js assert.strictEqual(namesScores(test2), 1468); ``` -`namesScores(names)` should return 871198282. +`namesScores(names)` deve retornar 871198282. ```js assert.strictEqual(namesScores(names), 871198282); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-24-lexicographic-permutations.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-24-lexicographic-permutations.md index 91572e2dd40..90c859feb9f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-24-lexicographic-permutations.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-24-lexicographic-permutations.md @@ -1,6 +1,6 @@ --- id: 5900f3841000cf542c50fe97 -title: 'Problem 24: Lexicographic permutations' +title: 'Problema 24: Permutações lexicográficas' challengeType: 1 forumTopicId: 301885 dashedName: problem-24-lexicographic-permutations @@ -8,39 +8,39 @@ dashedName: problem-24-lexicographic-permutations # --description-- -A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are: +Uma permutação consiste em elementos que podem formar agrupamentos que se diferenciam apenas pela ordem. Por exemplo, 3124 é uma possível permutação dos algarismos 1, 2, 3 e 4. Se todas as permutações estiverem listadas numericamente ou em ordem alfabética, chamamos isso de ordem lexicográfica. As permutações lexicográficas de 0, 1 e 2 são:
012   021   102   120   201   210
-What is the `n`th lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9? +Qual é a `n`-ésima permutação lexicográfica dos algarismos 0, 1, 2, 3, 4, 5, 6, 7, 8 e 9? # --hints-- -`lexicographicPermutations(699999)` should return a number. +`lexicographicPermutations(699999)` deve retornar um número. ```js assert(typeof lexicographicPermutations(699999) === 'number'); ``` -`lexicographicPermutations(699999)` should return 1938246570. +`lexicographicPermutations(699999)` deve retornar 1938246570. ```js assert(lexicographicPermutations(699999) == 1938246570); ``` -`lexicographicPermutations(899999)` should return 2536987410. +`lexicographicPermutations(899999)` deve retornar 2536987410. ```js assert(lexicographicPermutations(899999) == 2536987410); ``` -`lexicographicPermutations(900000)` should return 2537014689. +`lexicographicPermutations(900000)` deve retornar 2537014689. ```js assert(lexicographicPermutations(900000) == 2537014689); ``` -`lexicographicPermutations(999999)` should return 2783915460. +`lexicographicPermutations(999999)` deve retornar 2783915460. ```js assert(lexicographicPermutations(999999) == 2783915460); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-25-1000-digit-fibonacci-number.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-25-1000-digit-fibonacci-number.md index 25d18d786ef..ad3a3b17791 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-25-1000-digit-fibonacci-number.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-25-1000-digit-fibonacci-number.md @@ -1,6 +1,6 @@ --- id: 5900f3851000cf542c50fe98 -title: 'Problem 25: 1000-digit Fibonacci number' +title: 'Problema 25: Número de Fibonacci de 1000 algarismos' challengeType: 1 forumTopicId: 301897 dashedName: problem-25-1000-digit-fibonacci-number @@ -8,45 +8,45 @@ dashedName: problem-25-1000-digit-fibonacci-number # --description-- -The Fibonacci sequence is defined by the recurrence relation: +A sequência de Fibonacci é definida pela relação de recorrência: -
Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
+
Fn = Fn−1 + Fn−2, onde F1 = 1 e F2 = 1.
-Hence the first 12 terms will be: +Portanto, os primeiros 12 termos serão:
F1 = 1
F2 = 1
F3 = 2
F4 = 3
F5 = 5
F6 = 8
F7 = 13
F8 = 21
F9 = 34
F10 = 55
F11 = 89
F12 = 144
-The 12th term, F12, is the first term to contain three digits. +O 12º termo, F12, é o primeiro termo a conter três algarismos. -What is the index of the first term in the Fibonacci sequence to contain `n` digits? +Qual é o índice do primeiro termo na sequência de Fibonacci a conter `n` algarismos? # --hints-- -`digitFibonacci(5)` should return a number. +`digitFibonacci(5)` deve retornar um número. ```js assert(typeof digitFibonacci(5) === 'number'); ``` -`digitFibonacci(5)` should return 21. +`digitFibonacci(5)` deve retornar 21. ```js assert.strictEqual(digitFibonacci(5), 21); ``` -`digitFibonacci(10)` should return 45. +`digitFibonacci(10)` deve retornar 45. ```js assert.strictEqual(digitFibonacci(10), 45); ``` -`digitFibonacci(15)` should return 69. +`digitFibonacci(15)` deve retornar 69. ```js assert.strictEqual(digitFibonacci(15), 69); ``` -`digitFibonacci(20)` should return 93. +`digitFibonacci(20)` deve retornar 93. ```js assert.strictEqual(digitFibonacci(20), 93); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-26-reciprocal-cycles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-26-reciprocal-cycles.md index 580ba5807a3..2281f431bdc 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-26-reciprocal-cycles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-26-reciprocal-cycles.md @@ -1,6 +1,6 @@ --- id: 5900f3861000cf542c50fe99 -title: 'Problem 26: Reciprocal cycles' +title: 'Problema 26: Dízimas periódicas' challengeType: 1 forumTopicId: 301908 dashedName: problem-26-reciprocal-cycles @@ -8,41 +8,41 @@ dashedName: problem-26-reciprocal-cycles # --description-- -A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given: +Em uma fração unitária, o numerador é 1. A representação decimal das frações unitárias com denominadores de 2 a 10 é a seguinte:
1/2 = 0.5
1/3 = 0.(3)
1/4 = 0.25
1/5 = 0.2
1/6 = 0.1(6)
1/7 = 0.(142857)
1/8 = 0.125
1/9 = 0.(1)
1/10 = 0.1
-Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle. +A expressão 0.1(6) significa 0.16666666... e tem um ciclo recorrente (que se repete) de 1 algarismo. Podemos notar que 1/7 tem um ciclo recorrente de 6 algarismos. -Find the value of `d` < `n` for which 1/d contains the longest recurring cycle in its decimal fraction part. +Calcule o valor de `d` < `n` onde 1/d contém o ciclo recorrente mais longo na parte decimal. # --hints-- -`reciprocalCycles(700)` should return a number. +`reciprocalCycles(700)` deve retornar um número. ```js assert(typeof reciprocalCycles(700) === 'number'); ``` -`reciprocalCycles(700)` should return 659. +`reciprocalCycles(700)` deve retornar 659. ```js assert(reciprocalCycles(700) == 659); ``` -`reciprocalCycles(800)` should return 743. +`reciprocalCycles(800)` deve retornar 743. ```js assert(reciprocalCycles(800) == 743); ``` -`reciprocalCycles(900)` should return 887. +`reciprocalCycles(900)` deve retornar 887. ```js assert(reciprocalCycles(900) == 887); ``` -`reciprocalCycles(1000)` should return 983. +`reciprocalCycles(1000)` deve retornar 983. ```js assert(reciprocalCycles(1000) == 983); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-29-distinct-powers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-29-distinct-powers.md index 4b8f00162ee..8ce9820e450 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-29-distinct-powers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-29-distinct-powers.md @@ -1,6 +1,6 @@ --- id: 5900f3891000cf542c50fe9c -title: 'Problem 29: Distinct powers' +title: 'Problema 29: Potências distintas' challengeType: 1 forumTopicId: 301941 dashedName: problem-29-distinct-powers @@ -8,7 +8,7 @@ dashedName: problem-29-distinct-powers # --description-- -Consider all integer combinations of $a^b$ for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5: +Considere todas as combinações de números inteiros de $a^b$ para 2 ≤ a ≤ 5 e 2 ≤ b ≤ 5:
22=4, 23=8, 24=16, 25=32
@@ -17,41 +17,41 @@ Consider all integer combinations of $a^b$ for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5: 52=25, 53=125, 54=625, 55=3125
-If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms: +Se eles forem colocados em ordem numérica, com quaisquer repetições removidas, obtemos a seguinte sequência de 15 termos distintos:
4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
-How many distinct terms are in the sequence generated by $a^b$ for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`? +Quantos termos distintos estão na sequência gerada por $a^b$ para 2 ≤ `a` ≤ `n` e 2 ≤ `b` ≤ `n`? # --hints-- -`distinctPowers(15)` should return a number. +`distinctPowers(15)` deve retornar um número. ```js assert(typeof distinctPowers(15) === 'number'); ``` -`distinctPowers(15)` should return 177. +`distinctPowers(15)` deve retornar 177. ```js assert.strictEqual(distinctPowers(15), 177); ``` -`distinctPowers(20)` should return 324. +`distinctPowers(20)` deve retornar 324. ```js assert.strictEqual(distinctPowers(20), 324); ``` -`distinctPowers(25)` should return 519. +`distinctPowers(25)` deve retornar 519. ```js assert.strictEqual(distinctPowers(25), 519); ``` -`distinctPowers(30)` should return 755. +`distinctPowers(30)` deve retornar 755. ```js assert.strictEqual(distinctPowers(30), 755); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-31-coin-sums.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-31-coin-sums.md index ae4372cd69f..4394380bf68 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-31-coin-sums.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-31-coin-sums.md @@ -1,6 +1,6 @@ --- id: 5900f38b1000cf542c50fe9e -title: 'Problem 31: Coin sums' +title: 'Problema 31: Soma de moedas' challengeType: 1 forumTopicId: 301965 dashedName: problem-31-coin-sums @@ -8,43 +8,43 @@ dashedName: problem-31-coin-sums # --description-- -In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation: +Na Inglaterra, a moeda é composta pela libra (£) e pelos pence. No geral, há oito valores em circulação: -
1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).
+
1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) e £2 (200p).
-It is possible to make £2 in the following way: +É possível fazer £2 da seguinte maneira:
1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p
-How many different ways can `n` pence be made using any number of coins? +De quantas maneiras `n` pence podem ser feitos utilizando os valores mencionados? # --hints-- -`coinSums(50)` should return a number. +`coinSums(50)` deve retornar um número. ```js assert(typeof coinSums(50) === 'number'); ``` -`coinSums(50)` should return 451. +`coinSums(50)` deve retornar 451. ```js assert(coinSums(50) == 451); ``` -`coinSums(100)` should return 4563. +`coinSums(100)` deve retornar 4563. ```js assert(coinSums(100) == 4563); ``` -`coinSums(150)` should return 21873. +`coinSums(150)` deve retornar 21873. ```js assert(coinSums(150) == 21873); ``` -`coinSums(200)` should return 73682. +`coinSums(200)` deve retornar 73682. ```js assert(coinSums(200) == 73682); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-32-pandigital-products.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-32-pandigital-products.md index 5fe7d0495c5..48790ed7e5a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-32-pandigital-products.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-32-pandigital-products.md @@ -1,6 +1,6 @@ --- id: 5900f38c1000cf542c50fe9f -title: 'Problem 32: Pandigital products' +title: 'Problema 32: Produtos pandigitais' challengeType: 1 forumTopicId: 301976 dashedName: problem-32-pandigital-products @@ -8,47 +8,47 @@ dashedName: problem-32-pandigital-products # --description-- -We shall say that an `n`-digit number is pandigital if it makes use of all the digits 1 to `n` exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital. +Dizemos que um número de `n` algarismos é pandigital se ele usar todos os algarismos de 1 a `n` uma única vez. Por exemplo, o número 15234 é pandigital pois possui 5 algarismos e utiliza todos os algarismos entre 1 e 5. -The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital. +Considere o produto 39 x 186 = 7254. O multiplicando (39), multiplicador (186) e o produto (7254) possuem, no total, nove algarismos e nenhum deles se repete. -Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through `n` pandigital. +Calcule a soma de todos os produtos cujo multiplicando, multiplicador e produto formam um número pandigital (entre 1 e `n`). -**Hint:** Some products can be obtained in more than one way so be sure to only include it once in your sum. +**Dica:** alguns produtos podem ser obtidos de mais de uma forma. Portanto, certifique-se de incluí-lo apenas uma vez na sua soma. # --hints-- -`pandigitalProducts(4)` should return a number. +`pandigitalProducts(4)` deve retornar um número. ```js assert(typeof pandigitalProducts(4) === 'number'); ``` -`pandigitalProducts(4)` should return `12`. +`pandigitalProducts(4)` deve retornar `12`. ```js assert.strictEqual(pandigitalProducts(4), 12); ``` -`pandigitalProducts(6)` should return `162`. +`pandigitalProducts(6)` deve retornar `162`. ```js assert.strictEqual(pandigitalProducts(6), 162); ``` -`pandigitalProducts(7)` should return `0`. +`pandigitalProducts(7)` deve retornar `0`. ```js assert.strictEqual(pandigitalProducts(7), 0); ``` -`pandigitalProducts(8)` should return `13458`. +`pandigitalProducts(8)` deve retornar `13458`. ```js assert.strictEqual(pandigitalProducts(8), 13458); ``` -`pandigitalProducts(9)` should return `45228`. +`pandigitalProducts(9)` deve retornar `45228`. ```js assert.strictEqual(pandigitalProducts(9), 45228); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-33-digit-cancelling-fractions.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-33-digit-cancelling-fractions.md index 5419f2f8270..f2b1b38bc19 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-33-digit-cancelling-fractions.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-33-digit-cancelling-fractions.md @@ -1,6 +1,6 @@ --- id: 5900f38d1000cf542c50fea0 -title: 'Problem 33: Digit cancelling fractions' +title: 'Problema 33: Frações com cancelamento de algarismos' challengeType: 1 forumTopicId: 301987 dashedName: problem-33-digit-cancelling-fractions @@ -8,23 +8,23 @@ dashedName: problem-33-digit-cancelling-fractions # --description-- -The fraction 49/98 is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that 49/98 = 4/8, which is correct, is obtained by cancelling the 9s. +A fração 49/98 é uma fração curiosa, já que um matemático inexperiente, na tentativa de simplificá-la, pode acreditar, erroneamente, que 49/98 = 4/8 pelo cancelamento dos algarismos 9. Embora o resultado esteja correto, o raciocínio não está. -We shall consider fractions like, 30/50 = 3/5, to be trivial examples. +Devemos considerar frações como, por exemplo, 30/50 = 3/5, como exemplos triviais. -There are exactly four non-trivial examples of this type of fraction, less than one in value, and containing two digits in the numerator and denominator. +Existem exatamente quatro exemplos não triviais desse tipo de fração, com resultado inferior a 1 e que contêm dois algarismos no numerador e no denominador. -If the product of these four fractions is given in its lowest common terms, find the value of the denominator. +Se o produto dessas quatro frações é dado por seus mínimos divisores comuns, encontre o valor do denominador. # --hints-- -`digitCancellingFractions()` should return a number. +`digitCancellingFractions()` deve retornar um número. ```js assert(typeof digitCancellingFractions() === 'number'); ``` -`digitCancellingFractions()` should return 100. +`digitCancellingFractions()` deve retornar 100. ```js assert.strictEqual(digitCancellingFractions(), 100); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-34-digit-factorials.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-34-digit-factorials.md index 2eb87f93ba1..50bf9104859 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-34-digit-factorials.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-34-digit-factorials.md @@ -1,6 +1,6 @@ --- id: 5900f38e1000cf542c50fea1 -title: 'Problem 34: Digit factorials' +title: 'Problema 34: Algarismos dos fatoriais' challengeType: 1 forumTopicId: 301998 dashedName: problem-34-digit-factorials @@ -8,21 +8,21 @@ dashedName: problem-34-digit-factorials # --description-- -145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145. +145 é um número curioso, pois 1! + 4! + 5! = 1 + 24 + 120 = 145. -Find the numbers and the sum of the numbers which are equal to the sum of the factorial of their digits. +Calcule os números e a soma dos números que são iguais à soma do fatorial de seus algarismos. -**Note:** as 1! = 1 and 2! = 2 are not sums they are not included. +**Observação:** como 1! = 1 e 2! = 2 não são somas, eles não estão incluídos. # --hints-- -`digitFactorial()` should return an object. +`digitFactorial()` deve retornar um objeto. ```js assert.typeOf(digitFactorial(), 'object'); ``` -`digitFactorial()` should return { sum: 40730, numbers: [145, 40585] }. +`digitFactorial()` deve retornar { sum: 40730, numbers: [145, 40585] }. ```js assert.deepEqual(digitFactorial(), { sum: 40730, numbers: [145, 40585] }); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-36-double-base-palindromes.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-36-double-base-palindromes.md index 9793d760c20..05d029842f2 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-36-double-base-palindromes.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-36-double-base-palindromes.md @@ -1,6 +1,6 @@ --- id: 5900f3901000cf542c50fea3 -title: 'Problem 36: Double-base palindromes' +title: 'Problema 36: Palíndromos de base dupla' challengeType: 1 forumTopicId: 302020 dashedName: problem-36-double-base-palindromes @@ -8,39 +8,39 @@ dashedName: problem-36-double-base-palindromes # --description-- -The decimal number, 585 = 10010010012 (binary), is palindromic in both bases. +O número decimal, 585 = 10010012 (binário), é um palíndromo em ambas as bases. -Find the sum of all numbers, less than `n`, whereas 1000 ≤ `n` ≤ 1000000, which are palindromic in base 10 and base 2. +Calcule a soma de todos os números, menores que `n`, onde 1000 ≤ `n` ≤ 1000000, que são palíndromos na base 10 e base 2. -(Please note that the palindromic number, in either base, may not include leading zeros.) +(Note que um número palindrômico, em qualquer base, pode não começar com números zero.) # --hints-- -`doubleBasePalindromes(1000)` should return a number. +`doubleBasePalindromes(1000)` deve retornar um número. ```js assert(typeof doubleBasePalindromes(1000) === 'number'); ``` -`doubleBasePalindromes(1000)` should return 1772. +`doubleBasePalindromes(1000)` deve retornar 1772. ```js assert(doubleBasePalindromes(1000) == 1772); ``` -`doubleBasePalindromes(50000)` should return 105795. +`doubleBasePalindromes(50000)` deve retornar 105795. ```js assert(doubleBasePalindromes(50000) == 105795); ``` -`doubleBasePalindromes(500000)` should return 286602. +`doubleBasePalindromes(500000)` deve retornar 286602. ```js assert(doubleBasePalindromes(500000) == 286602); ``` -`doubleBasePalindromes(1000000)` should return 872187. +`doubleBasePalindromes(1000000)` deve retornar 872187. ```js assert(doubleBasePalindromes(1000000) == 872187); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-37-truncatable-primes.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-37-truncatable-primes.md index 5d4c80d5252..6352940b87b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-37-truncatable-primes.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-37-truncatable-primes.md @@ -1,6 +1,6 @@ --- id: 5900f3911000cf542c50fea4 -title: 'Problem 37: Truncatable primes' +title: 'Problema 37: Números primos truncáveis' challengeType: 1 forumTopicId: 302031 dashedName: problem-37-truncatable-primes @@ -8,39 +8,39 @@ dashedName: problem-37-truncatable-primes # --description-- -The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797, 379, 37, and 3. +O número 3797 tem uma propriedade interessante. Além de ser um número primo, se você remover 1 algarismo da esquerda para a direita, o resultado ainda assim é um número primo: 3797, 797, 97 e 7. Também podemos remover da direita para a esquerda: 3797, 379, 37 e 3. -Find the sum of the only `n` (8 ≤ `n` ≤ 11) primes that are both truncatable from left to right and right to left. +Calcule a soma dos números primos `n` (8 ≤ `n` ≤ 11) que podem ser truncados da esquerda para a direita e vice-versa. -NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes. +Observação: 2, 3, 5 e 7 não são considerados números primos truncáveis. # --hints-- -`truncatablePrimes(8)` should return a number. +`truncatablePrimes(8)` deve retornar um número. ```js assert(typeof truncatablePrimes(8) === 'number'); ``` -`truncatablePrimes(8)` should return 1986. +`truncatablePrimes(8)` deve retornar 1986. ```js assert(truncatablePrimes(8) == 1986); ``` -`truncatablePrimes(9)` should return 5123. +`truncatablePrimes(9)` deve retornar 5123. ```js assert(truncatablePrimes(9) == 5123); ``` -`truncatablePrimes(10)` should return 8920. +`truncatablePrimes(10)` deve retornar 8920. ```js assert(truncatablePrimes(10) == 8920); ``` -`truncatablePrimes(11)` should return 748317. +`truncatablePrimes(11)` deve retornar 748317. ```js assert(truncatablePrimes(11) == 748317); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-38-pandigital-multiples.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-38-pandigital-multiples.md index a1190e84f39..daa5832a34b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-38-pandigital-multiples.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-38-pandigital-multiples.md @@ -1,6 +1,6 @@ --- id: 5900f3931000cf542c50fea5 -title: 'Problem 38: Pandigital multiples' +title: 'Problema 38: Múltiplos pandigitais' challengeType: 1 forumTopicId: 302042 dashedName: problem-38-pandigital-multiples @@ -8,33 +8,33 @@ dashedName: problem-38-pandigital-multiples # --description-- -Take the number 192 and multiply it by each of 1, 2, and 3: +Pegue o número 192 e multiplique-o por cada um entre 1, 2 e 3: $$\begin{align} 192 × 1 = 192\\\\ 192 × 2 = 384\\\\ 192 × 3 = 576\\\\ \end{align}$$ -By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 192384576 the concatenated product of 192 and (1, 2, 3). +Ao concatenar cada produto, chegamos ao total 192384576. Esse resultado possui 9 algarismos e usa todos os números de 1 a 9 pelo menos uma vez. Chamaremos 192384576 o produto concatenado de 192 e (1, 2, 3). -The same can be achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the pandigital, 918273645, which is the concatenated product of 9 and (1, 2, 3, 4, 5). +O mesmo pode ser alcançado começando por 9 e multiplicando por 1, 2, 3, 4 e 5. O resultado é o pandigital 918273645, que é o produto concatenado de 9 e (1, 2, 3, 4, 5). -What is the largest 1 to `k` pandigital `k`-digit number that can be formed as the concatenated product of an integer with (1, 2, ..., `n`) where `n` > 1? +Qual é o maior número pandigital de 1 a `k` com `k` algarismos que pode ser formado como o produto concatenado de um inteiro com (1, 2, ..., `n`) onde `n` > 1? # --hints-- -`pandigitalMultiples(8)` should return a number. +`pandigitalMultiples(8)` deve retornar um número. ```js assert(typeof pandigitalMultiples(8) === 'number'); ``` -`pandigitalMultiples(8)` should return `78156234`. +`pandigitalMultiples(8)` deve retornar `78156234`. ```js assert.strictEqual(pandigitalMultiples(8), 78156234); ``` -`pandigitalMultiples(9)` should return `932718654`. +`pandigitalMultiples(9)` deve retornar `932718654`. ```js assert.strictEqual(pandigitalMultiples(9), 932718654); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-40-champernownes-constant.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-40-champernownes-constant.md index c4386bd2d91..2613833a011 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-40-champernownes-constant.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-40-champernownes-constant.md @@ -1,6 +1,6 @@ --- id: 5900f3941000cf542c50fea7 -title: 'Problem 40: Champernowne''s constant' +title: 'Problema 40: Constante de Champernowne' challengeType: 1 forumTopicId: 302066 dashedName: problem-40-champernownes-constant @@ -8,37 +8,37 @@ dashedName: problem-40-champernownes-constant # --description-- -An irrational decimal fraction is created by concatenating the positive integers: +Uma fração decimal irracional é criada concatenando os números inteiros positivos: 0.12345678910**1**112131415161718192021... -It can be seen that the 12th digit of the fractional part is 1. +Podemos notar que o 12º algarismo da parte fracionária é 1. -If *dn* represents the *n*th digit of the fractional part, find the value of the following expression. +Se *dn* representa o *n*-ésimo algarismo da parte fracionária, encontre o valor da expressão a seguir: d1 × d10 × d100 × d1000 × d10000 × d100000 × d1000000 # --hints-- -`champernownesConstant(100)` should return a number. +`champernownesConstant(100)` deve retornar um número. ```js assert(typeof champernownesConstant(100) === 'number'); ``` -`champernownesConstant(100)` should return 5. +`champernownesConstant(100)` deve retornar 5. ```js assert.strictEqual(champernownesConstant(100), 5); ``` -`champernownesConstant(1000)` should return 15. +`champernownesConstant(1000)` deve retornar 15. ```js assert.strictEqual(champernownesConstant(1000), 15); ``` -`champernownesConstant(1000000)` should return 210. +`champernownesConstant(1000000)` deve retornar 210. ```js assert.strictEqual(champernownesConstant(1000000), 210); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-41-pandigital-prime.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-41-pandigital-prime.md index a774fa31167..82af33a4bf4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-41-pandigital-prime.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-41-pandigital-prime.md @@ -1,6 +1,6 @@ --- id: 5900f3951000cf542c50fea8 -title: 'Problem 41: Pandigital prime' +title: 'Problema 41: Número primo pandigital' challengeType: 1 forumTopicId: 302078 dashedName: problem-41-pandigital-prime @@ -8,25 +8,25 @@ dashedName: problem-41-pandigital-prime # --description-- -We shall say that an `n`-digit number is pandigital if it makes use of all the digits 1 to `n` exactly once. For example, 2143 is a 4-digit pandigital and is also prime. +Dizemos que um número de `n` algarismos é pandigital se ele usar todos os algarismos de 1 a `n` exatamente uma vez. Por exemplo, 2143 é um número pandigital de 4 algarismos e também é um número primo. -What is the largest `n`-length digit pandigital prime that exists? +Qual é o maior número primo pandigital de comprimento `n` que existe? # --hints-- -`pandigitalPrime(4)` should return a number. +`pandigitalPrime(4)` deve retornar um número. ```js assert(typeof pandigitalPrime(4) === 'number'); ``` -`pandigitalPrime(4)` should return 4231. +`pandigitalPrime(4)` deve retornar 4231. ```js assert(pandigitalPrime(4) == 4231); ``` -`pandigitalPrime(7)` should return 7652413. +`pandigitalPrime(7)` deve retornar 7652413. ```js assert(pandigitalPrime(7) == 7652413); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-42-coded-triangle-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-42-coded-triangle-numbers.md index abda6f2d137..d45085a320a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-42-coded-triangle-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-42-coded-triangle-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f3961000cf542c50fea9 -title: 'Problem 42: Coded triangle numbers' +title: 'Problema 42: Números triangulares codificados' challengeType: 1 forumTopicId: 302089 dashedName: problem-42-coded-triangle-numbers @@ -8,41 +8,41 @@ dashedName: problem-42-coded-triangle-numbers # --description-- -The `n`th term of the sequence of triangle numbers is given by, `tn` = ½`n`(`n`+1); so the first ten triangle numbers are: +O `n`-ésimo termo da sequência de números triangulares é dado por, `tn` = ½`n`(`n`+1). Os primeiros dez números triangulares são:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
-By converting each letter in a word to a number corresponding to its alphabetical position and adding these values we form a word value. For example, the word value for SKY is 19 + 11 + 25 = 55 = `t`10. If the word value is a triangle number then we shall call the word a triangle word. +Ao converter cada letra de uma palavra para o número correspondente à sua posição alfabética e somar esses valores, nós formamos o valor (numérico) da palavra. Por exemplo, o valor da palavra SKY é 19 + 11 + 25 = 55 = `t`10. Se o valor da palavra é um número triangular, então vamos chamar a palavra de uma palavra triangular. -Using words array of `n`-length, how many are triangle words? +Usando o array de palavras de comprimento `n`, quantas são palavras triangulares? # --hints-- -`codedTriangleNumbers(1400)` should return a number. +`codedTriangleNumbers(1400)` deve retornar um número. ```js assert(typeof codedTriangleNumbers(1400) === 'number'); ``` -`codedTriangleNumbers(1400)` should return 129. +`codedTriangleNumbers(1400)` deve retornar 129. ```js assert(codedTriangleNumbers(1400) == 129); ``` -`codedTriangleNumbers(1500)` should return 137. +`codedTriangleNumbers(1500)` deve retornar 137. ```js assert(codedTriangleNumbers(1500) == 137); ``` -`codedTriangleNumbers(1600)` should return 141. +`codedTriangleNumbers(1600)` deve retornar 141. ```js assert(codedTriangleNumbers(1600) == 141); ``` -`codedTriangleNumbers(1786)` should return 162. +`codedTriangleNumbers(1786)` deve retornar 162. ```js assert(codedTriangleNumbers(1786) == 162); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-43-sub-string-divisibility.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-43-sub-string-divisibility.md index 53ae7b50350..0344e197793 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-43-sub-string-divisibility.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-43-sub-string-divisibility.md @@ -1,6 +1,6 @@ --- id: 5900f3971000cf542c50feaa -title: 'Problem 43: Sub-string divisibility' +title: 'Problema 43: Divisibilidade de substrings' challengeType: 1 forumTopicId: 302100 dashedName: problem-43-sub-string-divisibility @@ -8,49 +8,49 @@ dashedName: problem-43-sub-string-divisibility # --description-- -The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property. +O número 1406357289 é um número pandigital de 0 a 9 porque é composto por cada um dos algarismos de 0 a 9, mas tem também uma propriedade de divisão de suas substrings bastante interessante. -Let $d_1$ be the $1^{st}$ digit, $d_2$ be the $2^{nd}$ digit, and so on. In this way, we note the following: +Considere que $d_1$ seja o 1º algarismo, $d_2$ seja o 2º algarismo, e assim por diante. Desta forma, podemos perceber o seguinte: -- ${d_2}{d_3}{d_4} = 406$ is divisible by 2 -- ${d_3}{d_4}{d_5} = 063$ is divisible by 3 -- ${d_4}{d_5}{d_6} = 635$ is divisible by 5 -- ${d_5}{d_6}{d_7} = 357$ is divisible by 7 -- ${d_6}{d_7}{d_8} = 572$ is divisible by 11 -- ${d_7}{d_8}{d_9} = 728$ is divisible by 13 -- ${d_8}{d_9}{d_{10}} = 289$ is divisible by 17 +- ${d_2}{d_3}{d_4} = 406$ é divisível por 2 +- ${d_3}{d_4}{d_5} = 063$ é divisível por 3 +- ${d_4}{d_5}{d_6} = 635$ é divisível por 5 +- ${d_5}{d_6}{d_7} = 357$ é divisível por 7 +- ${d_6}{d_7}{d_8} = 572$ é divisível por 11 +- ${d_7}{d_8}{d_9} = 728$ é divisível por 13 +- ${d_8}{d_9}{d_{10}} = 289$ é divisível por 17 -Find the sum of all 0 to `n` pandigital numbers with sub-strings fulfilling `n - 2` of these divisibility properties. +Calcule a soma de todos os números pandigitais de 0 a `n` com `n - 2` substrings que cumprem as propriedades de divisibilidade (2, 3, 5, 7, 11, 13 e 17). -**Note:** Pandigital numbers starting with `0` are to be considered in the result. +**Observação:** os números pandigitais que começam com `0` devem ser considerados no resultado. # --hints-- -`substringDivisibility(5)` should return a number. +`substringDivisibility(5)` deve retornar um número. ```js assert(typeof substringDivisibility(5) === 'number'); ``` -`substringDivisibility(5)` should return `12444480`. +`substringDivisibility(5)` deve retornar `12444480`. ```js assert.strictEqual(substringDivisibility(5), 12444480) ``` -`substringDivisibility(7)` should return `1099210170`. +`substringDivisibility(7)` deve retornar `1099210170`. ```js assert.strictEqual(substringDivisibility(7), 1099210170) ``` -`substringDivisibility(8)` should return `1113342912`. +`substringDivisibility(8)` deve retornar `1113342912`. ```js assert.strictEqual(substringDivisibility(8), 1113342912) ``` -`substringDivisibility(9)` should return `16695334890`. +`substringDivisibility(9)` deve retornar `16695334890`. ```js assert.strictEqual(substringDivisibility(9), 16695334890) diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-44-pentagon-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-44-pentagon-numbers.md index 44905c1be79..54e09e5880c 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-44-pentagon-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-44-pentagon-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f3981000cf542c50feab -title: 'Problem 44: Pentagon numbers' +title: 'Problema 44: Números pentagonais' challengeType: 1 forumTopicId: 302111 dashedName: problem-44-pentagon-numbers @@ -8,23 +8,23 @@ dashedName: problem-44-pentagon-numbers # --description-- -Pentagonal numbers are generated by the formula, Pn=`n`(3`n`−1)/2. The first ten pentagonal numbers are: +Números pentagonais são gerados pela fórmula Pn = `n`(3`n` − 1) / 2. Os primeiros dez números pentagonais são: 1, 5, 12, 22, 35, 51, 70, 92, 117, 145, ... -It can be seen that P4 + P7 = 22 + 70 = 92 = P8. However, their difference, 70 − 22 = 48, is not pentagonal. +Pode ser visto que P4 + P7 = 22 + 70 = 92 = P8. No entanto, a sua diferença, 70 - 22 = 48, não forma um número pentagonal. -Find the pair of pentagonal numbers, Pj and Pk, for which their sum and difference are pentagonal and D = |Pk − Pj| is minimized; what is the value of D? +Encontre o par de números pentagonais, Pj e Pk, cuja soma e a diferença formem um número pentagonal e cuja equação D = |Pk − Pj| é minimizada. Qual o valor de D? # --hints-- -`pentagonNumbers()` should return a number. +`pentagonNumbers()` deve retornar um número. ```js assert(typeof pentagonNumbers() === 'number'); ``` -`pentagonNumbers()` should return 5482660. +`pentagonNumbers()` deve retornar 5482660. ```js assert.strictEqual(pentagonNumbers(), 5482660); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-45-triangular-pentagonal-and-hexagonal.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-45-triangular-pentagonal-and-hexagonal.md index e80bcc8dd50..754267ab9dc 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-45-triangular-pentagonal-and-hexagonal.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-45-triangular-pentagonal-and-hexagonal.md @@ -1,6 +1,6 @@ --- id: 5900f3991000cf542c50feac -title: 'Problem 45: Triangular, pentagonal, and hexagonal' +title: 'Problema 45: Triangular, pentagonal e hexagonal' challengeType: 1 forumTopicId: 302122 dashedName: problem-45-triangular-pentagonal-and-hexagonal @@ -8,25 +8,25 @@ dashedName: problem-45-triangular-pentagonal-and-hexagonal # --description-- -Triangle, pentagonal, and hexagonal numbers are generated by the following formulae: +Os números triangulares, pentagonais e hexagonais são gerados pelas seguintes fórmulas: -
Triangle
Tn=n(n+1)/2
1, 3, 6, 10, 15, ...
-
Pentagonal
Pn=n(3n−1)/2
1, 5, 12, 22, 35, ...
-
Hexagonal
Hn=n(2n−1)
1, 6, 15, 28, 45, ...
+
Triangular
Tn = n(n + 1) / 2
1, 3, 6, 10, 15, ...
+
Pentagonal
Pn = n(3n − 1) / 2
1, 5, 12, 22, 35, ...
+
Hexagonal
Hn = n(2n − 1)
1, 6, 15, 28, 45, ...
-It can be verified that T285 = P165 = H143 = 40755. +Pode ser verificado que T285 = P165 = H143 = 40755. -Find the next triangle number that is also pentagonal and hexagonal. +Calcule o próximo número triangular que é também pentagonal e hexagonal. # --hints-- -`triPentaHexa(40756)` should return a number. +`triPentaHexa(40756)` deve retornar um número. ```js assert(typeof triPentaHexa(40756) === 'number'); ``` -`triPentaHexa(40756)` should return 1533776805. +`triPentaHexa(40756)` deve retornar 1533776805. ```js assert.strictEqual(triPentaHexa(40756), 1533776805); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-46-goldbachs-other-conjecture.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-46-goldbachs-other-conjecture.md index 1bcc859d05e..d1a9da44095 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-46-goldbachs-other-conjecture.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-46-goldbachs-other-conjecture.md @@ -1,6 +1,6 @@ --- id: 5900f39a1000cf542c50fead -title: 'Problem 46: Goldbach''s other conjecture' +title: 'Problema 46: Outra conjectura de Goldbach' challengeType: 1 forumTopicId: 302134 dashedName: problem-46-goldbachs-other-conjecture @@ -8,7 +8,7 @@ dashedName: problem-46-goldbachs-other-conjecture # --description-- -It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square. +Foi proposto por Christian Goldbach que todos os números compostos ímpares podem ser obtidos pela soma de um primo e duas vezes um número ao quadrado.
9 = 7 + 2×12
@@ -19,19 +19,19 @@ It was proposed by Christian Goldbach that every odd composite number can be wri 33 = 31 + 2×12
-It turns out that the conjecture was false. +Acontece que a conjectura era falsa. -What is the smallest odd composite that cannot be written as the sum of a prime and twice a square? +Qual é o menor número composto ímpar que não pode ser escrito como a soma de um primo e duas vezes um número ao quadrado? # --hints-- -`goldbachsOtherConjecture()` should return a number. +`goldbachsOtherConjecture()` deve retornar um número. ```js assert(typeof goldbachsOtherConjecture() === 'number'); ``` -`goldbachsOtherConjecture()` should return 5777. +`goldbachsOtherConjecture()` deve retornar 5777. ```js assert.strictEqual(goldbachsOtherConjecture(), 5777); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-47-distinct-primes-factors.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-47-distinct-primes-factors.md index 3b79403a4ea..f90162739b4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-47-distinct-primes-factors.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-47-distinct-primes-factors.md @@ -1,6 +1,6 @@ --- id: 5900f39c1000cf542c50feae -title: 'Problem 47: Distinct primes factors' +title: 'Problema 47: Fatores primos distintos' challengeType: 1 forumTopicId: 302145 dashedName: problem-47-distinct-primes-factors @@ -8,14 +8,14 @@ dashedName: problem-47-distinct-primes-factors # --description-- -The first two consecutive numbers to have two distinct prime factors are: +Os dois primeiros números consecutivos a terem dois fatores primos distintos são:
14 = 2 × 7
15 = 3 × 5
-The first three consecutive numbers to have three distinct prime factors are: +Os três primeiros números consecutivos a ter três fatores primos distintos são:
644 = 22 × 7 × 23
@@ -23,29 +23,29 @@ The first three consecutive numbers to have three distinct prime factors are: 646 = 2 × 17 × 19
-Find the first four consecutive integers to have four distinct prime factors each. What is the first of these numbers? +Encontre os primeiros quatro números inteiros consecutivos que têm quatro fatores primos distintos. Qual é o primeiro desses números? # --hints-- -`distinctPrimeFactors(2, 2)` should return a number. +`distinctPrimeFactors(2, 2)` deve retornar um número. ```js assert(typeof distinctPrimeFactors(2, 2) === 'number'); ``` -`distinctPrimeFactors(2, 2)` should return 14. +`distinctPrimeFactors(2, 2)` deve retornar 14. ```js assert.strictEqual(distinctPrimeFactors(2, 2), 14); ``` -`distinctPrimeFactors(3, 3)` should return 644. +`distinctPrimeFactors(3, 3)` deve retornar 644. ```js assert.strictEqual(distinctPrimeFactors(3, 3), 644); ``` -`distinctPrimeFactors(4, 4)` should return 134043. +`distinctPrimeFactors(4, 4)` deve retornar 134043. ```js assert.strictEqual(distinctPrimeFactors(4, 4), 134043); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-48-self-powers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-48-self-powers.md index d429c978791..cfa02130a6d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-48-self-powers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-48-self-powers.md @@ -1,6 +1,6 @@ --- id: 5900f39c1000cf542c50feaf -title: 'Problem 48: Self powers' +title: 'Problema 48: Elevado à base' challengeType: 1 forumTopicId: 302157 dashedName: problem-48-self-powers @@ -8,37 +8,37 @@ dashedName: problem-48-self-powers # --description-- -The series, 11 + 22 + 33 + ... + 1010 = 10405071317. +A série, 11 + 22 + 33 + ... + 1010 = 10405071317. -Find the last ten digits of the series, 11 + 22 + 33 + ... + 10001000. +Encontre os últimos dez algarismos da série, 11 + 22 + 33 + ... + 10001000. # --hints-- -`selfPowers(10, 3)` should return a number. +`selfPowers(10, 3)` deve retornar um número. ```js assert(typeof selfPowers(10, 3) === 'number'); ``` -`selfPowers(10, 3)` should return 317. +`selfPowers(10, 3)` deve retornar 317. ```js assert.strictEqual(selfPowers(10, 3), 317); ``` -`selfPowers(150, 6)` should return 29045. +`selfPowers(150, 6)` deve retornar 29045. ```js assert.strictEqual(selfPowers(150, 6), 29045); ``` -`selfPowers(673, 7)` should return 2473989. +`selfPowers(673, 7)` deve retornar 2473989. ```js assert.strictEqual(selfPowers(673, 7), 2473989); ``` -`selfPowers(1000, 10)` should return 9110846700. +`selfPowers(1000, 10)` deve retornar 9110846700. ```js assert.strictEqual(selfPowers(1000, 10), 9110846700); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-49-prime-permutations.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-49-prime-permutations.md index 3c0c1d3d362..6675a6108ff 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-49-prime-permutations.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-49-prime-permutations.md @@ -1,6 +1,6 @@ --- id: 5900f39d1000cf542c50feb0 -title: 'Problem 49: Prime permutations' +title: 'Problema 49: Permutações de números primos' challengeType: 1 forumTopicId: 302159 dashedName: problem-49-prime-permutations @@ -8,21 +8,21 @@ dashedName: problem-49-prime-permutations # --description-- -The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual in two ways: (i) each of the three terms are prime, and, (ii) each of the 4-digit numbers are permutations of one another. +A sequência aritmética, 1487, 4817, 8147, em que cada um dos termos aumenta em 3330, é incomum por dois motivos: (i) todos os três números são primos e (ii) cada um dos números de 4 algarismos é uma permutação dos outros. -There are no arithmetic sequences made up of three 1-, 2-, or 3-digit primes, exhibiting this property, but there is one other 4-digit increasing sequence. +Não existem sequências aritméticas de números primos de 1, 2 ou 3 dígitos que possuem essas mesmas propriedades. Mas existe outra sequência crescente de 4 algarismos. -What 12-digit number do you form by concatenating the three terms in this sequence? +Qual número de 12 algarismos você forma ao concatenar os três termos nessa sequência? # --hints-- -`primePermutations()` should return a number. +`primePermutations()` deve retornar um número. ```js assert(typeof primePermutations() === 'number'); ``` -`primePermutations()` should return 296962999629. +`primePermutations()` deve retornar 296962999629. ```js assert.strictEqual(primePermutations(), 296962999629); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-51-prime-digit-replacements.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-51-prime-digit-replacements.md index cdbfc3e568b..67902e726f7 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-51-prime-digit-replacements.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-51-prime-digit-replacements.md @@ -1,6 +1,6 @@ --- id: 5900f39f1000cf542c50feb2 -title: 'Problem 51: Prime digit replacements' +title: 'Problema 51: Substituição de algarismos primos' challengeType: 1 forumTopicId: 302162 dashedName: problem-51-prime-digit-replacements @@ -8,33 +8,33 @@ dashedName: problem-51-prime-digit-replacements # --description-- -By replacing the 1st digit of the 2-digit number \*3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime. +Ao substituir o primeiro algarismo do número de dois algarismos, \*3, seis dos nove valores possíveis (13, 23, 43, 53, 73 e 83) são todos primos. -By replacing the 3rd and 4th digits of 56\*\*3 with the same digit, this 5-digit number is the first example having seven primes among the ten generated numbers, yielding the family: 56003, 56113, 56333, 56443, 56663, 56773, and 56993. Consequently 56003, being the first member of this family, is the smallest prime with this property. +Ao substituir o terceiro e o quarto algarismos do número 56\*\*3 pelo mesmo algarismo, este número de 5 algarismos é o primeiro exemplo com sete primos entre os dez números gerados, criando a sequência de termos: 56003, 56113, 56333, 56443, 56663, 56773 e 56993. O número 56003, por ser o primeiro termo desta sequência, é o menor primo com essa propriedade. -Find the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an `n` prime value family. +Encontre o menor número primo que, ao substituir parte do número (não necessariamente algarismos adjacentes) pelo mesmo algarismo, é parte de uma sequência de `n` termos. # --hints-- -`primeDigitReplacements(6)` should return a number. +`primeDigitReplacements(6)` deve retornar um número. ```js assert(typeof primeDigitReplacements(6) === 'number'); ``` -`primeDigitReplacements(6)` should return `13`. +`primeDigitReplacements(6)` deve retornar `13`. ```js assert.strictEqual(primeDigitReplacements(6), 13); ``` -`primeDigitReplacements(7)` should return `56003`. +`primeDigitReplacements(7)` deve retornar `56003`. ```js assert.strictEqual(primeDigitReplacements(7), 56003); ``` -`primeDigitReplacements(8)` should return `121313`. +`primeDigitReplacements(8)` deve retornar `121313`. ```js assert.strictEqual(primeDigitReplacements(8), 121313); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-52-permuted-multiples.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-52-permuted-multiples.md index 7a3886a6e27..44f7edc5aa6 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-52-permuted-multiples.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-52-permuted-multiples.md @@ -1,6 +1,6 @@ --- id: 5900f3a01000cf542c50feb3 -title: 'Problem 52: Permuted multiples' +title: 'Problema 52: Múltiplos permutados' challengeType: 1 forumTopicId: 302163 dashedName: problem-52-permuted-multiples @@ -8,25 +8,25 @@ dashedName: problem-52-permuted-multiples # --description-- -It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order. +Podemos notar que o número, 125874, e o seu dobro, 251748, contêm exatamente os mesmos algarismos, mas em uma ordem diferente. -Find the smallest positive integer, such that multiplied by integers $\\{2, 3, \ldots, n\\}$, contain the same digits. +Encontre o menor número inteiro positivo, tal que, multiplicado por números inteiros $\\{2, 3, \ldots, n\\}$, contém os mesmos algarismos. # --hints-- -`permutedMultiples(2)` should return a number. +`permutedMultiples(2)` deve retornar um número. ```js assert(typeof permutedMultiples(2) === 'number'); ``` -`permutedMultiples(2)` should return `125874`. +`permutedMultiples(2)` deve retornar `125874`. ```js assert.strictEqual(permutedMultiples(2), 125874); ``` -`permutedMultiples(6)` should return `142857`. +`permutedMultiples(6)` deve retornar `142857`. ```js assert.strictEqual(permutedMultiples(6), 142857); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-53-combinatoric-selections.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-53-combinatoric-selections.md index 8d96ff14392..83b219b411e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-53-combinatoric-selections.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-53-combinatoric-selections.md @@ -1,6 +1,6 @@ --- id: 5900f3a11000cf542c50feb4 -title: 'Problem 53: Combinatoric selections' +title: 'Problema 53: Seleção de combinações' challengeType: 1 forumTopicId: 302164 dashedName: problem-53-combinatoric-selections @@ -8,45 +8,45 @@ dashedName: problem-53-combinatoric-selections # --description-- -There are exactly ten ways of selecting three from five, 12345: +Existem exatamente dez maneiras de selecionar um número de 3 algarismos a partir de um número de 5 algarismos, 12345: -
123, 124, 125, 134, 135, 145, 234, 235, 245, and 345
+
123, 124, 125, 134, 135, 145, 234, 235, 245 e 345
-In combinatorics, we use the notation, $\\displaystyle \\binom 5 3 = 10$ +Na combinatória, usamos a notação $\\displaystyle \\binom 5 3 = 10$ -In general, $\\displaystyle \\binom n r = \\dfrac{n!}{r!(n-r)!}$, where $r \\le n$, $n! = n \\times (n-1) \\times ... \\times 3 \\times 2 \\times 1$, and $0! = 1$. +No geral, $\\displaystyle \\binom n r = \\dfrac{n!}{r!(n-r)!}$, onde $r \\le n$, $n! = n \\times (n-1) \\times ... \\times 3 \\times 2 \\times 1$, e $0! = 1$. -It is not until $n = 23$, that a value exceeds one-million: $\\displaystyle \\binom {23} {10} = 1144066$. +É só depois de $n = 23$ que um valor excede um milhão: $\\displaystyle \\binom {23} {10} = 1144066$. -How many, not necessarily distinct, values of $\\displaystyle \\binom n r$ for $1 \\le n \\le 100$, are greater than one-million? +Quantos valores de $\\displaystyle \\binom n r$ para $1 \\le n \\le 100$, não necessariamente distintos, são maiores que um milhão? # --hints-- -`combinatoricSelections(1000)` should return a number. +`combinatoricSelections(1000)` deve retornar um número. ```js assert(typeof combinatoricSelections(1000) === 'number'); ``` -`combinatoricSelections(1000)` should return 4626. +`combinatoricSelections(1000)` deve retornar 4626. ```js assert.strictEqual(combinatoricSelections(1000), 4626); ``` -`combinatoricSelections(10000)` should return 4431. +`combinatoricSelections(10000)` deve retornar 4431. ```js assert.strictEqual(combinatoricSelections(10000), 4431); ``` -`combinatoricSelections(100000)` should return 4255. +`combinatoricSelections(100000)` deve retornar 4255. ```js assert.strictEqual(combinatoricSelections(100000), 4255); ``` -`combinatoricSelections(1000000)` should return 4075. +`combinatoricSelections(1000000)` deve retornar 4075. ```js assert.strictEqual(combinatoricSelections(1000000), 4075); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-54-poker-hands.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-54-poker-hands.md index b08e9a13bda..6cb44e8456c 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-54-poker-hands.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-54-poker-hands.md @@ -1,6 +1,6 @@ --- id: 5900f3a21000cf542c50feb5 -title: 'Problem 54: Poker hands' +title: 'Problema 54: Mãos do pôquer' challengeType: 1 forumTopicId: 302165 dashedName: problem-54-poker-hands @@ -8,54 +8,54 @@ dashedName: problem-54-poker-hands # --description-- -In the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way: +No pôquer, uma mão consiste em cinco cartas e é classificada, da menor para a maior (mão), da seguinte maneira: -The cards are valued in the order: 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace. +A ordem das cartas é a seguinte: 2, 3, 4, 5, 6, 7, 8, 9, 10, Valete, Rainha, Rei e Ás. -If two players have the same ranked hands then the rank made up of the highest value wins; for example, a pair of eights beats a pair of fives (see example 1 below). But if two ranks tie, for example, both players have a pair of queens, then highest cards in each hand are compared (see example 4 below); if the highest cards tie then the next highest cards are compared, and so on. +Se dois jogadores tiverem as mesmas mãos, o jogador com as cartas de valor mais alto vence. Por exemplo, um par de oito vence um par de cinco (veja o exemplo 1 abaixo). Se os dois jogadores tiverem a mesma mão com os mesmos valores, as cartas mais altas de cada jogador são comparadas (veja exemplo 4 abaixo) para fim de desempate. Se as cartas mais altas empatarem de novo, então outras cartas são comparadas, e assim por diante. -Consider the following five hands dealt to two players: +Considere as cinco mãos a seguir dadas a dois jogadores: -| Hand | Player 1 | Player 2 | Winner | -| ------------------------- | --------------------------------------------------------------------- | ---------------------------------------------------------------------- | -------- | -| 1 | 5H 5C 6S 7S KD
Pair of Fives | 2C 3S 8S 8D TD
Pair of Eights | Player 2 | -| 2 | 5D 8C 9S JS AC
Highest card Ace | 2C 5C 7D 8S QH
Highest card Queen | Player 1 | -| 3 | 2D 9C AS AH AC
Three Aces | 3D 6D 7D TD QD
Flush with Diamonds | Player 2 | -| 4 | 4D 6S 9H QH QC
Pair of Queens
Highest card Nine | 3D 6D 7H QD QS
Pair of Queens
Highest card Seven | Player 1 | -| 5 | 2H 2D 4C 4D 4S
Full House
with Three Fours | 3C 3D 3S 9S 9D
Full House
with Three Threes | Player 1 | +| Mão | Jogador 1 | Jogador 2 | Vencedor | +| ------------------------- | ------------------------------------------------------------------------ | ------------------------------------------------------------------------ | --------- | +| 1 | 5H 5C 6S 7S KD
Par de cincos | 2C 3S 8S 8D TD
Par de oitos | Jogador 2 | +| 2 | 5D 8C 9S JS AC
Maior carta é o Ás | 2C 5C 7D 8S QH
Maior carta é a Rainha | Jogador 1 | +| 3 | 2D 9C AS AH AC
Três Ases | 3D 6D 7D TD QD
Flush de ouros | Jogador 2 | +| 4 | 4D 6S 9H QH QC
Par de Rainhas
A maior carta é Nove | 3D 6D 7H QD QS
Par de Rainhas
A maior carta é Sete | Jogador 1 | +| 5 | 2H 2D 4C 4D 4S
Full House
com três Quatros | 3C 3D 3S 9S 9D
Full House
com três Três | Jogador 1 | -The global array (`handsArr`) passed to the function, contains one-thousand random hands dealt to two players. Each line of the file contains ten cards (separated by a single space): the first five are Player 1's cards and the last five are Player 2's cards. You can assume that all hands are valid (no invalid characters or repeated cards), each player's hand is in no specific order, and in each hand there is a clear winner. +O array global (`handsArr`) passado para a função contém mil mãos aleatórias dadas a dois jogadores. Cada linha do arquivo contém dez cartas (separadas por um único espaço): as cinco primeiras são as cartas do Jogador 1 e as últimas cinco são cartas do Jogador 2. Você pode assumir que todas as mãos são válidas (sem caracteres inválidos ou cartas repetidas). A mão de cada jogador não está em uma ordem específica e em cada mão há um vencedor claro. -How many hands does Player 1 win? +Quantas mãos o Jogador 1 vence? # --hints-- -`pokerHands(testArr)` should return a number. +`pokerHands(testArr)` deve retornar um número. ```js assert(typeof pokerHands(testArr) === 'number'); ``` -`pokerHands(testArr)` should return 2. +`pokerHands(testArr)` deve retornar 2. ```js assert.strictEqual(pokerHands(testArr), 2); ``` -`pokerHands(handsArr)` should return 376. +`pokerHands(handsArr)` deve retornar 376. ```js assert.strictEqual(pokerHands(handsArr), 376); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-55-lychrel-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-55-lychrel-numbers.md index 890c5b0997d..97b763fc54d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-55-lychrel-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-55-lychrel-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f3a31000cf542c50feb6 -title: 'Problem 55: Lychrel numbers' +title: 'Problema 55: Números de Lychrel' challengeType: 1 forumTopicId: 302166 dashedName: problem-55-lychrel-numbers @@ -8,9 +8,9 @@ dashedName: problem-55-lychrel-numbers # --description-- -If we take 47, reverse and add, 47 + 74 = 121, which is palindromic. +Se pegarmos o número 47, invertemos e somarmos, 47 + 74 = 121, temos um número palíndromo. -Not all numbers produce palindromes so quickly. For example, +Nem todos os números, no entanto, produzem palíndromos tão facilmente. Por exemplo:
349 + 943 = 1292,
@@ -18,49 +18,49 @@ Not all numbers produce palindromes so quickly. For example, 4213 + 3124 = 7337
-That is, 349 took three iterations to arrive at a palindrome. +Ou seja, 349 precisou de três iterações para chegar a um palíndromo. -Although no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits). +Embora ninguém tenha provado ainda, pensa-se que alguns números, como 196, nunca produzem um palíndromo. Um número que nunca produz um palíndromo através do processo de inversão e adição é conhecido como um número de Lychrel. Devido à natureza teórica destes números e para fins de aprendizado, partiremos do princípio de que todo número é um número de Lychrel até que se prove o contrário. Além disso, você assumirá que para cada número abaixo de dez mil, ou (i) ele se torna um palíndromo em menos de cinquenta iterações, ou, (ii) ninguém, com todo o poder de computação que existe, conseguiu mapeá-lo para um palíndromo. Na verdade, 10677 é o primeiro número que exige mais de cinquenta iterações antes de produzir um palíndromo: 4668731596684224866951378664 (53 iterações, gerando um número com 28 algarismos). -Surprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994. +Surpreendentemente, há números palíndromos que são, ao mesmo tempo, um número de Lychrel. O primeiro exemplo é o 4994. -How many Lychrel numbers are there below `num`? +Quantos números de Lychrel existem abaixo de `num`? -**Note:** Wording was modified slightly on 24 April 2007 to emphasize the theoretical nature of Lychrel numbers. +**Observação:** o texto foi ligeiramente modificado em 24 de abril de 2007 para enfatizar a natureza teórica dos números de Lychrel. # --hints-- -`countLychrelNumbers(1000)` should return a number. +`countLychrelNumbers(1000)` deve retornar um número. ```js assert(typeof countLychrelNumbers(1000) === 'number'); ``` -`countLychrelNumbers(1000)` should return 13. +`countLychrelNumbers(1000)` deve retornar 13. ```js assert.strictEqual(countLychrelNumbers(1000), 13); ``` -`countLychrelNumbers(3243)` should return 39. +`countLychrelNumbers(3243)` deve retornar 39. ```js assert.strictEqual(countLychrelNumbers(3243), 39); ``` -`countLychrelNumbers(5000)` should return 76. +`countLychrelNumbers(5000)` deve retornar 76. ```js assert.strictEqual(countLychrelNumbers(5000), 76); ``` -`countLychrelNumbers(7654)` should return 140. +`countLychrelNumbers(7654)` deve retornar 140. ```js assert.strictEqual(countLychrelNumbers(7654), 140); ``` -`countLychrelNumbers(10000)` should return 249. +`countLychrelNumbers(10000)` deve retornar 249. ```js assert.strictEqual(countLychrelNumbers(10000), 249); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-56-powerful-digit-sum.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-56-powerful-digit-sum.md index e445973f332..645ef91f2ef 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-56-powerful-digit-sum.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-56-powerful-digit-sum.md @@ -1,6 +1,6 @@ --- id: 5900f3a41000cf542c50feb7 -title: 'Problem 56: Powerful digit sum' +title: 'Problema 56: Poderosa soma de algarismos' challengeType: 1 forumTopicId: 302167 dashedName: problem-56-powerful-digit-sum @@ -8,43 +8,43 @@ dashedName: problem-56-powerful-digit-sum # --description-- -A googol ($10^{100}$) is a massive number: one followed by one-hundred zeros; $100^{100}$ is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1. +Um googol ($10^{100}$) é um número absurdamente enorme: um seguido por cem zeros. Já $100^{100}$ é quase inimaginavelmente grande: um seguido por duzentos zeros. Apesar do seu tamanho, a soma dos algarismos em cada número é de apenas 1. -Considering natural numbers of the form, $a^b$, where `a`, `b` < `n`, what is the maximum digital sum? +Considerando os números naturais da fórmula $a^b$, onde `a`, `b` < `n`, qual é a soma máxima dos algarismos? # --hints-- -`powerfulDigitSum(3)` should return a number. +`powerfulDigitSum(3)` deve retornar um número. ```js assert(typeof powerfulDigitSum(3) === 'number'); ``` -`powerfulDigitSum(3)` should return `4`. +`powerfulDigitSum(3)` deve retornar `4`. ```js assert.strictEqual(powerfulDigitSum(3), 4); ``` -`powerfulDigitSum(10)` should return `45`. +`powerfulDigitSum(10)` deve retornar `45`. ```js assert.strictEqual(powerfulDigitSum(10), 45); ``` -`powerfulDigitSum(50)` should return `406`. +`powerfulDigitSum(50)` deve retornar `406`. ```js assert.strictEqual(powerfulDigitSum(50), 406); ``` -`powerfulDigitSum(75)` should return `684`. +`powerfulDigitSum(75)` deve retornar `684`. ```js assert.strictEqual(powerfulDigitSum(75), 684); ``` -`powerfulDigitSum(100)` should return `972`. +`powerfulDigitSum(100)` deve retornar `972`. ```js assert.strictEqual(powerfulDigitSum(100), 972); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-57-square-root-convergents.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-57-square-root-convergents.md index 034974d882c..523f992a39d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-57-square-root-convergents.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-57-square-root-convergents.md @@ -1,6 +1,6 @@ --- id: 5900f3a51000cf542c50feb8 -title: 'Problem 57: Square root convergents' +title: 'Problema 57: Convergentes da raiz quadrada' challengeType: 1 forumTopicId: 302168 dashedName: problem-57-square-root-convergents @@ -8,11 +8,11 @@ dashedName: problem-57-square-root-convergents # --description-- -It is possible to show that the square root of two can be expressed as an infinite continued fraction. +É possível mostrar que a raiz quadrada de dois pode ser expressa como uma fração que se repete infinitamente.
$\sqrt 2 =1+ \frac 1 {2+ \frac 1 {2 +\frac 1 {2+ \dots}}}$
-By expanding this for the first four iterations, we get: +Entrando em detalhes, as primeiras quatro iterações são: $1 + \\frac 1 2 = \\frac 32 = 1.5$ @@ -22,31 +22,31 @@ $1 + \\frac 1 {2 + \\frac 1 {2+\\frac 1 2}} = \\frac {17}{12} = 1.41666 \\dots$ $1 + \\frac 1 {2 + \\frac 1 {2+\\frac 1 {2+\\frac 1 2}}} = \\frac {41}{29} = 1.41379 \\dots$ -The next three expansions are $\\frac {99}{70}$, $\\frac {239}{169}$, and $\\frac {577}{408}$, but the eighth expansion, $\\frac {1393}{985}$, is the first example where the number of digits in the numerator exceeds the number of digits in the denominator. +As três próximas iterações são $\\frac {99}{70}$, $\\frac {239}{169}$ e $\\frac {577}{408}$. Mas a oitava iteração, $\\frac {1393}{985}$, é o primeiro exemplo em que o número de algarismos no numerador excede o número de algarismos no denominador. -In the first `n` expansions, how many fractions contain a numerator with more digits than denominator? +Nas primeiras `n` iterações, quantas frações contém um numerador com mais algarismos que o denominador? # --hints-- -`squareRootConvergents(10)` should return a number. +`squareRootConvergents(10)` deve retornar um número. ```js assert(typeof squareRootConvergents(10) === 'number'); ``` -`squareRootConvergents(10)` should return 1. +`squareRootConvergents(10)` deve retornar 1. ```js assert.strictEqual(squareRootConvergents(10), 1); ``` -`squareRootConvergents(100)` should return 15. +`squareRootConvergents(100)` deve retornar 15. ```js assert.strictEqual(squareRootConvergents(100), 15); ``` -`squareRootConvergents(1000)` should return 153. +`squareRootConvergents(1000)` deve retornar 153. ```js assert.strictEqual(squareRootConvergents(1000), 153); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-60-prime-pair-sets.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-60-prime-pair-sets.md index dc4a88c2cfb..cc4746434cf 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-60-prime-pair-sets.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-60-prime-pair-sets.md @@ -1,6 +1,6 @@ --- id: 5900f3a81000cf542c50febb -title: 'Problem 60: Prime pair sets' +title: 'Problema 60: Pares de números primos' challengeType: 1 forumTopicId: 302172 dashedName: problem-60-prime-pair-sets @@ -8,19 +8,19 @@ dashedName: problem-60-prime-pair-sets # --description-- -The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property. +Os números primos 3, 7, 109 e 673 são notáveis. Ao pegar quaisquer dois primos e concatená-los em qualquer ordem, o resultado sempre será um número primo. Por exemplo: ao pegar 7 e 109, ambos 7109 e 1097 são primos. A soma destes quatro números primos, 792, representa a soma mais baixa para um conjunto de quatro números primos com esta propriedade. -Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime. +Encontre a soma mais baixa de um conjunto de cinco números primos, onde dois números primos concatenados produzem outro número primo. # --hints-- -`primePairSets()` should return a number. +`primePairSets()` deve retornar um número. ```js assert(typeof primePairSets() === 'number'); ``` -`primePairSets()` should return 26033. +`primePairSets()` deve retornar 26033. ```js assert.strictEqual(primePairSets(), 26033); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-61-cyclical-figurate-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-61-cyclical-figurate-numbers.md index 99fee7255e8..49158dca2e1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-61-cyclical-figurate-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-61-cyclical-figurate-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f3a91000cf542c50febc -title: 'Problem 61: Cyclical figurate numbers' +title: 'Problema 61: Números cíclicos' challengeType: 1 forumTopicId: 302173 dashedName: problem-61-cyclical-figurate-numbers @@ -8,52 +8,52 @@ dashedName: problem-61-cyclical-figurate-numbers # --description-- -Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbers and are generated by the following formulae: +Números triângulares, quadrados, pentagonais, hexagonais, heptagonais e octogonais são números figurativos (poligonais) e são gerados pelas seguintes fórmulas: -| Type of Number | Formula | Sequence | +| Tipo de número | Fórmula | Sequência | | -------------- | ----------------------------- | --------------------- | -| Triangle | $P_3(n) = \frac{n(n+1)}{2}$ | 1, 3, 6, 10, 15, ... | -| Square | $P_4(n) = n^2$ | 1, 4, 9, 16, 25, ... | +| Triangular | $P_3(n) = \frac{n(n+1)}{2}$ | 1, 3, 6, 10, 15, ... | +| Quadrado | $P_4(n) = n^2$ | 1, 4, 9, 16, 25, ... | | Pentagonal | $P_5(n) = \frac{n(3n−1)}2$ | 1, 5, 12, 22, 35, ... | | Hexagonal | $P_6(n) = n(2n−1)$ | 1, 6, 15, 28, 45, ... | | Heptagonal | $P_7(n) = \frac{n(5n−3)}{2}$ | 1, 7, 18, 34, 55, ... | -| Octagonal | $P_8(n) = n(3n−2)$ | 1, 8, 21, 40, 65, ... | +| Octogonal | $P_8(n) = n(3n−2)$ | 1, 8, 21, 40, 65, ... | -The ordered set of three 4-digit numbers: 8128, 2882, 8281, has three interesting properties. +O conjunto ordenado de três números que possuem 4 algarismos, 8128, 2882, 8281, possui três propriedades interessantes. -1. The set is cyclic, in that the last two digits of each number is the first two digits of the next number (including the last number with the first). -2. Each polygonal type: triangle ($P_3(127) = 8128$), square ($P_4(91) = 8281$), and pentagonal ($P_5(44) = 2882$), is represented by a different number in the set. -3. This is the only set of 4-digit numbers with this property. +1. O conjunto é cíclico. Podemos notar que os dois últimos algarismos de cada número são os dois primeiros algarismos do próximo número (incluindo o último número com o primeiro). +2. Cada tipo poligonal, triângulo ($P_3(127) = 8128$), quadrado ($P_4(91) = 8281$) e pentagonal ($P_5(44) = 2882$), é representado por um número diferente no conjunto. +3. Este é o único conjunto de números de 4 algarismos com estas propriedades. -Find the sum of all numbers in ordered sets of `n` cyclic 4-digit numbers for which each of the $P_3$ to $P_{n + 2}$ polygonal types, is represented by a different number in the set. +Calcule a soma de todos os números em conjuntos ordenados de `n` números de 4 algarismos cíclicos, onde cada tipo poligonal de $P_3$ a $P_{n + 2}$ é representado por um número diferente no conjunto. # --hints-- -`cyclicalFigurateNums(3)` should return a number. +`cyclicalFigurateNums(3)` deve retornar um número. ```js assert(typeof cyclicalFigurateNums(3) === 'number'); ``` -`cyclicalFigurateNums(3)` should return `19291`. +`cyclicalFigurateNums(3)` deve retornar `19291`. ```js assert.strictEqual(cyclicalFigurateNums(3), 19291); ``` -`cyclicalFigurateNums(4)` should return `28684`. +`cyclicalFigurateNums(4)` deve retornar `28684`. ```js assert.strictEqual(cyclicalFigurateNums(4), 28684); ``` -`cyclicalFigurateNums(5)` should return `76255`. +`cyclicalFigurateNums(5)` deve retornar `76255`. ```js assert.strictEqual(cyclicalFigurateNums(5), 76255); ``` -`cyclicalFigurateNums(6)` should return `28684`. +`cyclicalFigurateNums(6)` deve retornar `28684`. ```js assert.strictEqual(cyclicalFigurateNums(6), 28684); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-63-powerful-digit-counts.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-63-powerful-digit-counts.md index 2c8b0bb8cd6..4c121c36c3b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-63-powerful-digit-counts.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-63-powerful-digit-counts.md @@ -1,6 +1,6 @@ --- id: 5900f3ab1000cf542c50febe -title: 'Problem 63: Powerful digit counts' +title: 'Problema 63: Contagem poderosa de algarismos' challengeType: 1 forumTopicId: 302175 dashedName: problem-63-powerful-digit-counts @@ -8,73 +8,73 @@ dashedName: problem-63-powerful-digit-counts # --description-- -The 5-digit number, 16807 = 75, is also a fifth power. Similarly, the 9-digit number, 134217728 = 89, is a ninth power. +O número de 5 algarismos, 16807 = 75, também é uma quinta potência. Da mesma forma, o número de 9 algarismos, 134217728 = 89, é uma nona potência. -Complete the function so that it returns how many positive integers are of length `n` and an `n`th power. +Complete a função para que ela retorne quantos números inteiros e positivos são da `n`-ésima potência e de comprimento `n`. # --hints-- -`powerfulDigitCounts(1)` should return a number. +`powerfulDigitCounts(1)` deve retornar um número. ```js assert(typeof powerfulDigitCounts(1) === 'number'); ``` -`powerfulDigitCounts(1)` should return `9`. +`powerfulDigitCounts(1)` deve retornar `9`. ```js assert.strictEqual(powerfulDigitCounts(1), 9); ``` -`powerfulDigitCounts(2)` should return `6`. +`powerfulDigitCounts(2)` deve retornar `6`. ```js assert.strictEqual(powerfulDigitCounts(2), 6); ``` -`powerfulDigitCounts(3)` should return `5`. +`powerfulDigitCounts(3)` deve retornar `5`. ```js assert.strictEqual(powerfulDigitCounts(3), 5); ``` -`powerfulDigitCounts(4)` should return `4`. +`powerfulDigitCounts(4)` deve retornar `4`. ```js assert.strictEqual(powerfulDigitCounts(4), 4); ``` -`powerfulDigitCounts(5)` should return `3`. +`powerfulDigitCounts(5)` deve retornar `3`. ```js assert.strictEqual(powerfulDigitCounts(5), 3); ``` -`powerfulDigitCounts(6)` should return `3`. +`powerfulDigitCounts(6)` deve retornar `3`. ```js assert.strictEqual(powerfulDigitCounts(6), 3); ``` -`powerfulDigitCounts(7)` should return `2`. +`powerfulDigitCounts(7)` deve retornar `2`. ```js assert.strictEqual(powerfulDigitCounts(7), 2); ``` -`powerfulDigitCounts(8)` should return `2`. +`powerfulDigitCounts(8)` deve retornar `2`. ```js assert.strictEqual(powerfulDigitCounts(8), 2); ``` -`powerfulDigitCounts(10)` should return `2`. +`powerfulDigitCounts(10)` deve retornar `2`. ```js assert.strictEqual(powerfulDigitCounts(10), 2); ``` -`powerfulDigitCounts(21)` should return `1`. +`powerfulDigitCounts(21)` deve retornar `1`. ```js assert.strictEqual(powerfulDigitCounts(21), 1); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-64-odd-period-square-roots.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-64-odd-period-square-roots.md index a6acdfc610e..7d4b3874d5e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-64-odd-period-square-roots.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-64-odd-period-square-roots.md @@ -1,6 +1,6 @@ --- id: 5900f3ac1000cf542c50febf -title: 'Problem 64: Odd period square roots' +title: 'Problema 64: Repetições ímpares da raiz quadrada' challengeType: 1 forumTopicId: 302176 dashedName: problem-64-odd-period-square-roots @@ -8,19 +8,19 @@ dashedName: problem-64-odd-period-square-roots # --description-- -All square roots are periodic when written as continued fractions and can be written in the form: +Todas as raízes quadradas são periódicas quando escritas como frações contínuas e podem ser escritas na forma: $\\displaystyle \\quad \\quad \\sqrt{N}=a_0+\\frac 1 {a_1+\\frac 1 {a_2+ \\frac 1 {a3+ \\dots}}}$ -For example, let us consider $\\sqrt{23}$: +Por exemplo, consideremos $\\sqrt{23}$: $\\quad \\quad \\sqrt{23}=4+\\sqrt{23}-4=4+\\frac 1 {\\frac 1 {\\sqrt{23}-4}}=4+\\frac 1 {1+\\frac{\\sqrt{23}-3}7}$ -If we continue we would get the following expansion: +Se continuarmos, teremos a seguinte expansão: $\\displaystyle \\quad \\quad \\sqrt{23}=4+\\frac 1 {1+\\frac 1 {3+ \\frac 1 {1+\\frac 1 {8+ \\dots}}}}$ -The process can be summarized as follows: +O processo pode ser resumido da seguinte forma: $\\quad \\quad a_0=4, \\frac 1 {\\sqrt{23}-4}=\\frac {\\sqrt{23}+4} 7=1+\\frac {\\sqrt{23}-3} 7$ @@ -38,61 +38,61 @@ $\\quad \\quad a_6=3, \\frac 2 {\\sqrt{23}-3}=\\frac {2(\\sqrt{23}+3)} {14}=1+\\ $\\quad \\quad a_7=1, \\frac 7 {\\sqrt{23}-4}=\\frac {7(\\sqrt{23}+4)} {7}=8+\\sqrt{23}-4$ -It can be seen that the sequence is repeating. For conciseness, we use the notation $\\sqrt{23}=\[4;(1,3,1,8)]$, to indicate that the block (1,3,1,8) repeats indefinitely. +Podemos ver que a sequência está se repetindo. Para sermos concisos, podemos usar a notação $\\sqrt{23}=\[4;(1,3,1,8)]$ para indicar que o bloco (1, 3, 1, 8) se repete indefinidamente. -The first ten continued fraction representations of (irrational) square roots are: +As primeiras dez representações de raízes (irracionais) contínuas são: -$\\quad \\quad \\sqrt{2}=\[1;(2)]$, period = 1 +$\\quad \\quad \\sqrt{2}=\[1;(2)]$, repetições = 1 -$\\quad \\quad \\sqrt{3}=\[1;(1,2)]$, period = 2 +$\\quad \\quad \\sqrt{3}=\[1;(1,2)]$, repetições = 2 -$\\quad \\quad \\sqrt{5}=\[2;(4)]$, period = 1 +$\\quad \\quad \\sqrt{5}=\[2;(4)]$, repetições = 1 -$\\quad \\quad \\sqrt{6}=\[2;(2,4)]$, period = 2 +$\\quad \\quad \\sqrt{6}=\[2;(2,4)]$, repetições = 2 -$\\quad \\quad \\sqrt{7}=\[2;(1,1,1,4)]$, period = 4 +$\\quad \\quad \\sqrt{7}=\[2;(1,1,1,4)]$, repetições = 4 -$\\quad \\quad \\sqrt{8}=\[2;(1,4)]$, period = 2 +$\\quad \\quad \\sqrt{8}=\[2;(1,4)]$, repetições = 2 -$\\quad \\quad \\sqrt{10}=\[3;(6)]$, period = 1 +$\\quad \\quad \\sqrt{10}=\[3;(6)]$, repetições = 1 -$\\quad \\quad \\sqrt{11}=\[3;(3,6)]$, period = 2 +$\\quad \\quad \\sqrt{11}=\[3;(3,6)]$, repetições = 2 -$\\quad \\quad \\sqrt{12}=\[3;(2,6)]$, period = 2 +$\\quad \\quad \\sqrt{12}=\[3;(2,6)]$, repetições = 2 -$\\quad \\quad \\sqrt{13}=\[3;(1,1,1,1,6)]$, period = 5 +$\\quad \\quad \\sqrt{13}=\[3;(1,1,1,1,6)]$, repetições = 5 -Exactly four continued fractions, for $N \\le 13$, have an odd period. +Exatamente quatro frações contínuas, onde $N \\le 13$, têm um total de repetições ímpares. -How many continued fractions for $N \\le n$ have an odd period? +Quantas frações contínuas onde $N \\le n$ têm repetições ímpares? # --hints-- -`oddPeriodSqrts(13)` should return a number. +`oddPeriodSqrts(13)` deve retornar um número. ```js assert(typeof oddPeriodSqrts(13) === 'number'); ``` -`oddPeriodSqrts(500)` should return `83`. +`oddPeriodSqrts(500)` deve retornar `83`. ```js assert.strictEqual(oddPeriodSqrts(500), 83); ``` -`oddPeriodSqrts(1000)` should return `152`. +`oddPeriodSqrts(1000)` deve retornar `152`. ```js assert.strictEqual(oddPeriodSqrts(1000), 152); ``` -`oddPeriodSqrts(5000)` should return `690`. +`oddPeriodSqrts(5000)` deve retornar `690`. ```js assert.strictEqual(oddPeriodSqrts(5000), 690); ``` -`oddPeriodSqrts(10000)` should return `1322`. +`oddPeriodSqrts(10000)` deve retornar `1322`. ```js assert.strictEqual(oddPeriodSqrts(10000), 1322); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-65-convergents-of-e.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-65-convergents-of-e.md index 9aa62302442..0c520ae9fa2 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-65-convergents-of-e.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-65-convergents-of-e.md @@ -1,6 +1,6 @@ --- id: 5900f3ad1000cf542c50fec0 -title: 'Problem 65: Convergents of e' +title: 'Problema 65: Convergentes de e' challengeType: 1 forumTopicId: 302177 dashedName: problem-65-convergents-of-e @@ -8,59 +8,59 @@ dashedName: problem-65-convergents-of-e # --description-- -The square root of 2 can be written as an infinite continued fraction. +A raiz quadrada de 2 pode ser escrita como uma fração contínua e infinita. $\\sqrt{2} = 1 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2 + ...}}}}$ -The infinite continued fraction can be written, $\\sqrt{2} = \[1; (2)]$ indicates that 2 repeats *ad infinitum*. In a similar way, $\\sqrt{23} = \[4; (1, 3, 1, 8)]$. It turns out that the sequence of partial values of continued fractions for square roots provide the best rational approximations. Let us consider the convergents for $\\sqrt{2}$. +Uma fração contínua e infinita pode ser representada por $\\sqrt{2} = \[1; (2)]$. Essa representação indica que 2 se repete *ad infinitum*. Da mesma forma, $\\sqrt{23} = \[4; (1, 3, 1, 8)]$. Acontece que a sequência de valores parciais de frações contínuas de raízes quadradas fornece as melhores aproximações racionais. Considere as convergências de $\\sqrt{2}$. $1 + \\dfrac{1}{2} = \\dfrac{3}{2}\\\\ 1 + \\dfrac{1}{2 + \\dfrac{1}{2}} = \\dfrac{7}{5}\\\\ 1 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2}}} = \\dfrac{17}{12}\\\\ 1 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2}}}} = \\dfrac{41}{29}$ -Hence the sequence of the first ten convergents for $\\sqrt{2}$ are: +Assim, a sequência dos primeiros dez convergentes onde $\\sqrt{2}$ é: $1, \\dfrac{3}{2}, \\dfrac{7}{5}, \\dfrac{17}{12}, \\dfrac{41}{29}, \\dfrac{99}{70}, \\dfrac{239}{169}, \\dfrac{577}{408}, \\dfrac{1393}{985}, \\dfrac{3363}{2378}, ...$ -What is most surprising is that the important mathematical constant, $e = \[2; 1, 2, 1, 1, 4, 1, 1, 6, 1, ... , 1, 2k, 1, ...]$. The first ten terms in the sequence of convergents for `e` are: +O que é mais surpreendente é a constante matemática, $e = \[2; 1, 2, 1, 1, 4, 1, 1, 6, 1, ... , 1, 2k, 1, ...]$. Os primeiros dez termos na sequência de convergentes para `e` são: $2, 3, \\dfrac{8}{3}, \\dfrac{11}{4}, \\dfrac{19}{7}, \\dfrac{87}{32}, \\dfrac{106}{39}, \\dfrac{193}{71}, \\dfrac{1264}{465}, \\dfrac{1457}{536}, ...$ -The sum of digits in the numerator of the 10th convergent is $1 + 4 + 5 + 7 = 17$. +A soma de algarismos no numerador do 10o convergente é $1 + 4 + 5 + 7 = 17$. -Find the sum of digits in the numerator of the `n`th convergent of the continued fraction for `e`. +Calcule a soma dos algarismos no numerador do `n`o convergente da fração contínua para `e`. # --hints-- -`convergentsOfE(10)` should return a number. +`convergentsOfE(10)` deve retornar um número. ```js assert(typeof convergentsOfE(10) === 'number'); ``` -`convergentsOfE(10)` should return `17`. +`convergentsOfE(10)` deve retornar `17`. ```js assert.strictEqual(convergentsOfE(10), 17); ``` -`convergentsOfE(30)` should return `53`. +`convergentsOfE(30)` deve retornar `53`. ```js assert.strictEqual(convergentsOfE(30), 53); ``` -`convergentsOfE(50)` should return `91`. +`convergentsOfE(50)` deve retornar `91`. ```js assert.strictEqual(convergentsOfE(50), 91); ``` -`convergentsOfE(70)` should return `169`. +`convergentsOfE(70)` deve retornar `169`. ```js assert.strictEqual(convergentsOfE(70), 169); ``` -`convergentsOfE(100)` should return `272`. +`convergentsOfE(100)` deve retornar `272`. ```js assert.strictEqual(convergentsOfE(100), 272); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-67-maximum-path-sum-ii.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-67-maximum-path-sum-ii.md index c3aa2fb6e3b..04f2429438d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-67-maximum-path-sum-ii.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-67-maximum-path-sum-ii.md @@ -1,6 +1,6 @@ --- id: 5900f3b01000cf542c50fec2 -title: 'Problem 67: Maximum path sum II' +title: 'Problema 67: Soma do caminho máximo II' challengeType: 1 forumTopicId: 302179 dashedName: problem-67-maximum-path-sum-ii @@ -8,7 +8,7 @@ dashedName: problem-67-maximum-path-sum-ii # --description-- -By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. +Começando no topo do triângulo abaixo e movendo-se para os números adjacentes na linha abaixo, o total máximo de cima para baixo é 23.
3
@@ -17,27 +17,27 @@ By starting at the top of the triangle below and moving to adjacent numbers on t 8 5 9 3
-That is, 3 + 7 + 4 + 9 = 23. +Ou seja, 3 + 7 + 4 + 9 = 23. -Find the maximum total from top to bottom in `numTriangle`, a 2D array defined in the background containing a triangle with one-hundred rows. +Calcule o total máximo de cima para baixo em `numTriangle`, um array 2D definido em segundo plano contendo um triângulo com cem linhas. -**Note:** This is a much more difficult version of Problem 18. It is not possible to try every route to solve this problem, as there are 299 altogether! If you could check one trillion (1012) routes every second it would take over twenty billion years to check them all. There is an efficient algorithm to solve it. ;o) +**Observação:** esta é uma versão muito mais difícil do Problema 18. Não é possível tentar todas as rotas para resolver este problema, pois há 299 rotas no total! Se você pudesse verificar um trilhão (1012) de rotas por segundo, levaria mais de vinte bilhões de anos para verificar todas elas. Existe um algoritmo eficaz para resolver esse problema. ;) # --hints-- -`maximumPathSumII(testTriangle)` should return a number. +`maximumPathSumII(testTriangle)` deve retornar um número. ```js assert(typeof maximumPathSumII(_testTriangle) === 'number'); ``` -`maximumPathSumII(testTriangle)` should return 23. +`maximumPathSumII(testTriangle)` deve retornar 23. ```js assert.strictEqual(maximumPathSumII(_testTriangle), 23); ``` -`maximumPathSumII(numTriangle)` should return 7273. +`maximumPathSumII(numTriangle)` deve retornar 7273. ```js assert.strictEqual(maximumPathSumII(_numTriangle), 7273); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-68-magic-5-gon-ring.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-68-magic-5-gon-ring.md index 7d8984cc7f8..b9b8d57a00e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-68-magic-5-gon-ring.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-68-magic-5-gon-ring.md @@ -1,6 +1,6 @@ --- id: 5900f3b01000cf542c50fec3 -title: 'Problem 68: Magic 5-gon ring' +title: 'Problema 68: Anel de 5 linhas mágicas' challengeType: 1 forumTopicId: 302180 dashedName: problem-68-magic-5-gon-ring @@ -8,17 +8,17 @@ dashedName: problem-68-magic-5-gon-ring # --description-- -Consider the following "magic" 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine. +Considere o seguinte anel de 3 linhas "mágicas" com números de 1 a 6. Note que ao somar os números de cada linha, o resultado é nove. -a completed example of a 3-gon ring +um exemplo completo de um anel de 3 linhas -Working **clockwise**, and starting from the group of three with the numerically lowest external node (4,3,2 in this example), each solution can be described uniquely. For example, the above solution can be described by the set: 4,3,2; 6,2,1; 5,1,3. +Trabalhando **no sentido horário** e começando pelo grupo onde o nó externo é numericamente menor (4, 3, 2 neste exemplo), cada solução pode ser descrita de forma única. Por exemplo, a solução acima pode ser descrita pelo conjunto: 4,3,2; 6,2,1; 5,1,3. -It is possible to complete the ring with four different totals: 9, 10, 11, and 12. There are eight solutions in total. +É possível completar o anel com quatro totais diferentes: 9, 10, 11 e 12. No total, há oito soluções.
-|
Total
|
Solution Set
| +|
Total
|
Conjunto da solução
| | -------------------------------------- | --------------------------------------------- | | 9 | 4,2,3; 5,3,1; 6,1,2 | | 9 | 4,3,2; 6,2,1; 5,1,3 | @@ -31,21 +31,21 @@ It is possible to complete the ring with four different totals: 9, 10, 11, and 1
-By concatenating each group it is possible to form 9-digit strings; the maximum string for a 3-gon ring is 432621513. +Ao concatenar cada grupo, é possível formar números de 9 algarismos; o maior número para um anel de 3 linhas é 432621513. -Using the numbers 1 to 10, and depending on arrangements, it is possible to form 16- and 17-digit strings. What is the maximum **16-digit** string for a "magic" 5-gon ring? +Usando os números de 1 a 10 e dependendo dos arranjos, é possível formar números de 16 e 17 algarismos. Qual é o maior número de **16 algarismos** em um anel de 5 linhas? -a blank diagram of a 5-gon ring +um diagrama em branco de um anel de 5 linhas # --hints-- -`magic5GonRing()` should return a number. +`magic5GonRing()` deve retornar um número. ```js assert(typeof magic5GonRing() === 'number'); ``` -`magic5GonRing()` should return 6531031914842725. +`magic5GonRing()` deve retornar 6531031914842725. ```js assert.strictEqual(magic5GonRing(), 6531031914842725); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-69-totient-maximum.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-69-totient-maximum.md index e57b133fbe7..c45c919dc4a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-69-totient-maximum.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-69-totient-maximum.md @@ -1,6 +1,6 @@ --- id: 5900f3b11000cf542c50fec4 -title: 'Problem 69: Totient maximum' +title: 'Problema 69: Totiente máximo' challengeType: 1 forumTopicId: 302181 dashedName: problem-69-totient-maximum @@ -8,7 +8,7 @@ dashedName: problem-69-totient-maximum # --description-- -Euler's Totient function, ${\phi}(n)$ (sometimes called the phi function), is used to determine the number of numbers less than `n` which are relatively prime to `n`. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, ${\phi}(9) = 6$. +A função Totiente de Euler, ${\phi}(n)$ (às vezes chamada de função phi), é usada para determinar a quantidade de números menores que `n`, que são primos próximos de `n`. Por exemplo, 1, 2, 4, 5, 7 e 8 são todos inferiores a nove e primos relativos de nove, ${\phi}(9) = 6$.
@@ -26,37 +26,37 @@ Euler's Totient function, ${\phi}(n)$ (sometimes called the phi function), is us
-It can be seen that `n` = 6 produces a maximum $\displaystyle\frac{n}{{\phi}(n)}$ for `n` ≤ 10. +Aqui, vemos que `n` = 6 produz um máximo $\displaystyle\frac{n}{{\phi}(n)}$, onde `n` ≤ 10. -Find the value of `n` ≤ `limit` for which $\displaystyle\frac{n}{{\phi(n)}}$ is a maximum. +Calcule o valor de `n` ≤ `limit` onde $\displaystyle\frac{n}{{\phi(n)}}$ é um máximo. # --hints-- -`totientMaximum(10)` should return a number. +`totientMaximum(10)` deve retornar um número. ```js assert(typeof totientMaximum(10) === 'number'); ``` -`totientMaximum(10)` should return `6`. +`totientMaximum(10)` deve retornar `6`. ```js assert.strictEqual(totientMaximum(10), 6); ``` -`totientMaximum(10000)` should return `2310`. +`totientMaximum(10000)` deve retornar `2310`. ```js assert.strictEqual(totientMaximum(10000), 2310); ``` -`totientMaximum(500000)` should return `30030`. +`totientMaximum(500000)` deve retornar `30030`. ```js assert.strictEqual(totientMaximum(500000), 30030); ``` -`totientMaximum(1000000)` should return `510510`. +`totientMaximum(1000000)` deve retornar `510510`. ```js assert.strictEqual(totientMaximum(1000000), 510510); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-70-totient-permutation.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-70-totient-permutation.md index 1328f1ca1e7..b9e0ca1ee28 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-70-totient-permutation.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-70-totient-permutation.md @@ -1,6 +1,6 @@ --- id: 5900f3b21000cf542c50fec5 -title: 'Problem 70: Totient permutation' +title: 'Problema 70: Permutações de totientes' challengeType: 1 forumTopicId: 302183 dashedName: problem-70-totient-permutation @@ -8,39 +8,39 @@ dashedName: problem-70-totient-permutation # --description-- -Euler's Totient function, ${\phi}(n)$ (sometimes called the phi function), is used to determine the number of positive numbers less than or equal to `n` which are relatively prime to `n`. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, ${\phi}(9) = 6$. The number 1 is considered to be relatively prime to every positive number, so ${\phi}(1) = 1$. +A função totiente de Euler, ${\phi}(n)$ (às vezes chamada de função phi), é usada para determinar a quantidade de números menores que `n`, que são primos próximos de `n`. Por exemplo, 1, 2, 4, 5, 7 e 8 são todos inferiores a nove e primos relativos de nove, ${\phi}(9) = 6$. O número 1 é considerado um primo relativo para todos os números positivos, portanto ${\phi}(1) = 1$. -Interestingly, ${\phi}(87109) = 79180$, and it can be seen that 87109 is a permutation of 79180. +Curiosamente, ${\phi}(87109) = 79180$, e pode ser visto que 87109 é uma permutação de 79180. -Find the value of `n`, 1 < `n` < `limit`, for which ${\phi}(n)$ is a permutation of `n` and the ratio $\displaystyle\frac{n}{{\phi}(n)}$ produces a minimum. +Encontre o valor de `n`, 1 < `n` < `limit`, onde ${\phi}(n)$ é uma permutação de `n` e a razão $\displaystyle\frac{n}{{\phi}(n)}$ produz um mínimo. # --hints-- -`totientPermutation(10000)` should return a number. +`totientPermutation(10000)` deve retornar um número. ```js assert(typeof totientPermutation(10000) === 'number'); ``` -`totientPermutation(10000)` should return `4435`. +`totientPermutation(10000)` deve retornar `4435`. ```js assert.strictEqual(totientPermutation(10000), 4435); ``` -`totientPermutation(100000)` should return `75841`. +`totientPermutation(100000)` deve retornar `75841`. ```js assert.strictEqual(totientPermutation(100000), 75841); ``` -`totientPermutation(500000)` should return `474883`. +`totientPermutation(500000)` deve retornar `474883`. ```js assert.strictEqual(totientPermutation(500000), 474883); ``` -`totientPermutation(10000000)` should return `8319823`. +`totientPermutation(10000000)` deve retornar `8319823`. ```js assert.strictEqual(totientPermutation(10000000), 8319823); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-71-ordered-fractions.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-71-ordered-fractions.md index 267a17669b0..67fbdcab5ba 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-71-ordered-fractions.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-71-ordered-fractions.md @@ -1,6 +1,6 @@ --- id: 5900f3b31000cf542c50fec6 -title: 'Problem 71: Ordered fractions' +title: 'Problema 71: Frações ordenadas' challengeType: 1 forumTopicId: 302184 dashedName: problem-71-ordered-fractions @@ -8,49 +8,49 @@ dashedName: problem-71-ordered-fractions # --description-- -Consider the fraction, $\frac{n}{d}$, where `n` and `d` are positive integers. If `n` < `d` and highest common factor, ${{HCF}(n, d)} = 1$, it is called a reduced proper fraction. +Considere a fração $\frac{n}{d}$, onde `n` e `d` são números inteiros e positivos. Se `n` < `d` e o maior divisor comum, ${{HCF}(n, d)} = 1$, ela é chamada de fração irredutível. -If we list the set of reduced proper fractions for `d` ≤ 8 in ascending order of size, we get: +Se nós listarmos o conjunto de frações irredutíveis onde `d` ≤ 8, em ordem ascendente, temos: $$\frac{1}{8}, \frac{1}{7}, \frac{1}{6}, \frac{1}{5}, \frac{1}{4}, \frac{2}{7}, \frac{1}{3}, \frac{3}{8}, \frac{\textbf2}{\textbf5}, \frac{3}{7}, \frac{1}{2}, \frac{4}{7}, \frac{3}{5}, \frac{5}{8}, \frac{2}{3}, \frac{5}{7}, \frac{3}{4}, \frac{4}{5}, \frac{5}{6}, \frac{6}{7}, \frac{7}{8}$$ -It can be seen that $\frac{2}{5}$ is the fraction immediately to the left of $\frac{3}{7}$. +Podemos ver que $\frac{2}{5}$ está imediatamente à esquerda de $\frac{3}{7}$. -By listing the set of reduced proper fractions for `d` ≤ `limit` in ascending order of size, find the numerator of the fraction immediately to the left of $\frac{3}{7}$. +Ao listar o conjunto de frações irredutíveis em ordem ascendente, onde `d` ≤ `limit`, encontre o numerador da fração imediatamente à esquerda de $\frac{3}{7}$. # --hints-- -`orderedFractions(8)` should return a number. +`orderedFractions(8)` deve retornar um número. ```js assert(typeof orderedFractions(8) === 'number'); ``` -`orderedFractions(8)` should return `2`. +`orderedFractions(8)` deve retornar `2`. ```js assert.strictEqual(orderedFractions(8), 2); ``` -`orderedFractions(10)` should return `2`. +`orderedFractions(10)` deve retornar `2`. ```js assert.strictEqual(orderedFractions(10), 2); ``` -`orderedFractions(9994)` should return `4283`. +`orderedFractions(9994)` deve retornar `4283`. ```js assert.strictEqual(orderedFractions(9994), 4283); ``` -`orderedFractions(500000)` should return `214283`. +`orderedFractions(500000)` deve retornar `214283`. ```js assert.strictEqual(orderedFractions(500000), 214283); ``` -`orderedFractions(1000000)` should return `428570`. +`orderedFractions(1000000)` deve retornar `428570`. ```js assert.strictEqual(orderedFractions(1000000), 428570); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-72-counting-fractions.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-72-counting-fractions.md index dab392ae0ae..08cdab8e882 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-72-counting-fractions.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-72-counting-fractions.md @@ -1,6 +1,6 @@ --- id: 5900f3b41000cf542c50fec7 -title: 'Problem 72: Counting fractions' +title: 'Problema 72: Contando frações' challengeType: 1 forumTopicId: 302185 dashedName: problem-72-counting-fractions @@ -8,43 +8,43 @@ dashedName: problem-72-counting-fractions # --description-- -Consider the fraction, $\frac{n}{d}$, where `n` and `d` are positive integers. If `n` < `d` and highest common factor, ${HCF}(n, d) = 1$, it is called a reduced proper fraction. +Considere a fração $\frac{n}{d}$, onde `n` e `d` são números inteiros e positivos. Se `n` < `d` e o maior divisor comum, ${HCF}(n, d) = 1$, ela é chamada de fração irredutível. -If we list the set of reduced proper fractions for `d` ≤ 8 in ascending order of size, we get: +Se nós listarmos o conjunto de frações irredutíveis onde `d` ≤ 8, em ordem ascendente, temos: $$\frac{1}{8}, \frac{1}{7}, \frac{1}{6}, \frac{1}{5}, \frac{1}{4}, \frac{2}{7}, \frac{1}{3}, \frac{3}{8}, \frac{2}{5}, \frac{3}{7}, \frac{1}{2}, \frac{4}{7}, \frac{3}{5}, \frac{5}{8}, \frac{2}{3}, \frac{5}{7}, \frac{3}{4}, \frac{4}{5}, \frac{5}{6}, \frac{6}{7}, \frac{7}{8}$$ -It can be seen that there are `21` elements in this set. +Podemos notar que há `21` elementos neste conjunto. -How many elements would be contained in the set of reduced proper fractions for `d` ≤ `limit`? +Quantos elementos existem no conjunto de frações irredutíveis onde `d` ≤ `limit`? # --hints-- -`countingFractions(8)` should return a number. +`countingFractions(8)` deve retornar um número. ```js assert(typeof countingFractions(8) === 'number'); ``` -`countingFractions(8)` should return `21`. +`countingFractions(8)` deve retornar `21`. ```js assert.strictEqual(countingFractions(8), 21); ``` -`countingFractions(20000)` should return `121590395`. +`countingFractions(20000)` deve retornar `121590395`. ```js assert.strictEqual(countingFractions(20000), 121590395); ``` -`countingFractions(500000)` should return `75991039675`. +`countingFractions(500000)` deve retornar `75991039675`. ```js assert.strictEqual(countingFractions(500000), 75991039675); ``` -`countingFractions(1000000)` should return `303963552391`. +`countingFractions(1000000)` deve retornar `303963552391`. ```js assert.strictEqual(countingFractions(1000000), 303963552391); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-73-counting-fractions-in-a-range.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-73-counting-fractions-in-a-range.md index b53ef258385..fa65821c495 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-73-counting-fractions-in-a-range.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-73-counting-fractions-in-a-range.md @@ -1,6 +1,6 @@ --- id: 5900f3b61000cf542c50fec8 -title: 'Problem 73: Counting fractions in a range' +title: 'Problema 73: Contando frações em um intervalo' challengeType: 1 forumTopicId: 302186 dashedName: problem-73-counting-fractions-in-a-range @@ -8,43 +8,43 @@ dashedName: problem-73-counting-fractions-in-a-range # --description-- -Consider the fraction, $\frac{n}{d}$, where `n` and `d` are positive integers. If `n` < `d` and highest common factor, ${HCF}(n, d) = 1$, it is called a reduced proper fraction. +Considere a fração $\frac{n}{d}$, onde `n` e `d` são números inteiros e positivos. Se `n` < `d` e o maior divisor comum, ${HCF}(n, d) = 1$, ela é chamada de fração irredutível. -If we list the set of reduced proper fractions for `d` ≤ 8 in ascending order of size, we get: +Se nós listarmos o conjunto de frações irredutíveis onde `d` ≤ 8, em ordem ascendente, temos: $$\frac{1}{8}, \frac{1}{7}, \frac{1}{6}, \frac{1}{5}, \frac{1}{4}, \frac{2}{7}, \frac{1}{3}, \mathbf{\frac{3}{8}, \frac{2}{5}, \frac{3}{7}}, \frac{1}{2}, \frac{4}{7}, \frac{3}{5}, \frac{5}{8}, \frac{2}{3}, \frac{5}{7}, \frac{3}{4}, \frac{4}{5}, \frac{5}{6}, \frac{6}{7}, \frac{7}{8}$$ -It can be seen that there are `3` fractions between $\frac{1}{3}$ and $\frac{1}{2}$. +Podemos notar que há `3` frações entre $\frac{1}{3}$ e $\frac{1}{2}$. -How many fractions lie between $\frac{1}{3}$ and $\frac{1}{2}$ in the sorted set of reduced proper fractions for `d` ≤ `limit`? +Quantas frações estão entre $\frac{1}{3}$ e $\frac{1}{2}$ no conjunto de frações irredutíveis, onde `d` ≤ `limit`? # --hints-- -`countingFractionsInARange(8)` should return a number. +`countingFractionsInARange(8)` deve retornar um número. ```js assert(typeof countingFractionsInARange(8) === 'number'); ``` -`countingFractionsInARange(8)` should return `3`. +`countingFractionsInARange(8)` deve retornar `3`. ```js assert.strictEqual(countingFractionsInARange(8), 3); ``` -`countingFractionsInARange(1000)` should return `50695`. +`countingFractionsInARange(1000)` deve retornar `50695`. ```js assert.strictEqual(countingFractionsInARange(1000), 50695); ``` -`countingFractionsInARange(6000)` should return `1823861`. +`countingFractionsInARange(6000)` deve retornar `1823861`. ```js assert.strictEqual(countingFractionsInARange(6000), 1823861); ``` -`countingFractionsInARange(12000)` should return `7295372`. +`countingFractionsInARange(12000)` deve retornar `7295372`. ```js assert.strictEqual(countingFractionsInARange(12000), 7295372); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-74-digit-factorial-chains.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-74-digit-factorial-chains.md index 0b94dee88dd..b2cecc7518b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-74-digit-factorial-chains.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-74-digit-factorial-chains.md @@ -1,6 +1,6 @@ --- id: 5900f3b61000cf542c50fec9 -title: 'Problem 74: Digit factorial chains' +title: 'Problema 74: Cadeia de fatoriais' challengeType: 1 forumTopicId: 302187 dashedName: problem-74-digit-factorial-chains @@ -8,53 +8,53 @@ dashedName: problem-74-digit-factorial-chains # --description-- -The number 145 is well known for the property that the sum of the factorial of its digits is equal to 145: +O número 145 é conhecido pela propriedade onde a soma do fatorial de seus algarismos é igual a 145: $$1! + 4! + 5! = 1 + 24 + 120 = 145$$ -Perhaps less well known is 169, in that it produces the longest chain of numbers that link back to 169; it turns out that there are only three such loops that exist: +Talvez 169 seja menos conhecido. Esse número produz a maior cadeia de números que remonta a 169. Acontece que existem apenas três desses laços: $$\begin{align} &169 → 363601 → 1454 → 169\\\\ &871 → 45361 → 871\\\\ &872 → 45362 → 872\\\\ \end{align}$$ -It is not difficult to prove that EVERY starting number will eventually get stuck in a loop. For example, +Não é difícil provar que TODOS os números com que você iniciar ficarão presos em um ciclo. Por exemplo: $$\begin{align} &69 → 363600 → 1454 → 169 → 363601\\ (→ 1454)\\\\ &78 → 45360 → 871 → 45361\\ (→ 871)\\\\ &540 → 145\\ (→ 145)\\\\ \end{align}$$ -Starting with 69 produces a chain of five non-repeating terms, but the longest non-repeating chain with a starting number below one million is sixty terms. +O número 69 produz uma cadeia de cinco termos sem repetição. A cadeia de maior número sem repetição, iniciando com um número abaixo de um milhão, é de sessenta termos. -How many chains, with a starting number below `n`, contain exactly sixty non-repeating terms? +Quantas cadeias, com um número inicial abaixo de `n`, contém exatamente sessenta termos não repetidos? # --hints-- -`digitFactorialChains(2000)` should return a number. +`digitFactorialChains(2000)` deve retornar um número. ```js assert(typeof digitFactorialChains(2000) === 'number'); ``` -`digitFactorialChains(2000)` should return `6`. +`digitFactorialChains(2000)` deve retornar `6`. ```js assert.strictEqual(digitFactorialChains(2000), 6); ``` -`digitFactorialChains(100000)` should return `42`. +`digitFactorialChains(100000)` deve retornar `42`. ```js assert.strictEqual(digitFactorialChains(100000), 42); ``` -`digitFactorialChains(500000)` should return `282`. +`digitFactorialChains(500000)` deve retornar `282`. ```js assert.strictEqual(digitFactorialChains(500000), 282); ``` -`digitFactorialChains(1000000)` should return `402`. +`digitFactorialChains(1000000)` deve retornar `402`. ```js assert.strictEqual(digitFactorialChains(1000000), 402); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-76-counting-summations.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-76-counting-summations.md index 04a358b584d..5ff26de5fb4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-76-counting-summations.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-76-counting-summations.md @@ -1,6 +1,6 @@ --- id: 5900f3b81000cf542c50fecb -title: 'Problem 76: Counting summations' +title: 'Problema 76: Contagem de somas' challengeType: 1 forumTopicId: 302189 dashedName: problem-76-counting-summations @@ -8,7 +8,7 @@ dashedName: problem-76-counting-summations # --description-- -It is possible to write five as a sum in exactly six different ways: +É possível chegar ao resultado 5 a partir de uma soma de seis formas diferentes:
4 + 1
@@ -19,35 +19,35 @@ It is possible to write five as a sum in exactly six different ways: 1 + 1 + 1 + 1 + 1

-How many different ways can `n` be written as a sum of at least two positive integers? +De quantas formas diferentes `n` pode ser escrito como o resultado de uma soma de pelo menos dois números inteiros positivos? # --hints-- -`countingSummations(5)` should return a number. +`countingSummations(5)` deve retornar um número. ```js assert(typeof countingSummations(5) === 'number'); ``` -`countingSummations(5)` should return `6`. +`countingSummations(5)` deve retornar `6`. ```js assert.strictEqual(countingSummations(5), 6); ``` -`countingSummations(20)` should return `626`. +`countingSummations(20)` deve retornar `626`. ```js assert.strictEqual(countingSummations(20), 626); ``` -`countingSummations(50)` should return `204225`. +`countingSummations(50)` deve retornar `204225`. ```js assert.strictEqual(countingSummations(50), 204225); ``` -`countingSummations(100)` should return `190569291`. +`countingSummations(100)` deve retornar `190569291`. ```js assert.strictEqual(countingSummations(100), 190569291); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-77-prime-summations.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-77-prime-summations.md index a5639dc73a4..9279f495b2e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-77-prime-summations.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-77-prime-summations.md @@ -1,6 +1,6 @@ --- id: 5900f3b91000cf542c50fecc -title: 'Problem 77: Prime summations' +title: 'Problema 77: Contagem de primos' challengeType: 1 forumTopicId: 302190 dashedName: problem-77-prime-summations @@ -8,7 +8,7 @@ dashedName: problem-77-prime-summations # --description-- -It is possible to write ten as the sum of primes in exactly five different ways: +É possível chegar a 10 como resultado a partir de uma soma de números primos de cinco formas diferentes:
7 + 3
@@ -18,35 +18,35 @@ It is possible to write ten as the sum of primes in exactly five different ways: 2 + 2 + 2 + 2 + 2

-What is the first value which can be written as the sum of primes in over `n` ways? +Qual é o primeiro valor que pode ser escrito como a soma de números primos de `n` maneiras? # --hints-- -`primeSummations(5)` should return a number. +`primeSummations(5)` deve retornar um número. ```js assert(typeof primeSummations(5) === 'number'); ``` -`primeSummations(5)` should return `11`. +`primeSummations(5)` deve retornar `11`. ```js assert.strictEqual(primeSummations(5), 11); ``` -`primeSummations(100)` should return `31`. +`primeSummations(100)` deve retornar `31`. ```js assert.strictEqual(primeSummations(100), 31); ``` -`primeSummations(1000)` should return `53`. +`primeSummations(1000)` deve retornar `53`. ```js assert.strictEqual(primeSummations(1000), 53); ``` -`primeSummations(5000)` should return `71`. +`primeSummations(5000)` deve retornar `71`. ```js assert.strictEqual(primeSummations(5000), 71); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-78-coin-partitions.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-78-coin-partitions.md index 65d3ebad7e4..7d9a84c2fb3 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-78-coin-partitions.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-78-coin-partitions.md @@ -1,6 +1,6 @@ --- id: 5900f3ba1000cf542c50fecd -title: 'Problem 78: Coin partitions' +title: 'Problema 78: Partições de moedas' challengeType: 1 forumTopicId: 302191 dashedName: problem-78-coin-partitions @@ -8,51 +8,51 @@ dashedName: problem-78-coin-partitions # --description-- -Let ${p}(n)$ represent the number of different ways in which `n` coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so ${p}(5) = 7$. +Consideremos que ${p}(n)$ representa o número de diferentes maneiras pelas quais `n` moedas podem ser separadas em pilhas. Por exemplo, cinco moedas podem ser separadas em pilhas de exatamente sete maneiras diferentes, então ${p}(5) = 7$.
-| Coin piles | +| Pilhas de moedas | | ----------------- | | OOOOO | -| OOOO   O | -| OOO   OO | -| OOO   O   O | -| OO   OO   O | -| OO   O   O   O | -| O   O   O   O   O | +| OOOO O | +| OOO OO | +| OOO O O | +| OO OO O | +| OO O O O | +| O O O O O |

-Find the least value of `n` for which ${p}(n)$ is divisible by `divisor`. +Encontre o menor valor de `n` para o qual ${p}(n)$ é divisível pelo `divisor`. # --hints-- -`coinPartitions(7)` should return a number. +`coinPartitions(7)` deve retornar um número. ```js assert(typeof coinPartitions(7) === 'number'); ``` -`coinPartitions(7)` should return `5`. +`coinPartitions(7)` deve retornar `5`. ```js assert.strictEqual(coinPartitions(7), 5); ``` -`coinPartitions(10000)` should return `599`. +`coinPartitions(10000)` deve retornar `599`. ```js assert.strictEqual(coinPartitions(10000), 599); ``` -`coinPartitions(100000)` should return `11224`. +`coinPartitions(100000)` deve retornar `11224`. ```js assert.strictEqual(coinPartitions(100000), 11224); ``` -`coinPartitions(1000000)` should return `55374`. +`coinPartitions(1000000)` deve retornar `55374`. ```js assert.strictEqual(coinPartitions(1000000), 55374); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-80-square-root-digital-expansion.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-80-square-root-digital-expansion.md index 34d7dd6eea4..31f07b84d42 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-80-square-root-digital-expansion.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-80-square-root-digital-expansion.md @@ -1,6 +1,6 @@ --- id: 5900f3bc1000cf542c50fecf -title: 'Problem 80: Square root digital expansion' +title: 'Problema 80: Expansão de algarismos da raiz quadrada' challengeType: 1 forumTopicId: 302194 dashedName: problem-80-square-root-digital-expansion @@ -8,33 +8,33 @@ dashedName: problem-80-square-root-digital-expansion # --description-- -It is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite without any repeating pattern at all. +É do conhecimento geral que se a raiz quadrada de um número natural não é um número inteiro, então é irracional. A expansão decimal de tais raízes quadradas é infinita sem qualquer tipo de padrão de repetição. -The square root of two is `1.41421356237309504880...`, and the digital sum of the first one hundred decimal digits is `475`. +A raiz quadrada de dois é `1.41421356237309504880...`. A soma dos algarismos das primeiras cem casas decimais é `475`. -For the first `n` natural numbers, find the total of the digital sums of the first one hundred decimal digits for all the irrational square roots. +Para os primeiros `n` números naturais, encontre o total das somas dos algarismos das primeiras cem casas decimais para todas as raízes quadradas irracionais. # --hints-- -`sqrtDigitalExpansion(2)` should return a number. +`sqrtDigitalExpansion(2)` deve retornar um número. ```js assert(typeof sqrtDigitalExpansion(2) === 'number'); ``` -`sqrtDigitalExpansion(2)` should return `475`. +`sqrtDigitalExpansion(2)` deve retornar `475`. ```js assert.strictEqual(sqrtDigitalExpansion(2), 475); ``` -`sqrtDigitalExpansion(50)` should return `19543`. +`sqrtDigitalExpansion(50)` deve retornar `19543`. ```js assert.strictEqual(sqrtDigitalExpansion(50), 19543); ``` -`sqrtDigitalExpansion(100)` should return `40886`. +`sqrtDigitalExpansion(100)` deve retornar `40886`. ```js assert.strictEqual(sqrtDigitalExpansion(100), 40886); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-81-path-sum-two-ways.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-81-path-sum-two-ways.md index 5fe3982048f..96c222658d2 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-81-path-sum-two-ways.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-81-path-sum-two-ways.md @@ -1,6 +1,6 @@ --- id: 5900f3bd1000cf542c50fed0 -title: 'Problem 81: Path sum: two ways' +title: 'Problema 81: Soma dos caminhos: duas formas' challengeType: 1 forumTopicId: 302195 dashedName: problem-81-path-sum-two-ways @@ -8,29 +8,29 @@ dashedName: problem-81-path-sum-two-ways # --description-- -In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by **only moving to the right and down**, is indicated in bold red and is equal to `2427`. +Na matriz de 5 por 5 abaixo, a soma do caminho mínimo do canto superior esquerdo até o canto inferior direito, **movendo-se somente para a direita e para baixo**, é indicado em vermelho e em negrito e é igual a `2427`. $$\begin{pmatrix} \color{red}{131} & 673 & 234 & 103 & 18\\\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\ 630 & 803 & \color{red}{746} & \color{red}{422} & 111\\\\ 537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$ -Find the minimal path sum from the top left to the bottom right by only moving right and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in the tests will be 80 by 80. +Encontre a soma do caminho mínimo, do canto superior esquerdo para o canto inferior direito, movendo-se apenas para a direita e para baixo, na `matrix`, um array bidimensional que representa uma matriz. O tamanho máximo da matriz utilizado nos testes será de 80 por 80. # --hints-- -`pathSumTwoWays(testMatrix1)` should return a number. +`pathSumTwoWays(testMatrix1)` deve retornar um número. ```js assert(typeof pathSumTwoWays(_testMatrix1) === 'number'); ``` -`pathSumTwoWays(testMatrix1)` should return `2427`. +`pathSumTwoWays(testMatrix1)` deve retornar `2427`. ```js assert.strictEqual(pathSumTwoWays(_testMatrix1), 2427); ``` -`pathSumTwoWays(testMatrix2)` should return `427337`. +`pathSumTwoWays(testMatrix2)` deve retornar `427337`. ```js assert.strictEqual(pathSumTwoWays(_testMatrix2), 427337); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-82-path-sum-three-ways.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-82-path-sum-three-ways.md index 0895540d468..6cd92b48360 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-82-path-sum-three-ways.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-82-path-sum-three-ways.md @@ -1,6 +1,6 @@ --- id: 5900f3be1000cf542c50fed1 -title: 'Problem 82: Path sum: three ways' +title: 'Problema 82: Soma dos caminhos: três formas' challengeType: 1 forumTopicId: 302196 dashedName: problem-82-path-sum-three-ways @@ -8,31 +8,31 @@ dashedName: problem-82-path-sum-three-ways # --description-- -**Note:** This problem is a more challenging version of Problem 81. +**Observação:** este problema é uma versão mais difícil do Problema 81. -The minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finishing in any cell in the right column, and only moving up, down, and right, is indicated in red and bold; the sum is equal to `994`. +A soma do caminho mínimo da matriz de 5 por 5 abaixo, iniciando em qualquer célula na coluna da esquerda e terminando em qualquer célula na coluna da direita, e apenas se movendo para cima, para baixo e para a direita, é indicado em vermelho e em negrito. A soma é igual a `994`. $$\begin{pmatrix} 131 & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\ 630 & 803 & 746 & 422 & 111\\\\ 537 & 699 & 497 & 121 & 956\\\\ 805 & 732 & 524 & 37 & 331 \end{pmatrix}$$ -Find the minimal path sum from the left column to the right column in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80. +Encontre a soma do caminho mínimo, da coluna da esquerda para a coluna da direita, na `matrix`, um array bidimensional que representa uma matriz. O tamanho máximo da matriz utilizado nos testes será de 80 por 80. # --hints-- -`pathSumThreeWays(testMatrix1)` should return a number. +`pathSumThreeWays(testMatrix1)` deve retornar um número. ```js assert(typeof pathSumThreeWays(_testMatrix1) === 'number'); ``` -`pathSumThreeWays(testMatrix1)` should return `994`. +`pathSumThreeWays(testMatrix1)` deve retornar `994`. ```js assert.strictEqual(pathSumThreeWays(_testMatrix1), 994); ``` -`pathSumThreeWays(testMatrix2)` should return `260324`. +`pathSumThreeWays(testMatrix2)` deve retornar `260324`. ```js assert.strictEqual(pathSumThreeWays(_testMatrix2), 260324); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-83-path-sum-four-ways.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-83-path-sum-four-ways.md index 8d3b60e0c0b..29247f6bb47 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-83-path-sum-four-ways.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-83-path-sum-four-ways.md @@ -1,6 +1,6 @@ --- id: 5900f3bf1000cf542c50fed2 -title: 'Problem 83: Path sum: four ways' +title: 'Problema 83: Soma dos caminhos: quatro formas' challengeType: 1 forumTopicId: 302197 dashedName: problem-83-path-sum-four-ways @@ -8,31 +8,31 @@ dashedName: problem-83-path-sum-four-ways # --description-- -**Note:** This problem is a significantly more challenging version of Problem 81. +**Observação:** este problema é uma versão significativamente mais difícil do Problema 81. -In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by moving left, right, up, and down, is indicated in bold red and is equal to `2297`. +Na matriz de 5 por 5 abaixo, a soma do caminho mínimo do canto superior esquerdo até o canto inferior direito, movendo-se para a esquerda, para a direita, para cima e para baixo, é indicado em vermelho e em negrito e é igual a `2297`. $$\begin{pmatrix} \color{red}{131} & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & \color{red}{150}\\\\ 630 & 803 & 746 & \color{red}{422} & \color{red}{111}\\\\ 537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$ -Find the minimal path sum from the top left to the bottom right by moving left, right, up, and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80. +Encontre a soma do caminho mínimo, do canto superior esquerdo para o canto inferior direito, movendo-se para a esquerda, para a direita, para cima e para baixo, na `matrix`, um array bidimensional que representa uma matriz. O tamanho máximo da matriz utilizado nos testes será de 80 por 80. # --hints-- -`pathSumFourWays(testMatrix1)` should return a number. +`pathSumFourWays(testMatrix1)` deve retornar um número. ```js assert(typeof pathSumFourWays(_testMatrix1) === 'number'); ``` -`pathSumFourWays(testMatrix1)` should return `2297`. +`pathSumFourWays(testMatrix1)` deve retornar `2297`. ```js assert.strictEqual(pathSumFourWays(_testMatrix1), 2297); ``` -`pathSumFourWays(testMatrix2)` should return `425185`. +`pathSumFourWays(testMatrix2)` deve retornar `425185`. ```js assert.strictEqual(pathSumFourWays(_testMatrix2), 425185); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-84-monopoly-odds.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-84-monopoly-odds.md index 92c630f9429..97e5899b5e4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-84-monopoly-odds.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-84-monopoly-odds.md @@ -1,6 +1,6 @@ --- id: 5900f3c11000cf542c50fed3 -title: 'Problem 84: Monopoly odds' +title: 'Problem 84: Probabilidades no Monopoly' challengeType: 1 forumTopicId: 302198 dashedName: problem-84-monopoly-odds @@ -8,7 +8,7 @@ dashedName: problem-84-monopoly-odds # --description-- -In the game, *Monopoly*, the standard board is set up in the following way: +No jogo, *Monopoly*, o tabuleiro padrão é configurado da seguinte maneira:
@@ -88,69 +88,69 @@ In the game, *Monopoly*, the standard board is set up in the following way:

-A player starts on the GO square and adds the scores on two 6-sided dice to determine the number of squares they advance in a clockwise direction. Without any further rules we would expect to visit each square with equal probability: 2.5%. However, landing on G2J (Go To Jail), CC (community chest), and CH (chance) changes this distribution. +Um jogador começa no quadrado GO e adiciona as pontuações de dois dados de 6 lados para determinar o número de quadrados que ele avança no sentido horário. Sem adicionarmos outras regras, esperaríamos visitar cada quadrado com igual probabilidade: 2,5%. No entanto, cair em G2J (Go To Jail), CC (Community Chest) e CH (Chance) altera esta distribuição. -In addition to G2J, and one card from each of CC and CH, that orders the player to go directly to jail, if a player rolls three consecutive doubles, they do not advance the result of their 3rd roll. Instead they proceed directly to jail. +Além de G2J e de uma carta de cada, CC e CH, que ordena ao jogador que vá diretamente para a prisão, se um jogador rolar o mesmo número nos dois dados três vezes seguidas, eles não avançam o resultado da terceira jogada. Em vez disso, eles vão para a prisão diretamente. -At the beginning of the game, the CC and CH cards are shuffled. When a player lands on CC or CH they take a card from the top of the respective pile and, after following the instructions, it is returned to the bottom of the pile. There are sixteen cards in each pile, but for the purpose of this problem we are only concerned with cards that order a movement; any instruction not concerned with movement will be ignored and the player will remain on the CC/CH square. +No início do jogo, as cartas de CC e de CH são embaralhadas. Quando um jogador cai em CC ou em CH, ele tira uma carta do topo da pilha respectiva e, após seguir as instruções, ela é retornada para o fim da pilha. Existem dezesseis cartas em cada pilha, mas, para efeito deste problema, nos preocupamos apenas com as cartas que ordenam um movimento; qualquer instrução que não tenha a ver com movimento será ignorada e o jogador permanecerá no quadrado CC/CH. -The heart of this problem concerns the likelihood of visiting a particular square. That is, the probability of finishing at that square after a roll. For this reason it should be clear that, with the exception of G2J for which the probability of finishing on it is zero, the CH squares will have the lowest probabilities, as 5/8 request a movement to another square, and it is the final square that the player finishes at on each roll that we are interested in. We shall make no distinction between "Just Visiting" and being sent to JAIL, and we shall also ignore the rule about requiring a double to "get out of jail", assuming that they pay to get out on their next turn. +O centro deste problema diz respeito à possibilidade de visitar um determinado quadrado. Ou seja, a probabilidade de terminar naquele quadrado depois de uma jogada dos dados. Por esta razão, deveria ficar claro que, com a exceção de G2J, para o qual a probabilidade de terminar em cima dela é zero, os quadrados em CH terão as menores probabilidades, já que 5 a cada 8 solicitam um movimento para outro quadrado e é o último quadrado em que o jogador fica em cada jogada que nos interessa. Não estabeleceremos qualquer distinção entre o "Just Visiting" (estar só de passagem) e ser enviado para JAIL (prisão). Também ignoraremos a regra sobre a exigência de uma rolada de dois números iguais nos dados para "sair da cadeia", assumindo que eles pagam para sair no próximo turno. -By starting at GO and numbering the squares sequentially from 00 to 39 we can concatenate these two-digit numbers to produce strings that correspond with sets of squares. +Começando em GO e numerando os quadrados sequencialmente, de 00 a 39, podemos concatenar esses números de dois algarismos para produzir strings que correspondem a conjuntos de quadrados. -Statistically it can be shown that the three most popular squares, in order, are JAIL (6.24%) = Square 10, E3 (3.18%) = Square 24, and GO (3.09%) = Square 00. So these three most popular squares can be listed with the six-digit modal string `102400`. +Estatisticamente, pode ser mostrado que os três quadrados mais populares, em ordem, são JAIL (6,24%) = Quadrado 10, E3 (3,18%) = Quadrado 24 e GO (3,09%) = Quadrado 00. Então, esses três quadrados mais populares podem ser listados com a string modal de seis algarismos `102400`. -If, instead of using two 6-sided dice, two `n`-sided dice are used, find the six-digit modal string. +Se, ao invés de usar dois dados de 6 lados, dois dados de `n` lados forem usados, encontre a string modal de 6 algarismos. # --hints-- -`monopolyOdds(8)` should return a string. +`monopolyOdds(8)` deve retornar uma string. ```js assert(typeof monopolyOdds(8) === 'string'); ``` -`monopolyOdds(8)` should return string `102400`. +`monopolyOdds(8)` deve retornar a string `102400`. ```js assert.strictEqual(monopolyOdds(8), '102400'); ``` -`monopolyOdds(10)` should return string `100024`. +`monopolyOdds(10)` deve retornar a string `100024`. ```js assert.strictEqual(monopolyOdds(10), '100024'); ``` -`monopolyOdds(20)` should return string `100005`. +`monopolyOdds(20)` deve retornar a string `100005`. ```js assert.strictEqual(monopolyOdds(20), '100005'); ``` -`monopolyOdds(4)` should return string `101524`. +`monopolyOdds(4)` deve retornar a string `101524`. ```js assert.strictEqual(monopolyOdds(4), '101524'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-85-counting-rectangles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-85-counting-rectangles.md index eafbccb8aee..65fb6427f14 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-85-counting-rectangles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-85-counting-rectangles.md @@ -1,6 +1,6 @@ --- id: 5900f3c11000cf542c50fed4 -title: 'Problem 85: Counting rectangles' +title: 'Problema 85: Contagem de retângulos' challengeType: 1 forumTopicId: 302199 dashedName: problem-85-counting-rectangles @@ -8,45 +8,45 @@ dashedName: problem-85-counting-rectangles # --description-- -By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles: +Se contarmos com cuidado, poderemos ver que uma grade retangular que mede 3 por 2 contém dezoito retângulos: -a diagram of the different rectangles found within a 3 by 2 rectangular grid +um diagrama de retângulos diferentes encontrados dentro de uma grade retangular de 3 por 2 -Although there may not exists a rectangular grid that contains exactly `n` rectangles, find the area of the grid with the nearest solution. +Embora possa não existir uma grade retangular que contenha exatamente `n` retângulos, calcule a área da grade com a solução mais próxima. # --hints-- -`countingRectangles(18)` should return a number. +`countingRectangles(18)` deve retornar um número. ```js assert(typeof countingRectangles(18) === 'number'); ``` -`countingRectangles(18)` should return `6`. +`countingRectangles(18)` deve retornar `6`. ```js assert.strictEqual(countingRectangles(18), 6); ``` -`countingRectangles(250)` should return `22`. +`countingRectangles(250)` deve retornar `22`. ```js assert.strictEqual(countingRectangles(250), 22); ``` -`countingRectangles(50000)` should return `364`. +`countingRectangles(50000)` deve retornar `364`. ```js assert.strictEqual(countingRectangles(50000), 364); ``` -`countingRectangles(1000000)` should return `1632`. +`countingRectangles(1000000)` deve retornar `1632`. ```js assert.strictEqual(countingRectangles(1000000), 1632); ``` -`countingRectangles(2000000)` should return `2772`. +`countingRectangles(2000000)` deve retornar `2772`. ```js assert.strictEqual(countingRectangles(2000000), 2772); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-86-cuboid-route.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-86-cuboid-route.md index 39a860bd794..c5145c4dc6e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-86-cuboid-route.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-86-cuboid-route.md @@ -1,6 +1,6 @@ --- id: 5900f3c31000cf542c50fed5 -title: 'Problem 86: Cuboid route' +title: 'Problema 86: Rota de um cuboide' challengeType: 1 forumTopicId: 302200 dashedName: problem-86-cuboid-route @@ -8,43 +8,43 @@ dashedName: problem-86-cuboid-route # --description-- -A spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3, and a fly, F, sits in the opposite corner. By travelling on the surfaces of the room the shortest "straight line" distance from S to F is 10 and the path is shown on the diagram. +Uma aranha, S, está no canto de uma sala em formato de cubo, medindo 6 por 5 por 3, e uma mosca, F, fica no canto oposto. Ao passear pelas superfícies da sala, a menor distância de "linha reta" entre S e F é 10 e o caminho é mostrado no diagrama. -a diagram of a spider and fly's path from one corner of a cuboid room to the opposite corner +um diagrama do caminho entre uma aranha e uma mosca a partir de um canto de uma sala no formato de cubo até o canto oposto -However, there are up to three "shortest" path candidates for any given cuboid and the shortest route doesn't always have integer length. +No entanto, há até três candidatos a caminhos "mais curtos" para qualquer cuboide dado. O caminho mais curto nem sempre tem o tamanho expresso em números inteiros. -It can be shown that there are exactly `2060` distinct cuboids, ignoring rotations, with integer dimensions, up to a maximum size of M by M by M, for which the shortest route has integer length when M = 100. This is the least value of M for which the number of solutions first exceeds two thousand; the number of solutions when M = 99 is `1975`. +Pode-se mostrar aqui que há exatamente `2060` cubos distintos, ignorando rotações, com dimensões inteiras, até um tamanho máximo de M por M por M, para os quais a rota mais curta tem comprimento inteiro quando M = 100. Este é o menor valor de M para o qual o número de soluções excede duas mil. O número de soluções quando M = 99 é `1975`. -Find the least value of M such that the number of solutions first exceeds `n`. +Encontre o menor valor de M, de modo que o número de soluções exceda `n`. # --hints-- -`cuboidRoute(2000)` should return a number. +`cuboidRoute(2000)` deve retornar um número. ```js assert(typeof cuboidRoute(2000) === 'number'); ``` -`cuboidRoute(2000)` should return `100`. +`cuboidRoute(2000)` deve retornar `100`. ```js assert.strictEqual(cuboidRoute(2000), 100); ``` -`cuboidRoute(25000)` should return `320`. +`cuboidRoute(25000)` deve retornar `320`. ```js assert.strictEqual(cuboidRoute(25000), 320); ``` -`cuboidRoute(500000)` should return `1309`. +`cuboidRoute(500000)` deve retornar `1309`. ```js assert.strictEqual(cuboidRoute(500000), 1309); ``` -`cuboidRoute(1000000)` should return `1818`. +`cuboidRoute(1000000)` deve retornar `1818`. ```js assert.strictEqual(cuboidRoute(1000000), 1818); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-87-prime-power-triples.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-87-prime-power-triples.md index a6c51eff68d..44680801d59 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-87-prime-power-triples.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-87-prime-power-triples.md @@ -1,6 +1,6 @@ --- id: 5900f3c51000cf542c50fed8 -title: 'Problem 87: Prime power triples' +title: 'Problema 87: Trios de potência de primos' challengeType: 1 forumTopicId: 302201 dashedName: problem-87-prime-power-triples @@ -8,7 +8,7 @@ dashedName: problem-87-prime-power-triples # --description-- -The smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is `28`. In fact, there are exactly four numbers below fifty that can be expressed in such a way: +O menor número que pode ser expresso como a soma de um quadrado de primo, cubo de primos e primos na quarta potência é `28`. Na verdade, há exatamente quatro números abaixo de cinquenta que podem ser expressos dessa forma:
28 = 22 + 23 + 24
@@ -17,41 +17,41 @@ The smallest number expressible as the sum of a prime square, prime cube, and pr 47 = 22 + 33 + 24

-How many numbers below `n` can be expressed as the sum of a prime square, prime cube, and prime fourth power? +Quantos números abaixo de `n` podem ser expressos como a soma do quadrado de um número primo, do cubo de um número primo e de um número primo na quarta potência? # --hints-- -`primePowerTriples(50)` should return a number. +`primePowerTriples(50)` deve retornar um número. ```js assert(typeof primePowerTriples(50) === 'number'); ``` -`primePowerTriples(50)` should return `4`. +`primePowerTriples(50)` deve retornar `4`. ```js assert.strictEqual(primePowerTriples(50), 4); ``` -`primePowerTriples(10035)` should return `684`. +`primePowerTriples(10035)` deve retornar `684`. ```js assert.strictEqual(primePowerTriples(10035), 684); ``` -`primePowerTriples(500000)` should return `18899`. +`primePowerTriples(500000)` deve retornar `18899`. ```js assert.strictEqual(primePowerTriples(500000), 18899); ``` -`primePowerTriples(5000000)` should return `138932`. +`primePowerTriples(5000000)` deve retornar `138932`. ```js assert.strictEqual(primePowerTriples(5000000), 138932); ``` -`primePowerTriples(50000000)` should return `1097343`. +`primePowerTriples(50000000)` deve retornar `1097343`. ```js assert.strictEqual(primePowerTriples(50000000), 1097343); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-88-product-sum-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-88-product-sum-numbers.md index 46779896396..a3dcd74b882 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-88-product-sum-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-88-product-sum-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f3c51000cf542c50fed6 -title: 'Problem 88: Product-sum numbers' +title: 'Problema 88: Números de somas e produtos' challengeType: 1 forumTopicId: 302203 dashedName: problem-88-product-sum-numbers @@ -8,11 +8,11 @@ dashedName: problem-88-product-sum-numbers # --description-- -A natural number, `N`, that can be written as the sum and product of a given set of at least two natural numbers, $\\{a_1, a_2, \ldots , a_k\\}$ is called a product-sum number: $N = a_1 + a_2 + \cdots + a_k = a_1 × a_2 × \cdots × a_k$. +Um número natural, `N`, que pode ser escrito como a soma e o produto de um determinado conjunto de, pelo menos, dois números naturais, $\\{a_1, a_2, \ldots , a_k\\}$, é chamado de um número de soma e produto: $N = a_1 + a_2 + \cdots + a_k = a_1 × a_2 × \cdots × a_k$. -For example, 6 = 1 + 2 + 3 = 1 × 2 × 3. +Por exemplo: 6 = 1 + 2 + 3 = 1 x 2 x 3. -For a given set of size, `k`, we shall call the smallest N with this property a minimal product-sum number. The minimal product-sum numbers for sets of size, `k` = 2, 3, 4, 5, and 6 are as follows. +Para um determinado conjunto de tamanho `k`, vamos chamar o menor número N com essa propriedade de número mínimo de soma e produto. Os números mínimos de soma e produto para conjuntos de tamanho `k` = 2, 3, 4, 5 e 6 são os seguintes.
k=2: 4 = 2 × 2 = 2 + 2
@@ -22,45 +22,45 @@ For a given set of size, `k`, we shall call the smallest N with this property a k=6: 12 = 1 × 1 × 1 × 1 × 2 × 6 = 1 + 1 + 1 + 1 + 2 + 6

-Hence for 2 ≤ `k` ≤ 6, the sum of all the minimal product-sum numbers is 4 + 6 + 8 + 12 = 30; note that `8` is only counted once in the sum. +Assim, para 2 ≤ `k` ≤ 6, a soma de todos os números mínimos de soma e produto é 4 + 6 + 8 + 12 = 30. Observe que `8` é contado apenas uma vez na soma. -In fact, as the complete set of minimal product-sum numbers for 2 ≤ `k` ≤ 12 is $\\{4, 6, 8, 12, 15, 16\\}$, the sum is `61`. +De fato, como o conjunto completo de números mínimos de soma e produto para 2 ≤ `k` ≤ 12 é $\\{4, 6, 8, 12, 15, 16\\}$, a soma é `61`. -What is the sum of all the minimal product-sum numbers for 2 ≤ `k` ≤ `limit`? +Qual é a soma de todos os números mínimos de soma e produto para 2 ≤ `k` ≤ `limit`? # --hints-- -`productSumNumbers(6)` should return a number. +`productSumNumbers(6)` deve retornar um número. ```js assert(typeof productSumNumbers(6) === 'number'); ``` -`productSumNumbers(6)` should return `30`. +`productSumNumbers(6)` deve retornar `30`. ```js assert.strictEqual(productSumNumbers(6), 30); ``` -`productSumNumbers(12)` should return `61`. +`productSumNumbers(12)` deve retornar `61`. ```js assert.strictEqual(productSumNumbers(12), 61); ``` -`productSumNumbers(300)` should return `12686`. +`productSumNumbers(300)` deve retornar `12686`. ```js assert.strictEqual(productSumNumbers(300), 12686); ``` -`productSumNumbers(6000)` should return `2125990`. +`productSumNumbers(6000)` deve retornar `2125990`. ```js assert.strictEqual(productSumNumbers(6000), 2125990); ``` -`productSumNumbers(12000)` should return `7587457`. +`productSumNumbers(12000)` deve retornar `7587457`. ```js assert.strictEqual(productSumNumbers(12000), 7587457); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-89-roman-numerals.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-89-roman-numerals.md index 52c03847a6b..42ad8e4455e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-89-roman-numerals.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-89-roman-numerals.md @@ -1,6 +1,6 @@ --- id: 5900f3c51000cf542c50fed7 -title: 'Problem 89: Roman numerals' +title: 'Problema 89: Números romanos' challengeType: 1 forumTopicId: 302204 dashedName: problem-89-roman-numerals @@ -8,20 +8,20 @@ dashedName: problem-89-roman-numerals # --description-- -For a number written in Roman numerals to be considered valid there are basic rules which must be followed. Even though the rules allow some numbers to be expressed in more than one way there is always a *best* way of writing a particular number. +Para que um número escrito em numerais romanos seja considerado válido, há regras básicas que têm de ser cumpridas. Embora as regras permitam que alguns números sejam expressos de mais de uma forma, há sempre uma forma *melhor* de escrever um número específico. -- Numerals must be arranged in descending order of size. -- M, C, and X cannot be equaled or exceeded by smaller denominations. -- D, L, and V can each only appear once. +- Os números devem ser organizados em ordem decrescente de tamanho. +- M, C e X não podem ser igualados ou excedidos por denominações menores. +- D, L e V só podem aparecer uma vez. -In addition to the three rules given above, if subtractive combinations are used then the following four rules must be followed. +Além das três regras dadas acima, se as combinações subtrativas forem usadas, as quatro regras a seguir devem ser respeitadas. -- Only one I, X, and C can be used as the leading numeral in part of a subtractive pair. -- I can only be placed before V and X. -- X can only be placed before L and C. -- C can only be placed before D and M. +- Somente um I, X e C podem ser usados como numerais adiante de um par subtrativo. +- I só pode ser colocado antes de V e de X. +- X só pode ser colocado antes de L e de C. +- C só pode ser colocado antes de D e de M. -For example, it would appear that there are at least six ways of writing the number sixteen: +Por exemplo, poderíamos imaginar que há pelo menos seis maneiras de escrever o número dezesseis:
IIIIIIIIIIIIIIII
@@ -32,29 +32,29 @@ For example, it would appear that there are at least six ways of writing the num XVI

-However, according to the rules only XIIIIII and XVI are valid, and the last example is considered to be the most efficient, as it uses the least number of numerals. +Porém, de acordo com as regras, somente XIIIIII e XVI são válidos. O último desses exemplos é considerado o mais eficiente, já que usa a menor quantidade de numerais. -The array, `roman`, will contain numbers written with valid, but not necessarily minimal, Roman numerals. +O array, `roman`, terá números escritos de maneira válida, mas não necessariamente mínima, de numerais romanos. -Find the number of characters saved by writing each of these in their minimal form. +Encontre o número de caracteres salvos escrevendo cada um deles na sua forma mínima. -**Note:** You can assume that all the Roman numerals in the array contain no more than four consecutive identical units. +**Observação:** você pode considerar que nenhum dos números romanos no array contêm mais do que quatro unidades idênticas consecutivas. # --hints-- -`romanNumerals(testNumerals1)` should return a number. +`romanNumerals(testNumerals1)` deve retornar um número. ```js assert(typeof romanNumerals(_testNumerals1) === 'number'); ``` -`romanNumerals(testNumerals1)` should return `19`. +`romanNumerals(testNumerals1)` deve retornar `19`. ```js assert.strictEqual(romanNumerals(_testNumerals1), 19); ``` -`romanNumerals(testNumerals2)` should return `743`. +`romanNumerals(testNumerals2)` deve retornar `743`. ```js assert.strictEqual(romanNumerals(_testNumerals2), 743); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-90-cube-digit-pairs.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-90-cube-digit-pairs.md index 3e1206b4c4f..08ce72da183 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-90-cube-digit-pairs.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-90-cube-digit-pairs.md @@ -1,6 +1,6 @@ --- id: 5900f3c61000cf542c50fed9 -title: 'Problem 90: Cube digit pairs' +title: 'Problema 90: pares de algarismos em cubos' challengeType: 1 forumTopicId: 302207 dashedName: problem-90-cube-digit-pairs @@ -8,38 +8,38 @@ dashedName: problem-90-cube-digit-pairs # --description-- -Each of the six faces on a cube has a different digit (0 to 9) written on it; the same is done to a second cube. By placing the two cubes side-by-side in different positions we can form a variety of 2-digit numbers. +Cada uma das seis faces em um cubo tem um algarismo diferente (de 0 a 9) escrito nela. O mesmo se passa com um segundo cubo. Colocando os dois cubos lado a lado em posições diferentes, podemos formar uma variedade de números de dois algarismos. -For example, the square number 64 could be formed: +Por exemplo, o número quadrado 64 poderia ser formado assim: -two cubes, one with the number 6 and the other with number 4 +dois cubos, um com o número 6 e o outro com o número 4 -In fact, by carefully choosing the digits on both cubes it is possible to display all of the square numbers below one-hundred: 01, 04, 09, 16, 25, 36, 49, 64, and 81. +De fato, se escolhermos cuidadosamente os algarismos em ambos os cubos, é possível exibir todos os números quadrados abaixo de cem: 01, 04, 09, 16, 25, 36, 49, 64 e 81. -For example, one way this can be achieved is by placing {0, 5, 6, 7, 8, 9} on one cube and {1, 2, 3, 4, 8, 9} on the other cube. +Por exemplo, uma forma de conseguir isso é colocando {0, 5, 6, 7, 8, 9} em um cubo e {1, 2, 3, 4, 8, 9} no outro cubo. -However, for this problem we shall allow the 6 or 9 to be turned upside-down so that an arrangement like {0, 5, 6, 7, 8, 9} and {1, 2, 3, 4, 6, 7} allows for all nine square numbers to be displayed; otherwise it would be impossible to obtain 09. +No entanto, para este problema, permitiremos que os 6 ou 9 sejam invertidos de modo que um arranjo como {0, 5, 6, 7, 8, 9} e {1, 2, 3, 4, 6, 7} permita que todos os nove números quadrados sejam exibidos. Caso contrário, seria impossível obter 09. -In determining a distinct arrangement we are interested in the digits on each cube, not the order. +Ao estabelecermos um arranjo distinto, estamos interessados nos algarismos de cada cubo, não na ordem.
- {1, 2, 3, 4, 5, 6} is equivalent to {3, 6, 4, 1, 2, 5}
- {1, 2, 3, 4, 5, 6} is distinct from {1, 2, 3, 4, 5, 9} + {1, 2, 3, 4, 5, 6} é equivalente a {3, 6, 4, 1, 2, 5}
+ {1, 2, 3, 4, 5, 6} é diferente de {1, 2, 3, 4, 5, 9}
-But because we are allowing 6 and 9 to be reversed, the two distinct sets in the last example both represent the extended set {1, 2, 3, 4, 5, 6, 9} for the purpose of forming 2-digit numbers. +Como estamos permitindo que 6 e 9 sejam invertidos, os dois conjuntos distintos no último exemplo representam o conjunto estendido {1, 2, 3, 4, 5, 6, 9} para fins de formar números de dois algarismos. -How many distinct arrangements of the two cubes allow for all of the square numbers to be displayed? +Quantos arranjos distintos dos dois cubos permitem a exibição de todos os números quadrados até cem? # --hints-- -`cubeDigitPairs()` should return a number. +`cubeDigitPairs()` deve retornar um número. ```js assert(typeof cubeDigitPairs() === 'number'); ``` -`cubeDigitPairs()` should return 1217. +`cubeDigitPairs()` deve retornar 1217. ```js assert.strictEqual(cubeDigitPairs(), 1217); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-92-square-digit-chains.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-92-square-digit-chains.md index c560f06847c..e2c3e063bfc 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-92-square-digit-chains.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-92-square-digit-chains.md @@ -1,6 +1,6 @@ --- id: 5900f3c81000cf542c50fedb -title: 'Problem 92: Square digit chains' +title: 'Problema 92: Cadeias de algarismos quadrados' challengeType: 1 forumTopicId: 302209 dashedName: problem-92-square-digit-chains @@ -8,44 +8,44 @@ dashedName: problem-92-square-digit-chains # --description-- -A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before. +Uma cadeia de números é criada adicionando continuamente o quadrado dos algarismos em um número para formar um novo número até que ele tenha sido visto antes. -For example, +Por exemplo: $$\begin{align} & 44 → 32 → 13 → 10 → \boldsymbol{1} → \boldsymbol{1}\\\\ & 85 → \boldsymbol{89} → 145 → 42 → 20 → 4 → 16 → 37 → 58 → \boldsymbol{89}\\\\ \end{align}$$ -Therefore any chain that arrives at 1 or 89 will become stuck in an endless loop. What is most amazing is that EVERY starting number will eventually arrive at 1 or 89. +Portanto, qualquer corrente que chegue a 1 ou 89 ficará presa numa repetição infinita. O que é mais incrível é que TODO número inicial eventualmente chegará a 1 ou 89. -How many starting numbers below `limit` will arrive at 89? +Quantos números iniciais abaixo do `limit` chegarão a 89? # --hints-- -`squareDigitChains(100)` should return a number. +`squareDigitChains(100)` deve retornar um número. ```js assert(typeof squareDigitChains(100) === 'number'); ``` -`squareDigitChains(100)` should return `80`. +`squareDigitChains(100)` deve retornar `80`. ```js assert.strictEqual(squareDigitChains(100), 80); ``` -`squareDigitChains(1000)` should return `857`. +`squareDigitChains(1000)` deve retornar `857`. ```js assert.strictEqual(squareDigitChains(1000), 857); ``` -`squareDigitChains(100000)` should return `85623`. +`squareDigitChains(100000)` deve retornar `85623`. ```js assert.strictEqual(squareDigitChains(100000), 85623); ``` -`squareDigitChains(10000000)` should return `8581146`. +`squareDigitChains(10000000)` deve retornar `8581146`. ```js assert.strictEqual(squareDigitChains(10000000), 8581146); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-93-arithmetic-expressions.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-93-arithmetic-expressions.md index 5a8afb7d782..876dfdbc6e1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-93-arithmetic-expressions.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-93-arithmetic-expressions.md @@ -1,6 +1,6 @@ --- id: 5900f3ca1000cf542c50fedc -title: 'Problem 93: Arithmetic expressions' +title: 'Problema 93: Expressões aritméticas' challengeType: 1 forumTopicId: 302210 dashedName: problem-93-arithmetic-expressions @@ -8,32 +8,32 @@ dashedName: problem-93-arithmetic-expressions # --description-- -By using each of the digits from the set, {1, 2, 3, 4}, exactly once, and making use of the four arithmetic operations (+, −, \*, /) and brackets/parentheses, it is possible to form different positive integer targets. +Usando cada um dos algarismos do conjunto {1, 2, 3, 4} exatamente uma vez e fazendo uso das quatro operações aritméticas (+, –, \*, /) e parênteses, é possível formar resultados inteiros positivos diferentes. -For example, +Por exemplo:
8 = (4 * (1 + 3)) / 2
- 14 = 4 * (3 + 1 / 2)
- 19 = 4 * (2 + 3) − 1
- 36 = 3 * 4 * (2 + 1) + 14 = 4 (3 + 1 / 2)
+ 19 = 4 * (2 + 3) - 1
+ 36 = 3 * 4 (2 + 1)
-Note that concatenations of the digits, like 12 + 34, are not allowed. +Observe que as concatenações de algarismos, como 12 + 34, não são permitidas. -Using the set, {1, 2, 3, 4}, it is possible to obtain thirty-one different target numbers of which 36 is the maximum, and each of the numbers 1 to 28 can be obtained before encountering the first non-expressible number. +Usando o conjunto {1, 2, 3, 4}, é possível obter trinta e um resultados numéricos diferentes, dos quais 36 é o máximo. Cada um dos números, de 1 a 28, pode ser obtido antes de encontrar o primeiro número não expressivo. -Find the set of four distinct digits, `a` < `b` < `c` < `d`, for which the longest set of consecutive positive integers, 1 to `n`, can be obtained, giving your answer as a string: `abcd`. +Encontre o conjunto de quatro algarismos distintos, `a` < `b` < `c` < `d`, para os quais o maior conjunto de inteiros positivos consecutivos, de 1 a `n`, pode ser obtido, dando sua resposta como uma string: `abcd`. # --hints-- -`arithmeticExpressions()` should return a number. +`arithmeticExpressions()` deve retornar um número. ```js assert(typeof arithmeticExpressions() === 'number'); ``` -`arithmeticExpressions()` should return 1258. +`arithmeticExpressions()` deve retornar 1258. ```js assert.strictEqual(arithmeticExpressions(), 1258); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-95-amicable-chains.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-95-amicable-chains.md index fe2d422a206..7700a2cc918 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-95-amicable-chains.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-95-amicable-chains.md @@ -1,6 +1,6 @@ --- id: 5900f3cc1000cf542c50fede -title: 'Problem 95: Amicable chains' +title: 'Problema 95: Cadeias amigáveis' challengeType: 1 forumTopicId: 302212 dashedName: problem-95-amicable-chains @@ -8,45 +8,45 @@ dashedName: problem-95-amicable-chains # --description-- -The proper divisors of a number are all the divisors excluding the number itself. For example, the proper divisors of 28 are 1, 2, 4, 7, and 14. As the sum of these divisors is equal to 28, we call it a perfect number. +Os divisores apropriados de um número são todos os seus divisores excetuando o número em si. Por exemplo, os divisores adequados de 28 são 1, 2, 4, 7 e 14. Como a soma desses divisores é igual a 28, chamamos esse número de um número perfeito. -Interestingly the sum of the proper divisors of 220 is 284 and the sum of the proper divisors of 284 is 220, forming a chain of two numbers. For this reason, 220 and 284 are called an amicable pair. +Curiosamente, a soma dos divisores adequados de 220 é 284 e a soma dos divisores adequados de 284 é 220, formando uma cadeia de dois números. Por esta razão, 220 e 284 são chamados de par amigável. -Perhaps less well known are longer chains. For example, starting with 12496, we form a chain of five numbers: +Talvez menos conhecidas sejam as cadeias mais longas. Por exemplo, começando com 12496, formamos uma cadeia de cinco números: $$ 12496 → 14288 → 15472 → 14536 → 14264 \\,(→ 12496 → \cdots) $$ -Since this chain returns to its starting point, it is called an amicable chain. +Como essa cadeia retorna ao seu ponto de partida, ela é chamada de uma cadeia amigável. -Find the smallest member of the longest amicable chain with no element exceeding `limit`. +Encontre o menor membro da maior cadeia amigável sem elementos que excedam o `limit`. # --hints-- -`amicableChains(300)` should return a number. +`amicableChains(300)` deve retornar um número. ```js assert(typeof amicableChains(300) === 'number'); ``` -`amicableChains(300)` should return `220`. +`amicableChains(300)` deve retornar `220`. ```js assert.strictEqual(amicableChains(300), 220); ``` -`amicableChains(15000)` should return `220`. +`amicableChains(15000)` deve retornar `220`. ```js assert.strictEqual(amicableChains(15000), 220); ``` -`amicableChains(100000)` should return `12496`. +`amicableChains(100000)` deve retornar `12496`. ```js assert.strictEqual(amicableChains(100000), 12496); ``` -`amicableChains(1000000)` should return `14316`. +`amicableChains(1000000)` deve retornar `14316`. ```js assert.strictEqual(amicableChains(1000000), 14316); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-96-su-doku.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-96-su-doku.md index 27ce515b109..930c8866f92 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-96-su-doku.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-96-su-doku.md @@ -8,7 +8,7 @@ dashedName: problem-96-su-doku # --description-- -Sudoku (do japonês, *lugar do número*) é o nome dado a um conceito de desafio popular. A sua origem não é clara, mas o mérito deve ser atribuído a Leonhard Euler, que inventou uma ideia de quebra-cabeça semelhante e muito mais difícil, chamada de Quadrados Latinos. No entanto, o objetivo dos quebra-cabeças de sudoku é substituir as lacunas (ou zeros) em um tabuleiro de 9 por 9, de tal forma que cada linha, coluna e caixa de 3 por 3 contenha cada um dos algarismos de 1 a 9. Below is an example of a typical starting puzzle grid and its solution grid. +Sudoku (do japonês, *lugar do número*) é o nome dado a um conceito de desafio popular. A sua origem não é clara, mas o mérito deve ser atribuído a Leonhard Euler, que inventou uma ideia de quebra-cabeça semelhante e muito mais difícil, chamada de Quadrados Latinos. No entanto, o objetivo dos quebra-cabeças de sudoku é substituir as lacunas (ou zeros) em um tabuleiro de 9 por 9, de tal forma que cada linha, coluna e caixa de 3 por 3 contenha cada um dos algarismos de 1 a 9. Abaixo, vemos um exemplo típico de tabuleiro inicial e o tabuleiro solucionado.
@@ -100,27 +100,27 @@ Sudoku (do japonês, *lugar do número*) é o nome dado a um conceito de desafio
-A well constructed Su Doku puzzle has a unique solution and can be solved by logic, although it may be necessary to employ "guess and test" methods in order to eliminate options (there is much contested opinion over this). The complexity of the search determines the difficulty of the puzzle; the example above is considered easy because it can be solved by straight forward direct deduction. +Um quebra-cabeças de sudoku bem construído tem uma solução única e pode ser resolvida por lógica, embora possa ser necessário utilizar métodos de "adivinhação e teste" a fim de eliminar opções (há opiniões bastante contestadas a esse respeito). A complexidade da busca determina a dificuldade do quebra-cabeça. O exemplo acima é considerado fácil, pois pode ser resolvido através de dedução direta. -The `puzzlesArr` array contains different Su Doku puzzle strings ranging in difficulty, but all with unique solutions. +O array `puzzlesArr` contém cadeias de quebra-cabeças de sudoku de várias dificuldades, mas com soluções únicas. -By solving all puzzles in `puzzlesArr`, find the sum of the 3-digit numbers found in the top left corner of each solution grid; for example, 483 is the 3-digit number found in the top left corner of the solution grid above. +Resolvendo todos os quebra-cabeças de `puzzlesArr`, encontre a soma dos números de 3 algarismos encontrados no canto superior esquerdo de cada tabuleiro solucionado. Por exemplo, 483 é o número de 3 algarismos encontrado no canto superior esquerdo do tabuleiro solucionado acima. # --hints-- -`suDoku(testPuzzles1)` should return a number. +`suDoku(testPuzzles1)` deve retornar um número. ```js assert(typeof suDoku(_testPuzzles1) === 'number'); ``` -`suDoku(testPuzzles1)` should return `1190`. +`suDoku(testPuzzles1)` deve retornar `1190`. ```js assert.strictEqual(suDoku(_testPuzzles1), 1190); ``` -`suDoku(testPuzzles2)` should return `24702`. +`suDoku(testPuzzles2)` deve retornar `24702`. ```js assert.strictEqual(suDoku(_testPuzzles2), 24702); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-97-large-non-mersenne-prime.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-97-large-non-mersenne-prime.md index cabdb3486c9..414769747cb 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-97-large-non-mersenne-prime.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-97-large-non-mersenne-prime.md @@ -1,6 +1,6 @@ --- id: 5900f3ce1000cf542c50fee0 -title: 'Problem 97: Large non-Mersenne prime' +title: 'Problema 97: Grande número primo que não seja de Mersenne' challengeType: 1 forumTopicId: 302214 dashedName: problem-97-large-non-mersenne-prime @@ -8,39 +8,39 @@ dashedName: problem-97-large-non-mersenne-prime # --description-- -The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form $2^{6972593} − 1$; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form $2^p − 1$, have been found which contain more digits. +O primeiro número primo descoberto que excedia um milhão de algarismos foi descoberto em 1999. Ele é um primo de Mersenne no formato $2^{6972593} - 1$ e contém exatamente 2.098.960 algarismos. Depois disso, outros primos de Mersenne, no formato $2^p - 1$, foram encontrados e contendo mais algarismos. -However, in 2004 there was found a massive non-Mersenne prime which contains 2,357,207 digits: $28433 × 2^{7830457} + 1$. +No entanto, em 2004, foi encontrado um número primo enorme e não sendo um primo de Mersenne que contém 2.357.207 algarismos: $28433 × 2^{7830457} + 1$. -Find the last ten digits of that non-Mersenne prime in the form $multiplier × 2^{power} + 1$. +Encontre os últimos dez algarismos daquele primo que não seja de Mersenne na forma $multiplicador × 2^{potência} + 1$. # --hints-- -`largeNonMersennePrime(19, 6833086)` should return a string. +`largeNonMersennePrime(19, 6833086)` deve retornar uma string. ```js assert(typeof largeNonMersennePrime(19, 6833086) === 'string'); ``` -`largeNonMersennePrime(19, 6833086)` should return the string `3637590017`. +`largeNonMersennePrime(19, 6833086)` deve retornar a string `3637590017`. ```js assert.strictEqual(largeNonMersennePrime(19, 6833086), '3637590017'); ``` -`largeNonMersennePrime(27, 7046834)` should return the string `0130771969`. +`largeNonMersennePrime(27, 7046834)` deve retornar a string `0130771969`. ```js assert.strictEqual(largeNonMersennePrime(27, 7046834), '0130771969'); ``` -`largeNonMersennePrime(6679881, 6679881)` should return the string `4455386113`. +`largeNonMersennePrime(6679881, 6679881)` deve retornar a string `4455386113`. ```js assert.strictEqual(largeNonMersennePrime(6679881, 6679881), '4455386113'); ``` -`largeNonMersennePrime(28433, 7830457)` should return the string `8739992577`. +`largeNonMersennePrime(28433, 7830457)` deve retornar a string `8739992577`. ```js assert.strictEqual(largeNonMersennePrime(28433, 7830457), '8739992577'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-99-largest-exponential.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-99-largest-exponential.md index af44a7d0bd7..c8ad892060f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-99-largest-exponential.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-1-to-100/problem-99-largest-exponential.md @@ -1,6 +1,6 @@ --- id: 5900f3d01000cf542c50fee2 -title: 'Problem 99: Largest exponential' +title: 'Problema 99: Maior exponencial' challengeType: 1 forumTopicId: 302216 dashedName: problem-99-largest-exponential @@ -8,27 +8,27 @@ dashedName: problem-99-largest-exponential # --description-- -Comparing two numbers written in index form like $2^{11}$ and $3^7$ is not difficult, as any calculator would confirm that $2^{11} = 2048 < 3^7 = 2187$. +Comparar dois números escritos em forma de índice como $2^{11}$ e $3^7$ não é difícil, como uma calculadora confirmaria que $2^{11} = 2048 < 3^7 = 2187$. -However, confirming that $632382^{518061} < 519432^{525806}$ would be much more difficult, as both numbers contain over three million digits. +No entanto, confirmar que $632382^{518061} < 519432^{525806}$ seria muito mais difícil, já que ambos os números contêm mais de três milhões de algarismos. -Using the 2D `baseExp` array of base/exponent pairs, determine pair with the greatest numerical value and return it. +Usando o array bidimensional `baseExp` de pares base/expoente, determine o par com o maior valor numérico e retorne-o. # --hints-- -`largestExponential(testArray1)` should return an array. +`largestExponential(testArray1)` deve retornar um array. ```js assert(Array.isArray(largestExponential(_testArray1))); ``` -`largestExponential(testArray1)` should return `[840237, 507276]`. +`largestExponential(testArray1)` deve retornar `[840237, 507276]`. ```js assert.deepEqual(largestExponential(_testArray1), [840237, 507276]); ``` -`largestExponential(testArray2)` should return `[895447, 504922]`. +`largestExponential(testArray2)` deve retornar `[895447, 504922]`. ```js assert.deepEqual(largestExponential(_testArray2), [895447, 504922]); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-101-optimum-polynomial.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-101-optimum-polynomial.md index 803f95dc33e..cfce717e7c1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-101-optimum-polynomial.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-101-optimum-polynomial.md @@ -1,6 +1,6 @@ --- id: 5900f3d21000cf542c50fee4 -title: 'Problem 101: Optimum polynomial' +title: 'Problema 101: Polinômio ideal' challengeType: 1 forumTopicId: 301725 dashedName: problem-101-optimum-polynomial @@ -8,31 +8,31 @@ dashedName: problem-101-optimum-polynomial # --description-- -If we are presented with the first k terms of a sequence it is impossible to say with certainty the value of the next term, as there are infinitely many polynomial functions that can model the sequence. +Se nos forem apresentados os primeiros termos k de uma sequência, é impossível dizer com certeza o valor do termo seguinte, uma vez que existem infinitas funções polinomiais que podem modelar a sequência. -As an example, let us consider the sequence of cube numbers. This is defined by the generating function, $u_n = n^3: 1, 8, 27, 64, 125, 216, \ldots$ +Como exemplo, vamos considerar a sequencia de números cúbicos. Isso é definido pela função de geração, $u_n = n^3: 1, 8, 27, 64, 125, 216, \ldots$ -Suppose we were only given the first two terms of this sequence. Working on the principle that "simple is best" we should assume a linear relationship and predict the next term to be 15 (common difference 7). Even if we were presented with the first three terms, by the same principle of simplicity, a quadratic relationship should be assumed. +Suponhamos que só nos foram dados os dois primeiros termos desta sequência. Trabalhando com o princípio de que "simples é melhor", devemos assumir uma relação linear e prever que o próximo termo será 15 (diferença comum 7). Mesmo que nos fossem apresentados os três primeiros termos, pelo mesmo princípio de simplicidade, uma relação quadrática deveria ser assumida. -We shall define $OP(k, n)$ to be the $n^{th}$ term of the optimum polynomial generating function for the first k terms of a sequence. It should be clear that $OP(k, n)$ will accurately generate the terms of the sequence for $n ≤ k$, and potentially the first incorrect term (FIT) will be $OP(k, k+1)$; in which case we shall call it a bad OP (BOP). +Definiremos $OP(k, n)$ como o termo $n^{th}$ da função de geração polinomial ótima para os primeiros termos k de uma sequência. Deve ficar claro que $OP(k, n)$ gerará com precisão os termos da sequência para $n ≤ k$ e, potencialmente, o primeiro termo incorreto (FIT) será $OP(k, k+1)$; Nesse caso, devemos chamá-lo de OP (BOP) ruim. -As a basis, if we were only given the first term of sequence, it would be most sensible to assume constancy; that is, for $n ≥ 2, OP(1, n) = u_1$. +Como base, se nos fosse dado apenas o primeiro termo de sequência, seria mais sensato assumir constância, ou seja, por $n ≥ 2, OP(1, n) = u_1$. -Hence we obtain the following OPs for the cubic sequence: +Assim, obtemos as seguintes OPs para a sequência cúbica: $$\begin{array}{ll} OP(1, n) = 1 & 1, {\color{red}1}, 1, 1, \ldots \\\\ OP(2, n) = 7n−6 & 1, 8, {\color{red}{15}}, \ldots \\\\ OP(3, n) = 6n^2−11n+6 & 1, 8, 27, {\color{red}{58}}, \ldots \\\\ OP(4, n) = n^3 & 1, 8, 27, 64, 125, \ldots \end{array}$$ -Clearly no BOPs exist for k ≥ 4. By considering the sum of FITs generated by the BOPs (indicated in $\color{red}{red}$ above), we obtain 1 + 15 + 58 = 74. Consider the following tenth degree polynomial generating function: +Claramente, não existem BOPs para k ≥ 4. Considerando a soma dos FITs gerados pelos BOPs (indicados em $\color{red}{red}$ acima), obtemos 1 + 15 + 58 = 74. Considere a seguinte função de geração de polinômios de décimo grau: $$u_n = 1 − n + n^2 − n^3 + n^4 − n^5 + n^6 − n^7 + n^8 − n^9 + n^{10}$$ -Find the sum of FITs for the BOPs. +Encontre a soma dos FITs para os BOPs. # --hints-- -`optimumPolynomial()` should return `37076114526`. +`optimumPolynomial()` deve retornar `37076114526`. ```js assert.strictEqual(optimumPolynomial(), 37076114526); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-102-triangle-containment.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-102-triangle-containment.md index c90a827dda3..eaae8841f26 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-102-triangle-containment.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-102-triangle-containment.md @@ -1,6 +1,6 @@ --- id: 5900f3d21000cf542c50fee5 -title: 'Problem 102: Triangle containment' +title: 'Problema 102: Contenção triangular' challengeType: 1 forumTopicId: 301726 dashedName: problem-102-triangle-containment @@ -8,9 +8,9 @@ dashedName: problem-102-triangle-containment # --description-- -Three distinct points are plotted at random on a Cartesian plane, for which -1000 ≤ x, y ≤ 1000, such that a triangle is formed. +Três pontos distintos são colocados aleatoriamente em um plano cartesiano, para o qual -1000 ≤ x, y ≤ 1000, de modo que um triângulo seja formado. -Consider the following two triangles: +Considere o seguinte exemplo com dois triângulos: ```js const exampleTriangles = [ @@ -19,31 +19,31 @@ const exampleTriangles = [ ]; ``` -It can be verified that first triangle contains the origin, whereas second triangle does not. +É possível verificar que o primeiro triângulo contém a origem, ao passo que o segundo triângulo não. -Using the `triangles` array containing coordinates of triangles, find the number of triangles for which the interior contains the origin. +Usando o array `triangles` contendo coordenadas de triângulos, descubra o número de triângulos para os quais o interior contém a origem. # --hints-- -`triangleContainment(exampleTriangles)` should return a number. +`triangleContainment(exampleTriangles)` deve retornar um número. ```js assert(typeof triangleContainment(_exampleTriangles) === 'number'); ``` -`triangleContainment(exampleTriangles)` should return `1`. +`triangleContainment(exampleTriangles)` deve retornar `1`. ```js assert.strictEqual(triangleContainment(_exampleTriangles), 1); ``` -`triangleContainment(testTriangles1)` should return `19`. +`triangleContainment(testTriangles1)` deve retornar `19`. ```js assert.strictEqual(triangleContainment(_testTriangles1), 19); ``` -`triangleContainment(testTriangles2)` should return `228`. +`triangleContainment(testTriangles2)` deve retornar `228`. ```js assert.strictEqual(triangleContainment(_testTriangles2), 228); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-103-special-subset-sums-optimum.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-103-special-subset-sums-optimum.md index bf85eef1f76..41656c5749b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-103-special-subset-sums-optimum.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-103-special-subset-sums-optimum.md @@ -1,6 +1,6 @@ --- id: 5900f3d61000cf542c50fee7 -title: 'Problem 103: Special subset sums: optimum' +title: 'Problema 103: Quantidade especial de subconjuntos: ideal' challengeType: 1 forumTopicId: 301727 dashedName: problem-103-special-subset-sums-optimum @@ -8,29 +8,29 @@ dashedName: problem-103-special-subset-sums-optimum # --description-- -Let $S(A)$ represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true: +Considere que $S(A)$ representa a soma dos elementos no conjunto A, de tamanho n. Vamos chamá-la de uma soma especial definida se, para dois subconjuntos disjuntos, B e C, as seguintes propriedades são verdadeiras: -1. $S(B) ≠ S(C)$; that is, sums of subsets cannot be equal. -2. If B contains more elements than C then $S(B) > S(C)$. +1. $S(B) ≠ S(C)$; isto é, as somas de subconjuntos não podem ser iguais. +2. Se B contém mais elementos que C, $S(B) > S(C)$. -If $S(A)$ is minimised for a given n, we shall call it an optimum special sum set. The first five optimum special sum sets are given below. +Se $S(A)$ for minimizado por um determinado n, vamos chamar de um conjunto de soma especial ideal. Os primeiros cinco conjuntos de somas especiais ideais são fornecidos abaixo. $$\begin{align} & n = 1: \\{1\\} \\\\ & n = 2: \\{1, 2\\} \\\\ & n = 3: \\{2, 3, 4\\} \\\\ & n = 4: \\{3, 5, 6, 7\\} \\\\ & n = 5: \\{6, 9, 11, 12, 13\\} \\\\ \end{align}$$ -It seems that for a given optimum set, $A = \\{a_1, a_2, \ldots, a_n\\}$, the next optimum set is of the form $B = \\{b, a_1 + b, a_2 + b, \ldots, a_n + b\\}$, where b is the "middle" element on the previous row. +Parece que, para um determinado conjunto ideal, $A = \\{a_1, a_2, \ldots, a_n\\}$, o próximo conjunto ideal é do formato $B = \\{b, a_1 + b, a_2 + b, \ldots, a_n + b\\}$, onde b é o elemento do "meio" na linha anterior. -By applying this "rule" we would expect the optimum set for $n = 6$ to be $A = \\{11, 17, 20, 22, 23, 24\\}$, with $S(A) = 117$. However, this is not the optimum set, as we have merely applied an algorithm to provide a near optimum set. The optimum set for $n = 6$ is $A = \\{11, 18, 19, 20, 22, 25\\}$, with $S(A) = 115$ and corresponding set string: `111819202225`. +Aplicando esta "regra", esperaríamos que o conjunto ideal para $n = 6$ fosse $A = \\{11, 17, 20, 22, 23, 24\\}$, com $S(A) = 117$. No entanto, este não é o conjunto ideal, já que apenas aplicamos um algoritmo para fornecer um conjunto quase ideal. O conjunto ideal para $n = 6$ é $A = \\{11, 18, 19, 20, 22, 25\\}$, com $S(A) = 115$ e a string correspondente do conjunto: `111819202225`. -Given that A is an optimum special sum set for $n = 7$, find its set string. +Dado que A é uma soma especial ideal para $n = 7$, encontre sua string definida. -**Note:** This problem is related to Problem 105 and Problem 106. +**Observação:** este problema está relacionado ao Problema 105 e ao Problema 106. # --hints-- -`optimumSpecialSumSet()` should return the string `20313839404245`. +`optimumSpecialSumSet()` deve retornar a string `20313839404245`. ```js assert.strictEqual(optimumSpecialSumSet(), '20313839404245'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-104-pandigital-fibonacci-ends.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-104-pandigital-fibonacci-ends.md index baa7dcbfdbd..17c9db3ca2c 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-104-pandigital-fibonacci-ends.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-104-pandigital-fibonacci-ends.md @@ -1,6 +1,6 @@ --- id: 5900f3d51000cf542c50fee6 -title: 'Problem 104: Pandigital Fibonacci ends' +title: 'Problema 104: Extremidades do Fibonacci pandigital' challengeType: 1 forumTopicId: 301728 dashedName: problem-104-pandigital-fibonacci-ends @@ -8,17 +8,17 @@ dashedName: problem-104-pandigital-fibonacci-ends # --description-- -The Fibonacci sequence is defined by the recurrence relation: +A sequência de Fibonacci é definida pela relação de recorrência: -$F_n = F_{n − 1} + F_{n − 2}$, where $F_1 = 1$ and $F_2 = 1$ +$F_n = F_{n − 1} + F_{n − 2}$, onde $F_1 = 1$ e $F_2 = 1$ -It turns out that $F_{541}$, which contains 113 digits, is the first Fibonacci number for which the last nine digits are 1 - 9 pandigital (contain all the digits 1 to 9, but not necessarily in order). And $F_{2749}$, which contains 575 digits, is the first Fibonacci number for which the first nine digits are 1 - 9 pandigital. +$F_{541} $, que contém 113 algarismos, é o primeiro número de Fibonacci para o qual os últimos nove algarismos são de 1a 9 pandigital (contém todos os algarismos de 1 a 9, mas não necessariamente em ordem). E $F_{2749}$, que contém 575 algarismos, é o primeiro número de Fibonacci para o qual os primeiros nove algarismos são 1 - 9 pandigital. -Given that $F_k$ is the first Fibonacci number for which the first nine digits AND the last nine digits are 1 - 9 pandigital, find `k`. +Dado que $F_k$ é o primeiro número de Fibonacci para o qual os primeiros nove algarismos E os últimos nove algarismos são pandigitais de 1 a 9, encontre `k`. # --hints-- -`pandigitalFibonacciEnds()` should return `329468`. +`pandigitalFibonacciEnds()` deve retornar `329468`. ```js assert.strictEqual(pandigitalFibonacciEnds(), 329468); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-105-special-subset-sums-testing.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-105-special-subset-sums-testing.md index 1636463728d..9e3b3cc8e86 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-105-special-subset-sums-testing.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-105-special-subset-sums-testing.md @@ -1,6 +1,6 @@ --- id: 5900f3d61000cf542c50fee8 -title: 'Problem 105: Special subset sums: testing' +title: 'Problema 105: Somas especiais de subconjuntos: testes' challengeType: 1 forumTopicId: 301729 dashedName: problem-105-special-subset-sums-testing @@ -8,20 +8,20 @@ dashedName: problem-105-special-subset-sums-testing # --description-- -Let $S(A)$ represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true: +Deixe que $S(A)$ represente a soma dos elementos no conjunto A, de tamanho n. Vamos chamá-la de uma soma especial definida se, para dois subconjuntos disjuntos, B e C, as seguintes propriedades são verdadeiras: -1. $S(B) ≠ S(C)$; that is, sums of subsets cannot be equal. -2. If B contains more elements than C then $S(B) > S(C)$. +1. $S(B) ≠ S(C)$; isto é, as somas de subconjuntos não podem ser iguais. +2. Se B contém mais elementos que C, $S(B) > S(C)$. -For example, {81, 88, 75, 42, 87, 84, 86, 65} is not a special sum set because 65 + 87 + 88 = 75 + 81 + 84, whereas {157, 150, 164, 119, 79, 159, 161, 139, 158} satisfies both rules for all possible subset pair combinations and $S(A) = 1286$. +Por exemplo, {81, 88, 75, 42, 87, 84, 86, 65} não é uma soma especial porque 65 + 87 + 88 = 75 + 81 + 84, enquanto {157, 150, 164, 119, 79, 159, 161, 139, 158} satisfaz as duas regras para todas as combinações possíveis de pares de subconjuntos e $S(A) = 1286$. -Using `sets`, an array with one-hundred sets, containing seven to twelve elements (the two examples given above are the first two sets), identify all the special sum sets, $A_1, A_2, \ldots, A_k$, and find the value of $(A_1) + S(A_2) + \cdots + S(A_k)$. +Usando `sets` (conjuntos), um array com cem conjuntos, contendo de sete a doze elementos (os dois exemplos citados acima são os dois primeiros conjuntos), identifique todos os conjuntos especiais de soma, $A_1, A_2, \ldots, A_k$, e encontre o valor de $(A_1) + S(A_2) + \cdots + S(A_k)$. -**Note:** This problem is related to Problem 103 and Problem 106. +**Observação:** este problema está relacionado aos problemas 103 e 106. # --hints-- -`testingSpecialSubsetSums(testSets)` should return `73702`. +`testingSpecialSubsetSums(testSets)` deve retornar `73702`. ```js assert.strictEqual(testingSpecialSubsetSums(_testSets), 73702); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-106-special-subset-sums-meta-testing.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-106-special-subset-sums-meta-testing.md index 67638b56e90..74985399034 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-106-special-subset-sums-meta-testing.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-106-special-subset-sums-meta-testing.md @@ -1,6 +1,6 @@ --- id: 5900f3d71000cf542c50fee9 -title: 'Problem 106: Special subset sums: meta-testing' +title: 'Problema 106: Somas especiais de subconjuntos: metatestes' challengeType: 1 forumTopicId: 301730 dashedName: problem-106-special-subset-sums-meta-testing @@ -8,22 +8,22 @@ dashedName: problem-106-special-subset-sums-meta-testing # --description-- -Let $S(A)$ represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true: +Considere que $S(A)$ representa a soma dos elementos no conjunto A, de tamanho n. Vamos chamá-la de uma soma especial definida se, para dois subconjuntos disjuntos, B e C, as seguintes propriedades são verdadeiras: -1. $S(B) ≠ S(C)$; that is, sums of subsets cannot be equal. -2. If B contains more elements than C then $S(B) > S(C)$. +1. $S(B) ≠ S(C)$; isto é, as somas de subconjuntos não podem ser iguais. +2. Se B contém mais elementos que C, $S(B) > S(C)$. -For this problem we shall assume that a given set contains n strictly increasing elements and it already satisfies the second rule. +Para este problema, vamos supor que um determinado conjunto contém n elementos estritamente crescentes e já satisfaz a segunda regra. -Surprisingly, out of the 25 possible subset pairs that can be obtained from a set for which n = 4, only 1 of these pairs need to be tested for equality (first rule). Similarly, when n = 7, only 70 out of the 966 subset pairs need to be tested. +Notavelmente, dos 25 pares de subconjuntos possíveis que podem ser obtidos a partir de um conjunto para o qual n = 4, apenas 1 destes pares precisa ser testado para a igualdade (primeira regra). Da mesma forma, quando n = 7, apenas 70 dos 966 pares de subconjunto precisam ser testados. -For n = 12, how many of the 261625 subset pairs that can be obtained need to be tested for equality? +Para n = 12, quantos dos 261625 pares de subconjunto que podem ser obtidos precisam ser testados para a igualdade? -**Note:** This problem is related to Problem 103 and Problem 105. +**Observação:** este problema está relacionado aos problemas 103 e 105. # --hints-- -`subsetSumsMetaTesting()` should return `21384`. +`subsetSumsMetaTesting()` deve retornar `21384`. ```js assert.strictEqual(subsetSumsMetaTesting(), 21384); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-107-minimal-network.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-107-minimal-network.md index 3b69363096d..f5443eb8674 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-107-minimal-network.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-107-minimal-network.md @@ -1,6 +1,6 @@ --- id: 5900f3d91000cf542c50feea -title: 'Problem 107: Minimal network' +title: 'Problema 107: Rede mínima' challengeType: 1 forumTopicId: 301731 dashedName: problem-107-minimal-network @@ -8,11 +8,11 @@ dashedName: problem-107-minimal-network # --description-- -The following undirected network consists of seven vertices and twelve edges with a total weight of 243. +A rede não direcionada a seguir consiste em sete vértices e doze arestas com um peso total de 243. -Network with seven vertices and twelve edges +Rede com sete vértices e doze arestas -The same network can be represented by the matrix below. +A mesma rede pode ser representada pela matriz abaixo. | | A | B | C | D | E | F | G | | - | -- | -- | -- | -- | -- | -- | -- | @@ -25,15 +25,15 @@ The same network can be represented by the matrix below. | G | - | - | - | 23 | 11 | 27 | - | -However, it is possible to optimise the network by removing some edges and still ensure that all points on the network remain connected. The network which achieves the maximum saving is shown below. It has a weight of 93, representing a saving of 243 − 93 = 150 from the original network. +No entanto, é possível otimizar a rede removendo algumas arestas e ainda garantindo que todos os pontos na rede permaneçam ligados. A rede que alcança o máximo de economia é mostrada abaixo. Tem um peso de 93, representando uma economia de 243 - 93 = 150 da rede original. -Network with seven vertices and left six edges: AB, BD, CA, DE, DF, EG +A rede possui sete vértices e seis arestas: AB, BD, CA, DE, DF, EG -Using `network`, an 2D array representing network in matrix form, find the maximum saving which can be achieved by removing redundant edges whilst ensuring that the network remains connected. Vertices not having connection will be represented with `-1`. +Usando `network` (rede), um array 2D representando a rede em forma de matriz, encontre a economia máxima que pode ser alcançada removendo as arestas redundantes, assegurando simultaneamente que a rede permaneça ligada. Vértices que não tiverem conexão serão representados com `-1`. # --hints-- -`minimalNetwork(testNetwork)` should return `259679`. +`minimalNetwork(testNetwork)` deve retornar `259679`. ```js assert.strictEqual(minimalNetwork(_testNetwork), 259679); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-108-diophantine-reciprocals-i.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-108-diophantine-reciprocals-i.md index 56fbe532238..58032beb061 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-108-diophantine-reciprocals-i.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-108-diophantine-reciprocals-i.md @@ -1,6 +1,6 @@ --- id: 5900f3d91000cf542c50feeb -title: 'Problem 108: Diophantine Reciprocals I' +title: 'Problema 108: Diofantinos recíprocos I' challengeType: 1 forumTopicId: 301732 dashedName: problem-108-diophantine-reciprocals-i @@ -8,21 +8,21 @@ dashedName: problem-108-diophantine-reciprocals-i # --description-- -In the following equation x, y, and n are positive integers. +Na equação a seguir, x, y e n são inteiros positivos. $$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$ -For `n` = 4 there are exactly three distinct solutions: +Para `n` = 4, há exatamente três soluções distintas: $$\begin{align} & \frac{1}{5} + \frac{1}{20} = \frac{1}{4}\\\\ \\\\ & \frac{1}{6} + \frac{1}{12} = \frac{1}{4}\\\\ \\\\ & \frac{1}{8} + \frac{1}{8} = \frac{1}{4} \end{align}$$ -What is the least value of `n` for which the number of distinct solutions exceeds one-thousand? +Qual é o menor valor de `n` para o qual o número de soluções distintas excede um mil? # --hints-- -`diophantineOne()` should return `180180`. +`diophantineOne()` deve retornar `180180`. ```js assert.strictEqual(diophantineOne(), 180180); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-110-diophantine-reciprocals-ii.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-110-diophantine-reciprocals-ii.md index 9bbeb3dd075..1bff9b9b51b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-110-diophantine-reciprocals-ii.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-110-diophantine-reciprocals-ii.md @@ -1,6 +1,6 @@ --- id: 5900f3db1000cf542c50feed -title: 'Problem 110: Diophantine Reciprocals II' +title: 'Problema 110: Diofantinos recíprocos II' challengeType: 1 forumTopicId: 301735 dashedName: problem-110-diophantine-reciprocals-ii @@ -8,19 +8,19 @@ dashedName: problem-110-diophantine-reciprocals-ii # --description-- -In the following equation x, y, and n are positive integers. +Na equação a seguir, x, y e n são inteiros positivos. $$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$ -It can be verified that when `n` = 1260 there are 113 distinct solutions and this is the least value of `n` for which the total number of distinct solutions exceeds one hundred. +Pode ser verificado que, quando `n` = 1260, existem 113 soluções distintas e este é o menor valor de `n` para o qual o número total de soluções distintas excede cem. -What is the least value of `n` for which the number of distinct solutions exceeds four million? +Qual é o menor valor de `n` para o qual o número de soluções distintas excede quatro milhões? -**Note:** This problem is a much more difficult version of Problem 108 and as it is well beyond the limitations of a brute force approach it requires a clever implementation. +**Observação:** este problema é uma versão muito mais difícil do Problema 108 e, como está muito além das limitações de uma abordagem de força bruta, requer uma implementação inteligente. # --hints-- -`diophantineTwo()` should return `9350130049860600`. +`diophantineTwo()` deve retornar `9350130049860600`. ```js assert.strictEqual(diophantineTwo(), 9350130049860600); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-111-primes-with-runs.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-111-primes-with-runs.md index 7f22fbffb6c..36aaf52c7ee 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-111-primes-with-runs.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-111-primes-with-runs.md @@ -1,6 +1,6 @@ --- id: 5900f3db1000cf542c50feee -title: 'Problem 111: Primes with runs' +title: 'Problema 111: Primos com execuções' challengeType: 1 forumTopicId: 301736 dashedName: problem-111-primes-with-runs @@ -8,34 +8,34 @@ dashedName: problem-111-primes-with-runs # --description-- -Considering 4-digit primes containing repeated digits it is clear that they cannot all be the same: 1111 is divisible by 11, 2222 is divisible by 22, and so on. But there are nine 4-digit primes containing three ones: +Considerando primos de 4 algarismos contendo algarismos repetidos, é claro que eles não podem ser todos iguais: 1111 é divisível por 11, 2222 é divisível por 22, e assim por diante. Mas há nove primos de 4 algarismos que contêm três números 1: $$1117, 1151, 1171, 1181, 1511, 1811, 2111, 4111, 8111$$ -We shall say that $M(n, d)$ represents the maximum number of repeated digits for an n-digit prime where d is the repeated digit, $N(n, d)$ represents the number of such primes, and $S(n, d)$ represents the sum of these primes. +Vamos dizer que $M(n, d)$ representa o número máximo de algarismos repetidos para um primo de n algarismos, onde d é o algarismo repetido, $N(n, d)$ representa quantos desses primos existem, e $S(n, d)$ representa a soma desses primos. -So $M(4, 1) = 3$ is the maximum number of repeated digits for a 4-digit prime where one is the repeated digit, there are $N(4, 1) = 9$ such primes, and the sum of these primes is $S(4, 1) = 22275$. It turns out that for d = 0, it is only possible to have $M(4, 0) = 2$ repeated digits, but there are $N(4, 0) = 13$ such cases. +Então $M(4, 1) = 3$ é o número máximo de algarismos repetidos para um primo de 4 algarismos, onde 1 é o algarismo repetido, há $N(4, 1) = 9$ primos desses, e a soma desses primos é $S(4, 1) = 22275$. Acontece que, para d = 0, só é possível ter $M(4, 0) = 2$ algarismos repetidos, mas há $N(4, 0) = 13$ desses casos. -In the same way we obtain the following results for 4-digit primes. +Da mesma forma, obtemos os seguintes resultados para primos de 4 algarismos. -| Digit, d | $M(4, d)$ | $N(4, d)$ | $S(4, d)$ | -| -------- | --------- | --------- | --------- | -| 0 | 2 | 13 | 67061 | -| 1 | 3 | 9 | 22275 | -| 2 | 3 | 1 | 2221 | -| 3 | 3 | 12 | 46214 | -| 4 | 3 | 2 | 8888 | -| 5 | 3 | 1 | 5557 | -| 6 | 3 | 1 | 6661 | -| 7 | 3 | 9 | 57863 | -| 8 | 3 | 1 | 8887 | -| 9 | 3 | 7 | 48073 | +| Algarismo, d | $M(4, d)$ | $N(4, d)$ | $S(4, d)$ | +| ------------ | --------- | --------- | --------- | +| 0 | 2 | 13 | 67061 | +| 1 | 3 | 9 | 22275 | +| 2 | 3 | 1 | 2221 | +| 3 | 3 | 12 | 46214 | +| 4 | 3 | 2 | 8888 | +| 5 | 3 | 1 | 5557 | +| 6 | 3 | 1 | 6661 | +| 7 | 3 | 9 | 57863 | +| 8 | 3 | 1 | 8887 | +| 9 | 3 | 7 | 48073 | -For d = 0 to 9, the sum of all $S(4, d)$ is 273700. Find the sum of all $S(10, d)$. +Para d = 0 até 9, a soma de todos $S(4, d)$ é 273700. Calcule a soma de todos os $S(10, d)$. # --hints-- -`primesWithRuns()` should return `612407567715`. +`primesWithRuns()` deve retornar `612407567715`. ```js assert.strictEqual(primesWithRuns(), 612407567715); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-112-bouncy-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-112-bouncy-numbers.md index 7599de29978..a717b915037 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-112-bouncy-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-112-bouncy-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f3dd1000cf542c50feef -title: 'Problem 112: Bouncy numbers' +title: 'Problema 112: Números saltitantes' challengeType: 1 forumTopicId: 301738 dashedName: problem-112-bouncy-numbers @@ -8,21 +8,21 @@ dashedName: problem-112-bouncy-numbers # --description-- -Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468. +Trabalhando da esquerda para a direita, se nenhum algarismo for excedido pelo algarismo à sua esquerda, é chamado de número crescente. Por exemplo, 134468. -Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420. +Da mesma forma, se nenhum algarismo for excedido pelo algarismo à sua direita, é chamado de número decrescente. Por exemplo, 66420. -We shall call a positive integer that is neither increasing nor decreasing a "bouncy" number; for example, 155349. +Chamaremos um número inteiro positivo que não aumenta nem diminui um número "saltitante"; por exemplo, 155349. -Clearly there cannot be any bouncy numbers below one-hundred, but just over half of the numbers below one-thousand (525) are bouncy. In fact, the least number for which the proportion of bouncy numbers first reaches 50% is 538. +Claramente, não pode haver números saltitantes abaixo de cem, mas apenas pouco mais da metade dos números abaixo de mil (525) são saltitantes. Na verdade, o menor número para o qual a proporção de números saltitantes atinge primeiro os 50% é 538. -Surprisingly, bouncy numbers become more and more common and by the time we reach 21780 the proportion of bouncy numbers is equal to 90%. +Surpreendentemente, os números saltitantes tornam-se cada vez mais comuns e, quando atingimos 21780, a proporção de números saltitantes equivalerá a 90%. -Find the least number for which the proportion of bouncy numbers is exactly 99%. +Encontre o número mínimo para o qual a proporção de números saltitantes é exatamente 99%. # --hints-- -`bouncyNumbers()` should return `1587000`. +`bouncyNumbers()` deve retornar `1587000`. ```js assert.strictEqual(bouncyNumbers(), 1587000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-113-non-bouncy-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-113-non-bouncy-numbers.md index 868909ef6b2..0243e019652 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-113-non-bouncy-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-113-non-bouncy-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f3dd1000cf542c50fef0 -title: 'Problem 113: Non-bouncy numbers' +title: 'Problema 113: Números não saltitantes' challengeType: 1 forumTopicId: 301739 dashedName: problem-113-non-bouncy-numbers @@ -8,19 +8,19 @@ dashedName: problem-113-non-bouncy-numbers # --description-- -Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468. +Trabalhando da esquerda para a direita, se nenhum algarismo for excedido pelo algarismo à sua esquerda, é chamado de número crescente. Por exemplo, 134468. -Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420. +Da mesma forma, se nenhum algarismo for excedido pelo algarismo à sua direita, é chamado de número decrescente. Por exemplo, 66420. -We shall call a positive integer that is neither increasing nor decreasing a "bouncy" number; for example, 155349. +Chamaremos um número inteiro positivo que não aumenta nem diminui um número "saltitante"; por exemplo, 155349. -As n increases, the proportion of bouncy numbers below n increases such that there are only 12951 numbers below one-million that are not bouncy and only 277032 non-bouncy numbers below ${10}^{10}$. +À medida que n aumenta, a proporção de números saltitantes abaixo de n aumenta de tal forma que há apenas 12951 números abaixo de um milhão que não são saltitantes e apenas 277032 números não saltitantes abaixo de ${10}^{10}$. -How many numbers below a googol (${10}^{100}$) are not bouncy? +Quantos números abaixo de um googol (${10}^{100}$) não são saltitantes? # --hints-- -`nonBouncyNumbers()` should return `51161058134250`. +`nonBouncyNumbers()` deve retornar `51161058134250`. ```js assert.strictEqual(nonBouncyNumbers(), 51161058134250); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-114-counting-block-combinations-i.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-114-counting-block-combinations-i.md index 3e1b2f85927..4638d4f126c 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-114-counting-block-combinations-i.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-114-counting-block-combinations-i.md @@ -1,6 +1,6 @@ --- id: 5900f3e01000cf542c50fef2 -title: 'Problem 114: Counting block combinations I' +title: 'Problema 114: Contando combinações de blocos I' challengeType: 1 forumTopicId: 301740 dashedName: problem-114-counting-block-combinations-i @@ -8,17 +8,17 @@ dashedName: problem-114-counting-block-combinations-i # --description-- -A row measuring seven units in length has red blocks with a minimum length of three units placed on it, such that any two red blocks (which are allowed to be different lengths) are separated by at least one black square. There are exactly seventeen ways of doing this. +Uma linha de sete unidades de comprimento tem blocos vermelhos com um comprimento mínimo de três unidades colocados nela, de tal forma que dois blocos vermelhos (que podem ter comprimentos diferentes) são separados por pelo menos um quadrado preto. Há exatamente dezessete maneiras de se fazer isso. -Possible ways of placing block with a minimum length of three units, on a row with length of seven units +Formas possíveis de se colocar um bloco, com um comprimento mínimo de três unidades, em uma fileira com comprimento de sete unidades -How many ways can a row measuring fifty units in length be filled? +De quantas maneiras uma fileira de cinquenta unidades de comprimento pode ser preenchida? -**Note:** Although the example above does not lend itself to the possibility, in general it is permitted to mix block sizes. For example, on a row measuring eight units in length you could use red (3), black (1), and red (4). +**Observação:** embora o exemplo acima não se preste a essa possibilidade, em geral é permitido misturar tamanhos de bloco. Por exemplo, em uma fileira com oito unidades de comprimento, você poderia usar vermelho (3), preto (1) e vermelho (4). # --hints-- -`countingBlockOne()` should return `16475640049`. +`countingBlockOne()` deve retornar `16475640049`. ```js assert.strictEqual(countingBlockOne(), 16475640049); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-115-counting-block-combinations-ii.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-115-counting-block-combinations-ii.md index a659ea34ad1..9e56357a788 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-115-counting-block-combinations-ii.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-115-counting-block-combinations-ii.md @@ -1,6 +1,6 @@ --- id: 5900f3df1000cf542c50fef1 -title: 'Problem 115: Counting block combinations II' +title: 'Problema 115: Contando combinações de blocos II' challengeType: 1 forumTopicId: 301741 dashedName: problem-115-counting-block-combinations-ii @@ -8,23 +8,23 @@ dashedName: problem-115-counting-block-combinations-ii # --description-- -A row measuring `n` units in length has red blocks with a minimum length of `m` units placed on it, such that any two red blocks (which are allowed to be different lengths) are separated by at least one black square. +Uma linha medindo `n` unidades de comprimento tem blocos vermelhos com um comprimento mínimo de `m` unidades colocadas nela, de tal forma que dois blocos vermelhos (que podem ter comprimentos diferentes) são separados por pelo menos um quadrado preto. -Let the fill-count function, $F(m, n)$, represent the number of ways that a row can be filled. +Considere que a função de preenchimento, $F(m, n)$, representa o número de formas que uma fila pode ser preenchida. -For example, $F(3, 29) = 673135$ and $F(3, 30) = 1089155$. +Por exemplo, $F(3, 29) = 673135$ e $F(3, 30) = 1089155$. -That is, for m = 3, it can be seen that n = 30 is the smallest value for which the fill-count function first exceeds one million. +Ou seja, para m = 3, pode ser visto que n = 30 é o menor valor para o qual a função de contagem de preenchimento excede primeiro um milhão. -In the same way, for m = 10, it can be verified that $F(10, 56) = 880711$ and $F(10, 57) = 1148904$, so n = 57 is the least value for which the fill-count function first exceeds one million. +Da mesma maneira, para m = 10, pode ser verificado que $F(10, 56) = 880711$ e $F(10, 57) = 1148904$, então n = 57 é o menor valor para o qual a função de contagem de preenchimento excede primeiro um milhão. -For m = 50, find the least value of `n` for which the fill-count function first exceeds one million. +Para m = 50, encontre o menor valor de `n` para o qual a função de contagem de preenchimento excede primeiro um milhão. -**Note:** This is a more difficult version of Problem 114. +**Observação:** esta é uma versão mais difícil do Problema 114. # --hints-- -`countingBlockTwo()` should return `168`. +`countingBlockTwo()` deve retornar `168`. ```js assert.strictEqual(countingBlockTwo(), 168); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-116-red-green-or-blue-tiles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-116-red-green-or-blue-tiles.md index b0b1969a3df..8bfb736ab49 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-116-red-green-or-blue-tiles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-116-red-green-or-blue-tiles.md @@ -1,6 +1,6 @@ --- id: 5900f3e01000cf542c50fef3 -title: 'Problem 116: Red, green or blue tiles' +title: 'Problema 116: Blocos vermelhos, verdes ou azuis' challengeType: 1 forumTopicId: 301742 dashedName: problem-116-red-green-or-blue-tiles @@ -8,27 +8,27 @@ dashedName: problem-116-red-green-or-blue-tiles # --description-- -A row of five black square tiles is to have a number of its tiles replaced with coloured oblong tiles chosen from red (length two), green (length three), or blue (length four). +Uma fileira de cinco blocos quadrados pretos deve ser substituída por blocos oblongos coloridos, escolhidos entre vermelhos (comprimento dois), verdes (comprimento três) ou azuis (comprimento quatro). -If red tiles are chosen there are exactly seven ways this can be done. +Se forem escolhidos os blocos vermelhos, haverá exatamente sete maneiras de fazer isso. -Possible ways to placing red oblong on a row with length of five units +Formas possíveis de colocar um oblongo vermelho em uma linha com cinco unidades de comprimento -If green tiles are chosen there are three ways. +Se escolhermos os blocos verdes, há três maneiras de fazer isso. -Possible ways of placing green oblong on a row with length of five units +Formas possíveis de colocar um oblongo verde em uma linha com cinco unidades de comprimento -And if blue tiles are chosen there are two ways. +E se os blocos azuis forem escolhidos, há duas maneiras de fazer isso. -Possible ways of placing blue oblong on a row with length of five units +Formas possíveis de colocar um oblongo azul em uma linha com cinco unidades de comprimento -Assuming that colors cannot be mixed there are 7 + 3 + 2 = 12 ways of replacing the black tiles in a row measuring five units in length. How many different ways can the black tiles in a row measuring fifty units in length be replaced if colors cannot be mixed and at least one colored tile must be used? +Assumindo que as cores não podem ser misturadas, há 7 + 3 + 2 = 12 maneiras de substituir os blocos pretos em sequência, medindo cinco unidades de comprimento. De quantas maneiras diferentes os blocos pretos em uma fileira medindo cinquenta unidades de comprimento podem ser substituídos, se as cores não podem ser misturadas e pelo menos um bloco colorido deve ser usado? -**Note:** This is related to Problem 117. +**Observação:** este problema está relacionado ao Problema 117. # --hints-- -`redGreenBlueOne()` should return `20492570929`. +`redGreenBlueOne()` deve retornar `20492570929`. ```js assert.strictEqual(redGreenBlueOne(), 20492570929); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-117-red-green-and-blue-tiles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-117-red-green-and-blue-tiles.md index 4a4873aac95..681e79421a0 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-117-red-green-and-blue-tiles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-117-red-green-and-blue-tiles.md @@ -1,6 +1,6 @@ --- id: 5900f3e21000cf542c50fef4 -title: 'Problem 117: Red, green, and blue tiles' +title: 'Problema 117: Blocos vermelhos, verdes e azuis' challengeType: 1 forumTopicId: 301743 dashedName: problem-117-red-green-and-blue-tiles @@ -8,17 +8,17 @@ dashedName: problem-117-red-green-and-blue-tiles # --description-- -Using a combination of black square tiles and oblong tiles chosen from: red tiles measuring two units, green tiles measuring three units, and blue tiles measuring four units, it is possible to tile a row measuring five units in length in exactly fifteen different ways. +Usando uma combinação de blocos quadrados pretos e blocos oblongos selecionados entre: blocos vermelhos medindo duas unidades, blocos verdes medindo três unidades e blocos azuis medindo quatro unidades, é possível fazer fileiras de cinco unidades de comprimento exatamente de quinze formas diferentes. -Possible ways of placing red, green and blue oblongs on a row with length of five units +Formas possíveis de colocar oblongos vermelhos, verdes e azuis em uma linha com cinco unidades de comprimento -How many ways can a row measuring fifty units in length be tiled? +De quantas maneiras uma fileira de cinquenta unidades de comprimento pode ser preenchida? -**Note**: This is related to Problem 116. +**Observação**: este problema está relacionado ao Problema 116. # --hints-- -`redGreenBlueTilesTwo()` should return `100808458960497`. +`redGreenBlueTilesTwo()` deve retornar `100808458960497`. ```js assert.strictEqual(redGreenBlueTilesTwo(), 100808458960497); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-118-pandigital-prime-sets.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-118-pandigital-prime-sets.md index 195d39136ed..802665faec1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-118-pandigital-prime-sets.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-118-pandigital-prime-sets.md @@ -1,6 +1,6 @@ --- id: 5900f3e21000cf542c50fef5 -title: 'Problem 118: Pandigital prime sets' +title: 'Problema 118: Conjuntos de números primos pandigitais' challengeType: 1 forumTopicId: 301744 dashedName: problem-118-pandigital-prime-sets @@ -8,13 +8,13 @@ dashedName: problem-118-pandigital-prime-sets # --description-- -Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can be formed. Interestingly with the set $\\{2, 5, 47, 89, 631\\}$, all of the elements belonging to it are prime. +Usando todos os algarismos de 1 a 9 e concatenando-os livremente para formar números inteiros decimais, diferentes conjuntos podem ser formados. É interessante que, com o conjunto $\\{2, 5, 47, 89, 631\\}$, todos os elementos pertencentes a ele são primos. -How many distinct sets containing each of the digits one through nine exactly once contain only prime elements? +Quantos conjuntos distintos, contendo cada um dos algarismos de um a nove exatamente uma vez, são compostos apenas por elementos primos? # --hints-- -`pandigitalPrimeSets()` should return `44680`. +`pandigitalPrimeSets()` deve retornar `44680`. ```js assert.strictEqual(pandigitalPrimeSets(), 44680); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-119-digit-power-sum.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-119-digit-power-sum.md index 87bf836b33a..793e38071de 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-119-digit-power-sum.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-119-digit-power-sum.md @@ -1,6 +1,6 @@ --- id: 5900f3e41000cf542c50fef6 -title: 'Problem 119: Digit power sum' +title: 'Problema 119: Soma das potências dos algarismos' challengeType: 1 forumTopicId: 301745 dashedName: problem-119-digit-power-sum @@ -8,17 +8,17 @@ dashedName: problem-119-digit-power-sum # --description-- -The number 512 is interesting because it is equal to the sum of its digits raised to some power: $5 + 1 + 2 = 8$, and $8^3 = 512$. Another example of a number with this property is $614656 = 28^4$. +O número 512 é interessante porque é igual à soma de seus algarismos elevado a alguma potência: $5 + 1 + 2 = 8$, e $8^3 = 512$. Outro exemplo de um número com essa propriedade é $614656 = 28^4$. -We shall define $a_n$ to be the $n-th$ term of this sequence and insist that a number must contain at least two digits to have a sum. +Vamos definir $a_n$ como o $n-ésimo$ termo desta sequência e reforçar que um número deve conter pelo menos dois algarismos para ter uma soma. -You are given that $a_2 = 512$ and $a_{10} = 614656$. +Você já sabe que $a_2 = 512$ e $a_{10} = 614656$. -Find $a_{30}$. +Encontre $a_{30}$. # --hints-- -`digitPowerSum()` should return `248155780267521`. +`digitPowerSum()` deve retornar `248155780267521`. ```js assert.strictEqual(digitPowerSum(), 248155780267521); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-120-square-remainders.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-120-square-remainders.md index d42c224e3db..59b01299e1d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-120-square-remainders.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-120-square-remainders.md @@ -1,6 +1,6 @@ --- id: 5900f3e41000cf542c50fef7 -title: 'Problem 120: Square remainders' +title: 'Problema 120: Restos quadrados' challengeType: 1 forumTopicId: 301747 dashedName: problem-120-square-remainders @@ -8,15 +8,15 @@ dashedName: problem-120-square-remainders # --description-- -Let `r` be the remainder when ${(a − 1)}^n + {(a + 1)}^n$ is divided by $a^2$. +Considere que `r` seja o resto quando ${(a -- 1)}^n + {(a + 1)}^n$ é dividido por $a^2$. -For example, if $a = 7$ and $n = 3$, then $r = 42: 6^3 + 8^3 = 728 ≡ 42 \\ \text{mod}\\ 49$. And as `n` varies, so too will `r`, but for $a = 7$ it turns out that $r_{max} = 42$. +Por exemplo, se $a = 7$ e $n = 3$, então $r = 42: 6^3 + 8^3 = 728 ≡ 42 \\ \text{mod}\\ 49$. Conforme `n` varia, `r` também vai variar, mas, para $a = 7$, temos que $r_{max} = 42$. -For $3 ≤ a ≤ 1000$, find $\sum{r}_{max}$. +Para $3 ≤ a ≤ 1000$, encontre $\sum{r}_{max}$. # --hints-- -`squareRemainders()` should return `333082500`. +`squareRemainders()` deve retornar `333082500`. ```js assert.strictEqual(squareRemainders(), 333082500); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-121-disc-game-prize-fund.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-121-disc-game-prize-fund.md index 0f23b7fdd50..f2e56cf453a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-121-disc-game-prize-fund.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-121-disc-game-prize-fund.md @@ -1,6 +1,6 @@ --- id: 5900f3e51000cf542c50fef8 -title: 'Problem 121: Disc game prize fund' +title: 'Problema 121: Fundo de prêmio de jogo do disco' challengeType: 1 forumTopicId: 301748 dashedName: problem-121-disc-game-prize-fund @@ -8,17 +8,17 @@ dashedName: problem-121-disc-game-prize-fund # --description-- -A bag contains one red disc and one blue disc. In a game of chance a player takes a disc at random and its colour is noted. After each turn the disc is returned to the bag, an extra red disc is added, and another disc is taken at random. +Uma bolsa contém um disco vermelho e um disco azul. Em um jogo de azar, um jogador recebe um disco aleatório e sua cor é anotada. Após cada turno, o disco é devolvido à sacola, um disco vermelho extra é adicionado e outro disco é retirado aleatoriamente. -The player pays £1 to play and wins if they have taken more blue discs than red discs at the end of the game. +O jogador paga £1 para jogar e ganha se tiver recebido mais discos azuis do que discos vermelhos no final do jogo. -If the game is played for four turns, the probability of a player winning is exactly 11/120, and so the maximum prize fund the banker should allocate for winning in this game would be £10 before they would expect to incur a loss. Note that any payout will be a whole number of pounds and also includes the original £1 paid to play the game, so in the example given the player actually wins £9. +Se o jogo for jogado por quatro turnos, a probabilidade de um jogador vencer é exatamente 11/120, e, portanto, o fundo de prêmio máximo que a banca deve atribuir para a vitória neste jogo seria de 10 libras esterlinas antes de esperar sofrer uma perda. Observe que qualquer pagamento será um número inteiro de libras e que ele também incluirá a quantia de £1 original paga para jogar o jogo. Portanto, no exemplo dado, o jogador, ganha de fato 9 libras. -Find the maximum prize fund that should be allocated to a single game in which fifteen turns are played. +Encontre o fundo máximo de prêmios que deve ser atribuído a um único jogo em que se jogam quinze turnos. # --hints-- -`discGamePrize()` should return `2269`. +`discGamePrize()` deve retornar `2269`. ```js assert.strictEqual(discGamePrize(), 2269); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-122-efficient-exponentiation.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-122-efficient-exponentiation.md index 78c29aa7952..416c0ce83ba 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-122-efficient-exponentiation.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-122-efficient-exponentiation.md @@ -1,6 +1,6 @@ --- id: 5900f3e61000cf542c50fef9 -title: 'Problem 122: Efficient exponentiation' +title: 'Problema 122: Exponenciação eficiente' challengeType: 1 forumTopicId: 301749 dashedName: problem-122-efficient-exponentiation @@ -8,30 +8,30 @@ dashedName: problem-122-efficient-exponentiation # --description-- -The most naive way of computing $n^{15}$ requires fourteen multiplications: +A maneira mais ingênua de calcular $n^{15}$ requer 14 multiplicações: $$n × n × \ldots × n = n^{15}$$ -But using a "binary" method you can compute it in six multiplications: +Mas usando um método "binário" você pode calculá-lo em seis multiplicações: $$\begin{align} & n × n = n^2\\\\ & n^2 × n^2 = n^4\\\\ & n^4 × n^4 = n^8\\\\ & n^8 × n^4 = n^{12}\\\\ & n^{12} × n^2 = n^{14}\\\\ & n^{14} × n = n^{15} \end{align}$$ -However it is yet possible to compute it in only five multiplications: +No entanto, ainda é possível calculá-lo em apenas cinco multiplicações: $$\begin{align} & n × n = n^2\\\\ & n^2 × n = n^3\\\\ & n^3 × n^3 = n^6\\\\ & n^6 × n^6 = n^{12}\\\\ & n^{12} × n^3 = n^{15} \end{align}$$ -We shall define $m(k)$ to be the minimum number of multiplications to compute $n^k$; for example $m(15) = 5$. +Definiremos $m(k)$ como o número mínimo de multiplicações para calcular $n^k$; por exemplo, $m(15) = 5$. -For $1 ≤ k ≤ 200$, find $\sum{m(k)}$. +Para $1 ≤ k ≤ 200$, encontre $\sum{m(k)}$. # --hints-- -`efficientExponentation()` should return `1582`. +`efficientExponentation()` deve retornar `1582`. ```js assert.strictEqual(efficientExponentation(), 1582); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-123-prime-square-remainders.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-123-prime-square-remainders.md index 743089b64e3..561e04585a1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-123-prime-square-remainders.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-123-prime-square-remainders.md @@ -1,6 +1,6 @@ --- id: 5900f3e71000cf542c50fefa -title: 'Problem 123: Prime square remainders' +title: 'Problema 123: Resto dos quadrados dos primos' challengeType: 1 forumTopicId: 301750 dashedName: problem-123-prime-square-remainders @@ -8,17 +8,17 @@ dashedName: problem-123-prime-square-remainders # --description-- -Let $p_n$ be the $n$th prime: 2, 3, 5, 7, 11, ..., and let $r$ be the remainder when ${(p_n−1)}^n + {(p_n+1)}^n$ is divided by ${p_n}^2$. +Considere $p_n$ o $n$-ésimo número primo: 2, 3, 5, 7, 11, ..., e $r$ o resto da divisão quando ${(p_n−1)}^n + {(p_n+1)}^n$ é dividido por ${p_n}^2$. -For example, when $n = 3, p_3 = 5$, and $4^3 + 6^3 = 280 ≡ 5\\ mod\\ 25$. +Por exemplo, quando $n = 3, p_3 = 5$ e $4^3 + 6^3 = 280 ≡ 5\\ mod\\ 25$. -The least value of $n$ for which the remainder first exceeds $10^9$ is 7037. +O menor valor de $n$ para o qual o resto excede $10^9$ é 7037. -Find the least value of $n$ for which the remainder first exceeds $10^{10}$. +Encontre o menor valor de $n$ para o qual o resto excede $10^{10}$. # --hints-- -`primeSquareRemainders()` should return `21035`. +`primeSquareRemainders()` deve retornar `21035`. ```js assert.strictEqual(primeSquareRemainders(), 21035); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-124-ordered-radicals.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-124-ordered-radicals.md index 899171a9731..81a2340e216 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-124-ordered-radicals.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-124-ordered-radicals.md @@ -1,6 +1,6 @@ --- id: 5900f3e81000cf542c50fefb -title: 'Problem 124: Ordered radicals' +title: 'Problema 124: Radicais ordenados' challengeType: 1 forumTopicId: 301751 dashedName: problem-124-ordered-radicals @@ -8,17 +8,17 @@ dashedName: problem-124-ordered-radicals # --description-- -The radical of $n$, $rad(n)$, is the product of the distinct prime factors of $n$. For example, $504 = 2^3 × 3^2 × 7$, so $rad(504) = 2 × 3 × 7 = 42$. +O radical de $n$, $rad(n)$, é o produto dos fatores primos distintos de $n$. Por exemplo, $504 = 2^3 × 3^2 × 7$, então $rad(504) = 2 × 3 × 7 = 42$. -If we calculate $rad(n)$ for $1 ≤ n ≤ 10$, then sort them on $rad(n)$, and sorting on $n$ if the radical values are equal, we get: +Se calcularmos $rad(n)$ para $1 ≤ n ≤ 10$ e, em seguida, ordená-los em $rad(n)$, e ordená-los novamente em $n$ se os valores dos radicais forem iguais, obtemos:
- + - + @@ -112,11 +112,11 @@ If we calculate $rad(n)$ for $1 ≤ n ≤ 10$, then sort them on $rad(n)$, and s
$Unsorted$$Nao ordenados$ $Sorted$$Ordenados$
$n$

-Let $E(k)$ be the $k$th element in the sorted $n$ column; for example, $E(4) = 8$ and $E(6) = 9$. If $rad(n)$ is sorted for $1 ≤ n ≤ 100000$, find $E(10000)$. +Considere $E(k)$ como o $k$-ésimo elemento na coluna de ordenados $n$; por exemplo, $E(4) = 8$ e $E(6) = 9$. Se $rad(n)$ estiver ordenado para $1 ≤ n ≤ 100000$, encontre $E(10000)$. # --hints-- -`orderedRadicals()` should return `21417`. +`orderedRadicals()` deve retornar `21417`. ```js assert.strictEqual(orderedRadicals(), 21417); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-125-palindromic-sums.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-125-palindromic-sums.md index eb499c13931..1dd03404588 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-125-palindromic-sums.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-125-palindromic-sums.md @@ -1,6 +1,6 @@ --- id: 5900f3e91000cf542c50fefc -title: 'Problem 125: Palindromic sums' +title: 'Problema 125: Somas de palíndromo' challengeType: 1 forumTopicId: 301752 dashedName: problem-125-palindromic-sums @@ -8,14 +8,14 @@ dashedName: problem-125-palindromic-sums # --description-- -The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: $6^2 + 7^2 + 8^2 + 9^2 + 10^2 + 11^2 + 12^2$. +O número palíndromo 595 é interessante, porque ele pode ser escrito como a soma dos quadrados consecutivos: $6^2 + 7^2 + 8^2 + 9^2 + 9^2 + 10^2 + 11^2 + 12^2$. -There are exactly eleven palindromes below one-thousand that can be written as consecutive square sums, and the sum of these palindromes is 4164. Note that $1 = 0^2 + 1^2$ has not been included as this problem is concerned with the squares of positive integers. +Existem exatamente onze palíndromos abaixo de mil que podem ser escritos como somas quadradas consecutivas. A soma destes palíndromos é 4164. Observe que $1 = 0^2 + 1^2$ não foi incluído, pois este problema está interessado nos quadrados de inteiros positivos. -Find the sum of all the numbers less than the `limit` that are both palindromic and can be written as the sum of consecutive squares. +Calcule a soma de todos os números menores que `limit` que sejam palíndromos e que possam ser escritos como a soma de quadrados consecutivos. # --hints-- -`palindromicSums(100000000)` should return `2906969179`. +`palindromicSums(100000000)` deve retornar `2906969179`. ```js @@ -23,13 +23,13 @@ assert.strictEqual(palindromicSums(100000000), 2906969179); ``` -`palindromicSums(100)` should return `137`. +`palindromicSums(100)` deve retornar `137`. ```js assert.strictEqual(palindromicSums(100), 137); ``` -`palindromicSums(1000)` should return `4164`. +`palindromicSums(1000)` deve retornar `4164`. ```js assert.strictEqual(palindromicSums(1000),4164); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-126-cuboid-layers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-126-cuboid-layers.md index d089c18aff0..9ddcc0cc4b4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-126-cuboid-layers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-126-cuboid-layers.md @@ -1,6 +1,6 @@ --- id: 5900f3ea1000cf542c50fefd -title: 'Problem 126: Cuboid layers' +title: 'Problema 126: Camadas de cuboides' challengeType: 1 forumTopicId: 301753 dashedName: problem-126-cuboid-layers @@ -8,23 +8,23 @@ dashedName: problem-126-cuboid-layers # --description-- -The minimum number of cubes to cover every visible face on a cuboid measuring 3 x 2 x 1 is twenty-two. +A número mínimo de cubos para cobrir todas as faces visíveis de um cuboide medindo 3 x 2 x 1 é 22. -3x2x1 cuboid covered by twenty-two 1x1x1 cubes +Cuboide 3 x 2 x 1 coberto por 22 cubos 1 x 1 x 1 -If we add a second layer to this solid it would require forty-six cubes to cover every visible face, the third layer would require seventy-eight cubes, and the fourth layer would require one-hundred and eighteen cubes to cover every visible face. +Se adicionarmos uma segunda camada a este sólido, precisaremos de 46 cubos para cobrir todas as faces visíveis, a terceira camada precisará de 78 cubos e a quarta camada precisará de 118 cubos para cobrir todas as faces visíveis. -However, the first layer on a cuboid measuring 5 x 1 x 1 also requires twenty-two cubes; similarly, the first layer on cuboids measuring 5 x 3 x 1, 7 x 2 x 1, and 11 x 1 x 1 all contain forty-six cubes. +No entanto, a primeira camada de um cuboide que mede 5 x 1 x 1 também precisa de 22 cubos; analogamente, a primeira camada de cuboides que medem 5 x 3 x 1, 7 x 2 x 1 e 11 x 1 x 1 contém 46 cubos. -We shall define $C(n)$ to represent the number of cuboids that contain $n$ cubes in one of its layers. So $C(22) = 2$, $C(46) = 4$, $C(78) = 5$, and $C(118) = 8$. +Definiremos $C(n)$ como a representação do número de cubos que contêm $n$ cubos em uma de suas camadas. Portanto, $C(22) = 2$, $C(46) = 4$, $C(78) = 5$ e $C(118) = 8$. -It turns out that 154 is the least value of $n$ for which $C(n) = 10$. +Acontece que 154 é o menor valor de $n$ no qual $C(n) = 10$. -Find the least value of $n$ for which $C(n) = 1000$. +Calcule o menor valor de $n$ no qual $C(n) = 1000$. # --hints-- -`cuboidLayers()` should return `18522`. +`cuboidLayers()` deve retornar `18522`. ```js assert.strictEqual(cuboidLayers(), 18522); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-127-abc-hits.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-127-abc-hits.md index 2f7f927858e..73a24de1085 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-127-abc-hits.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-127-abc-hits.md @@ -1,6 +1,6 @@ --- id: 5900f3ec1000cf542c50fefe -title: 'Problem 127: abc-hits' +title: 'Problema 127: Trio abc' challengeType: 1 forumTopicId: 301754 dashedName: problem-127-abc-hits @@ -8,29 +8,29 @@ dashedName: problem-127-abc-hits # --description-- -The radical of $n$, $rad(n)$, is the product of distinct prime factors of $n$. For example, $504 = 2^3 × 3^2 × 7$, so $rad(504) = 2 × 3 × 7 = 42$. +O radical de $n$, $rad(n)$, é o produto dos fatores primos distintos de $n$. Por exemplo, $504 = 2^3 × 3^2 × 7$, então $rad(504) = 2 × 3 × 7 = 42$. -We shall define the triplet of positive integers (a, b, c) to be an abc-hit if: +Definiremos o trio de números inteiros positivos (a, b, c) como sendo um trio abc se: 1. $GCD(a, b) = GCD(a, c) = GCD(b, c) = 1$ 2. $a < b$ 3. $a + b = c$ 4. $rad(abc) < c$ -For example, (5, 27, 32) is an abc-hit, because: +Por exemplo, (5, 27, 32) é um trio abc, pois: 1. $GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1$ 2. $5 < 27$ 3. $5 + 27 = 32$ 4. $rad(4320) = 30 < 32$ -It turns out that abc-hits are quite rare and there are only thirty-one abc-hits for $c < 1000$, with $\sum{c} = 12523$. +Ocorre que os trios abc são bastante raros e há somente 31 deles para $c < 1000$, com a $\sum{c} = 12523$. -Find $\sum{c}$ for $c < 120000$. +Encontre a $\sum{c}$ para $c < 120000$. # --hints-- -`abcHits()` should return `18407904`. +`abcHits()` deve retornar `18407904`. ```js assert.strictEqual(abcHits(), 18407904); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-128-hexagonal-tile-differences.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-128-hexagonal-tile-differences.md index 49d59948762..e3f062a4476 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-128-hexagonal-tile-differences.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-128-hexagonal-tile-differences.md @@ -1,6 +1,6 @@ --- id: 5900f3ec1000cf542c50feff -title: 'Problem 128: Hexagonal tile differences' +title: 'Problema 128: Diferenças de blocos hexagonais' challengeType: 1 forumTopicId: 301755 dashedName: problem-128-hexagonal-tile-differences @@ -8,33 +8,33 @@ dashedName: problem-128-hexagonal-tile-differences # --description-- -A hexagonal tile with number 1 is surrounded by a ring of six hexagonal tiles, starting at "12 o'clock" and numbering the tiles 2 to 7 in an anti-clockwise direction. +Um bloco hexagonal com o número 1 é cercado por um anel de seis blocos hexagonais, começando às "12 horas" e numerando os blocos de 2 a 7 em direção anti-horária. -New rings are added in the same fashion, with the next rings being numbered 8 to 19, 20 to 37, 38 to 61, and so on. The diagram below shows the first three rings. +Novos anéis são adicionados da mesma forma, com os próximos anéis sendo numerados de 8 a 19, 20 a 37, 38 a 61, e assim por diante. O diagrama abaixo mostra os três primeiros anéis. -three first rings of arranged hexagonal tiles with numbers 1 to 37, and with highlighted tiles 8 and 17 +três primeiros anéis de blocos hexagonais dispostos com números de 1 a 37 e com os blocos 8 e 17 destacados -By finding the difference between tile $n$ and each of its six neighbours we shall define $PD(n)$ to be the number of those differences which are prime. +Ao calcular a diferença entre o bloco $n$ e cada um de seus seis vizinhos, definiremos $PD(n)$ como o número dessas diferenças primas, que são primos. -For example, working clockwise around tile 8 the differences are 12, 29, 11, 6, 1, and 13. So $PD(8) = 3$. +Por exemplo, trabalhando no sentido horário em torno do bloco 8, as diferenças são 12, 29, 11, 6, 1 e 13. Portanto, $PD(8) = 3$. -In the same way, the differences around tile 17 are 1, 17, 16, 1, 11, and 10, hence $PD(17) = 2$. +Da mesma forma, as diferenças em torno do bloco 17 são 1, 17, 16, 1, 11 e 10. Portanto, $PD(17) = 2$. -It can be shown that the maximum value of $PD(n)$ is $3$. +Pode-se ser mostrar que o valor máximo de $PD(n)$ é $3$. -If all of the tiles for which $PD(n) = 3$ are listed in ascending order to form a sequence, the 10th tile would be 271. +Se todos os blocos para os quais $PD(n) = 3$ estiverem listados em ordem ascendente para formar uma sequência, o décimo bloco seria 271. -Find the 2000th tile in this sequence. +Encontre o 2000º bloco desta sequência. # --hints-- -`hexagonalTile(10)` should return `271`. +`hexagonalTile(10)` deve retornar `271`. ```js assert.strictEqual(hexagonalTile(10), 271); ``` -`hexagonalTile(2000)` should return `14516824220`. +`hexagonalTile(2000)` deve retornar `14516824220`. ```js assert.strictEqual(hexagonalTile(2000), 14516824220); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-129-repunit-divisibility.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-129-repunit-divisibility.md index e7f423f96d5..752f7d734e1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-129-repunit-divisibility.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-129-repunit-divisibility.md @@ -1,6 +1,6 @@ --- id: 5900f3ef1000cf542c50ff01 -title: 'Problem 129: Repunit divisibility' +title: 'Problema 129: Divisibilidade de repunits' challengeType: 1 forumTopicId: 301756 dashedName: problem-129-repunit-divisibility @@ -8,17 +8,17 @@ dashedName: problem-129-repunit-divisibility # --description-- -A number consisting entirely of ones is called a repunit. We shall define $R(k)$ to be a repunit of length $k$; for example, $R(6) = 111111$. +Em inglês, um número que consiste apenas de 1s é chamado de repunit. Definiremos $R(k)$ como sendo um repunit de comprimento $k$. Por exemplo, $R(6) = 111111$. -Given that $n$ is a positive integer and $GCD(n, 10) = 1$, it can be shown that there always exists a value, $k$, for which $R(k)$ is divisible by $n$, and let $A(n)$ be the least such value of $k$; for example, $A(7) = 6$ and $A(41) = 5$. +Dado que $n$ é um número inteiro positivo e que o máximo divisor comum $GCD(n, 10) = 1$, pode-se mostrar que sempre existe um valor, $k$, para o qual $R(k)$ é divisível por $n$. Além disso, consideremos $A(n)$ o menor dos valores de $k$ (por exemplo, $A(7) = 6$ e $A(41) = 5$). -The least value of $n$ for which $A(n)$ first exceeds ten is 17. +O menor valor de $n$ para o qual o $A(n)$ excede dez é 17. -Find the least value of $n$ for which $A(n)$ first exceeds one-million. +Encontre o menor valor de $n$ para o qual $A(n)$ excede um milhão. # --hints-- -`repunitDivisibility()` should return `1000023`. +`repunitDivisibility()` deve retornar `1000023`. ```js assert.strictEqual(repunitDivisibility(), 1000023); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-130-composites-with-prime-repunit-property.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-130-composites-with-prime-repunit-property.md index 48f7149e5a6..62213a29929 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-130-composites-with-prime-repunit-property.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-130-composites-with-prime-repunit-property.md @@ -1,6 +1,6 @@ --- id: 5900f3ee1000cf542c50ff00 -title: 'Problem 130: Composites with prime repunit property' +title: 'Problema 130: Compostos com propriedade de primo repunit' challengeType: 1 forumTopicId: 301758 dashedName: problem-130-composites-with-prime-repunit-property @@ -8,19 +8,19 @@ dashedName: problem-130-composites-with-prime-repunit-property # --description-- -A number consisting entirely of ones is called a repunit. We shall define $R(k)$ to be a repunit of length $k$; for example, $R(6) = 111111$. +Em inglês, um número que consiste apenas de 1s é chamado de repunit. Definiremos $R(k)$ como sendo um repunit de comprimento $k$. Por exemplo, $R(6) = 111111$. -Given that $n$ is a positive integer and $GCD(n, 10) = 1$, it can be shown that there always exists a value, $k$, for which $R(k)$ is divisible by $n$, and let $A(n)$ be the least such value of $k$; for example, $A(7) = 6$ and $A(41) = 5$. +Dado que $n$ é um número inteiro positivo e que o máximo divisor comum $GCD(n, 10) = 1$, pode-se mostrar que sempre existe um valor, $k$, para o qual $R(k)$ é divisível por $n$. Além disso, consideremos $A(n)$ o menor dos valores de $k$ (por exemplo, $A(7) = 6$ e $A(41) = 5$). -You are given that for all primes, $p > 5$, that $p − 1$ is divisible by $A(p)$. For example, when $p = 41, A(41) = 5$, and 40 is divisible by 5. +Você é informado, para todos os números primos, $p > 5$, que $p − 1$ é divisível por $A(p)$. Por exemplo, quando $p = 41, A(41) = 5$ e 40 é divisível por 5. -However, there are rare composite values for which this is also true; the first five examples being 91, 259, 451, 481, and 703. +No entanto, há valores compostos raros para os quais isto também é verdadeiro. Os cinco primeiros exemplos são 91, 259, 451, 481 e 703. -Find the sum of the first twenty-five composite values of $n$ for which $GCD(n, 10) = 1$ and $n − 1$ is divisible by $A(n)$. +Encontre a soma dos primeiros vinte e cinco valores compostos de $n$ para os quais o máximo divisor comum, $GCD(n, 10) = 1$, e $n - 1$ é divisível por $A(n)$. # --hints-- -`compositeRepunit()` should return `149253`. +`compositeRepunit()` deve retornar `149253`. ```js assert.strictEqual(compositeRepunit(), 149253); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-132-large-repunit-factors.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-132-large-repunit-factors.md index 5ca7c0760fd..c9ef6d68bb1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-132-large-repunit-factors.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-132-large-repunit-factors.md @@ -1,6 +1,6 @@ --- id: 5900f3f11000cf542c50ff03 -title: 'Problem 132: Large repunit factors' +title: 'Problema 132: Fatores repunit grandes' challengeType: 1 forumTopicId: 301760 dashedName: problem-132-large-repunit-factors @@ -8,15 +8,15 @@ dashedName: problem-132-large-repunit-factors # --description-- -A number consisting entirely of ones is called a repunit. We shall define $R(k)$ to be a repunit of length $k$. +Em inglês, um número que consiste apenas de 1s é chamado de repunit. Devemos definir $R(k)$ como uma repunit de tamanho $k$. -For example, $R(10) = 1111111111 = 11 × 41 × 271 × 9091$, and the sum of these prime factors is 9414. +Por exemplo, $R(10) = 1111111111 = 11 × 41 × 271 × 9091$, e a soma desses fatores primos é 9414. -Find the sum of the first forty prime factors of $R({10}^9)$. +Encontre a soma dos 40 primeiros fatores primos de $R({10}^9)$. # --hints-- -`largeRepunitFactors()` should return `843296`. +`largeRepunitFactors()` deve retornar `843296`. ```js assert.strictEqual(largeRepunitFactors(), 843296); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-133-repunit-nonfactors.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-133-repunit-nonfactors.md index ee861a14420..dcf6c04c8ac 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-133-repunit-nonfactors.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-133-repunit-nonfactors.md @@ -1,6 +1,6 @@ --- id: 5900f3f21000cf542c50ff04 -title: 'Problem 133: Repunit nonfactors' +title: 'Problema 133: Não fatores repunit' challengeType: 1 forumTopicId: 301761 dashedName: problem-133-repunit-nonfactors @@ -8,17 +8,17 @@ dashedName: problem-133-repunit-nonfactors # --description-- -A number consisting entirely of ones is called a repunit. We shall define $R(k)$ to be a repunit of length $k$; for example, $R(6) = 111111$. +Em inglês, um número que consiste apenas de 1s é chamado de repunit. Definiremos $R(k)$ como sendo um repunit de comprimento $k$. Por exemplo, $R(6) = 111111$. -Let us consider repunits of the form $R({10}^n)$. +Vamos considerar os repunits no formato $R({10}^n)$. -Although $R(10)$, $R(100)$, or $R(1000)$ are not divisible by 17, $R(10000)$ is divisible by 17. Yet there is no value of n for which $R({10}^n)$ will divide by 19. Remarkably, 11, 17, 41, and 73 are the only four primes below one-hundred that can be a factor of $R({10}^n)$. +Embora $R(10)$, $R(100)$ ou $R(1000)$ não sejam divisíveis por 17, $R(10000)$ é. No entanto, não há valor de n para o qual $R({10}^n)$ seja divisível por 19. Curiosamente, 11, 17, 41 e 73 são os únicos quatro primos abaixo de cem que podem ser um fator de $R({10}^n)$. -Find the sum of all the primes below one-hundred thousand that will never be a factor of $R({10}^n)$. +Encontre a soma de todos os primos abaixo de cem mil que nunca serão um fator de $R({10}^n)$. # --hints-- -`repunitNonfactors()` should return `453647705`. +`repunitNonfactors()` deve retornar `453647705`. ```js assert.strictEqual(repunitNonfactors(), 453647705); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-134-prime-pair-connection.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-134-prime-pair-connection.md index d6629ef1579..57fd7d76f1d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-134-prime-pair-connection.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-134-prime-pair-connection.md @@ -1,6 +1,6 @@ --- id: 5900f3f21000cf542c50ff05 -title: 'Problem 134: Prime pair connection' +title: 'Problema 134: Conexão de pares de números primos' challengeType: 1 forumTopicId: 301762 dashedName: problem-134-prime-pair-connection @@ -8,15 +8,15 @@ dashedName: problem-134-prime-pair-connection # --description-- -Consider the consecutive primes $p_1 = 19$ and $p_2 = 23$. It can be verified that 1219 is the smallest number such that the last digits are formed by $p_1$ whilst also being divisible by $p_2$. +Considere os primos consecutivos $p_1 = 19$ e $p_2 = 23$. É possível verificar que 1219 é o menor número, tal que os últimos algarismos são formados por $p_1$, ao mesmo tempo em que são divisíveis por $p_2$. -In fact, with the exception of $p_1 = 3$ and $p_2 = 5$, for every pair of consecutive primes, $p_2 > p_1$, there exist values of $n$ for which the last digits are formed by $p_1$ and $n$ is divisible by $p_2$. Let $S$ be the smallest of these values of $n$. +De fato, com exceção de $p_1 = 3$ e $p_2 = 5$, para cada par de números primos consecutivos, $p_2 > p_1$, existem valores de $n$ para os quais os últimos algarismos são formados por $p_1$ e $n$ é divisível por $p_2$. Considere $S$ o menor destes valores de $n$. -Find $\sum{S}$ for every pair of consecutive primes with $5 ≤ p_1 ≤ 1000000$. +Encontre $\sum{S}$ para cada par de números primos consecutivos, com $5 ≤ p_1 ≤ 1000000$. # --hints-- -`primePairConnection()` should return `18613426663617120`. +`primePairConnection()` deve retornar `18613426663617120`. ```js assert.strictEqual(primePairConnection(), 18613426663617120); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-135-same-differences.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-135-same-differences.md index 3045467d61e..86041752418 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-135-same-differences.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-135-same-differences.md @@ -1,6 +1,6 @@ --- id: 5900f3f31000cf542c50ff06 -title: 'Problem 135: Same differences' +title: 'Problema 135: Mesmas diferenças' challengeType: 1 forumTopicId: 301763 dashedName: problem-135-same-differences @@ -8,17 +8,17 @@ dashedName: problem-135-same-differences # --description-- -Given the positive integers, $x$, $y$, and $z$, are consecutive terms of an arithmetic progression, the least value of the positive integer, $n$, for which the equation, $x^2 − y^2 − z^2 = n$, has exactly two solutions is $n = 27$: +Sendo os números inteiros positivos, $x$, $y$ e $z$, termos consecutivos de uma progressão aritmética, o menor valor do inteiro positivo, $n$, para o qual a equação, $x^2 - y^2 - z^2 = n$, tem exatamente duas soluções é $n = 27$: $$34^2 − 27^2 − 20^2 = 12^2 − 9^2 − 6^2 = 27$$ -It turns out that $n = 1155$ is the least value which has exactly ten solutions. +Ocorre que $n = 1155$ é o menor valor para o qual a equação tem exatamente dez soluções. -How many values of $n$ less than one million have exactly ten distinct solutions? +Quantos valores de $n$ abaixo de um milhão têm exatamente dez soluções distintas? # --hints-- -`sameDifferences()` should return `4989`. +`sameDifferences()` deve retornar `4989`. ```js assert.strictEqual(sameDifferences(), 4989); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-136-singleton-difference.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-136-singleton-difference.md index d73ff59f63b..520075e31d7 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-136-singleton-difference.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-136-singleton-difference.md @@ -1,6 +1,6 @@ --- id: 5900f3f51000cf542c50ff07 -title: 'Problem 136: Singleton difference' +title: 'Problema 136: Diferenças de solitários' challengeType: 1 forumTopicId: 301764 dashedName: problem-136-singleton-difference @@ -8,17 +8,17 @@ dashedName: problem-136-singleton-difference # --description-- -The positive integers, $x$, $y$, and $z$, are consecutive terms of an arithmetic progression. Given that $n$ is a positive integer, the equation, $x^2 − y^2 − z^2 = n$, has exactly one solution when $n = 20$: +Os números inteiros positivos, $x$, $y$e $z$, são termos consecutivos de uma progressão aritmética. Dado que $n$ é um número inteiro positivo, a equação, $x^2 - y^2 - z^2 = n$, tem exatamente uma solução quando $n = 20$: $$13^2 − 10^2 − 7^2 = 20$$ -In fact, there are twenty-five values of $n$ below one hundred for which the equation has a unique solution. +De fato, há vinte e cinco valores de $n$ abaixo de cem para os quais a equação tem uma solução única. -How many values of $n$ less than fifty million have exactly one solution? +Quantos valores de $n$ abaixo de cinquenta milhões têm exatamente uma solução? # --hints-- -`singletonDifference()` should return `2544559`. +`singletonDifference()` deve retornar `2544559`. ```js assert.strictEqual(singletonDifference(), 2544559); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-137-fibonacci-golden-nuggets.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-137-fibonacci-golden-nuggets.md index b700dba62d0..ef4b5fbcfa1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-137-fibonacci-golden-nuggets.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-137-fibonacci-golden-nuggets.md @@ -1,6 +1,6 @@ --- id: 5900f3f51000cf542c50ff08 -title: 'Problem 137: Fibonacci golden nuggets' +title: 'Problema 137: Pepitas de ouro de Fibonacci' challengeType: 1 forumTopicId: 301765 dashedName: problem-137-fibonacci-golden-nuggets @@ -8,16 +8,16 @@ dashedName: problem-137-fibonacci-golden-nuggets # --description-- -Consider the infinite polynomial series $A_{F}(x) = xF_1 + x^2F_2 + x^3F_3 + \ldots$, where $F_k$ is the $k$th term in the Fibonacci sequence: $1, 1, 2, 3, 5, 8, \ldots$; that is, $F_k = F_{k − 1} + F_{k − 2}, F_1 = 1$ and $F_2 = 1$. +Considere a série polinomial infinita $A_{F}(x) = xF_1 + x^2F_2 + x^3F_3 + \ldots$, onde $F_k$ é o $k$º termo na sequência de Fibonacci: $1, 1, 2, 3, 5, 8, \ldots$; ou seja, $F_k = F_{k − 1} + F_{k − 2}, F_1 = 1$ e $F_2 = 1$. -For this problem we shall be interested in values of $x$ for which $A_{F}(x)$ is a positive integer. +Para este problema, estaremos interessados em valores de $x$ para os quais $A_{F}(x)$ é um número inteiro positivo. -Surprisingly +Surpreendentemente, $$\begin{align} A_F(\frac{1}{2}) & = (\frac{1}{2}) × 1 + {(\frac{1}{2})}^2 × 1 + {(\frac{1}{2})}^3 × 2 + {(\frac{1}{2})}^4 × 3 + {(\frac{1}{2})}^5 × 5 + \cdots \\\\ & = \frac{1}{2} + \frac{1}{4} + \frac{2}{8} + \frac{3}{16} + \frac{5}{32} + \cdots \\\\ & = 2 \end{align}$$ -The corresponding values of $x$ for the first five natural numbers are shown below. +Os valores correspondentes de $x$ para os primeiros cinco números naturais são mostrados abaixo. | $x$ | $A_F(x)$ | | --------------------------- | -------- | @@ -27,13 +27,13 @@ The corresponding values of $x$ for the first five natural numbers are shown bel | $\frac{\sqrt{89} − 5}{8}$ | $4$ | | $\frac{\sqrt{34} − 3}{5}$ | $5$ | -We shall call $A_F(x)$ a golden nugget if $x$ is rational, because they become increasingly rarer; for example, the 10th golden nugget is 74049690. +Vamos chamar $A_F(x)$ de pepita de ouro se $x$ for racional, porque eles se tornam cada vez mais raros (por exemplo, a 10ª pepita de ouro é 74049690). -Find the 15th golden nugget. +Encontre a 15ª pepita dourada. # --hints-- -`goldenNugget()` should return `1120149658760`. +`goldenNugget()` deve retornar `1120149658760`. ```js assert.strictEqual(goldenNugget(), 1120149658760); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-138-special-isosceles-triangles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-138-special-isosceles-triangles.md index 6391b7523c4..b24016a9940 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-138-special-isosceles-triangles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-138-special-isosceles-triangles.md @@ -1,6 +1,6 @@ --- id: 5900f3f61000cf542c50ff09 -title: 'Problem 138: Special isosceles triangles' +title: 'Problema 138: Triângulos isósceles especiais' challengeType: 1 forumTopicId: 301766 dashedName: problem-138-special-isosceles-triangles @@ -8,19 +8,19 @@ dashedName: problem-138-special-isosceles-triangles # --description-- -Consider the isosceles triangle with base length, $b = 16$, and legs, $L = 17$. +Considere o triângulo isósceles com o comprimento de base $b = 16$ e os lados iguais $L = 17$. -isosceles triangle with edges named as L - two edges with the same length and base of the triangle as b; and height of the triangle - h from the base of the triangle to the angle between L edges +triângulo isósceles com lados chamados de L - dois lados com o mesmo comprimento e a base do triângulo chamada de b. A altura do triângulo é chamada de h e vai da base do triângulo ao ângulo entre os lados L -By using the Pythagorean theorem, it can be seen that the height of the triangle, $h = \sqrt{{17}^2 − 8^2} = 15$, which is one less than the base length. +Usando o teorema de Pitágoras, pode ser visto que a altura do triângulo, $h = \sqrt{{17}^2 - 8^2} = 15$, que é uma unidade menor que o comprimento da base. -With $b = 272$ and $L = 305$, we get $h = 273$, which is one more than the base length, and this is the second smallest isosceles triangle with the property that $h = b ± 1$. +Com $b = 272$ e $L = 305$, obtemos $h = 273$, que é um a mais do que o comprimento da base, e este é o segundo menor triângulo isósceles com a propriedade $h = b ± 1$. -Find $\sum{L}$ for the twelve smallest isosceles triangles for which $h = b ± 1$ and $b$, $L$ are positive integers. +Encontre $\sum{L}$ para os doze menores triângulos isósceles para os quais $h = b ± 1$ e $b$, $L$ são números inteiros positivos. # --hints-- -`isoscelesTriangles()` should return `1118049290473932`. +`isoscelesTriangles()` deve retornar `1118049290473932`. ```js assert.strictEqual(isoscelesTriangles(), 1118049290473932); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-139-pythagorean-tiles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-139-pythagorean-tiles.md index 19f12579cb2..9ca61ec0680 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-139-pythagorean-tiles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-139-pythagorean-tiles.md @@ -1,6 +1,6 @@ --- id: 5900f3f71000cf542c50ff0a -title: 'Problem 139: Pythagorean tiles' +title: 'Problema 139: Blocos de Pitágoras' challengeType: 1 forumTopicId: 301767 dashedName: problem-139-pythagorean-tiles @@ -8,19 +8,19 @@ dashedName: problem-139-pythagorean-tiles # --description-- -Let (a, b, c) represent the three sides of a right angle triangle with integral length sides. It is possible to place four such triangles together to form a square with length c. +Considere que (a, b, c) representam os três lados de um triângulo retângulo com lados cujo comprimento são números inteiros. É possível posicionar quatro desses triângulos juntos para formar um quadrado com comprimento c. -For example, (3, 4, 5) triangles can be placed together to form a 5 by 5 square with a 1 by 1 hole in the middle and it can be seen that the 5 by 5 square can be tiled with twenty-five 1 by 1 squares. +Por exemplo, triângulos de lados (3, 4, 5) podem ser colocados juntos para formar um quadrado de 5 por 5 com um orifício de 1 por 1 no meio. Também pode-se ver que o quadrado de 5 por 5 pode ser preenchido com vinte e cinco blocos quadrados de 1 por 1. -two 5 x 5 squares: one with four 3x4x5 triangles placed to create 1x1 hole in the middle; second with twenty-five 1x1 squares +dois quadrados de 5 por 5: no primeiro, quatro triângulos de medidas 3x4x5 são dispostos de modo a criar um orifício de 1x1 no meio; no segundo, há vinte e cinco quadrados de 1x1 -However, if (5, 12, 13) triangles were used, the hole would measure 7 by 7. These 7 by 7 squares could not be used to tile the 13 by 13 square. +No entanto, se os triângulos de (5, 12, 13) fossem usados, o orifício mediria 7 por 7. Esses quadrados de 7 por 7 não poderiam ser usados para preencher o quadrado de 13 por 13. -Given that the perimeter of the right triangle is less than one-hundred million, how many Pythagorean triangles would allow such a tiling to occur? +Dado que o perímetro do triângulo retângulo é inferior a cem milhões, quantos triângulos trigonométricos pitagóricos permitiriam que tal preenchimento acontecesse? # --hints-- -`pythagoreanTiles()` should return `10057761`. +`pythagoreanTiles()` deve retornar `10057761`. ```js assert.strictEqual(pythagoreanTiles(), 10057761); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-140-modified-fibonacci-golden-nuggets.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-140-modified-fibonacci-golden-nuggets.md index bdd6612a63c..11c9b0987eb 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-140-modified-fibonacci-golden-nuggets.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-140-modified-fibonacci-golden-nuggets.md @@ -1,6 +1,6 @@ --- id: 5900f3fa1000cf542c50ff0c -title: 'Problem 140: Modified Fibonacci golden nuggets' +title: 'Problema 140: Pepitas de ouro de Fibonacci modificado' challengeType: 1 forumTopicId: 301769 dashedName: problem-140-modified-fibonacci-golden-nuggets @@ -8,11 +8,11 @@ dashedName: problem-140-modified-fibonacci-golden-nuggets # --description-- -Consider the infinite polynomial series $A_G(x) = xG_1 + x^2G_2 + x^3G_3 + \cdots$, where $G_k$ is the $k$th term of the second order recurrence relation $G_k = G_{k − 1} + G_{k − 2}, G_1 = 1$ and $G_2 = 4$; that is, $1, 4, 5, 9, 14, 23, \ldots$. +Considere a série polinomial infinita $A_G(x) = xG_1 + x^2G_2 + x^3G_3 + \cdots$, onde $G_k$ é o $k$º termo da relação de recorrência de segunda ordem $G_k = G_{k − 1} + G_{k − 2}, G_1 = 1$ e $G_2 = 4$; ou seja, $1, 4, 5, 9, 14, 23, \ldots$. -For this problem we shall be concerned with values of $x$ for which $A_G(x)$ is a positive integer. +Para este problema, estaremos interessados nos valores de $x$ para os quais $A_G(x)$ é um número inteiro positivo. -The corresponding values of $x$ for the first five natural numbers are shown below. +Os valores correspondentes de $x$ para os primeiros cinco números naturais são mostrados abaixo. | $x$ | $A_G(x)$ | | ----------------------------- | -------- | @@ -22,11 +22,11 @@ The corresponding values of $x$ for the first five natural numbers are shown bel | $\frac{\sqrt{137} − 5}{14}$ | $4$ | | $\frac{1}{2}$ | $5$ | -We shall call $A_G(x)$ a golden nugget if $x$ is rational because they become increasingly rarer; for example, the 20th golden nugget is 211345365. Find the sum of the first thirty golden nuggets. +Vamos chamar $A_G(x)$ de pepita de ouro se $x$ for racional, porque eles se tornam cada vez mais raros (por exemplo, a 20ª pepita de ouro é 211345365). Encontre a soma das primeiras trinta pepitas douradas. # --hints-- -`modifiedGoldenNuggets()` should return `5673835352990` +`modifiedGoldenNuggets()` deve retornar `5673835352990` ```js assert.strictEqual(modifiedGoldenNuggets(), 5673835352990); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-141-investigating-progressive-numbers-n-which-are-also-square.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-141-investigating-progressive-numbers-n-which-are-also-square.md index 9f1e9d3bb45..e51ddf78c94 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-141-investigating-progressive-numbers-n-which-are-also-square.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-141-investigating-progressive-numbers-n-which-are-also-square.md @@ -1,6 +1,6 @@ --- id: 5900f3f91000cf542c50ff0b -title: 'Problem 141: Investigating progressive numbers, n, which are also square' +title: 'Problema 141: Investigação de números progressivos, n, que também são quadrados' challengeType: 1 forumTopicId: 301770 dashedName: problem-141-investigating-progressive-numbers-n-which-are-also-square @@ -8,19 +8,19 @@ dashedName: problem-141-investigating-progressive-numbers-n-which-are-also-squar # --description-- -A positive integer, $n$, is divided by $d$ and the quotient and remainder are $q$ and $r$ respectively. In addition $d$, $q$, and $r$ are consecutive positive integer terms in a geometric sequence, but not necessarily in that order. +Um número inteiro positivo, $n$, é dividido por $d$ e o quociente e resto são $q$ e $r$, respectivamente. Além disso, $d$, $q$ e $r$ são termos inteiros positivos consecutivos em uma sequência geométrica, mas não necessariamente nessa ordem. -For example, 58 divided by 6 has a quotient of 9 and a remainder of 4. It can also be seen that 4, 6, 9 are consecutive terms in a geometric sequence (common ratio $\frac{3}{2}$). +Por exemplo, 58 dividido por 6 têm um quociente de 9 e um resto de 4. Também pode-se ver que 4, 6 e 9 são termos consecutivos em uma sequência geométrica (razão comum $\frac{3}{2}$). -We will call such numbers, $n$, progressive. +Chamaremos esses números, $n$, de progressivos. -Some progressive numbers, such as 9 and 10404 = ${102}^2$, also happen to be perfect squares. The sum of all progressive perfect squares below one hundred thousand is 124657. +Alguns números progressivos, como 9 e 10404 = ${102}^2$, também são quadrados perfeitos. A soma de todos os quadrados perfeitos progressivos abaixo de cem mil é 124657. -Find the sum of all progressive perfect squares below one trillion (${10}^{12}$). +Encontre a soma de todos os quadrados perfeitos progressivos abaixo de um trilhão (${10}^{12}$). # --hints-- -`progressivePerfectSquares()` should return `878454337159`. +`progressivePerfectSquares()` deve retornar `878454337159`. ```js assert.strictEqual(progressivePerfectSquares(), 878454337159); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-142-perfect-square-collection.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-142-perfect-square-collection.md index 17a07958833..c8f5528728a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-142-perfect-square-collection.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-142-perfect-square-collection.md @@ -1,6 +1,6 @@ --- id: 5900f3fa1000cf542c50ff0d -title: 'Problem 142: Perfect Square Collection' +title: 'Problema 142: Coleção de quadrados perfeitos' challengeType: 1 forumTopicId: 301771 dashedName: problem-142-perfect-square-collection @@ -8,11 +8,11 @@ dashedName: problem-142-perfect-square-collection # --description-- -Find the smallest $x + y + z$ with integers $x > y > z > 0$ such that $x + y$, $x − y$, $x + z$, $x − z$, $y + z$, $y − z$ are all perfect squares. +Encontre a menor soma de $x + y + z$, com números inteiros $x > y > z > 0$, tal que $x + y$, $x – y$, $x + z$, $x – z$, $y + z$, $y – z$ sejam todos quadrados perfeitos. # --hints-- -`perfectSquareCollection()` should return `1006193`. +`perfectSquareCollection()` deve retornar `1006193`. ```js assert.strictEqual(perfectSquareCollection(), 1006193); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-143-investigating-the-torricelli-point-of-a-triangle.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-143-investigating-the-torricelli-point-of-a-triangle.md index 8051dd4317d..35b3bd57af2 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-143-investigating-the-torricelli-point-of-a-triangle.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-143-investigating-the-torricelli-point-of-a-triangle.md @@ -1,6 +1,6 @@ --- id: 5900f3fc1000cf542c50ff0e -title: 'Problem 143: Investigating the Torricelli point of a triangle' +title: 'Problema 143: Investigação do ponto de Torricelli de um triângulo' challengeType: 1 forumTopicId: 301772 dashedName: problem-143-investigating-the-torricelli-point-of-a-triangle @@ -8,19 +8,19 @@ dashedName: problem-143-investigating-the-torricelli-point-of-a-triangle # --description-- -Let ABC be a triangle with all interior angles being less than 120 degrees. Let X be any point inside the triangle and let $XA = p$, $XC = q$, and $XB = r$. +Imagine que ABC seja um triângulo com todos os ângulos internos menores que 120 graus. Considere X qualquer ponto dentro do triângulo e $XA = p$, $XC = q$ e $XB = r$. -Fermat challenged Torricelli to find the position of X such that p + q + r was minimised. +Fermat desafiou Torricelli a encontrar a posição de X, de modo que p + q + r seja minimizado. -Torricelli was able to prove that if equilateral triangles AOB, BNC and AMC are constructed on each side of triangle ABC, the circumscribed circles of AOB, BNC, and AMC will intersect at a single point, T, inside the triangle. Moreover he proved that T, called the Torricelli/Fermat point, minimises $p + q + r$. Even more remarkable, it can be shown that when the sum is minimised, $AN = BM = CO = p + q + r$ and that AN, BM and CO also intersect at T. +Torricelli foi capaz de provar que, se triângulos equiláteros AOB, BNC e AMC são construídos em cada lado do triângulo ABC, os círculos circunscritos da AOB, BNC e AMC se entrecruzarão em um único ponto, T, dentro do triângulo. Além disso, ele provou que T, chamado de ponto de Torricelli/Fermat, minimiza $p + q + r$. Ainda mais notável, pode mostrar-se que, quando a soma é minimizada, $AN = BM = CO = p + q + r$ e AN, BM e CO também se cruzam em T. -equilateral triangles AOB, BNC and AMC constructed on each side of triangle ABC; with the circumscribed circles of AOB, BNC, and AMC will intersecting at a single point, T, inside the triangle +triângulos equiláteros AOB, BNC e AMC construídos em cada lado do triângulo ABC; os círculos circunscritos da AOB, BNC e AMC se entrecruzarão em um único ponto, T, dentro do triângulo -If the sum is minimised and a, b, c, p, q and r are all positive integers we shall call triangle ABC a Torricelli triangle. For example, $a = 399$, $b = 455$, $c = 511$ is an example of a Torricelli triangle, with $p + q + r = 784$. Find the sum of all distinct values of $p + q + r ≤ 120000$ for Torricelli triangles. +Se a soma for minimizada e a, b, c, p, q e r forem todos números inteiros positivos, chamaremos o triângulo ABC de triângulo de Torricelli. Por exemplo, $a = 399$, $b = 455$, $c = 511$ é um exemplo de um triângulo de Torricelli, com $p + q + r = 784$. Encontre a soma de todos os valores distintos de $p + q + r ≤ 120000$ para os triângulos de Torricelli. # --hints-- -`sumTorricelliTriangles()` should return `30758397`. +`sumTorricelliTriangles()` deve retornar `30758397`. ```js assert.strictEqual(sumTorricelliTriangles(), 30758397); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md index f30799446b2..b9ae30eacde 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md @@ -1,6 +1,6 @@ --- id: 5900f3fd1000cf542c50ff10 -title: 'Problem 145: How many reversible numbers are there below one-billion?' +title: 'Problema 145: Quantos números reversíveis há abaixo de um bilhão?' challengeType: 1 forumTopicId: 301774 dashedName: problem-145-how-many-reversible-numbers-are-there-below-one-billion @@ -8,15 +8,15 @@ dashedName: problem-145-how-many-reversible-numbers-are-there-below-one-billion # --description-- -Some positive integers $n$ have the property that the sum [ $n + reverse(n)$ ] consists entirely of odd (decimal) digits. For instance, $36 + 63 = 99$ and $409 + 904 = 1313$. We will call such numbers reversible; so 36, 63, 409, and 904 are reversible. Leading zeroes are not allowed in either $n$ or $reverse(n)$. +Alguns números inteiros positivos $n$ têm a propriedade de que a soma [ $n + reverse(n)$ ] consiste inteiramente de algarismos ímpares (decimais). Por exemplo, $36 + 63 = 99$ e $409 + 904 = 1313$. Chamaremos esses números de reversíveis. Portanto, 36, 63, 409 e 904 são reversíveis. Zeros à esquerda não são permitidos em $n$ ou em $reverse(n)$. -There are 120 reversible numbers below one-thousand. +Há 120 números reversíveis abaixo de mil. -How many reversible numbers are there below one-billion (${10}^9$)? +Quantos números reversíveis há abaixo de um bilhão (${10}^9$)? # --hints-- -`reversibleNumbers()` should return `608720`. +`reversibleNumbers()` deve retornar `608720`. ```js assert.strictEqual(reversibleNumbers(), 608720); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-146-investigating-a-prime-pattern.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-146-investigating-a-prime-pattern.md index 6407520a81a..66a2b0a5394 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-146-investigating-a-prime-pattern.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-146-investigating-a-prime-pattern.md @@ -1,6 +1,6 @@ --- id: 5900f3fe1000cf542c50ff11 -title: 'Problem 146: Investigating a Prime Pattern' +title: 'Problema 146: Investigação de um padrão em números primos' challengeType: 1 forumTopicId: 301775 dashedName: problem-146-investigating-a-prime-pattern @@ -8,13 +8,13 @@ dashedName: problem-146-investigating-a-prime-pattern # --description-- -The smallest positive integer $n$ for which the numbers $n^2 + 1$, $n^2 + 3$, $n^2 + 7$, $n^2 + 9$, $n^2 + 13$, and $n^2 + 27$ are consecutive primes is 10. The sum of all such integers $n$ below one-million is 1242490. +O menor número inteiro positivo $n$ para o qual os números $n^2 + 1$, $n^2 + 3$, $n^2 + 7$, $n^2 + 9$, $n^2 + 13$, e $n^2 + 27$ são 10 números primos consecutivos. A soma de todos esses números inteiros $n$ abaixo de um milhão é 1242490. -What is the sum of all such integers $n$ below 150 million? +Qual é a soma de todos esses números inteiros $n$ abaixo dos 150 milhões? # --hints-- -`primePattern()` should return `676333270`. +`primePattern()` deve retornar `676333270`. ```js assert.strictEqual(primePattern(), 676333270); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-147-rectangles-in-cross-hatched-grids.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-147-rectangles-in-cross-hatched-grids.md index dfade844910..07fae04be44 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-147-rectangles-in-cross-hatched-grids.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-147-rectangles-in-cross-hatched-grids.md @@ -1,6 +1,6 @@ --- id: 5900f3ff1000cf542c50ff12 -title: 'Problem 147: Rectangles in cross-hatched grids' +title: 'Problema 147: Retângulos em grades cruzadas' challengeType: 1 forumTopicId: 301776 dashedName: problem-147-rectangles-in-cross-hatched-grids @@ -8,21 +8,21 @@ dashedName: problem-147-rectangles-in-cross-hatched-grids # --description-- -In a 3x2 cross-hatched grid, a total of 37 different rectangles could be situated within that grid as indicated in the sketch. +Em uma grade cruzada de 3x2, um total de 37 retângulos diferentes podem ser situados dentro dela, conforme indicado no esboço. -ways of situating different rectangles within cross-hatched 3x2 grid +formas de situar diferentes retângulos dentro da grade cruzada de 3x2 -There are 5 grids smaller than 3x2, vertical and horizontal dimensions being important, i.e. 1x1, 2x1, 3x1, 1x2 and 2x2. If each of them is cross-hatched, the following number of different rectangles could be situated within those smaller grids: +Há 5 grades menores que 3x2, com dimensões vertical e horizontal importantes. São eles: 1x1, 2x1, 3x1, 1x2 e 2x2. Se cada uma delas for cruzada, o número de retângulos diferentes a seguir poderia estar situado dentro dessas grades menores: $$\begin{array}{|c|c|} \hline 1 \times 1 & 1 \\\\ \hline 2 \times 1 & 4 \\\\ \hline 3 \times 1 & 8 \\\\ \hline 1 \times 2 & 4 \\\\ \hline 2 \times 2 & 18 \\\\ \hline \end{array}$$ -Adding those to the 37 of the 3x2 grid, a total of 72 different rectangles could be situated within 3x2 and smaller grids. +Adicionando estes valores aos 37 da grade de 3x2, um total de 72 retângulos diferentes pode ficar situado dentro da grade de 3x2 e das grades menores. -How many different rectangles could be situated within 47x43 and smaller grids? +Quantos retângulos diferentes poderiam estar localizados na grade de 47x43 e em suas grades menores? # --hints-- -`crossHatchedRectangles()` should return `846910284`. +`crossHatchedRectangles()` deve retornar `846910284`. ```js assert.strictEqual(crossHatchedRectangles(), 846910284); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-148-exploring-pascals-triangle.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-148-exploring-pascals-triangle.md index d30e62b5442..08f7f440f33 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-148-exploring-pascals-triangle.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-148-exploring-pascals-triangle.md @@ -1,6 +1,6 @@ --- id: 5900f4021000cf542c50ff14 -title: 'Problem 148: Exploring Pascal''s triangle' +title: 'Problema 148: Explorando o triângulo de Pascal' challengeType: 1 forumTopicId: 301777 dashedName: problem-148-exploring-pascals-triangle @@ -8,7 +8,7 @@ dashedName: problem-148-exploring-pascals-triangle # --description-- -We can easily verify that none of the entries in the first seven rows of Pascal's triangle are divisible by 7: +Podemos facilmente verificar que nenhuma das entradas das primeiras sete linhas do triângulo Pascal é divisível por 7: ```markup 1 @@ -20,15 +20,15 @@ We can easily verify that none of the entries in the first seven rows of Pascal' 1 6 15 20 15 6 1 ``` -However, if we check the first one hundred rows, we will find that only 2361 of the 5050 entries are not divisible by 7. +No entanto, se verificarmos as primeiras cem linhas, descobriremos que apenas 2361 das 5050 entradas não são divisíveis por 7. # --instructions-- -Find the number of entries which are not divisible by 7 in the first one billion (${10}^9$) rows of Pascal's triangle. +Encontre o número de entradas que não são divisíveis por 7 no primeiro bilhão (${10}^9$) de linhas do triângulo de Pascal. # --hints-- -`entriesOfPascalsTriangle()` should return `2129970655314432`. +`entriesOfPascalsTriangle()` deve retornar `2129970655314432`. ```js assert.strictEqual(entriesOfPascalsTriangle(), 2129970655314432); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-149-searching-for-a-maximum-sum-subsequence.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-149-searching-for-a-maximum-sum-subsequence.md index c1fbd34962d..4999f1f748c 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-149-searching-for-a-maximum-sum-subsequence.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-149-searching-for-a-maximum-sum-subsequence.md @@ -1,6 +1,6 @@ --- id: 5900f4021000cf542c50ff13 -title: 'Problem 149: Searching for a maximum-sum subsequence' +title: 'Problema 149: Procura de uma subsequência de soma máxima' challengeType: 1 forumTopicId: 301778 dashedName: problem-149-searching-for-a-maximum-sum-subsequence @@ -8,27 +8,27 @@ dashedName: problem-149-searching-for-a-maximum-sum-subsequence # --description-- -Looking at the table below, it is easy to verify that the maximum possible sum of adjacent numbers in any direction (horizontal, vertical, diagonal or anti-diagonal) is $16 (= 8 + 7 + 1)$. +Olhando para a tabela abaixo, é fácil verificar se a soma máxima possível de números adjacentes em qualquer direção (horizontal, vertical, diagonal ou antidiagonal) é de $16 (= 8 + 7 + 1)$. $$\begin{array}{|r|r|r|r|} \hline −2 & 5 & 3 & 2 \\\\ \hline 9 & −6 & 5 & 1 \\\\ \hline 3 & 2 & 7 & 3 \\\\ \hline −1 & 8 & −4 & 8 \\\\ \hline \end{array}$$ -Now, let us repeat the search, but on a much larger scale: +Agora, vamos repetir a busca, mas em uma escala muito maior: -First, generate four million pseudo-random numbers using a specific form of what is known as a "Lagged Fibonacci Generator": +Primeiro, gere quatro milhões de números pseudoaleatórios usando uma forma específica do que é conhecido como "Gerador Fibonacci com atraso": -For $1 ≤ k ≤ 55$, $s_k = (100003 − 200003k + 300007{k}^3) \\ (modulo\\ 1000000) − 500000$. +Para $1 ≤ k ≤ 55$, $s_k = (100003 − 200003k + 300007{k}^3) \\ (modulo\\ 1000000) − 500000$. -For $56 ≤ k ≤ 4000000$, $s_k = (s_{k − 24} + s_{k − 55} + 1000000) \\ (modulo\\ 1000000) − 500000$. +Para $56 ≤ k ≤ 4000000$, $s_k = (s_{k − 24} + s_{k − 55} + 1000000) \\ (modulo\\ 1000000) − 500000$. -Thus, $s_{10} = −393027$ and $s_{100} = 86613$. +Portanto, $s_{10} = −393027$ e $s_{100} = 86613$. -The terms of $s$ are then arranged in a 2000×2000 table, using the first 2000 numbers to fill the first row (sequentially), the next 2000 numbers to fill the second row, and so on. +Os termos de $s$ estão combinados em uma tabela de 2000×2000 usando os primeiros 2000 números para preencher a primeira linha (sequencialmente), os próximos 2000 números para preencher a segunda linha e assim por diante. -Finally, find the greatest sum of (any number of) adjacent entries in any direction (horizontal, vertical, diagonal or anti-diagonal). +Por fim, encontre a maior soma de (qualquer número de) entradas adjacentes em qualquer direção (horizontal, vertical, diagonal ou antidiagonal). # --hints-- -`maximumSubSequence()` should return `52852124`. +`maximumSubSequence()` deve retornar `52852124`. ```js assert.strictEqual(maximumSubSequence(), 52852124); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md index 366d5dd9bd0..7d590f91ef6 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md @@ -1,7 +1,7 @@ --- id: 5900f4031000cf542c50ff15 title: >- - Problem 150: Searching a triangular array for a sub-triangle having minimum-sum + Problema 150: Procura de uma matriz triangular para um subtriângulo com a soma mínima challengeType: 1 forumTopicId: 301781 dashedName: problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum @@ -9,35 +9,35 @@ dashedName: problem-150-searching-a-triangular-array-for-a-sub-triangle-having-m # --description-- -In a triangular array of positive and negative integers, we wish to find a sub-triangle such that the sum of the numbers it contains is the smallest possible. +Em uma matriz triangular de números inteiros positivos e negativos, queremos encontrar um subtriângulo onde a soma dos números nele contidos seja a menor possível. -In the example below, it can be easily verified that the marked triangle satisfies this condition having a sum of −42. +No exemplo abaixo, pode ser facilmente verificado que o triângulo marcado satisfaz esta condição tendo uma soma de -42. -triangular array, with marked sub-triangle, having sum of -42 +matriz triangular, com subtriângulo marcado, somando -42 -We wish to make such a triangular array with one thousand rows, so we generate 500500 pseudo-random numbers $s_k$ in the range $±2^{19}$, using a type of random number generator (known as a Linear Congruential Generator) as follows: +Queremos fazer uma matriz triangular desse tipo com mil fileiras. Então, geramos 500500 números pseudoaleatórios $s_k$ no intervalo $±2^{19}$, usando um tipo de gerador de número aleatório (conhecido como gerador congruente linear), da seguinte forma: $$\begin{align} t := & \\ 0\\\\ \text{for}\\ & k = 1\\ \text{up to}\\ k = 500500:\\\\ & t := (615949 × t + 797807)\\ \text{modulo}\\ 2^{20}\\\\ & s_k := t − 219\\\\ \end{align}$$ -Thus: $s_1 = 273519$, $s_2 = −153582$, $s_3 = 450905$ etc. +Assim: $s_1 = 273519$, $s_2 = −153582$, $s_3 = 450905$ e assim por diante. -Our triangular array is then formed using the pseudo-random numbers thus: +Nossa matriz triangular é então formada usando os pseudonúmeros aleatórios, ou seja: $$ s_1 \\\\ s_2\\;s_3 \\\\ s_4\\; s_5\\; s_6 \\\\ s_7\\; s_8\\; s_9\\; s_{10} \\\\ \ldots $$ -Sub-triangles can start at any element of the array and extend down as far as we like (taking-in the two elements directly below it from the next row, the three elements directly below from the row after that, and so on). +Os subtriângulos podem começar em qualquer elemento da matriz e se estender até onde quisermos (pegando os dois elementos diretamente abaixo dele na próxima fileira, sendo os três elementos diretamente abaixo da linha depois disso e assim por diante). -The "sum of a sub-triangle" is defined as the sum of all the elements it contains. +A "soma de um subtriângulo" é definida como a soma de todos os elementos que o contêm. -Find the smallest possible sub-triangle sum. +Encontre o subtriângulo de menor soma de elementos possível. # --hints-- -`smallestSubTriangleSum()` should return `-271248680`. +`smallestSubTriangleSum()` deve retornar `-271248680`. ```js assert.strictEqual(smallestSubTriangleSum(), -271248680); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md index c03197b781f..f2f1798ccb4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md @@ -1,6 +1,6 @@ --- id: 5900f4041000cf542c50ff17 -title: 'Problem 152: Writing one half as a sum of inverse squares' +title: 'Problema 152: Escrever a metade como uma soma de quadrados inversos' challengeType: 1 forumTopicId: 301783 dashedName: problem-152-writing-one-half-as-a-sum-of-inverse-squares @@ -8,19 +8,19 @@ dashedName: problem-152-writing-one-half-as-a-sum-of-inverse-squares # --description-- -There are several ways to write the number $\frac{1}{2}$ as a sum of inverse squares using distinct integers. +Há várias maneiras de escrever o número $\frac{1}{2}$ como uma soma de quadrados inversos usando números inteiros distintos. -For instance, the numbers {2,3,4,5,7,12,15,20,28,35} can be used: +Por exemplo, os números {2, 3, 4, 5, 7, 12, 15, 20, 28, 35} podem ser usados: $$\frac{1}{2} = \frac{1}{2^2} + \frac{1}{3^2} + \frac{1}{4^2} + \frac{1}{5^2} + \frac{1}{7^2} + \frac{1}{{12}^2} + \frac{1}{{15}^2} + \frac{1}{{20}^2} + \frac{1}{{28}^2} + \frac{1}{{35}^2}$$ -In fact, only using integers between 2 and 45 inclusive, there are exactly three ways to do it, the remaining two being: {2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45}. +De fato, usando apenas números inteiros entre 2 e 45, há exatamente três maneiras de fazer isso. As duas formas restantes são: {2, 3, 4, 6, 7, 9, 10, 20, 28, 35, 36, 45} e {2, 3, 4, 6, 7, 9, 12, 15, 28, 30, 35, 36, 45}. -How many ways are there to write the number $\frac{1}{2}$ as a sum of inverse squares using distinct integers between 2 and 80 inclusive? +Quantas formas existem de escrever o número $\frac{1}{2}$ como uma soma de quadrados inversos usando números inteiros distintos entre 2 e 80? # --hints-- -`sumInverseSquares()` should return `301`. +`sumInverseSquares()` deve retornar `301`. ```js assert.strictEqual(sumInverseSquares(), 301); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-153-investigating-gaussian-integers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-153-investigating-gaussian-integers.md index a66c05c4f97..efe4a70d15b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-153-investigating-gaussian-integers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-153-investigating-gaussian-integers.md @@ -1,6 +1,6 @@ --- id: 5900f4051000cf542c50ff18 -title: 'Problem 153: Investigating Gaussian Integers' +title: 'Problema 153: Investigação de números inteiros gaussianos' challengeType: 1 forumTopicId: 301784 dashedName: problem-153-investigating-gaussian-integers @@ -8,57 +8,57 @@ dashedName: problem-153-investigating-gaussian-integers # --description-- -As we all know the equation $x^2 = -1$ has no solutions for real $x$. +Como todos sabemos, a equação $x^2 = -1$ não tem soluções para $x$ real. -If we however introduce the imaginary number $i$ this equation has two solutions: $x = i$ and $x = -i$. +Se, no entanto, introduzirmos o número imaginário $i$, esta equação tem duas soluções: $x = i$ e $x = -i$. -If we go a step further the equation ${(x - 3)}^2 = -4$ has two complex solutions: $x = 3 + 2i$ and $x = 3 - 2i$, which are called each others' complex conjugate. +Se formos mais longe, a equação ${(x - 3)}^2 = -4$ tem duas soluções complexas: $x = 3 + 2i$ e $x = 3 - 2i$, que são chamados de complexos conjugados um do outro. -Numbers of the form $a + bi$ are called complex numbers. +Os números na forma $a + bi$ são chamados de números complexos. -In general $a + bi$ and $a − bi$ are each other's complex conjugate. A Gaussian Integer is a complex number $a + bi$ such that both $a$ and $b$ are integers. +Em geral, $a + bi$ e $a - bi$ são os conjugados complexos um do outro. Um número inteiro gaussiano é um número complexo $a + bi$, tal que $a$ e $b$ são números inteiros. -The regular integers are also Gaussian integers (with $b = 0$). +Os números inteiros regulares também são números inteiros gaussianos (com $b = 0$). -To distinguish them from Gaussian integers with $b ≠ 0$ we call such integers "rational integers." +Para distingui-los de números inteiros gaussianos com $b ≠ 0$ chamamos esses inteiros de "inteiros racionais". -A Gaussian integer is called a divisor of a rational integer $n$ if the result is also a Gaussian integer. +Um número inteiro gaussiano é chamado de divisor de um número inteiro racional $n$ se o resultado também for um número inteiro gaussiano. -If for example we divide 5 by $1 + 2i$ we can simplify in the following manner: +Se, por exemplo, dividirmos 5 por $1 + 2i$, podemos simplificar da seguinte maneira: -Multiply numerator and denominator by the complex conjugate of $1 + 2i$: $1 − 2i$. +Multiplicar o numerador e o denominador pelo conjugado complexo de $1 + 2i$, ou seja, $1 - 2i$. -The result is: +O resultado é: $$\frac{5}{1 + 2i} = \frac{5}{1 + 2i} \frac{1 - 2i}{1 - 2i} = \frac{5(1 - 2i)}{1 - {(2i)}^2} = \frac{5(1 - 2i)}{1 - (-4)} = \frac{5(1 - 2i)}{5} = 1 - 2i$$ -So $1 + 2i$ is a divisor of 5. +Assim sendo, $1 + 2i$ é um divisor de 5. -Note that $1 + i$ is not a divisor of 5 because: +Observe que $1 + i$ não é um divisor de 5, pois: $$\frac{5}{1 + i} = \frac{5}{2} - \frac{5}{2}i$$ -Note also that if the Gaussian Integer ($a + bi$) is a divisor of a rational integer $n$, then its complex conjugate ($a − bi$) is also a divisor of $n$. In fact, 5 has six divisors such that the real part is positive: {1, 1 + 2i, 1 − 2i, 2 + i, 2 − i, 5}. +Observe também que se o número inteiro gaussiano ($a + bi$) for um divisor de um número inteiro racional $n$, então seu conjugado complexo ($a - bi$) também será um divisor de $n$. De fato, 5 tem seis divisores, sendo que a parte real é positiva: {1, 1 + 2i, 1 - 2i, 2 + i, 2 - i, 5}. -The following is a table of all of the divisors for the first five positive rational integers: +A seguir, vemos uma tabela de todos os divisores para os primeiros cinco números inteiros racionais positivos: -| n | Gaussian integer divisors with positive real part | Sum s(n) of these divisors | -| - | ------------------------------------------------- | -------------------------- | -| 1 | 1 | 1 | -| 2 | 1, 1 + i, 1 - i, 2 | 5 | -| 3 | 1, 3 | 4 | -| 4 | 1, 1 + i, 1 - i, 2, 2 + 2i, 2 - 2i, 4 | 13 | -| 5 | 1, 1 + 2i, 1 - 2i, 2 + i, 2 - i, 5 | 12 | +| n | Números inteiros gaussianos divisores com parte real positiva | Soma s(n) destes divisores | +| - | ------------------------------------------------------------- | -------------------------- | +| 1 | 1 | 1 | +| 2 | 1, 1 + i, 1 - i, 2 | 5 | +| 3 | 1, 3 | 4 | +| 4 | 1, 1 + i, 1 - i, 2, 2 + 2i, 2 - 2i, 4 | 13 | +| 5 | 1, 1 + 2i, 1 - 2i, 2 + i, 2 - i, 5 | 12 | -For divisors with positive real parts, then, we have: $\displaystyle\sum_{n=1}^5 s(n) = 35$. +Para divisores com partes reais positivas, então, temos: $\displaystyle\sum_{n=1}^5 s(n) = 35$. -For $1 ≤ n ≤ {10}^5$, $\displaystyle\sum_{n = 1}^{{10}^5} s(n) = 17924657155$. +Para $1 ≤ n ≤ {10}^5$, $\displaystyle\sum_{n = 1}^{{10}^5} s(n) = 17924657155$. -What is $\displaystyle\sum_{n=1}^{{10}^8} s(n)$? +Qual é $\displaystyle\sum_{n=1}^{{10}^8} s(n)$? # --hints-- -`sumGaussianIntegers()` should return `17971254122360636`. +`sumGaussianIntegers()` deve retornar `17971254122360636`. ```js assert.strictEqual(sumGaussianIntegers(), 17971254122360636); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-154-exploring-pascals-pyramid.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-154-exploring-pascals-pyramid.md index 40533ba38f8..b62b8f23338 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-154-exploring-pascals-pyramid.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-154-exploring-pascals-pyramid.md @@ -1,6 +1,6 @@ --- id: 5900f4071000cf542c50ff19 -title: 'Problem 154: Exploring Pascal''s pyramid' +title: 'Problema 154: Explorando o triângulo de Pascal' challengeType: 1 forumTopicId: 301785 dashedName: problem-154-exploring-pascals-pyramid @@ -8,19 +8,19 @@ dashedName: problem-154-exploring-pascals-pyramid # --description-- -A triangular pyramid is constructed using spherical balls so that each ball rests on exactly three balls of the next lower level. +Uma pirâmide triangular é construída usando bolas esféricas de modo que cada bola fique exatamente sobre três bolas do próximo nível. -triangular pyramid constructed using spherical balls with four levels +pirâmide triangular de quatro níveis construída usando bolas esféricas -Then, we calculate the number of paths leading from the apex to each position: A path starts at the apex and progresses downwards to any of the three spheres directly below the current position. Consequently, the number of paths to reach a certain position is the sum of the numbers immediately above it (depending on the position, there are up to three numbers above it). +Então, calculamos o número de caminhos que levam a partir do ápice para cada posição: um caminho começa no ápice e avança para baixo para qualquer uma das três esferas diretamente abaixo da posição atual. Consequentemente, o número de caminhos para chegar a uma determinada posição é a soma dos números imediatamente acima dele (dependendo da posição, há até três números acima dele). -The result is Pascal's pyramid and the numbers at each level n are the coefficients of the trinomial expansion ${(x + y + z)}^n$. +O resultado é a pirâmide de Pascal e os números de cada nível são os coeficientes da expansão trinomial ${(x + y + z)}^n$. -How many coefficients in the expansion of ${(x + y + z)}^{200000}$ are multiples of ${10}^{12}$? +Quantos coeficientes na expansão de ${(x + y + z)}^{200000}$ são múltiplos de ${10}^{12}$? # --hints-- -`pascalsPyramid()` should return `479742450`. +`pascalsPyramid()` deve retornar `479742450`. ```js assert.strictEqual(pascalsPyramid(), 479742450); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-155-counting-capacitor-circuits.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-155-counting-capacitor-circuits.md index ee1b1f97d9b..d4f8608be46 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-155-counting-capacitor-circuits.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-155-counting-capacitor-circuits.md @@ -1,6 +1,6 @@ --- id: 5900f4081000cf542c50ff1a -title: 'Problem 155: Counting Capacitor Circuits' +title: 'Problema 155: Contagem de circuitos de capacitor' challengeType: 1 forumTopicId: 301786 dashedName: problem-155-counting-capacitor-circuits @@ -8,23 +8,23 @@ dashedName: problem-155-counting-capacitor-circuits # --description-- -An electric circuit uses exclusively identical capacitors of the same value C. +Um circuito elétrico usa exclusivamente capacitores idênticos de mesmo valor C. -The capacitors can be connected in series or in parallel to form sub-units, which can then be connected in series or in parallel with other capacitors or other sub-units to form larger sub-units, and so on up to a final circuit. +Os capacitores podem ser conectados em série ou em paralelo para formar subunidades, as quais podem então ser conectadas em série ou em paralelo com outros capacitores ou outras subunidades para formar subunidades maiores e assim por diante até um circuito final. -Using this simple procedure and up to n identical capacitors, we can make circuits having a range of different total capacitances. For example, using up to $n = 3$ capacitors of $60 μF$ each, we can obtain the following 7 distinct total capacitance values: +Utilizando este procedimento simples e com n capacitores idênticos, podemos fazer circuitos que tenham um intervalo de capacitâncias total diferentes. Por exemplo, usando até $n = 3$ capacitores de $60 μF$ cada, podemos obter os seguintes 7 valores distintos de capacitância total: -example circuits having up to three capacitors, each of 60 μF +circuitos de exemplo com até três capacitores, cada um com 60 μF -If we denote by $D(n)$ the number of distinct total capacitance values we can obtain when using up to $n$ equal-valued capacitors and the simple procedure described above, we have: $D(1) = 1, D(2) = 3, D(3)=7, \ldots$ +Se considerarmos $D(n)$ o número de valores de capacitância total distintos que podemos obter ao usar até $n$ capacitores de valor igual e o procedimento simples descrito acima, temos: $D(1) = 1, D(2) = 3, D(3)=7, \ldots$ -Find $D(18)$. +Encontre $D(18)$. -Reminder: When connecting capacitors $C_1$, $C_2$ etc in parallel, the total capacitance is $C_T = C_1 + C_2 + \cdots$, whereas when connecting them in series, the overall capacitance is given by: $\frac{1}{C_T} = \frac{1}{C_1} + \frac{1}{C_2} + \cdots$. +Lembrete: Ao conectar os capacitores $C_1$, $C_2$ e assim por diante em paralelo, a capacitância total é $C_T = C_1 + C_2 + \cdots$, enquanto, ao conectá-los em série, a capacitância geral é dada por: $\frac{1}{C_T} = \frac{1}{C_1} + \frac{1}{C_2} + \cdots$. # --hints-- -`capacitanceValues()` should return `3857447`. +`capacitanceValues()` deve retornar `3857447`. ```js assert.strictEqual(capacitanceValues(), 3857447); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-156-counting-digits.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-156-counting-digits.md index fb820e64aa0..5171bb5609b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-156-counting-digits.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-156-counting-digits.md @@ -1,6 +1,6 @@ --- id: 5900f4091000cf542c50ff1b -title: 'Problem 156: Counting Digits' +title: 'Problema 156: Contagem de algarismos' challengeType: 1 forumTopicId: 301787 dashedName: problem-156-counting-digits @@ -8,11 +8,11 @@ dashedName: problem-156-counting-digits # --description-- -Starting from zero the natural numbers are written down in base 10 like this: +A partir de zero, os números naturais são escritos na base 10, assim: 0 1 2 3 4 5 6 7 8 9 10 11 12.... -Consider the digit $d = 1$. After we write down each number n, we will update the number of ones that have occurred and call this number $f(n, 1)$. The first values for $f(n, 1)$, then, are as follows: +Considere o algarismo $d = 1$. Depois de anotarmos cada número, vamos atualizar o número de unidades que ocorreram e chamar esse número de $f(n, 1)$. Os primeiros valores para $f(n, 1)$, então, são os seguintes: | $n$ | $f(n, 1)$ | | --- | --------- | @@ -30,19 +30,19 @@ Consider the digit $d = 1$. After we write down each number n, we will update th | 11 | 4 | | 12 | 5 | -Note that $f(n, 1)$ never equals 3. +Observe que $f(n, 1)$ nunca é igual a 3. -So the first two solutions of the equation $f(n, 1) = n$ are $n = 0$ and $n = 1$. The next solution is $n = 199981$. In the same manner the function $f(n, d)$ gives the total number of digits d that have been written down after the number $n$ has been written. +Portanto, as duas primeiras soluções da equação $f(n, 1) = n$ são $n = 0$ e $n = 1$. A próxima solução é $n = 199981$. Da mesma forma, a função $f(n, d)$ indica o número total de algarismos d que foram anotados após o número $n$ ter sido escrito. -In fact, for every digit $d ≠ 0$, 0 is the first solution of the equation $f(n, d) = n$. Let $s(d)$ be the sum of all the solutions for which $f(n, d) = n$. +De fato, para cada algarismo $d ≠ 0$, 0 é a primeira solução da equação $f(n, d) = n$. Considere $s(d)$ a soma de todas as soluções para as quais $f(n, d) = n$. -You are given that $s(1) = 22786974071$. Find $\sum{s(d)}$ for $1 ≤ d ≤ 9$. +Você é informado de que $s(1) = 22786974071$. Encontre $\sum{s(d)}$ para $1 ≤ d ≤ 9$. -Note: if, for some $n$, $f(n, d) = n$ for more than one value of $d$ this value of $n$ is counted again for every value of $d$ for which $f(n, d) = n$. +Observação: se, para alguns $n$, $f(n, d) = n$ para mais de um valor de $d$, este valor de $n$ é contado novamente para cada valor de $d$ para o qual $f(n, d) = n$. # --hints-- -`countingDigits()` should return `21295121502550`. +`countingDigits()` deve retornar `21295121502550`. ```js assert.strictEqual(countingDigits(), 21295121502550); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-157-solving-the-diophantine-equation.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-157-solving-the-diophantine-equation.md index aa5e8185547..0cd9b657f4f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-157-solving-the-diophantine-equation.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-157-solving-the-diophantine-equation.md @@ -1,6 +1,6 @@ --- id: 5900f4091000cf542c50ff1c -title: 'Problem 157: Solving the diophantine equation' +title: 'Problema 157: Resolução da equação diofantina' challengeType: 1 forumTopicId: 301788 dashedName: problem-157-solving-the-diophantine-equation @@ -8,20 +8,20 @@ dashedName: problem-157-solving-the-diophantine-equation # --description-- -Consider the diophantine equation $\frac{1}{a} + \frac{1}{b} = \frac{p}{{10}^n}$ with $a$, $b$, $p$, $n$ positive integers and $a ≤ b$. +Considere a equação diofantina $\frac{1}{a} + \frac{1}{b} = \frac{p}{{10}^n}$, sendo $a$, $b$, $p$, $n$ números inteiros positivos e $a ≤ b$. -For $n = 1$ this equation has 20 solutions that are listed below: +Para $n = 1$, esta equação tem 20 soluções listadas abaixo: $$\begin{array}{lllll} \frac{1}{1} + \frac{1}{1} = \frac{20}{10} & \frac{1}{1} + \frac{1}{2} = \frac{15}{10} & \frac{1}{1} + \frac{1}{5} = \frac{12}{10} & \frac{1}{1} + \frac{1}{10} = \frac{11}{10} & \frac{1}{2} + \frac{1}{2} = \frac{10}{10} \\\\ \frac{1}{2} + \frac{1}{5} = \frac{7}{10} & \frac{1}{2} + \frac{1}{10} = \frac{6}{10} & \frac{1}{3} + \frac{1}{6} = \frac{5}{10} & \frac{1}{3} + \frac{1}{15} = \frac{4}{10} & \frac{1}{4} + \frac{1}{4} = \frac{5}{10} \\\\ \frac{1}{4} + \frac{1}{4} = \frac{5}{10} & \frac{1}{5} + \frac{1}{5} = \frac{4}{10} & \frac{1}{5} + \frac{1}{10} = \frac{3}{10} & \frac{1}{6} + \frac{1}{30} = \frac{2}{10} & \frac{1}{10} + \frac{1}{10} = \frac{2}{10} \\\\ \frac{1}{11} + \frac{1}{110} = \frac{1}{10} & \frac{1}{12} + \frac{1}{60} = \frac{1}{10} & \frac{1}{14} + \frac{1}{35} = \frac{1}{10} & \frac{1}{15} + \frac{1}{30} = \frac{1}{10} & \frac{1}{20} + \frac{1}{20} = \frac{1}{10} \end{array}$$ -How many solutions has this equation for $1 ≤ n ≤ 9$? +Quantas soluções tem esta equação para $1 ≤ n ≤ 9$? # --hints-- -`diophantineEquation()` should return `53490`. +`diophantineEquation()` deve retornar `53490`. ```js assert.strictEqual(diophantineEquation(), 53490); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md index 845e2be3303..5577f52915e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md @@ -1,7 +1,7 @@ --- id: 5900f40a1000cf542c50ff1d title: >- - Problem 158: Exploring strings for which only one character comes lexicographically after its neighbour to the left + Problema 158: Explorar strings para as quais apenas um caractere vem lexicograficamente após seu vizinho à esquerda challengeType: 1 forumTopicId: 301789 dashedName: >- @@ -10,25 +10,25 @@ dashedName: >- # --description-- -Taking three different letters from the 26 letters of the alphabet, character strings of length three can be formed. +Levando em conta três letras diferentes das 26 letras do alfabeto, strings de comprimento três podem ser formadas. -Examples are 'abc', 'hat' and 'zyx'. +Exemplos são 'abc', 'hat' e 'zyx'. -When we study these three examples we see that for 'abc' two characters come lexicographically after its neighbour to the left. +Quando analisamos estes três exemplos, verificamos que, para "abc", dois caracteres vêm lexicograficamente depois do vizinho à esquerda. -For 'hat' there is exactly one character that comes lexicographically after its neighbour to the left. For 'zyx' there are zero characters that come lexicographically after its neighbour to the left. +Para "hat", há exatamente um caractere que vem lexicograficamente depois de seu vizinho à esquerda. Para "zyx", não há caracteres que venham lexicograficamente depois de seu vizinho à esquerda. -In all there are 10400 strings of length 3 for which exactly one character comes lexicographically after its neighbour to the left. +Ao todo, há 10.400 strings de tamanho 3 para as quais apenas um caractere vem lexicograficamente após seu vizinho à esquerda. -We now consider strings of $n ≤ 26$ different characters from the alphabet. +Consideremos agora strings de $n ≤ 26$ caracteres diferentes do alfabeto. -For every $n$, $p(n)$ is the number of strings of length $n$ for which exactly one character comes lexicographically after its neighbour to the left. +Para cada $n$, $p(n)$ é o número de strings de comprimento $n$ para as quais exatamente um caractere vem lexicograficamente depois de seu vizinho à esquerda. -What is the maximum value of $p(n)$? +Qual é o valor máximo de $p(n)$? # --hints-- -`lexicographicNeighbours()` should return `409511334375`. +`lexicographicNeighbours()` deve retornar `409511334375`. ```js assert.strictEqual(lexicographicNeighbours(), 409511334375); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-159-digital-root-sums-of-factorisations.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-159-digital-root-sums-of-factorisations.md index 07a2e4945a4..0c50e372eb6 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-159-digital-root-sums-of-factorisations.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-159-digital-root-sums-of-factorisations.md @@ -1,6 +1,6 @@ --- id: 5900f40c1000cf542c50ff1e -title: 'Problem 159: Digital root sums of factorisations' +title: 'Problema 159: Somas das raízes dos algarismos de fatorações' challengeType: 1 forumTopicId: 301790 dashedName: problem-159-digital-root-sums-of-factorisations @@ -8,36 +8,36 @@ dashedName: problem-159-digital-root-sums-of-factorisations # --description-- -A composite number can be factored many different ways. +Um número composto pode ser fatorado de várias maneiras. -For instance, not including multiplication by one, 24 can be factored in 7 distinct ways: +Por exemplo, não incluindo a multiplicação por um, 24 podem ser fatorado de 7 formas distintas: $$\begin{align} & 24 = 2 \times 2 \times 2 \times 3\\\\ & 24 = 2 \times 3 \times 4 \\\\ & 24 = 2 \times 2 \times 6 \\\\ & 24 = 4 \times 6 \\\\ & 24 = 3 \times 8 \\\\ & 24 = 2 \times 12 \\\\ & 24 = 24 \end{align}$$ -Recall that the digital root of a number, in base 10, is found by adding together the digits of that number, and repeating that process until a number arrives at less than 10. Thus the digital root of 467 is 8. +Lembre-se de que a raiz de algarismos de um número, na base 10, é encontrada adicionando os algarismos daquele número e repetindo esse processo até que um número chegue a menos de 10. Assim, a raiz dos algarismos de 467 é 8. -We shall call a Digital Root Sum (DRS) the sum of the digital roots of the individual factors of our number. The chart below demonstrates all of the DRS values for 24. +Vamos chamar a um soma da raiz dos algarismos (DRS) a soma das raízes dos algarismos dos fatores individuais do nosso número. A tabela abaixo demonstra todos os valores de DRS para 24. -| Factorisation | Digital Root Sum | -| ------------- | ---------------- | -| 2x2x2x3 | 9 | -| 2x3x4 | 9 | -| 2x2x6 | 10 | -| 4x6 | 10 | -| 3x8 | 11 | -| 2x12 | 5 | -| 24 | 6 | +| Fatoração | Soma da raiz dos algarismos | +| --------- | --------------------------- | +| 2x2x2x3 | 9 | +| 2x3x4 | 9 | +| 2x2x6 | 10 | +| 4x6 | 10 | +| 3x8 | 11 | +| 2x12 | 5 | +| 24 | 6 | -The maximum Digital Root Sum of 24 is 11. The function $mdrs(n)$ gives the maximum Digital Root Sum of $n$. So $mdrs(24) = 11$. +A soma da raiz dos algarismos máxima de 24 é 11. A função $mdrs(n)$ fornece a soma da raiz dos algarismos máxima de $n$. Portanto, $mdrs(24) = 11$. -Find $\sum{mdrs(n)}$ for $1 < n < 1,000,000$. +Encontre $\sum{mdrs(n)}$ para $1 < n < 1.000.000$. # --hints-- -`euler159()` should return `14489159`. +`euler159()` deve retornar `14489159`. ```js assert.strictEqual(euler159(), 14489159); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-160-factorial-trailing-digits.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-160-factorial-trailing-digits.md index ceec9db70d3..94a59b0233c 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-160-factorial-trailing-digits.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-160-factorial-trailing-digits.md @@ -1,6 +1,6 @@ --- id: 5900f40d1000cf542c50ff1f -title: 'Problem 160: Factorial trailing digits' +title: 'Problema 160: algarismos à direita do fatorial' challengeType: 1 forumTopicId: 301794 dashedName: problem-160-factorial-trailing-digits @@ -8,18 +8,18 @@ dashedName: problem-160-factorial-trailing-digits # --description-- -For any $N$, let $f(N)$ be the last five digits before the trailing zeroes in $N!$. +Para qualquer $N$, considere $f(N)$ como os últimos cinco algarismos antes dos zeros à direita em $N!$. -For example, +Por exemplo: $$\begin{align} & 9! = 362880 \\; \text{so} \\; f(9) = 36288 \\\\ & 10! = 3628800 \\; \text{so} \\; f(10) = 36288 \\\\ & 20! = 2432902008176640000 \\; \text{so} \\; f(20) = 17664 \end{align}$$ -Find $f(1,000,000,000,000)$ +Encontre $f(1.000.000.000.000)$ # --hints-- -`factorialTrailingDigits()` should return `16576`. +`factorialTrailingDigits()` deve retornar `16576`. ```js assert.strictEqual(factorialTrailingDigits(), 16576); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-161-triominoes.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-161-triominoes.md index 8e0a070c788..f168419dec5 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-161-triominoes.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-161-triominoes.md @@ -1,6 +1,6 @@ --- id: 5900f40d1000cf542c50ff20 -title: 'Problem 161: Triominoes' +title: 'Problema 161: Triominos' challengeType: 1 forumTopicId: 301795 dashedName: problem-161-triominoes @@ -8,25 +8,25 @@ dashedName: problem-161-triominoes # --description-- -A triomino is a shape consisting of three squares joined via the edges. +Um triomino é uma forma que consiste de três quadrados unidos pelas bordas. -There are two basic forms: +Existem duas formas básicas: -two basic triominoes forms +duas formas básicas de triominos -If all possible orientations are taken into account there are six: +Se todas as orientações possíveis forem levadas em conta, existem seis: -triominoes forms including orientation +formas de triominos incluindo orientação -Any n by m grid for which nxm is divisible by 3 can be tiled with triominoes. If we consider tilings that can be obtained by reflection or rotation from another tiling as different there are 41 ways a 2 by 9 grid can be tiled with triominoes: +Qualquer grid n por m para qual n * m é divisível por 3 pode ser preenchido por triominos. Se considerarmos que os agrupamentos que podem ser obtidos por reflexão ou rotação de outro agrupamento diferente, existem 41 maneiras de um grid de 2 por 9 ser completado por triominos: -animation showing 41 ways of filling 2x9 grid with triominoes +animação mostrando 41 maneiras de preencher o grid 2x9 com triominos -In how many ways can a 9 by 12 grid be tiled in this way by triominoes? +De quantas maneiras um grid 9 por 12 pode ser encaixados dessa forma por triominos? # --hints-- -`triominoes()` should return `20574308184277972`. +`triominoes()` deve retornar `20574308184277972`. ```js assert.strictEqual(triominoes(), 20574308184277972); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-162-hexadecimal-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-162-hexadecimal-numbers.md index 9ad940349fe..cc635824e51 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-162-hexadecimal-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-162-hexadecimal-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f40e1000cf542c50ff21 -title: 'Problem 162: Hexadecimal numbers' +title: 'Problema 162: Números hexadecimais' challengeType: 1 forumTopicId: 301796 dashedName: problem-162-hexadecimal-numbers @@ -8,31 +8,31 @@ dashedName: problem-162-hexadecimal-numbers # --description-- -In the hexadecimal number system numbers are represented using 16 different digits: +Os números do sistema de números hexadecimais são representados usando 16 algarismos diferentes: $$0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F$$ -The hexadecimal number AF when written in the decimal number system equals $10 \times 16 + 15 = 175$. +O número hexadecimal AF quando escrito no sistema de números decimais é igual a $10 \times 16 + 15 = 175$. -In the 3-digit hexadecimal numbers 10A, 1A0, A10, and A01 the digits 0,1 and A are all present. +Nos números hexadecimais de 3 algarismos 10A, 1A0, A10 e A01, os algarismos 0,1 e A estão todos presentes. -Like numbers written in base ten we write hexadecimal numbers without leading zeroes. +Como números escritos na base dez, escrevemos números hexadecimais sem zeros à frente. -How many hexadecimal numbers containing at most sixteen hexadecimal digits exist with all of the digits 0,1, and A present at least once? +Quantos números hexadecimais, contendo no máximo dezesseis algarismos hexadecimais, existem com os algarismos 0,1 e A presentes pelo menos uma vez? -Give your answer with hexadecimal number as a string. +Dê sua resposta com um número hexadecimal como uma string. -**Note:** (A,B,C,D,E and F in upper case, without any leading or trailing code that marks the number as hexadecimal and without leading zeroes , e.g. 1A3F and not: 1a3f and not 0x1a3f and not $1A3F and not #1A3F and not 0000001A3F) +**Observação:** deixe A,B,C,D,E e F em maiúsculas, sem qualquer código anterior ou posterior que marque o número como hexadecimal e sem zeros à direita, por exemplo: 1A3F e não: 1a3f, 0x1a3f, $1A3F, #1A3F ou 0000001A3F. # --hints-- -`hexadecimalNumbers()` should return a string. +`hexadecimalNumbers()` deve retornar uma string. ```js assert(typeof hexadecimalNumbers() === 'string'); ``` -`hexadecimalNumbers()` should return the string `3D58725572C62302`. +`hexadecimalNumbers()` deve retornar a string `3D58725572C62302`. ```js assert.strictEqual(hexadecimalNumbers(), '3D58725572C62302'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-165-intersections.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-165-intersections.md index 04fef3d3e53..192aa3a7d4b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-165-intersections.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-165-intersections.md @@ -1,6 +1,6 @@ --- id: 5900f4111000cf542c50ff24 -title: 'Problem 165: Intersections' +title: 'Problema 165: Interseções' challengeType: 1 forumTopicId: 301799 dashedName: problem-165-intersections @@ -8,37 +8,37 @@ dashedName: problem-165-intersections # --description-- -A segment is uniquely defined by its two endpoints. By considering two line segments in plane geometry there are three possibilities: the segments have zero points, one point, or infinitely many points in common. +Um segmento é definido exclusivamente por seus dois pontos de extremidade. Considerando dois segmentos de reta em geometria plana, há três possibilidades: os segmentos têm zero pontos, um ponto, ou infinitos pontos em comum. -Moreover when two segments have exactly one point in common it might be the case that that common point is an endpoint of either one of the segments or of both. If a common point of two segments is not an endpoint of either of the segments it is an interior point of both segments. +Além disso, quando dois segmentos têm exatamente um ponto em comum, pode acontecer que esse ponto comum seja um ponto de extremidade de um dos segmentos ou de ambos. Se um ponto comum de dois segmentos não for um ponto de extremidade de nenhum dos segmentos, ele é um ponto interno de ambos os segmentos. -We will call a common point $T$ of two segments $L_1$ and $L_2$ a true intersection point of $L_1$ and $L_2$ if $T$ is the only common point of $L_1$ and $L_2$ and $T$ is an interior point of both segments. +Chamaremos de ponto comum $T$ de dois segmentos $L_1$ e $L_2$ um ponto de interseção verdadeira de $L_1$ e $L_2$ se $T$ for o único ponto comum de $L_1$ e $L_2$ e se $T$ for um ponto interior de ambos os segmentos. -Consider the three segments $L_1$, $L_2$, and $L_3$: +Considere os três segmentos $L_1$, $L_2$, e $L_3$: $$\begin{align} & L_1: (27, 44) \\;\text{to}\\; (12, 32) \\\\ & L_2: (46, 53) \\;\text{to}\\; (17, 62) \\\\ & L_3: (46, 70) \\;\text{to}\\; (22, 40) \\\\ \end{align}$$ -It can be verified that line segments $L_2$ and $L_3$ have a true intersection point. We note that as the one of the end points of $L_3$: (22, 40) lies on $L_1$ this is not considered to be a true point of intersection. $L_1$ and $L_2$ have no common point. So among the three line segments, we find one true intersection point. +É possível verificar que os segmentos de reta $L_2$ e $L_3$ têm um ponto de interseção verdadeira. Percebemos que, como um dos pontos de extremidade de $L_3$: (22, 40) fica sobre $L_1$, este não é considerado um ponto de interseção verdadeira. $L_1$ e $L_2$ não têm um ponto em comum. Portanto, entre os três segmentos de reta, encontramos um ponto de interseção verdadeira. -Now let us do the same for 5000 line segments. To this end, we generate 20000 numbers using the so-called "Blum Blum Shub" pseudo-random number generator. +Façamos agora o mesmo em 5.000 segmentos de reta. Para isso, geramos 20.000 números usando o chamado gerador pseudoaleatório de números "Blum Blum Shub". $$\begin{align} & s_0 = 290797 \\\\ & s_{n + 1} = s_n × s_n (\text{modulo}\\; 50515093) \\\\ & t_n = s_n (\text{modulo}\\; 500) \\\\ \end{align}$$ -To create each line segment, we use four consecutive numbers $t_n$. That is, the first line segment is given by: +Para criar cada segmento de reta, usamos quatro números consecutivos $t_n$. Ou seja, o primeiro segmento de reta é dado por: -($_t$1, $t_2$) to ($t_3$, $t_4$) +($_t$1, $t_2$) a ($t_3$, $t_4$) -The first four numbers computed according to the above generator should be: 27, 144, 12 and 232. The first segment would thus be (27, 144) to (12, 232). +Os primeiros quatro números calculados de acordo com o gerador acima devem ser: 27, 144, 12 e 232. O primeiro segmento seria, portanto, de (27, 144) a (12, 232). -How many distinct true intersection points are found among the 5000 line segments? +Quantos pontos de interseção verdadeira distintos se encontram entre os 5.000 segmentos de reta? # --hints-- -`distinctIntersections()` should return `2868868`. +`distinctIntersections()` deve retornar `2868868`. ```js assert.strictEqual(distinctIntersections(), 2868868); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-166-criss-cross.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-166-criss-cross.md index f413a225835..67567cebfec 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-166-criss-cross.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-166-criss-cross.md @@ -1,6 +1,6 @@ --- id: 5900f4131000cf542c50ff25 -title: 'Problem 166: Criss Cross' +title: 'Problema 166: Cruzamentos' challengeType: 1 forumTopicId: 301800 dashedName: problem-166-criss-cross @@ -8,21 +8,21 @@ dashedName: problem-166-criss-cross # --description-- -A 4x4 grid is filled with digits $d$, $0 ≤ d ≤ 9$. +Uma grade de 4x4 é preenchida por algarismos $d$, sendo que $0 ≤ d ≤ 9$. -It can be seen that in the grid +Pode-se ver que na grade $$\begin{array}{} 6 & 3 & 3 & 0 \\\\ 5 & 0 & 4 & 3 \\\\ 0 & 7 & 1 & 4 \\\\ 1 & 2 & 4 & 5 \end{array}$$ -the sum of each row and each column has the value 12. Moreover the sum of each diagonal is also 12. +a soma de cada linha e de cada coluna tem o valor 12. Além disso, a soma de cada diagonal também é 12. -In how many ways can you fill a 4x4 grid with the digits $d$, $0 ≤ d ≤ 9$ so that each row, each column, and both diagonals have the same sum? +De quantas maneiras você pode preencher uma grade 4x4 com os algarismos $d$, sendo que $0 ≤ d ≤ 9$, de modo que cada linha, cada coluna e as duas diagonais tenham a mesma soma? # --hints-- -`crissCross()` should return `7130034`. +`crissCross()` deve retornar `7130034`. ```js assert.strictEqual(crissCross(), 7130034); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-167-investigating-ulam-sequences.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-167-investigating-ulam-sequences.md index 37f3fd53c28..2b70bd6b95b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-167-investigating-ulam-sequences.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-167-investigating-ulam-sequences.md @@ -1,6 +1,6 @@ --- id: 5900f4141000cf542c50ff26 -title: 'Problem 167: Investigating Ulam sequences' +title: 'Problema 167: Investigação de sequências de Ulam' challengeType: 1 forumTopicId: 301801 dashedName: problem-167-investigating-ulam-sequences @@ -8,19 +8,19 @@ dashedName: problem-167-investigating-ulam-sequences # --description-- -For two positive integers $a$ and $b$, the Ulam sequence $U(a,b)$ is defined by ${U{(a,b)}\_1} = a$, ${U{(a,b)}\_2} = b$ and for $k > 2$, ${U{(a,b)}\_k}$ is the smallest integer greater than ${U{(a,b)}\_{(k-1)}}$ which can be written in exactly one way as the sum of two distinct previous members of $U(a,b)$. +Para dois números inteiros positivos, $a$ e $b$, a sequência de Ulam $U(a,b)$ é definida por ${U{(a,b)}\_1} = a$, ${U{(a,b)}\_2} = b$ e por $k > 2$. ${U{(a,b)}\_k}$ é o menor número inteiro maior que ${U{(a,b)}\_{(k-1)}}$ que pode ser escrito exatamente de um modo como a soma dos dois membros distintos anteriores de $U(a,b)$. -For example, the sequence $U(1,2)$ begins with +Por exemplo, a sequência $U(1,2)$ começa com $$1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 = 2 + 4, 8 = 2 + 6, 11 = 3 + 8$$ -5 does not belong to it because $5 = 1 + 4 = 2 + 3$ has two representations as the sum of two previous members, likewise $7 = 1 + 6 = 3 + 4$. +5 não pertence a ela porque $5 = 1 + 4 = 2 + 3$ tem duas representações como a soma de dois membros anteriores. Da mesma forma, $7 = 1 + 6 = 3 + 4$. -Find $\sum {U(2, 2n + 1)_k}$ for $2 ≤ n ≤ 10$, where $k = {10}^{11}$. +Encontre a $\sum {U(2, 2n + 1)_k}$ para $2 ≤ n ≤ 10$, onde $k = {10}^{11}$. # --hints-- -`ulamSequences()` should return `3916160068885`. +`ulamSequences()` deve retornar `3916160068885`. ```js assert.strictEqual(ulamSequences(), 3916160068885); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-168-number-rotations.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-168-number-rotations.md index 50802415375..5852c3ce68a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-168-number-rotations.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-168-number-rotations.md @@ -1,6 +1,6 @@ --- id: 5900f4151000cf542c50ff27 -title: 'Problem 168: Number Rotations' +title: 'Problema 168: Rotações de números' challengeType: 1 forumTopicId: 301802 dashedName: problem-168-number-rotations @@ -8,23 +8,23 @@ dashedName: problem-168-number-rotations # --description-- -Consider the number 142857. We can right-rotate this number by moving the last digit (7) to the front of it, giving us 714285. +Considere o número 142857. Podemos girar esse número para a direita movendo o último algarismo (7) para a frente dele, nos dando 714285. -It can be verified that $714285 = 5 × 142857$. +Pode-se ver que $714285 = 5 × 142857$. -This demonstrates an unusual property of 142857: it is a divisor of its right-rotation. +Isto demonstra uma propriedade incomum de 142857: ele é um divisor de sua rotação à direita. -For integer number of digits $a$ and $b$, find the last 5 digits of the sum of all integers $n$, $10^a < n < 10^b$, that have this property. +Para um número inteiro de dígitos $a$ e $b$, encontre os 5 últimos dígitos da soma de todos os inteiros $n$, $10^a < n < 10^b$ que têm essa propriedade. # --hints-- -`numberRotations(2, 10)` should return `98311`. +`numberRotations(2, 10)` deve retornar `98311`. ```js assert.strictEqual(numberRotations(2, 10), 98311); ``` -`numberRotations(2, 100)` should return `59206`. +`numberRotations(2, 100)` deve retornar `59206`. ```js assert.strictEqual(numberRotations(2, 100), 59206); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md index b6886e18764..6b82c0277ae 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md @@ -1,7 +1,7 @@ --- id: 5900f4161000cf542c50ff29 title: >- - Problem 170: Find the largest 0 to 9 pandigital that can be formed by concatenating products + Problema 170: Encontrar o maior pandigital de 0 a 9 que pode ser formado concatenando produtos challengeType: 1 forumTopicId: 301805 dashedName: >- @@ -10,20 +10,20 @@ dashedName: >- # --description-- -Take the number 6 and multiply it by each of 1273 and 9854: +Pegue o número 6 e multiplique-o por 1273 e 9854: $$\begin{align} & 6 × 1273 = 7638 \\\\ & 6 × 9854 = 59124 \\\\ \end{align}$$ -By concatenating these products we get the 1 to 9 pandigital 763859124. We will call 763859124 the "concatenated product of 6 and (1273, 9854)". Notice too, that the concatenation of the input numbers, 612739854, is also 1 to 9 pandigital. +Ao concatenar esses produtos, temos o pandigital de 1 a 9 763859124. Chamaremos 763859124 de "produto concatenado de 6 e (1273, 9854)". Observe, também, que a concatenação dos números de entrada, 612739854, também é um pandigital de 1 a 9. -The same can be done for 0 to 9 pandigital numbers. +O mesmo pode ser feito com os números pandigitais de 0 e 9. -What is the largest 0 to 9 pandigital 10-digit concatenated product of an integer with two or more other integers, such that the concatenation of the input numbers is also a 0 to 9 pandigital 10-digit number? +Qual é o maior pandigital de 0 a 9 que é, ao mesmo tempo, o produto concatenado de um número inteiro com dois ou mais números inteiros diversos, de modo que a concatenação dos números de entrada seja também um número pandigital de 0 a 9 com 10 algarismos? # --hints-- -`largestPandigital()` should return `9857164023`. +`largestPandigital()` deve retornar `9857164023`. ```js assert.strictEqual(largestPandigital(), 9857164023); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md index 0488d662943..9a5764d5fd7 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md @@ -1,7 +1,7 @@ --- id: 5900f41a1000cf542c50ff2c title: >- - Problem 173: Using up to one million tiles how many different "hollow" square laminae can be formed? + Problema 173: Usando até um milhão de blocos, quantas lâminas quadradas "ocas" diferentes podem ser formadas? challengeType: 1 forumTopicId: 301808 dashedName: >- @@ -10,15 +10,15 @@ dashedName: >- # --description-- -We shall define a square lamina to be a square outline with a square "hole" so that the shape possesses vertical and horizontal symmetry. For example, using exactly thirty-two square tiles we can form two different square laminae: +Definiremos um lâmina quadrada como um esboço quadrado com um "buraco", de modo que a forma possua simetria vertical e horizontal. Por exemplo, usando exatamente trinta e dois blocos quadrados, podemos formar duas lâminas quadradas diferentes: -two square lamina with holes 2x2 and 7x7 +duas lâminas quadradas com buracos 2x2 e 7x7 -With one-hundred tiles, and not necessarily using all of the tiles at one time, it is possible to form forty-one different square laminae. Using up to one million tiles how many different square laminae can be formed? +Com cem blocos, e não necessariamente usando todos eles de uma só vez, é possível formar quarenta e uma lâminas quadradas diferentes. Usando até um milhão de blocos, quantas lâminas quadradas diferentes podem ser formadas? # --hints-- -`differentHollowSquareLaminae()` should return `1572729`. +`differentHollowSquareLaminae()` deve retornar `1572729`. ```js assert.strictEqual(differentHollowSquareLaminae(), 1572729); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md index 48843b6b0a9..018e9f902b2 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md @@ -1,7 +1,7 @@ --- id: 5900f41a1000cf542c50ff2d title: >- - Problem 174: Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements + Problema 174: Contar o número de lâminas quadradas "ocas" que podem formar um, dois, três... arranjos distintos challengeType: 1 forumTopicId: 301809 dashedName: >- @@ -10,21 +10,21 @@ dashedName: >- # --description-- -We shall define a square lamina to be a square outline with a square "hole" so that the shape possesses vertical and horizontal symmetry. +Definiremos um lâmina quadrada como um esboço quadrado com um "buraco", de modo que a forma possua simetria vertical e horizontal. -Given eight tiles it is possible to form a lamina in only one way: 3x3 square with a 1x1 hole in the middle. However, using thirty-two tiles it is possible to form two distinct laminae. +Com oito blocos, é possível formar uma lâmina de uma só forma: um quadrado de 3x3 com um buraco de 1x1 no meio. No entanto, com trinta e dois blocos, é possível formar duas lâminas distintas. -two square lamina with holes 2x2 and 7x7 +duas lâminas quadradas com buracos 2x2 e 7x7 -If $t$ represents the number of tiles used, we shall say that $t = 8$ is type $L(1)$ and $t = 32$ is type $L(2)$. +Se $t$ representa o número de blocos utilizados, diremos que $t = 8$ é do tipo $L(1)$ e $t = 32$ é do tipo $L(2)$. -Let $N(n)$ be the number of $t ≤ 1000000$ such that $t$ is type $L(n)$; for example, $N(15) = 832$. +Considere $N(n)$ o número de $t ≤ 1000000$, de modo que $t$ é do tipo $L(n)$; por exemplo, $N(15) = 832$. -What is $\sum N(n)$ for $1 ≤ n ≤ 10$? +Qual é a $\sum N(n)$ para $1 ≤ n ≤ 10$? # --hints-- -`hollowSquareLaminaeDistinctArrangements()` should return `209566`. +`hollowSquareLaminaeDistinctArrangements()` deve retornar `209566`. ```js assert.strictEqual(hollowSquareLaminaeDistinctArrangements(), 209566); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md index b3419c34823..2a08d059fc9 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md @@ -1,7 +1,7 @@ --- id: 5900f41c1000cf542c50ff2e title: >- - Problem 175: Fractions involving the number of different ways a number can be expressed as a sum of powers of 2 + Problema 175: Frações envolvendo o número de maneiras diferentes pelas quais um número pode ser expresso como uma soma de potências de 2 challengeType: 1 forumTopicId: 301810 dashedName: >- @@ -10,33 +10,33 @@ dashedName: >- # --description-- -Define $f(0) = 1$ and $f(n)$ to be the number of ways to write $n$ as a sum of powers of 2 where no power occurs more than twice. +Defina $f(0) = 1$ e $f(n)$ como o número de formas de escrever $n$ como uma soma de potências de 2 onde nenhuma potência ocorra mais de duas vezes. -For example, $f(10) = 5$ since there are five different ways to express 10: +Por exemplo, $f(10) = 5$ já que há cinco maneiras diferentes de expressar 10: $$10 = 8 + 2 = 8 + 1 + 1 = 4 + 4 + 2 = 4 + 2 + 2 + 1 + 1 = 4 + 4 + 1 + 1$$ -It can be shown that for every fraction $\frac{p}{q}\\; (p>0, q>0)$ there exists at least one integer $n$ such that $\frac{f(n)}{f(n - 1)} = \frac{p}{q}$. +Pode-se mostrar que, para cada fração $\frac{p}{q}\\; (p>0, q>0)$ existe pelo menos um número inteiro $n$ de modo que $\frac{f(n)}{f(n - 1)} = \frac{p}{q}$. -For instance, the smallest $n$ for which $\frac{f(n)}{f(n - 1)} = \frac{13}{17}$ is 241. The binary expansion of 241 is 11110001. +Por exemplo, o menor $n$ para o qual $\frac{f(n)}{f(n - 1)} = \frac{13}{17}$ é 241. A expansão binária de 241 é 11110001. -Reading this binary number from the most significant bit to the least significant bit there are 4 one's, 3 zeroes and 1 one. We shall call the string 4,3,1 the Shortened Binary Expansion of 241. +Ao ler este número binário, a partir do bit mais significativo até o bit menos significativo, que há 4 números um, 3 zeros e um 1. Chamaremos a string 4,3,1 de expansão binária reduzida de 241. -Find the Shortened Binary Expansion of the smallest $n$ for which +Encontre a expansão binária reduzida do menor $n$ para o qual $$\frac{f(n)}{f(n - 1)} = \frac{123456789}{987654321}$$ -Give your answer as a string with comma separated integers, without any whitespaces. +Dê sua resposta como uma string com inteiros separados por vírgula, sem nenhum espaço em branco. # --hints-- -`shortenedBinaryExpansionOfNumber()` should return a string. +`shortenedBinaryExpansionOfNumber()` deve retornar uma string. ```js assert(typeof shortenedBinaryExpansionOfNumber() === 'string'); ``` -`shortenedBinaryExpansionOfNumber()` should return the string `1,13717420,8`. +`shortenedBinaryExpansionOfNumber()` deve retornar a string `1,13717420,8`. ```js assert.strictEqual(shortenedBinaryExpansionOfNumber(), '1,13717420,8'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-177-integer-angled-quadrilaterals.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-177-integer-angled-quadrilaterals.md index c6f7b8ee5c4..c2e74fad2ab 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-177-integer-angled-quadrilaterals.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-177-integer-angled-quadrilaterals.md @@ -1,6 +1,6 @@ --- id: 5900f41e1000cf542c50ff30 -title: 'Problem 177: Integer angled Quadrilaterals' +title: 'Problema 177: Quadriláteros de ângulos inteiros' challengeType: 1 forumTopicId: 301812 dashedName: problem-177-integer-angled-quadrilaterals @@ -8,21 +8,21 @@ dashedName: problem-177-integer-angled-quadrilaterals # --description-- -Let ABCD be a convex quadrilateral, with diagonals AC and BD. At each vertex the diagonal makes an angle with each of the two sides, creating eight corner angles. +Considere ABCD um quadrilátero convexo, com suas diagonais AC e BD. Em cada vértice, a diagonal faz um ângulo com cada um dos dois lados, criando oito ângulos de canto. -convex quadrilateral ABCD, with diagonals AC and BD +quadrilátero convexo ABCD com diagonais AC e BD -For example, at vertex A, the two angles are CAD, CAB. +Por exemplo, no vértice A, os dois ângulos são CAD e CAB. -We call such a quadrilateral for which all eight corner angles have integer values when measured in degrees an "integer angled quadrilateral". An example of an integer angled quadrilateral is a square, where all eight corner angles are 45°. Another example is given by DAC = 20°, BAC = 60°, ABD = 50°, CBD = 30°, BCA = 40°, DCA = 30°, CDB = 80°, ADB = 50°. +Chamamos um quadrilátero como esse, para o qual todos os oito ângulos têm valores em números inteiros quando medidos em graus um "quadrilátero de ângulos inteiros". Um exemplo de um quadrilátero de ângulos inteiros é um quadrado, onde todos os oito ângulos são de 45°. Outro exemplo é dado por DAC = 20°, BAC = 60°, ABD = 50°, CBD = 30°, BCA = 40°, DCA = 30°, CDB = 80°, ADB = 50°. -What is the total number of non-similar integer angled quadrilaterals? +Qual é o número total de quadriláteros de ângulos inteiros não semelhantes? -**Note:** In your calculations you may assume that a calculated angle is integral if it is within a tolerance of ${10}^{-9}$ of an integer value. +**Observação:** nos seus cálculos, você pode supor que um ângulo calculado é inteiro se estiver dentro de uma tolerância de ${10}^{-9}$ de um valor inteiro. # --hints-- -`integerAngledQuadrilaterals()` should return `129325`. +`integerAngledQuadrilaterals()` deve retornar `129325`. ```js assert.strictEqual(integerAngledQuadrilaterals(), 129325); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-178-step-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-178-step-numbers.md index 22f44139de6..2a29142acc9 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-178-step-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-178-step-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f41e1000cf542c50ff31 -title: 'Problem 178: Step Numbers' +title: 'Problema 178: Números com passos' challengeType: 1 forumTopicId: 301813 dashedName: problem-178-step-numbers @@ -8,19 +8,19 @@ dashedName: problem-178-step-numbers # --description-- -Consider the number 45656. +Considere o número 45656. -It can be seen that each pair of consecutive digits of 45656 has a difference of one. +Podemos ver que cada par de algarismos consecutivos de 45656 tem uma diferença de um. -A number for which every pair of consecutive digits has a difference of one is called a step number. +Um número para o qual cada par de algarismos consecutivos tem uma diferença de um é chamado de um número com passos. -A pandigital number contains every decimal digit from 0 to 9 at least once. +Um número pandigital contém todos os algarismos decimais de 0 a 9 pelo menos uma vez. -How many pandigital step numbers less than ${10}^{40}$ are there? +Quantos números com passos pandigitais menores que ${10}^{40}$ existem? # --hints-- -`stepNumbers()` should return `126461847755`. +`stepNumbers()` deve retornar `126461847755`. ```js assert.strictEqual(stepNumbers(), 126461847755); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-179-consecutive-positive-divisors.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-179-consecutive-positive-divisors.md index a159a7af8f6..8c4f4eebd23 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-179-consecutive-positive-divisors.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-179-consecutive-positive-divisors.md @@ -1,6 +1,6 @@ --- id: 5900f41f1000cf542c50ff32 -title: 'Problem 179: Consecutive positive divisors' +title: 'Problema 179: Divisores positivos consecutivos' challengeType: 1 forumTopicId: 301814 dashedName: problem-179-consecutive-positive-divisors @@ -8,11 +8,11 @@ dashedName: problem-179-consecutive-positive-divisors # --description-- -Find the number of integers $1 < n < {10}^7$, for which $n$ and $n + 1$ have the same number of positive divisors. For example, 14 has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15. +Encontre o número de inteiros sendo que $1 < n < {10}^7$, para os quais $n$ e $n + 1$ têm o mesmo número de divisores positivos. Por exemplo, 14 têm os divisores positivos 1, 2, 7, 14, enquanto 15 tem 1, 3, 5, 15. # --hints-- -`consecutivePositiveDivisors()` should return `986262`. +`consecutivePositiveDivisors()` deve retornar `986262`. ```js assert.strictEqual(consecutivePositiveDivisors(), 986262); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-182-rsa-encryption.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-182-rsa-encryption.md index e971434b3e7..4ef623f3aff 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-182-rsa-encryption.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-182-rsa-encryption.md @@ -1,6 +1,6 @@ --- id: 5900f4231000cf542c50ff35 -title: 'Problem 182: RSA encryption' +title: 'Problema 182: Criptografia RSA' challengeType: 1 forumTopicId: 301818 dashedName: problem-182-rsa-encryption @@ -8,47 +8,47 @@ dashedName: problem-182-rsa-encryption # --description-- -The RSA encryption is based on the following procedure: +A criptografia RSA baseia-se no seguinte procedimento: -Generate two distinct primes `p` and `q`. Compute `n=p*q` and `φ=(p-1)(q-1)`. Find an integer `e`, `1 < e < φ`, such that `gcd(e,φ) = 1` +Gere dois números primos distintos `p` e `q`. Calcule `n=p*q` e `φ=(p-1)(q-1)`. Encontre um número inteiro `e`, sendo que `1 < e < φ`, de tal forma que `gcd(e,φ) = 1` (gcd é a sigla para máximo divisor comum, em inglês) -A message in this system is a number in the interval `[0,n-1]`. A text to be encrypted is then somehow converted to messages (numbers in the interval `[0,n-1]`). To encrypt the text, for each message, `m`, c=me mod n is calculated. +Uma mensagem neste sistema é um número no intervalo `[0,n-1]`. Um texto a ser criptografado é então convertido em mensagens (números no intervalo `[0,n-1]`). Para criptografar o texto, para cada mensagem, `m`, c=me mod n é calculado. -To decrypt the text, the following procedure is needed: calculate `d` such that `ed=1 mod φ`, then for each encrypted message, `c`, calculate m=cd mod n. +Para descriptografar o texto, é necessário o seguinte procedimento: calcular `d` tal que `ed=1 mod φ`. Depois, para cada mensagem criptografada, `c`, calcular m=cd mod n. -There exist values of `e` and `m` such that me mod n = m. We call messages `m` for which me mod n=m unconcealed messages. +Existem valores de `e` e `m` tal que me mod n = m. Chamamos de mensagens `m` aquelas para as quais me mod n=m mensagens não ocultas. -An issue when choosing `e` is that there should not be too many unconcealed messages. For instance, let `p=19` and `q=37`. Then `n=19*37=703` and `φ=18*36=648`. If we choose `e=181`, then, although `gcd(181,648)=1` it turns out that all possible messages m `(0≤m≤n-1)` are unconcealed when calculating me mod n. For any valid choice of `e` there exist some unconcealed messages. It's important that the number of unconcealed messages is at a minimum. +Um problema ao escolher `e` é o fato de que não deve haver muitas mensagens não ocultas. Por exemplo, considere `p=19` e `q=37`. Então `n=19*37=703` e `φ=18*36=648`. Se escolhermos `e=181`, então, embora `gcd(181,648)=1` todas as mensagens possíveis m `(0≤m≤n-1)` são não ocultas ao calcular me mod n. Para qualquer escolha válida de `e`, existem algumas mensagens não ocultas. É importante que o número de mensagens não ocultas seja o mínimo. -For any given `p` and `q`, find the sum of all values of `e`, `1 < e < φ(p,q)` and `gcd(e,φ)=1`, so that the number of unconcealed messages for this value of `e` is at a minimum. +Para quaisquer `p` e `q` fornecidos, encontre a soma de todos os valores de `e`, `1 < e < φ(p,q)` e `gcd(e,φ)=1`, para que o número de mensagens não ocultas para esse valor de `e` seja o menor possível. # --hints-- -`RSAEncryption` should be a function. +`RSAEncryption` deve ser uma função. ```js assert(typeof RSAEncryption === 'function') ``` -`RSAEncryption` should return a number. +`RSAEncryption` deve retornar um número. ```js assert.strictEqual(typeof RSAEncryption(19, 37), 'number'); ``` -`RSAEncryption(19, 37)` should return `17766`. +`RSAEncryption(19, 37)` deve retornar `17766`. ```js assert.strictEqual(RSAEncryption(19, 37), 17766); ``` -`RSAEncryption(283, 409)` should return `466196580`. +`RSAEncryption(283, 409)` deve retornar `466196580`. ```js assert.strictEqual(RSAEncryption(283, 409), 466196580); ``` -`RSAEncryption(1009, 3643)` should return `399788195976`. +`RSAEncryption(1009, 3643)` deve retornar `399788195976`. ```js assert.strictEqual(RSAEncryption(19, 37), 17766); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-183-maximum-product-of-parts.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-183-maximum-product-of-parts.md index 7586be421e3..e15caaae72e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-183-maximum-product-of-parts.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-183-maximum-product-of-parts.md @@ -1,6 +1,6 @@ --- id: 5900f4231000cf542c50ff36 -title: 'Problem 183: Maximum product of parts' +title: 'Problema 183: Produto máximo das partes' challengeType: 1 forumTopicId: 301819 dashedName: problem-183-maximum-product-of-parts @@ -8,27 +8,27 @@ dashedName: problem-183-maximum-product-of-parts # --description-- -Let $N$ be a positive integer and let $N$ be split into $k$ equal parts, $r = \frac{N}{k}$, so that $N = r + r + \cdots + r$. +Considere $N$ um número inteiro positivo que pode ser dividido em $k$ partes iguais, $r = \frac{N}{k}$, de modo que $N = r + r + \cdots + r$. -Let $P$ be the product of these parts, $P = r × r × \cdots × r = r^k$. +Considere $P$ o produto dessas partes, $P = r × r × \cdots × r = r^k$. -For example, if 11 is split into five equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2, then $P = {2.2}^5 = 51.53632$. +Por exemplo, se 11 for dividido em cinco partes iguais, 11 = 2,2 + 2,2 + 2,2 + 2,2 + 2,2, então $P = {2.2}^5 = 51,53632$. -Let $M(N) = P_{max}$ for a given value of $N$. +Considere $M(N) = P_{max}$ para um valor dado de $N$. -It turns out that the maximum for $N = 11$ is found by splitting eleven into four equal parts which leads to $P_{max} = {(\frac{11}{4})}^4$; that is, $M(11) = \frac{14641}{256} = 57.19140625$, which is a terminating decimal. +Acontece que o máximo para $N = 11$ é encontrado ao dividirmos onze em quatro partes iguais, o que leva a $P_{max} = {(\frac{11}{4})}^4$; ou seja, $M(11) = \frac{14641}{256} = 57.19140625$, que é um número decimal finito. -However, for $N = 8$ the maximum is achieved by splitting it into three equal parts, so $M(8) = \frac{512}{27}$, which is a non-terminating decimal. +No entanto, para $N = 8$, o máximo é alcançado dividindo-o em três partes iguais, então $M(8) = \frac{512}{27}$, que é um decimal infinito. -Let $D(N) = N$ if $M(N)$ is a non-terminating decimal and $D(N) = -N$ if $M(N)$ is a terminating decimal. +Considere $D(N) = N$ se $M(N)$ for um decimal infinito e $D(N) = -N$ se $M(N)$ for um decimal finito. -For example, $\sum D(N)$ for $5 ≤ N ≤ 100$ is 2438. +Por exemplo, $\sum D(N)$ para $5 ≤ N ≤ 100$ é 2438. -Find $\sum D(N)$ for $5 ≤ N ≤ 10000$. +Encontre $\sum D(N)$ para $5 ≤ N ≤ 10000$. # --hints-- -`maximumProductOfParts()` should return `48861552`. +`maximumProductOfParts()` deve retornar `48861552`. ```js assert.strictEqual(maximumProductOfParts(), 48861552); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-184-triangles-containing-the-origin.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-184-triangles-containing-the-origin.md index 8d3eb0bfc9d..51218069cdc 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-184-triangles-containing-the-origin.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-184-triangles-containing-the-origin.md @@ -1,6 +1,6 @@ --- id: 5900f4241000cf542c50ff37 -title: 'Problem 184: Triangles containing the origin' +title: 'Problema 184: Triângulos contendo a origem' challengeType: 1 forumTopicId: 301820 dashedName: problem-184-triangles-containing-the-origin @@ -8,19 +8,19 @@ dashedName: problem-184-triangles-containing-the-origin # --description-- -Consider the set $I_r$ of points $(x,y)$ with integer coordinates in the interior of the circle with radius $r$, centered at the origin, i.e. $x^2 + y^2 < r^2$. +Considere o conjunto $I_r$ de pontos $(x,y)$ com coordenadas inteiras no interior do círculo com raio $r$, centralizado na origem, ou seja, $x^2 + y^2 < r^2$. -For a radius of 2, $I_2$ contains the nine points (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight triangles having all three vertices in $I_2$ which contain the origin in the interior. Two of them are shown below, the others are obtained from these by rotation. +Para um raio de 2, $I_2$ contém os nove pontos (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) e (1,-1). Há oito triângulos com todos os três vértices em $I_2$ que contêm a origem no interior. Dois deles são mostrados abaixo. Os outros são obtidos por rotação. -circle with radius 2, centered at the origin, with nine marked points and two triangles - (-1,0), (0,1), (1,-1) and (-1,1), (0,-1), (1,1) +círculo com raio 2, centralizado na origem, com nove pontos marcados e dois triângulos - (-1,0), (0,1), (1,-1) e (-1,1), (0,-1), (1,1) -For a radius of 3, there are 360 triangles containing the origin in the interior and having all vertices in $I_3$ and for $I_5$ the number is 10600. +Para um raio de 3, há 360 triângulos contendo a origem no interior e tendo todos os vértices em $I_3$. Para $I_5$, o número é 10600. -How many triangles are there containing the origin in the interior and having all three vertices in $I_{105}$? +Quantos triângulos há contendo a origem no interior e tendo todos os três vértices em $I_{105}$? # --hints-- -`trianglesContainingOrigin()` should return `1725323624056`. +`trianglesContainingOrigin()` deve retornar `1725323624056`. ```js assert.strictEqual(trianglesContainingOrigin(), 1725323624056); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-185-number-mind.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-185-number-mind.md index 820f0832166..97f8952fbb0 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-185-number-mind.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-185-number-mind.md @@ -1,6 +1,6 @@ --- id: 5900f4251000cf542c50ff38 -title: 'Problem 185: Number Mind' +title: 'Problema 185: Senha de números' challengeType: 1 forumTopicId: 301821 dashedName: problem-185-number-mind @@ -8,20 +8,20 @@ dashedName: problem-185-number-mind # --description-- -The game Number Mind is a variant of the well known game Master Mind. +O jogo da Senha de números é uma variante do conhecido jogo Senha. -Instead of coloured pegs, you have to guess a secret sequence of digits. After each guess you're only told in how many places you've guessed the correct digit. So, if the sequence was 1234 and you guessed 2036, you'd be told that you have one correct digit; however, you would NOT be told that you also have another digit in the wrong place. +Em vez de peças coloridas, você tem que adivinhar uma sequência secreta de algarismos. Depois de cada palpite você é informado apenas em quantos lugares você adivinhou o algarismo correto. Então, se a sequência for 1234 e seu palpite for 2036, você será informado de que tem um algarismo correto. No entanto, NÃO será informado se você tem outro algarismo correto, mas no lugar errado. -For instance, given the following guesses for a 5-digit secret sequence, +Por exemplo, dados os seguintes palpites para uma sequência secreta de 5 algarismos $$\begin{align} & 90342 ;2\\;\text{correct}\\\\ & 70794 ;0\\;\text{correct}\\\\ & 39458 ;2\\;\text{correct}\\\\ & 34109 ;1\\;\text{correct}\\\\ & 51545 ;2\\;\text{correct}\\\\ & 12531 ;1\\;\text{correct} \end{align}$$ -The correct sequence 39542 is unique. +A sequência correta 39542 é única. -Based on the following guesses, +Com base nos palpites abaixo $$\begin{align} & 5616185650518293 ;2\\;\text{correct}\\\\ & 3847439647293047 ;1\\;\text{correct}\\\\ & 5855462940810587 ;3\\;\text{correct}\\\\ @@ -36,11 +36,11 @@ $$\begin{align} & 5616185650518293 ;2\\;\text{correct}\\\\ & 3041631117224635 ;3\\;\text{correct}\\\\ & 1841236454324589 ;3\\;\text{correct}\\\\ & 2659862637316867 ;2\\;\text{correct} \end{align}$$ -Find the unique 16-digit secret sequence. +Encontre a sequência secreta única de 16 algarismos. # --hints-- -`numberMind()` should return `4640261571849533`. +`numberMind()` deve retornar `4640261571849533`. ```js assert.strictEqual(numberMind(), 4640261571849533); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-186-connectedness-of-a-network.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-186-connectedness-of-a-network.md index 8d1fed78cdf..a40393d1a64 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-186-connectedness-of-a-network.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-186-connectedness-of-a-network.md @@ -1,6 +1,6 @@ --- id: 5900f4281000cf542c50ff39 -title: 'Problem 186: Connectedness of a network' +title: 'Problema 186: Conectividade de uma rede' challengeType: 1 forumTopicId: 301822 dashedName: problem-186-connectedness-of-a-network @@ -8,7 +8,7 @@ dashedName: problem-186-connectedness-of-a-network # --description-- -Here are the records from a busy telephone system with one million users: +Aqui estão os registros de um sistema de telefone bastante ativo com um milhão de usuários: | RecNr | Caller | Called | | ----- | ------ | ------ | @@ -17,21 +17,21 @@ Here are the records from a busy telephone system with one million users: | 3 | 600863 | 701497 | | ... | ... | ... | -The telephone number of the caller and the called number in record $n$ are $Caller(n) = S_{2n - 1}$ and $Called(n) = S_{2n}$ where ${S}_{1,2,3,\ldots}$ come from the "Lagged Fibonacci Generator": +O número de telefone de quem ligou e o número de quem recebeu a chamada no registro $n$ (RecNr) são $Caller(n) = S_{2n - 1}$ (quem ligou) e $Called(n) = S_{2n}$ (quem recebeu) em ${S}_{1,2,3,\ldots}$ veio de um "Gerador Fibonacci com atraso": -For $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007{k}^3]\\;(\text{modulo}\\;1000000)$ +Para $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007{k}^3]\\;(\text{modulo}\\;1000000)$ -For $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}]\\;(\text{modulo}\\;1000000)$ +Para $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}]\\;(\text{modulo}\\;1000000)$ -If $Caller(n) = Called(n)$ then the user is assumed to have misdialled and the call fails; otherwise the call is successful. +Se $Caller(n) = Called(n)$, diz-se que o usuário ligou errado e há uma falha na ligação; do contrário, a chamada foi um sucesso. -From the start of the records, we say that any pair of users $X$ and $Y$ are friends if $X$ calls $Y$ or vice-versa. Similarly, $X$ is a friend of a friend of $Z$ if $X$ is a friend of $Y$ and $Y$ is a friend of $Z$; and so on for longer chains. +Desde o início dos registros, dizemos que qualquer par de usuários $X$ e $Y$ são amigos se $X$ ligar para $Y$ ou vice-versa. Do mesmo modo, $X$ é um amigo de um amigo de $Z$ se $X$ é um amigo de $Y$ e $Y$ é um amigo de $Z$. O mesmo vale para cadeias maiores. -The Prime Minister's phone number is 524287. After how many successful calls, not counting misdials, will 99% of the users (including the PM) be a friend, or a friend of a friend etc., of the Prime Minister? +O número de telefone do primeiro ministro é 524287. Após quantas chamadas bem-sucedidas, sem contar as falsas, 99% dos usuários (incluindo o próprio primeiro ministro) serão amigos ou amigos de amigos do primeiro ministro? # --hints-- -`connectednessOfANetwork()` should return `2325629`. +`connectednessOfANetwork()` deve retornar `2325629`. ```js assert.strictEqual(connectednessOfANetwork(), 2325629); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-187-semiprimes.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-187-semiprimes.md index bcd6f324753..f747202baf6 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-187-semiprimes.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-187-semiprimes.md @@ -1,6 +1,6 @@ --- id: 5900f4291000cf542c50ff3a -title: 'Problem 187: Semiprimes' +title: 'Problema 187: Semiprimos' challengeType: 1 forumTopicId: 301823 dashedName: problem-187-semiprimes @@ -8,15 +8,15 @@ dashedName: problem-187-semiprimes # --description-- -A composite is a number containing at least two prime factors. For example, $15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3$. +Um número composto é um número que contém pelo menos dois fatores primos. Por exemplo, $15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3$. -There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26. +Há dez compostos abaixo de trinta, contendo precisamente dois fatores primos, não necessariamente distintos: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26. -How many composite integers, $n < {10}^8$, have precisely two, not necessarily distinct, prime factors? +Quantos números compostos inteiros, $n < {10}^8$, têm precisamente dois fatores primos, não necessariamente distintos? # --hints-- -`semiPrimes()` should return `17427258`. +`semiPrimes()` deve retornar `17427258`. ```js assert.strictEqual(euler187(), 17427258); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-188-the-hyperexponentiation-of-a-number.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-188-the-hyperexponentiation-of-a-number.md index 1e0ae1dc9fa..fc39458777c 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-188-the-hyperexponentiation-of-a-number.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-188-the-hyperexponentiation-of-a-number.md @@ -1,6 +1,6 @@ --- id: 5900f4291000cf542c50ff3b -title: 'Problem 188: The hyperexponentiation of a number' +title: 'Problema 188: A hiperexponenciação de um número' challengeType: 1 forumTopicId: 301824 dashedName: problem-188-the-hyperexponentiation-of-a-number @@ -8,17 +8,17 @@ dashedName: problem-188-the-hyperexponentiation-of-a-number # --description-- -The hyperexponentiation or tetration of a number $a$ by a positive integer $b$, denoted by $a↑↑b$ or ${}^ba$, is recursively defined by: +A hiperexponenciação ou tetração de um número $a$ por um número inteiro positivo $b$, denotada por $a↑↑b$ ou ${}^ba$, é recursivamente definida por: $a↑↑1 = a$, $a↑↑(k+1) = a^{(a↑↑k)}$. -Thus we have e.g. $3↑↑2 = 3^3 = 27$, hence $3↑↑3 = 3^{27} = 7625597484987$ and $3↑↑4$ is roughly ${10}^{3.6383346400240996 \times {10}^{12}}$. Find the last 8 digits of $1777↑↑1855$. +Assim, temos, por exemplo, que $3↑↑2 = 3^3 = 27$. Portanto $3↑↑3 = 3^{27} = 7625597484987$ e $3↑↑4$ é aproximadamente ${10}^{3.6383346400240996 \times {10}^{12}}$. Encontre os últimos 8 algarismos de $1777↑↑1855$. # --hints-- -`hyperexponentation()` should return `95962097`. +`hyperexponentation()` deve retornar `95962097`. ```js assert.strictEqual(hyperexponentation(), 95962097); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-189-tri-colouring-a-triangular-grid.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-189-tri-colouring-a-triangular-grid.md index 6ac8cedcec5..2a136bc8580 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-189-tri-colouring-a-triangular-grid.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-189-tri-colouring-a-triangular-grid.md @@ -1,6 +1,6 @@ --- id: 5900f4291000cf542c50ff3c -title: 'Problem 189: Tri-colouring a triangular grid' +title: 'Problema 189: Colorização tripla de uma grade triangular' challengeType: 1 forumTopicId: 301825 dashedName: problem-189-tri-colouring-a-triangular-grid @@ -8,23 +8,23 @@ dashedName: problem-189-tri-colouring-a-triangular-grid # --description-- -Consider the following configuration of 64 triangles: +Considere a seguinte configuração de 64 triângulos: -64 triangles arranged to create larger triangle with side length of 8 triangles +64 triângulos arranjados de modo a criar um triângulo maior com comprimento de lado de 8 triângulos -We wish to colour the interior of each triangle with one of three colours: red, green or blue, so that no two neighbouring triangles have the same colour. Such a colouring shall be called valid. Here, two triangles are said to be neighbouring if they share an edge. Note: if they only share a vertex, then they are not neighbours. +Queremos colorir o interior de cada triângulo com uma de três cores: vermelho, verde ou azul, para que nenhum de dois triângulos vizinhos tenha a mesma cor. Essa colorização será considerada válida. Aqui, diz-se que dois triângulos são vizinhos se eles compartilharem uma aresta. Observação: se eles apenas compartilharem um vértice, então não são vizinhos. -For example, here is a valid colouring of the above grid: +Por exemplo, aqui está uma colorização válida para a grade acima: -colored grid of 64 triangles +grade colorida de 64 triângulos -A colouring C' which is obtained from a colouring C by rotation or reflection is considered distinct from C unless the two are identical. +Uma colorização C', que é obtida a partir de uma colorização C por rotação ou reflexão, é considerada diferente de C, a menos que ambas sejam idênticas. -How many distinct valid colourings are there for the above configuration? +Quantas colorizações válidas distintas existem para a configuração acima? # --hints-- -`triangularGridColoring()` should return `10834893628237824`. +`triangularGridColoring()` deve retornar `10834893628237824`. ```js assert.strictEqual(triangularGridColoring(), 10834893628237824); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-190-maximising-a-weighted-product.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-190-maximising-a-weighted-product.md index 806332925e0..65c592cacde 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-190-maximising-a-weighted-product.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-190-maximising-a-weighted-product.md @@ -1,6 +1,6 @@ --- id: 5900f42b1000cf542c50ff3d -title: 'Problem 190: Maximising a weighted product' +title: 'Problema 190: Maximização de um produto ponderado' challengeType: 1 forumTopicId: 301828 dashedName: problem-190-maximising-a-weighted-product @@ -8,15 +8,15 @@ dashedName: problem-190-maximising-a-weighted-product # --description-- -Let $S_m = (x_1, x_2, \ldots, x_m)$ be the $m$-tuple of positive real numbers with $x_1 + x_2 + \cdots + x_m = m$ for which $P_m = x_1 \times {x_2}^2 \times \cdots \times {x_m}^m$ is maximised. +Considere $S_m = (x_1, x_2, \ldots, x_m)$ a $m$-ésima tupla de números reais positivos com $x_1 + x_2 + \cdots + x_m = m$ para a qual $P_m = x_1 \times {x_2}^2 \times \cdots \times {x_m}^m$ é maximizado. -For example, it can be verified that $[P_{10}] = 4112$ ([ ] is the integer part function). +Por exemplo, pode-se verificar que $[P_{10}] = 4112$ ([ ] é a parte inteira da função). -Find $\sum {[P_m]}$ for $2 ≤ m ≤ 15$. +Encontre $\sum {[P_m]}$ para $2 ≤ m ≤ 15$. # --hints-- -`maximisingWeightedProduct()` should return `371048281`. +`maximisingWeightedProduct()` deve retornar `371048281`. ```js assert.strictEqual(maximisingWeightedProduct(), 371048281); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-191-prize-strings.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-191-prize-strings.md index 8e4e35e5736..907c23119d6 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-191-prize-strings.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-191-prize-strings.md @@ -1,6 +1,6 @@ --- id: 5900f42b1000cf542c50ff3e -title: 'Problem 191: Prize Strings' +title: 'Problema 191: Strings de prêmios' challengeType: 1 forumTopicId: 301829 dashedName: problem-191-prize-strings @@ -8,11 +8,11 @@ dashedName: problem-191-prize-strings # --description-- -A particular school offers cash rewards to children with good attendance and punctuality. If they are absent for three consecutive days or late on more than one occasion then they forfeit their prize. +Uma determinada escola oferece recompensas em dinheiro para crianças com boa frequência e pontualidade. Se não estiverem presentes por três dias consecutivos ou atrasadas mais de uma vez, então perdem o seu prêmio. -During an n-day period a trinary string is formed for each child consisting of L's (late), O's (on time), and A's (absent). +Durante um período de n dias, uma string ternária é formada para cada criança consistindo em L's (dias atrasado), O's (dias chegando na hora) e A's (dias ausente). -Although there are eighty-one trinary strings for a 4-day period that can be formed, exactly forty-three strings would lead to a prize: +Embora existam oitenta e uma strings ternárias para um período de 4 dias que possam ser formadas, exatamente quarenta e três strings levariam a um prêmio: ```markup OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA @@ -22,11 +22,11 @@ AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA LAOO LAOA LAAO ``` -How many "prize" strings exist over a 30-day period? +Quantas strings de "prêmio" existem em um período de 30 dias? # --hints-- -`prizeStrings()` should return `1918080160`. +`prizeStrings()` deve retornar `1918080160`. ```js assert.strictEqual(prizeStrings(), 1918080160); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-192-best-approximations.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-192-best-approximations.md index 61889d4d47b..2a03644ca49 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-192-best-approximations.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-192-best-approximations.md @@ -1,6 +1,6 @@ --- id: 5900f42c1000cf542c50ff3f -title: 'Problem 192: Best Approximations' +title: 'Problema 192: Melhores aproximações' challengeType: 1 forumTopicId: 301830 dashedName: problem-192-best-approximations @@ -8,19 +8,19 @@ dashedName: problem-192-best-approximations # --description-- -Let $x$ be a real number. +Considere $x$ um número real. -A best approximation to $x$ for the denominator bound $d$ is a rational number $\frac{r}{s}$ in reduced form, with $s ≤ d$, such that any rational number which is closer to $x$ than $\frac{r}{s}$ has a denominator larger than $d$: +Uma melhor aproximação de $x$ para o denominador vinculado a $d$ é um número racional $\frac{r}{s}$ na forma reduzida, com $s ≤ d$, tal que qualquer número racional que esteja mais próximo de $x$ do que $\frac{r}{s}$ tenha um denominador maior que $d$: $$|\frac{p}{q} - x| < |\frac{r}{s} - x| ⇒ q > d$$ -For example, the best approximation to $\sqrt{13}$ for the denominator bound $20$ is $\frac{18}{5}$ and the best approximation to $\sqrt{13}$ for the denominator bound $30$ is $\frac{101}{28}$. +Por exemplo, a melhor aproximação de $\sqrt{13}$ do denominador vinculado $20$ é $\frac{18}{5}$ e a melhor aproximação de $\sqrt{13}$ do denominador vinculado $30$ é $\frac{101}{28}$. -Find the sum of all denominators of the best approximations to $\sqrt{n}$ for the denominator bound ${10}^{12}$, where $n$ is not a perfect square and $1 < n ≤ 100000$. +Encontre a soma de todos os denominadores das melhores aproximações de $\sqrt{n}$ para o denominador vinculado ${10}^{12}$, onde $n$ não é um quadrado perfeito e $1 < n ≤ 100000$. # --hints-- -`bestApproximations()` should return `57060635927998344`. +`bestApproximations()` deve retornar `57060635927998344`. ```js assert.strictEqual(bestApproximations(), 57060635927998344); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-194-coloured-configurations.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-194-coloured-configurations.md index 4d5b05af3d9..79e0bc701f8 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-194-coloured-configurations.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-194-coloured-configurations.md @@ -1,6 +1,6 @@ --- id: 5900f42f1000cf542c50ff40 -title: 'Problem 194: Coloured Configurations' +title: 'Problema 194: Configurações colorizadas' challengeType: 1 forumTopicId: 301832 dashedName: problem-194-coloured-configurations @@ -8,19 +8,19 @@ dashedName: problem-194-coloured-configurations # --description-- -Consider graphs built with the units A: -graph unit A - and B: graph unit B, where the units are glued along the vertical edges as in the graph graph with four units glued along the vertical edges. +Considere gráficos construídos com as unidades A: +gráfico da unidade A + e B: gráfico da unidade B, onde as unidades são grudadas ao longo das arestas verticais, como no desenho gráfico com quatro unidades grudadas ao longo das arestas verticais. -A configuration of type $(a,b,c)$ is a graph thus built of $a$ units A and $b$ units B, where the graph's vertices are coloured using up to $c$ colours, so that no two adjacent vertices have the same colour. The compound graph above is an example of a configuration of type $(2,2,6)$, in fact of type $(2,2,c)$ for all $c ≥ 4$ +Uma configuração do tipo $(a,b,c)$ é um gráfico que faz parte de $a$ unidades A e $b$ unidades B, onde os vértices do gráfico são colorizados usando até $c$ cores, de modo que nenhum dois vértices adjacentes tenham a mesma cor. O gráfico composto acima é um exemplo de configuração do tipo $(2,2,6)$. De fato, é do tipo $(2,2,c)$ para todos os $c ≥ 4$ -Let $N(a,b,c)$ be the number of configurations of type $(a,b,c)$. For example, $N(1,0,3) = 24$, $N(0,2,4) = 92928$ and $N(2,2,3) = 20736$. +Considere $N(a,b,c)$ o número de configurações do tipo $(a,b,c)$. Por exemplo, $N(1,0,3) = 24$, $N(0,2,4) = 92928$ e $N(2,2,3) = 20736$. -Find the last 8 digits of $N(25,75,1984)$. +Encontre os últimos 8 algarismos de $N(25,75,1984)$. # --hints-- -`coloredConfigurations()` should return `61190912`. +`coloredConfigurations()` deve retornar `61190912`. ```js assert.strictEqual(coloredConfigurations(), 61190912); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md index 18c2acd7592..8704a855a59 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md @@ -1,6 +1,6 @@ --- id: 5900f4311000cf542c50ff43 -title: 'Problem 195: Inscribed circles of triangles with one angle of 60 degrees' +title: 'Problema 195: Círculos inscritos de triângulos com um ângulo de 60 graus' challengeType: 1 forumTopicId: 301833 dashedName: problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees @@ -8,19 +8,19 @@ dashedName: problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degr # --description-- -Let's call an integer sided triangle with exactly one angle of 60° a 60° triangle. +Vamos chamar um triângulo de lado inteiro com exatamente um ângulo de 60° de um triângulo de 60°. -Let $r$ be the radius of the inscribed circle of such a 60° triangle. +Considere $r$ o raio do círculo inscrito de um triângulo de 60°. -There are 1234 60° triangles for which $r ≤ 100$. +Há 1234 triângulos de 60° para os quais $r ≤ 100$. -Let $T(n)$ be the number of 60° triangles for which $r ≤ n$, so $T(100) = 1234$, $T(1000) = 22767$, and $T(10000) = 359912$. +Considere $T(n)$ o número de triângulos de 60° para os quais $r ≤ n$. Assim, $T(100) = 1234$, $T(1000) = 22767$ e $T(10000) = 359912$. -Find $T(1053779)$. +Encontre $T(1053779)$. # --hints-- -`inscribedCirclesOfTriangles()` should return `75085391`. +`inscribedCirclesOfTriangles()` deve retornar `75085391`. ```js assert.strictEqual(inscribedCirclesOfTriangles(), 75085391); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-196-prime-triplets.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-196-prime-triplets.md index d072c7689a1..920440ebbcb 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-196-prime-triplets.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-196-prime-triplets.md @@ -1,6 +1,6 @@ --- id: 5900f4301000cf542c50ff42 -title: 'Problem 196: Prime triplets' +title: 'Problema 196: Trios de números primos' challengeType: 1 forumTopicId: 301834 dashedName: problem-196-prime-triplets @@ -8,7 +8,7 @@ dashedName: problem-196-prime-triplets # --description-- -Build a triangle from all positive integers in the following way: +Construa um triângulo com todos os números inteiros positivos da seguinte maneira: $$\begin{array}{rrr} & 1 \\\\ & \color{red}{2} & \color{red}{3} \\\\ & 4 & \color{red}{5} & 6 \\\\ @@ -18,23 +18,23 @@ $$\begin{array}{rrr} & 1 \\\\ & 46 & \color{red}{47} & 48 & 49 & 50 & 51 & 52 & \color{red}{53} & 54 & 55 \\\\ & 56 & 57 & 58 & \color{red}{59} & 60 & \color{red}{61} & 62 & 63 & 64 & 65 & 66 \\\\ & \cdots \end{array}$$ -Each positive integer has up to eight neighbours in the triangle. +Cada número inteiro positivo tem até oito vizinhos no triângulo. -A set of three primes is called a prime triplet if one of the three primes has the other two as neighbours in the triangle. +Um conjunto de três números primos é chamado de trio de números primos se um dos três primos tiver outros dois números primos como vizinhos do triângulo. -For example, in the second row, the prime numbers 2 and 3 are elements of some prime triplet. +Por exemplo, na segunda linha, os números primos 2 e 3 são elementos de um trio de números primos. -If row 8 is considered, it contains two primes which are elements of some prime triplet, i.e. 29 and 31. If row 9 is considered, it contains only one prime which is an element of some prime triplet: 37. +Se considerarmos a linha 8, ela contém dois primos, que são elementos de algum trio de números primos, 29 e 31. Se considerarmos a linha 9, ela contém apenas um número primo que é elemento de um trio de números primos: 37. -Define $S(n)$ as the sum of the primes in row $n$ which are elements of any prime triplet. Then $S(8) = 60$ and $S(9) = 37$. +Defina $S(n)$ como a soma de números primos em uma linha $n$ que são elementos de qualquer trio de números primos. Então, $S(8) = 60$ e $S(9) = 37$. -You are given that $S(10000) = 950007619$. +Você é informado de que $S(10000) = 950007619$. -Find $S(5678027) + S(7208785)$. +Encontre $S(5678027) + S(7208785)$. # --hints-- -`primeTriplets()` should return `322303240771079940`. +`primeTriplets()` deve retornar `322303240771079940`. ```js assert.strictEqual(primeTriplets(), 322303240771079940); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-198-ambiguous-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-198-ambiguous-numbers.md index 69c2ba856dc..c571ceb1e65 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-198-ambiguous-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-198-ambiguous-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f4331000cf542c50ff45 -title: 'Problem 198: Ambiguous Numbers' +title: 'Problema 198: Números ambíguos' challengeType: 1 forumTopicId: 301836 dashedName: problem-198-ambiguous-numbers @@ -8,15 +8,15 @@ dashedName: problem-198-ambiguous-numbers # --description-- -A best approximation to a real number $x$ for the denominator bound $d$ is a rational number $\frac{r}{s}$ (in reduced form) with $s ≤ d$, so that any rational number $\frac{p}{q}$ which is closer to $x$ than $\frac{r}{s}$ has $q > d$. +Uma melhor aproximação de um número real $x$ para o denominador vinculado $d$ é um número racional $\frac{r}{s}$ (na forma reduzida), com $s ≤ d$, tal que qualquer número racional $\frac{p}{q}$ que esteja mais próximo de $x$ do que de $\frac{r}{s}$ tenha $q > d$. -Usually the best approximation to a real number is uniquely determined for all denominator bounds. However, there are some exceptions, e.g. $\frac{9}{40}$ has the two best approximations $\frac{1}{4}$ and $\frac{1}{5}$ for the denominator bound $6$. We shall call a real number $x$ ambiguous, if there is at least one denominator bound for which $x$ possesses two best approximations. Clearly, an ambiguous number is necessarily rational. +Geralmente, a melhor aproximação de um número real é determinada exclusivamente para todos os denominadores vinculados. No entanto, há algumas exceções. Por exemplo, $\frac{9}{40}$ tem as duas melhores aproximações $\frac{1}{4}$ e $\frac{1}{5}$ para o denominador vinculado $6$. Chamaremos um número real $x$ de ambíguo se houver pelo menos um denominador vinculado para o qual $x$ possui duas melhores aproximações. Claramente, um número ambíguo é necessariamente racional. -How many ambiguous numbers $x = \frac{p}{q}$, $0 < x < \frac{1}{100}$, are there whose denominator $q$ does not exceed ${10}^8$? +Quantos números ambíguos $x = \frac{p}{q}$, $0 < x < \frac{1}{100}$, existem cujo denominador $q$ não exceda ${10}^8$? # --hints-- -`ambiguousNumbers()` should return `52374425`. +`ambiguousNumbers()` deve retornar `52374425`. ```js assert.strictEqual(ambiguousNumbers(), 52374425); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-199-iterative-circle-packing.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-199-iterative-circle-packing.md index 5c699d70320..70467d504f1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-199-iterative-circle-packing.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-199-iterative-circle-packing.md @@ -1,6 +1,6 @@ --- id: 5900f4341000cf542c50ff46 -title: 'Problem 199: Iterative Circle Packing' +title: 'Problema 199: Embalagem de círculos iterativa' challengeType: 1 forumTopicId: 301837 dashedName: problem-199-iterative-circle-packing @@ -8,29 +8,29 @@ dashedName: problem-199-iterative-circle-packing # --description-- -Three circles of equal radius are placed inside a larger circle such that each pair of circles is tangent to one another and the inner circles do not overlap. There are four uncovered "gaps" which are to be filled iteratively with more tangent circles. +Três círculos de raio igual são colocados dentro de um círculo maior, de tal forma que cada par de círculos é tangente entre si e os círculos internos não se sobrepõem. Há quatro "lacunas" descobertas que devem ser preenchidas iterativamente com mais círculos tangentes. -a diagram of non-overlapping circles +um diagrama de círculos não sobrepostos -At each iteration, a maximally sized circle is placed in each gap, which creates more gaps for the next iteration. After 3 iterations (pictured), there are 108 gaps and the fraction of the area which is not covered by circles is 0.06790342, rounded to eight decimal places. +A cada iteração, um círculo de tamanho máximo é colocado em cada lacuna, o que cria mais lacunas para a próxima iteração. Após 3 iterações (na figura), há 108 lacunas e a fração da área que não é coberta pelos círculos é de 0, 6790342, arredondado para oito casas decimais. -What fraction of the area is not covered by circles after `n` iterations? Give your answer rounded to eight decimal places using the format x.xxxxxxxx . +Qual fração da área não é coberta pelos círculos depois de `n` iterações? Arredonde sua resposta para até oito casas decimais usando o formato x.xxxxxxxx. # --hints-- -`iterativeCirclePacking(10)` should return a number. +`iterativeCirclePacking(10)` deve retornar um número. ```js assert(typeof iterativeCirclePacking(10) === 'number'); ``` -`iterativeCirclePacking(10)` should return `0.00396087`. +`iterativeCirclePacking(10)` deve retornar `0.00396087`. ```js assert.strictEqual(iterativeCirclePacking(10), 0.00396087); ``` -`iterativeCirclePacking(3)` should return `0.06790342`. +`iterativeCirclePacking(3)` deve retornar `0.06790342`. ```js assert.strictEqual(iterativeCirclePacking(3), 0.06790342); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md index e35cfa0a550..d7bc521048a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-101-to-200/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md @@ -1,7 +1,7 @@ --- id: 5900f4351000cf542c50ff47 title: >- - Problem 200: Find the 200th prime-proof sqube containing the contiguous sub-string "200" + Problema 200: Encontre o 200º sqube à prova de primos contendo a substring contígua "200" challengeType: 1 forumTopicId: 301840 dashedName: >- @@ -10,19 +10,19 @@ dashedName: >- # --description-- -We shall define a sqube to be a number of the form, ${p^2}{q^3}$, where $p$ and $q$ are distinct primes. +Definiremos um sqube como um número na forma ${p^2}{q^3}$, onde $p$ e $q$ são números primos distintos. -For example, $200 = {5^2}{2^3}$ or $120072949 = {{23}^2}{{61}^3}$. +Por exemplo, $200 = {5^2}{2^3}$ ou $120072949 = {{23}^2}{{61}^3}$. -The first five squbes are 72, 108, 200, 392, and 500. +Os primeiros cinco squbes são 72, 108, 200, 392 e 500. -Interestingly, 200 is also the first number for which you cannot change any single digit to make a prime; we shall call such numbers, prime-proof. The next prime-proof sqube which contains the contiguous sub-string `200` is 1992008. +Curiosamente, 200 também é o primeiro número para o qual não se pode alterar qualquer algarismo para torná-lo um número primo. Chamaremos esses números de à prova de primos. O próximo sqube à prova de primos que contém a substring contígua `200` é 1992008. -Find the 200th prime-proof sqube containing the contiguous sub-string `200`. +Encontre o 200º sqube à prova de primos contendo a substring contígua `200`. # --hints-- -`primeProofSqubeWithSubString()` should return `229161792008`. +`primeProofSqubeWithSubString()` deve retornar `229161792008`. ```js assert.strictEqual(primeProofSqubeWithSubString(), 229161792008); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-201-subsets-with-a-unique-sum.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-201-subsets-with-a-unique-sum.md index e0513d008ec..5297f475c11 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-201-subsets-with-a-unique-sum.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-201-subsets-with-a-unique-sum.md @@ -1,6 +1,6 @@ --- id: 5900f4361000cf542c50ff48 -title: 'Problem 201: Subsets with a unique sum' +title: 'Problema 201: Subconjuntos com uma soma única' challengeType: 1 forumTopicId: 301841 dashedName: problem-201-subsets-with-a-unique-sum @@ -8,9 +8,9 @@ dashedName: problem-201-subsets-with-a-unique-sum # --description-- -For any set $A$ of numbers, let $sum(A)$ be the sum of the elements of $A$. +Para qualquer conjunto $A$ de números, considere $sum(A)$ a soma dos elementos de $A$. -Consider the set $B = \\{1,3,6,8,10,11\\}$. There are 20 subsets of $B$ containing three elements, and their sums are: +Considere o conjunto $B = \\{1,3,6,8,10,11\\}$. Há 20 subconjuntos de $B$ contendo três elementos. Suas somas são: $$\begin{align} & sum(\\{1,3,6\\}) = 10 \\\\ & sum(\\{1,3,8\\}) = 12 \\\\ & sum(\\{1,3,10\\}) = 14 \\\\ @@ -24,15 +24,15 @@ $$\begin{align} & sum(\\{1,3,6\\}) = 10 \\\\ & sum(\\{6,8,11\\}) = 25 \\\\ & sum(\\{6,10,11\\}) = 27 \\\\ & sum(\\{8,10,11\\}) = 29 \\end{align}$$ -Some of these sums occur more than once, others are unique. For a set $A$, let $U(A,k)$ be the set of unique sums of $k$-element subsets of $A$, in our example we find $U(B,3) = \\{10,12,14,18,21,25,27,29\\}$ and $sum(U(B,3)) = 156$. +Algumas destas somas ocorrem mais de uma vez, outras são únicas. Para um conjunto de $A$, considere $U(A,k)$ como sendo o conjunto de somas únicas de subconjuntos de $k$ elementos de $A$. No nosso exemplo, encontramos $U(B,3) = \\{10,12,14,18,21,25,27,29\\}$ e $sum(U(B,3)) = 156$. -Now consider the $100$-element set $S = \\{1^2, 2^2, \ldots , {100}^2\\}$. $S$ has $100\\,891\\,344\\,545\\,564\\,193\\,334\\,812\\,497\\,256\\;$ $50$-element subsets. +Agora, considere o $100$º conjunto de elementos $S = \\{1^2, 2^2, \ldots , {100}^2\\}$. $S$ tem $100.891.344.545.564.193.334.812.497.256\\;$ subconjuntos de $50$ elementos. -Determine the sum of all integers which are the sum of exactly one of the $50$-element subsets of $S$, i.e. find $sum(U(S,50))$. +Determine a soma de todos os números inteiros que são a soma de exatamente um dos subconjuntos de $50$ elementos de $S$, ou seja, encontre $sum(U(S,50))$. # --hints-- -`uniqueSubsetsSum()` should return `115039000`. +`uniqueSubsetsSum()` deve retornar `115039000`. ```js assert.strictEqual(uniqueSubsetsSum(), 115039000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-203-squarefree-binomial-coefficients.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-203-squarefree-binomial-coefficients.md index 4e418715771..78fc5f2fe04 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-203-squarefree-binomial-coefficients.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-203-squarefree-binomial-coefficients.md @@ -1,6 +1,6 @@ --- id: 5900f4381000cf542c50ff4a -title: 'Problem 203: Squarefree Binomial Coefficients' +title: 'Problema 203: Coeficientes binomiais livres de quadrados' challengeType: 1 forumTopicId: 301844 dashedName: problem-203-squarefree-binomial-coefficients @@ -8,7 +8,7 @@ dashedName: problem-203-squarefree-binomial-coefficients # --description-- -The binomial coefficients $\displaystyle\binom{n}{k}$ can be arranged in triangular form, Pascal's triangle, like this: +Os coeficientes binomiais $\displaystyle\binom{n}{k}$ podem ser organizados em forma triangular, no triângulo de Pascal, assim: $$\begin{array}{ccccccccccccccc} & & & & & & & 1 & & & & & & & \\\\ & & & & & & 1 & & 1 & & & & & & \\\\ & & & & & 1 & & 2 & & 1 & & & & & \\\\ @@ -16,15 +16,15 @@ $$\begin{array}{ccccccccccccccc} & & & & & & & 1 & & & & & 1 & & 5 & & 10 & & 10 & & 5 & & 1 & & \\\\ & 1 & & 6 & & 15 & & 20 & & 15 & & 6 & & 1 & \\\\ 1 & & 7 & & 21 & & 35 & & 35 & & 21 & & 7 & & 1 \\\\ & & & & & & & \ldots \end{array}$$ -It can be seen that the first eight rows of Pascal's triangle contain twelve distinct numbers: 1, 2, 3, 4, 5, 6, 7, 10, 15, 20, 21 and 35. +Podemos ver que as primeiras oito linhas do triângulo de Pascal contêm doze números distintos: 1, 2, 3, 4, 5, 6, 7, 10, 15, 20, 21 e 35. -A positive integer n is called squarefree if no square of a prime divides n. Of the twelve distinct numbers in the first eight rows of Pascal's triangle, all except 4 and 20 are squarefree. The sum of the distinct squarefree numbers in the first eight rows is 105. +Um número inteiro positivo n é chamado de livre de quadrados se nenhum quadrado de um número primo dividir n. Dos doze números distintos nas primeiras oito linhas do triângulo de Pascal, todos os números exceto 4 e 20 são livres de quadrados. A soma dos números distintos livres de quadrados nas primeiras oito linhas é 105. -Find the sum of the distinct squarefree numbers in the first 51 rows of Pascal's triangle. +Encontre a soma dos números distintos livres de quadrados nas primeiras 51 linhas do triângulo de Pascal. # --hints-- -`squarefreeBinomialCoefficients()` should return `34029210557338`. +`squarefreeBinomialCoefficients()` deve retornar `34029210557338`. ```js assert.strictEqual(squarefreeBinomialCoefficients(), 34029210557338); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-204-generalised-hamming-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-204-generalised-hamming-numbers.md index 584cf57c132..3b88d62780f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-204-generalised-hamming-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-204-generalised-hamming-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f4381000cf542c50ff4b -title: 'Problem 204: Generalised Hamming Numbers' +title: 'Problema 204: Números de Hamming generalizados' challengeType: 1 forumTopicId: 301845 dashedName: problem-204-generalised-hamming-numbers @@ -8,19 +8,19 @@ dashedName: problem-204-generalised-hamming-numbers # --description-- -A Hamming number is a positive number which has no prime factor larger than 5. +Um número de Hamming é um número positivo que não tem fator primo maior que 5. -So the first few Hamming numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15. +Assim, os primeiros números de Hamming são 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 e 15. -There are 1105 Hamming numbers not exceeding ${10}^8$. +Há 1105 números de Hamming que não excedem ${10}^8$. -We will call a positive number a generalised Hamming number of type $n$, if it has no prime factor larger than $n$. Hence the Hamming numbers are the generalised Hamming numbers of type 5. +Chamaremos um número positivo de número generalizado de Hamming do tipo $n$ se ele não tiver fator primo maior que $n$. Assim, os números de Hamming são os números generalizados de Hamming do tipo 5. -How many generalised Hamming numbers of type 100 are there which don't exceed ${10}^9$? +Quantos números de Hamming generalizados do tipo 100 existem que não excedem ${10}^9$? # --hints-- -`generalisedHammingNumbers()` should return `2944730`. +`generalisedHammingNumbers()` deve retornar `2944730`. ```js assert.strictEqual(generalisedHammingNumbers(), 2944730); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-205-dice-game.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-205-dice-game.md index 17614dbf03b..9be972000c4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-205-dice-game.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-205-dice-game.md @@ -1,6 +1,6 @@ --- id: 5900f4391000cf542c50ff4c -title: 'Problem 205: Dice Game' +title: 'Problema 205: Jogo de dados' challengeType: 1 forumTopicId: 301846 dashedName: problem-205-dice-game @@ -8,17 +8,17 @@ dashedName: problem-205-dice-game # --description-- -Peter has nine four-sided (pyramidal) dice, each with faces numbered 1, 2, 3, 4. +Pedro tem nove dados de quatro lados (piramidais), e cada uma das faces recebe um número 1, 2, 3 e 4. -Colin has six six-sided (cubic) dice, each with faces numbered 1, 2, 3, 4, 5, 6. +Colin tem seis dados de seis lados (cúbicos), e cada uma das faces recebe um número 1, 2, 3, 4, 5 e 6. -Peter and Colin roll their dice and compare totals: the highest total wins. The result is a draw if the totals are equal. +Pedro e Colin rolam seus dados e comparam os totais: o maior total ganha. O resultado é um empate se os totais forem iguais. -What is the probability that Pyramidal Pete beats Cubic Colin? Give your answer rounded to seven decimal places in the form 0.abcdefg +Qual é a probabilidade que o Pedro Piramidal vencer Colin Cúbico? Arredonde sua resposta para até sete casas decimais usando o formato 0.abcdefg # --hints-- -`diceGame()` should return `0.5731441`. +`diceGame()` deve retornar `0.5731441`. ```js assert.strictEqual(diceGame(), 0.5731441); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-206-concealed-square.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-206-concealed-square.md index 596f703da28..5345442fb3a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-206-concealed-square.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-206-concealed-square.md @@ -1,6 +1,6 @@ --- id: 5900f43a1000cf542c50ff4d -title: 'Problem 206: Concealed Square' +title: 'Problema 206: Quadrado escondido' challengeType: 1 forumTopicId: 301847 dashedName: problem-206-concealed-square @@ -8,11 +8,11 @@ dashedName: problem-206-concealed-square # --description-- -Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each "_" is a single digit. +Encontre o número inteiro positivo cujo quadrado tem o formato 1_2_3_4_5_6_7_8_9_0, onde cada "_" é um único algarismo. # --hints-- -`concealedSquare()` should return `1389019170`. +`concealedSquare()` deve retornar `1389019170`. ```js assert.strictEqual(concealedSquare(), 1389019170); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-207-integer-partition-equations.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-207-integer-partition-equations.md index 29efa6bc5f6..d989a6430f5 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-207-integer-partition-equations.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-207-integer-partition-equations.md @@ -1,6 +1,6 @@ --- id: 5900f43c1000cf542c50ff4e -title: 'Problem 207: Integer partition equations' +title: 'Problema 207: Equações de partições inteiras' challengeType: 1 forumTopicId: 301848 dashedName: problem-207-integer-partition-equations @@ -8,17 +8,17 @@ dashedName: problem-207-integer-partition-equations # --description-- -For some positive integers $k$, there exists an integer partition of the form $4^t = 2^t + k$, +Para alguns números inteiros positivos $k$, existe uma partição inteira na forma $4^t = 2^t + k$, -where $4^t$, $2^t$, and $k$ are all positive integers and $t$ is a real number. +onde $4^t$, $2^t$ e $k$ são todos números inteiros positivos e $t$ é um número real. -The first two such partitions are $4^1 = 2^1 + 2$ and $4^{1.584\\,962\\,5\ldots} = 2^{1.584\\,962\\,5\ldots} + 6$. +As duas primeiras partições desse tipo são $4^1 = 2^1 + 2$ e $4^{1.584\\,962\\,5\ldots} = 2^{1.584\\,962\\,5\ldots} + 6$. -Partitions where $t$ is also an integer are called perfect. For any $m ≥ 1$ let $P(m)$ be the proportion of such partitions that are perfect with $k ≤ m$. +As partições onde $t$ é também um número inteiro são chamadas de perfeitas. Para qualquer $m ≥ 1$, considere $P(m)$ como sendo a proporção de tais partições que são perfeitas com $k ≤ m$. -Thus $P(6) = \frac{1}{2}$. +Assim, $P(6) = \frac{1}{2}$. -In the following table are listed some values of $P(m)$ +Na tabela a seguir, estão listados alguns valores de $P(m)$ $$\begin{align} & P(5) = \frac{1}{1} \\\\ & P(10) = \frac{1}{2} \\\\ & P(15) = \frac{2}{3} \\\\ @@ -26,11 +26,11 @@ $$\begin{align} & P(5) = \frac{1}{1} \\\\ & P(30) = \frac{2}{5} \\\\ & \ldots \\\\ & P(180) = \frac{1}{4} \\\\ & P(185) = \frac{3}{13} \end{align}$$ -Find the smallest $m$ for which $P(m) < \frac{1}{12\\,345}$ +Encontre o menor $m$ para o qual $P(m) < \frac{1}{12.345}$ # --hints-- -`integerPartitionEquations()` should return `44043947822`. +`integerPartitionEquations()` deve retornar `44043947822`. ```js assert.strictEqual(integerPartitionEquations(), 44043947822); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-208-robot-walks.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-208-robot-walks.md index 63c4e63cf53..7473a628762 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-208-robot-walks.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-208-robot-walks.md @@ -1,6 +1,6 @@ --- id: 5900f43f1000cf542c50ff51 -title: 'Problem 208: Robot Walks' +title: 'Problema 208: Caminhadas robóticas' challengeType: 1 forumTopicId: 301849 dashedName: problem-208-robot-walks @@ -8,19 +8,19 @@ dashedName: problem-208-robot-walks # --description-- -A robot moves in a series of one-fifth circular arcs (72°), with a free choice of a clockwise or an anticlockwise arc for each step, but no turning on the spot. +Um robô se move em uma série arco circular de um quinto de volta (72°), com uma escolha livre de sentido horário ou anti-horário para cada etapa, mas sem virar no local. -One of 70932 possible closed paths of 25 arcs starting northward is +Um dos 70932 caminhos fechados possíveis de 25 arcos iniciando para o norte é -closed path of 25 arcs, starting northward +caminho fechado de 25 arcos, iniciando voltado para o norte -Given that the robot starts facing North, how many journeys of 70 arcs in length can it take that return it, after the final arc, to its starting position? +Dado que o robô começa virado para o norte, quantas jornadas de 70 arcos de comprimento ele pode fazer que o retornem, após o arco final, para sua posição inicial? -**Note:** Any arc may be traversed multiple times. +**Observação:** qualquer arco pode ser atravessado várias vezes. # --hints-- -`robotWalks()` should return `331951449665644800`. +`robotWalks()` deve retornar `331951449665644800`. ```js assert.strictEqual(robotWalks(), 331951449665644800); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-209-circular-logic.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-209-circular-logic.md index 97190a72f20..d4476f2b271 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-209-circular-logic.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-209-circular-logic.md @@ -1,6 +1,6 @@ --- id: 5900f43e1000cf542c50ff4f -title: 'Problem 209: Circular Logic' +title: 'Problema 209: Lógica circular' challengeType: 1 forumTopicId: 301850 dashedName: problem-209-circular-logic @@ -8,7 +8,7 @@ dashedName: problem-209-circular-logic # --description-- -A $k$-input binary truth table is a map from $k$ input bits (binary digits, 0 [false] or 1 [true]) to 1 output bit. For example, the $2$-input binary truth tables for the logical $AND$ and $XOR$ functions are: +Uma tabela verdade binária de $k$ entradas é um mapa de $k$ bits de entrada (algarismos binários, 0 [false] ou 1 [true]) para 1 bit de saída. Por exemplo, as tabelas verdade binárias de $2$ entradas para as funções lógicas de $AND$ e $XOR$ são: | x | y | x AND y | | - | - | ------- | @@ -24,15 +24,15 @@ A $k$-input binary truth table is a map from $k$ input bits (binary digits, 0 [f | 1 | 0 | 1 | | 1 | 1 | 0 | -How many $6$-input binary truth tables, $τ$, satisfy the formula +Quantas tabelas verdade binárias de $6$ entradas, $τ$, satisfazem a fórmula $$τ(a, b, c, d, e, f) \\; AND \\; τ(b, c, d, e, f, a \\; XOR \\; (b \\; AND \\; c)) = 0$$ -for all $6$-bit inputs ($a$, $b$, $c$, $d$, $e$, $f$)? +para todas as entradas de $6$ bits ($a$, $b$, $c$, $d$, $e$, $f$)? # --hints-- -`circularLogic()` should return `15964587728784`. +`circularLogic()` deve retornar `15964587728784`. ```js assert.strictEqual(circularLogic(), 15964587728784); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-210-obtuse-angled-triangles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-210-obtuse-angled-triangles.md index 0dbbed2f9b0..eee2160cab4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-210-obtuse-angled-triangles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-210-obtuse-angled-triangles.md @@ -1,6 +1,6 @@ --- id: 5900f43e1000cf542c50ff50 -title: 'Problem 210: Obtuse Angled Triangles' +title: 'Problema 210: Triângulos de ângulos obtusos' challengeType: 1 forumTopicId: 301852 dashedName: problem-210-obtuse-angled-triangles @@ -8,19 +8,19 @@ dashedName: problem-210-obtuse-angled-triangles # --description-- -Consider the set $S(r)$ of points ($x$,$y$) with integer coordinates satisfying $|x| + |y| ≤ r$. +Considere o conjunto $S(r)$ de pontos ($x$,$y$) com coordenadas inteiras que satisfaçam $|x| + |y| ≤ r$. -Let $O$ be the point (0,0) and $C$ the point ($\frac{r}{4}$,$\frac{r}{4}$). +Considere $O$ como sendo o ponto (0,0) e $C$ o ponto($\frac{r}{4}$,$\frac{r}{4}$). -Let $N(r)$ be the number of points $B$ in $S(r)$, so that the triangle $OBC$ has an obtuse angle, i.e. the largest angle $α$ satisfies $90°<α<180°$. +Considere $N(r)$ como sendo o número de pontos $B$ em $S(r)$, para que o triângulo $OBC$ tenha um ângulo obtuso, ou seja, o maior ângulo $α$ satisfaz $90°<α<180°$. -So, for example, $N(4)=24$ and $N(8)=100$. +Assim, por exemplo, $N(4)=24$ e $N(8)=100$. -What is $N(1\\,000\\,000\\,000)$? +Qual é $N(1.000.000.000)$? # --hints-- -`obtuseAngledTriangles()` should return `1598174770174689500`. +`obtuseAngledTriangles()` deve retornar `1598174770174689500`. ```js assert.strictEqual(obtuseAngledTriangles(), 1598174770174689500); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-211-divisor-square-sum.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-211-divisor-square-sum.md index 3dddacaadbb..0a7902d2b91 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-211-divisor-square-sum.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-211-divisor-square-sum.md @@ -1,6 +1,6 @@ --- id: 5900f43f1000cf542c50ff52 -title: 'Problem 211: Divisor Square Sum' +title: 'Problema 211: Soma dos quadrados dos divisores' challengeType: 1 forumTopicId: 301853 dashedName: problem-211-divisor-square-sum @@ -8,15 +8,15 @@ dashedName: problem-211-divisor-square-sum # --description-- -For a positive integer $n$, let $σ_2(n)$ be the sum of the squares of its divisors. For example, +Para um número inteiro positivo $n$, considere $σ_2(n)$ como sendo a soma dos quadrados de seus divisores. Por exemplo: $$σ_2(10) = 1 + 4 + 25 + 100 = 130$$ -Find the sum of all $n$, $0 < n < 64\\,000\\,000$ such that $σ_2(n)$ is a perfect square. +Encontre a soma de todos os $n$, $0 < n < 64.000.000$, de tal forma que $σ_2(n)$ seja um quadrado perfeito. # --hints-- -`divisorSquareSum()` should return `1922364685`. +`divisorSquareSum()` deve retornar `1922364685`. ```js assert.strictEqual(divisorSquareSum(), 1922364685); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-212-combined-volume-of-cuboids.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-212-combined-volume-of-cuboids.md index 6fd271c483e..04feaae682f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-212-combined-volume-of-cuboids.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-212-combined-volume-of-cuboids.md @@ -1,6 +1,6 @@ --- id: 5900f4411000cf542c50ff53 -title: 'Problem 212: Combined Volume of Cuboids' +title: 'Problema 212: Volume combinado de cuboides' challengeType: 1 forumTopicId: 301854 dashedName: problem-212-combined-volume-of-cuboids @@ -8,30 +8,30 @@ dashedName: problem-212-combined-volume-of-cuboids # --description-- -An axis-aligned cuboid, specified by parameters $\{ (x_0,y_0,z_0), (dx,dy,dz) \}$, consists of all points ($X$,$Y$,$Z$) such that $x_0 ≤ X ≤ x_0 + dx$, $y_0 ≤ Y ≤ y_0 + dy$ and $z_0 ≤ Z ≤ z_0 + dz$. The volume of the cuboid is the product, $dx × dy × dz$. The combined volume of a collection of cuboids is the volume of their union and will be less than the sum of the individual volumes if any cuboids overlap. +Um cuboide alinhado em seus eixos, especificado pelos parâmetros $\{ (x_0,y_0,z_0), (dx,dy,dz) \}$, consiste em todos os pontos ($X$,$Y$,$Z$), de modo que $x_0 ≤ X ≤ x_0 + dx$, $y_0 ≤ Y ≤ y_0 + dy$ e $z_0 ≤ Z ≤ z_0 + dz$. O volume do cuboide é o produto, $dx × dy × dz$. O volume combinado de uma coleção de cuboides é o volume da sua união e será inferior à soma dos volumes individuais se houver sobreposição de qualquer um dos cuboides. -Let $C_1, \ldots, C_{50000}$ be a collection of 50000 axis-aligned cuboids such that $C_n$ has parameters +Considere $C_1, \ldots, C_{50000}$ como sendo uma coleção de 50.000 cuboides alinhados em seus eixos, de modo que $C_n$ tenha parâmetros $$\begin{align} & x_0 = S_{6n - 5} \\; \text{modulo} \\; 10000 \\\\ & y_0 = S_{6n - 4} \\; \text{modulo} \\; 10000 \\\\ & z_0 = S_{6n - 3} \\; \text{modulo} \\; 10000 \\\\ & dx = 1 + (S_{6n - 2} \\; \text{modulo} \\; 399) \\\\ & dy = 1 + (S_{6n - 1} \\; \text{modulo} \\; 399) \\\\ & dz = 1 + (S_{6n} \\; \text{modulo} \\; 399) \\\\ \end{align}$$ -where $S_1, \ldots, S_{300000}$ come from the "Lagged Fibonacci Generator": +onde $S_1, \ldots, S_{300000}$ vem do "Gerador Fibonacci com atraso": -For $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007k^3] \\; (modulo \\; 1000000)$ +Para $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007k^3] \\; (modulo \\; 1000000)$ -For $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}] \\; (modulo \\; 1000000)$ +Para $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}] \\; (modulo \\; 1000000)$ -Thus, $C_1$ has parameters $\{(7,53,183), (94,369,56)\}$, $C_2$ has parameters $\{(2383,3563,5079), (42,212,344)\}$, and so on. +Assim, $C_1$ tem parâmetros $\{(7,53,183), (94,369,56)\}$, $C_2$ tem parâmetros $\{(2383,3563,5079), (42,212,344)\}$ e assim por diante. -The combined volume of the first 100 cuboids, $C_1, \ldots, C_{100}$, is 723581599. +O volume combinado dos primeiros 100 cuboides, $C_1, \ldots, C_{100}$, é 723581599. -What is the combined volume of all 50000 cuboids, $C_1, \ldots, C_{50000}$? +Qual é o volume combinado de todos os 50000 cuboides, $C_1, \ldots, C_{50000}$? # --hints-- -`combinedValueOfCuboids()` should return `328968937309`. +`combinedValueOfCuboids()` deve retornar `328968937309`. ```js assert.strictEqual(combinedValueOfCuboids(), 328968937309); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-213-flea-circus.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-213-flea-circus.md index a18eb635255..b67737aba81 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-213-flea-circus.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-213-flea-circus.md @@ -1,6 +1,6 @@ --- id: 5900f4411000cf542c50ff54 -title: 'Problem 213: Flea Circus' +title: 'Problema 213: Circo de pulgas' challengeType: 1 forumTopicId: 301855 dashedName: problem-213-flea-circus @@ -8,15 +8,15 @@ dashedName: problem-213-flea-circus # --description-- -A 30×30 grid of squares contains 900 fleas, initially one flea per square. +Uma grade de 30×30 quadrados contém 900 pulgas, inicialmente uma pulga por quadrado. -When a bell is rung, each flea jumps to an adjacent square at random (usually 4 possibilities, except for fleas on the edge of the grid or at the corners). +Quando uma campainha é tocada, cada pulga salta para um quadrado adjacente aleatoriamente (geralmente 4 possibilidades, exceto para as pulgas nas bordas da grade ou nos cantos). -What is the expected number of unoccupied squares after 50 rings of the bell? Give your answer rounded to six decimal places. +Qual é o número esperado de quadrados desocupados após 50 toques da campainha? Dê sua resposta arredondada para seis casas decimais. # --hints-- -`fleaCircus()` should return `330.721154`. +`fleaCircus()` deve retornar `330.721154`. ```js assert.strictEqual(fleaCircus(), 330.721154); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-214-totient-chains.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-214-totient-chains.md index 497d541bc82..07308c0d6bd 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-214-totient-chains.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-214-totient-chains.md @@ -1,6 +1,6 @@ --- id: 5900f4421000cf542c50ff55 -title: 'Problem 214: Totient Chains' +title: 'Problema 214: Cadeias de totientes' challengeType: 1 forumTopicId: 301856 dashedName: problem-214-totient-chains @@ -8,9 +8,9 @@ dashedName: problem-214-totient-chains # --description-- -Let $φ$ be Euler's totient function, i.e. for a natural number $n$, $φ(n)$ is the number of $k$, $1 ≤ k ≤ n$, for which $gcd(k,n) = 1$. +Considere $φ$ como sendo a função totiente de Euler, ou seja, para um número natural $n$, $φ(n)$ é o número de $k$, $1 ≤ k ≤ n$, para os quais o máximo divisor comum é $gcd(k,n) = 1$. -By iterating $φ$, each positive integer generates a decreasing chain of numbers ending in 1. E.g. if we start with 5 the sequence 5,4,2,1 is generated. Here is a listing of all chains with length 4: +Ao iterar por $φ$, cada número inteiro positivo gera uma cadeia decrescente de números terminando em 1. Ex: se começarmos com 5 a sequência 5,4,2,1 é gerada. Aqui está uma lista de todas as cadeias com comprimento 4: $$\begin{align} 5,4,2,1 & \\\\ 7,6,2,1 & \\\\ 8,4,2,1 & \\\\ @@ -18,13 +18,13 @@ $$\begin{align} 5,4,2,1 & \\\\ 12,4,2,1 & \\\\ 14,6,2,1 & \\\\ 18,6,2,1 & \end{align}$$ -Only two of these chains start with a prime, their sum is 12. +Apenas duas dessas cadeias começam com um número primo e sua soma é 12. -What is the sum of all primes less than $40\\,000\\,000$ which generate a chain of length 25? +Qual é a soma de todos os números primos menores do que $40.000.000$ que gera uma cadeia de comprimento 25? # --hints-- -`totientChains()` should return `1677366278943`. +`totientChains()` deve retornar `1677366278943`. ```js assert.strictEqual(totientChains(), 1677366278943); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-215-crack-free-walls.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-215-crack-free-walls.md index 4e0f214b938..72088e89117 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-215-crack-free-walls.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-215-crack-free-walls.md @@ -1,6 +1,6 @@ --- id: 5900f4431000cf542c50ff56 -title: 'Problem 215: Crack-free Walls' +title: 'Problema 215: Paredes sem rachaduras' challengeType: 1 forumTopicId: 301857 dashedName: problem-215-crack-free-walls @@ -8,19 +8,19 @@ dashedName: problem-215-crack-free-walls # --description-- -Consider the problem of building a wall out of 2×1 and 3×1 bricks (horizontal×vertical dimensions) such that, for extra strength, the gaps between horizontally-adjacent bricks never line up in consecutive layers, i.e. never form a "running crack". +Considere o problema da construção de uma parede de 2×1 e 3×1 tijolos (dimensões verticais × horizontais), de modo que, para ter uma força extra, as lacunas entre os blocos adjacentes horizontalmente nunca se alinham em camadas consecutivas, ou seja, nunca formam uma "rachadura". -For example, the following 9×3 wall is not acceptable due to the running crack shown in red: +Por exemplo, a parede 9×3 a seguir não é aceitável devido à rachadura da execução mostrada em vermelho: -9x3 wall with one lined up gap between horizontally-adjacent bricks +parede 9x3 com uma lacuna alinhada entre blocos horizontalmente adjacentes -There are eight ways of forming a crack-free 9×3 wall, written $W(9,3) = 8$. +Existem oito maneiras de formar uma parede 9×3 sem rachaduras, as quais descrevemos como $W(9,3) = 8$. -Calculate $W(32,10)$. +Calcule $W(32,10)$. # --hints-- -`crackFreeWalls()` should return `806844323190414`. +`crackFreeWalls()` deve retornar `806844323190414`. ```js assert.strictEqual(crackFreeWalls(), 806844323190414); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md index a528915ab9a..8295980f62e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md @@ -1,6 +1,6 @@ --- id: 5900f4451000cf542c50ff57 -title: 'Problem 216: Investigating the primality of numbers of the form 2n2-1' +title: 'Problema 216: Investigação da primalidade dos números da forma 2n2-1' challengeType: 1 forumTopicId: 301858 dashedName: problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1 @@ -8,19 +8,19 @@ dashedName: problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1 # --description-- -Consider numbers $t(n)$ of the form $t(n) = 2n^2 - 1$ with $n > 1$. +Considere os números $t(n)$ da forma $t(n) = 2n^2 - 1$, sendo $n > 1$. -The first such numbers are 7, 17, 31, 49, 71, 97, 127 and 161. +Os primeiros desses números são 7, 17, 31, 49, 71, 97, 127 e 161. -It turns out that only $49 = 7 \times 7$ and $161 = 7 \times 23$ are not prime. +Ocorre que apenas $49 = 7 \times 7$ e $161 = 7 \times 23$ dentre esses não são números primos. -For $n ≤ 10000$ there are 2202 numbers $t(n)$ that are prime. +Para $n ≤ 10000$, há 2202 números $t(n)$ que são primos. -How many numbers $t(n)$ are prime for $n ≤ 50\\,000\\,000$? +Quantos números $t(n)$ são primos para $n ≤ 50.000.000$? # --hints-- -`primalityOfNumbers()` should return `5437849`. +`primalityOfNumbers()` deve retornar `5437849`. ```js assert.strictEqual(primalityOfNumbers(), 5437849); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-217-balanced-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-217-balanced-numbers.md index f685410fcd3..c04ea8f018c 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-217-balanced-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-217-balanced-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f4461000cf542c50ff58 -title: 'Problem 217: Balanced Numbers' +title: 'Problema 217: Números balanceados' challengeType: 1 forumTopicId: 301859 dashedName: problem-217-balanced-numbers @@ -8,19 +8,19 @@ dashedName: problem-217-balanced-numbers # --description-- -A positive integer with $k$ (decimal) digits is called balanced if its first $⌈\frac{k}{2}⌉$ digits sum to the same value as its last $⌈\frac{k}{2}⌉$ digits, where $⌈x⌉$, pronounced ceiling of $x$, is the smallest integer $≥ x$, thus $⌈π⌉ = 4$ and $⌈5⌉ = 5$. +Um número inteiro positivo com $k$ casas (decimais) é chamado de balanceado se os seus primeiros $⌈\frac{k}{2}⌉$ algarismos têm a soma igual aos seus últimos $⌈\frac{k}{2}⌉$ algarismos, onde $⌈x⌉$, o teto pronunciado de $x$, é o menor inteiro, sendo $≥ x$, portanto $⌈π⌉ = 4$ e $⌈5⌉ = 5$. -So, for example, all palindromes are balanced, as is 13722. +Então, por exemplo, todos os palíndromos são balanceados, assim como 13722. -Let $T(n)$ be the sum of all balanced numbers less than $10^n$. +Considere $T(n)$ como sendo a soma de todos os números balanceados menores que $10^n$. -Thus: $T(1) = 45$, $T(2) = 540$ and $T(5) = 334\\,795\\,890$. +Assim: $T(1) = 45$, $T(2) = 540$ e $T(5) = 334.795.890$. -Find $T(47)\\,mod\\,3^{15}$ +Encontre $T(47)\\,mod\\,3^{15}$ # --hints-- -`balancedNumbers()` should return `6273134`. +`balancedNumbers()` deve retornar `6273134`. ```js assert.strictEqual(balancedNumbers(), 6273134); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-218-perfect-right-angled-triangles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-218-perfect-right-angled-triangles.md index 1d29c005426..963bc5023fb 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-218-perfect-right-angled-triangles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-218-perfect-right-angled-triangles.md @@ -1,6 +1,6 @@ --- id: 5900f4461000cf542c50ff59 -title: 'Problem 218: Perfect right-angled triangles' +title: 'Problema 218: Triângulos retos perfeitos' challengeType: 1 forumTopicId: 301860 dashedName: problem-218-perfect-right-angled-triangles @@ -8,29 +8,29 @@ dashedName: problem-218-perfect-right-angled-triangles # --description-- -Consider the right-angled triangle with sides $a=7$, $b=24$ and $c=25$. +Considere o triângulo reto com lados $a=7$, $b=24$ e $c=25$. -The area of this triangle is 84, which is divisible by the perfect numbers 6 and 28. +A área deste triângulo é 84, que é divisível pelos números perfeitos 6 e 28. -Moreover it is a primitive right-angled triangle as $gcd(a,b) = 1$ and $gcd(b,c) = 1$. +Além disso, ele é um triângulo reto primitivo, já que tem os maiores divisores comuns $gcd(a,b) = 1$ e $gcd(b,c) = 1$. -Also $c$ is a perfect square. +Por fim, $c$ é um quadrado perfeito. -We will call a right-angled triangle perfect if: +Chamaremos um triângulo de triângulo reto perfeito se: -- it is a primitive right-angled triangle -- its hypotenuse is a perfect square +- for um triângulo reto primitivo +- sua hipotenusa for um quadrado perfeito -We will call a right-angled triangle super-perfect if: +Chamaremos um triângulo de triângulo reto superperfeito se: -- it is a perfect right-angled triangle -- its area is a multiple of the perfect numbers 6 and 28. +- for um triângulo reto perfeito +- sua área for um múltiplo dos números perfeitos 6 e 28. -How many perfect right-angled triangles with $c ≤ {10}^{16}$ exist that are not super-perfect? +Quantos triângulos retos perfeitos com $c ≤ {10}^{16}$ existem que não são superperfeitos? # --hints-- -`perfectRightAngledTriangles()` should return `0`. +`perfectRightAngledTriangles()` deve retornar `0`. ```js assert.strictEqual(perfectRightAngledTriangles(), 0); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-219-skew-cost-coding.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-219-skew-cost-coding.md index f2d2b0f8721..4c87118da11 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-219-skew-cost-coding.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-219-skew-cost-coding.md @@ -1,6 +1,6 @@ --- id: 5900f4481000cf542c50ff5a -title: 'Problem 219: Skew-cost coding' +title: 'Problema 219: Codificação de custo modificado' challengeType: 1 forumTopicId: 301861 dashedName: problem-219-skew-cost-coding @@ -8,23 +8,23 @@ dashedName: problem-219-skew-cost-coding # --description-- -Let $A$ and $B$ be bit strings (sequences of 0's and 1's). +Considere $A$ e $B$ como sendo strings de bits (sequências de 0s e 1s). -If $A$ is equal to the leftmost length($A$) bits of $B$, then $A$ is said to be a prefix of $B$. +Se $A$ for igual aos bits de comprimento ($A$) mais à esquerda de $B$, então $A$ é pode ser considerado um prefixo de $B$. -For example, 00110 is a prefix of 001101001, but not of 00111 or 100110. +Por exemplo, 00110 é um prefixo de 001101001, mas não de 00111 ou 100110. -A prefix-free code of size $n$ is a collection of $n$ distinct bit strings such that no string is a prefix of any other. For example, this is a prefix-free code of size 6: +Um código de tamanho $n$ sem prefixo é uma coleção de $n$ strings de bits distintos, de modo que nenhuma string é um prefixo de outra. Por exemplo, este é um código de tamanho 6 sem prefixos: $$0000, 0001, 001, 01, 10, 11$$ -Now suppose that it costs one penny to transmit a '0' bit, but four pence to transmit a '1'. Then the total cost of the prefix-free code shown above is 35 pence, which happens to be the cheapest possible for the skewed pricing scheme in question. In short, we write $Cost(6) = 35$. +Suponhamos agora que custa um centavo transmitir um bit "0", mas quatro centavos transmitir um bit "1". Então, o custo total do código sem o prefixo mostrado acima é de 35 centavos, que é o mais barato possível para o regime de preços modificados em questão. Em resumo, escrevemos $Cost(6) = 35$. -What is $Cost(10^9)$? +Qual é o $Cost(10^9)$? # --hints-- -`skewCostCoding()` should return `64564225042`. +`skewCostCoding()` deve retornar `64564225042`. ```js assert.strictEqual(skewCostCoding(), 64564225042); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-220-heighway-dragon.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-220-heighway-dragon.md index e58e3c3f3ec..fc5ffe3677d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-220-heighway-dragon.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-220-heighway-dragon.md @@ -1,6 +1,6 @@ --- id: 5900f4481000cf542c50ff5b -title: 'Problem 220: Heighway Dragon' +title: 'Problema 220: Dragão de Heighway' challengeType: 1 forumTopicId: 301863 dashedName: problem-220-heighway-dragon @@ -8,30 +8,30 @@ dashedName: problem-220-heighway-dragon # --description-- -Let $D_0$ be the two-letter string "Fa". For $n ≥ 1$, derive $D_n$ from $D_{n - 1}$ by the string-rewriting rules: +Considere $D_0$ como sendo a string de duas letras "Fa". Para $n ≥ 1$, derive $D_n$ de $D_{n - 1}$ pelas regras de reescrita da string: - "a" → "aRbFR" - "b" → "LFaLb" -Thus, $D_0$ = "Fa", $D_1$ = "FaRbFR", $D_2$ = "FaRbFRRLFaLbFR", and so on. +Assim, $D_0$ = "Fa", $D_1$ = "FaRbFR", $D_2$ = "FaRbFRRLFaLbFR" e assim por diante. -These strings can be interpreted as instructions to a computer graphics program, with "F" meaning "draw forward one unit", "L" meaning "turn left 90 degrees", "R" meaning "turn right 90 degrees", and "a" and "b" being ignored. The initial position of the computer cursor is (0,0), pointing up towards (0,1). +Essas strings podem ser interpretadas como instruções para um programa gráfico do computador, com "F" significando "desenhar uma unidade adiante", "L" significando "virar 90 graus à esquerda", "R" significando "virar 90 graus à direita " e "a" e "b" sendo ignorados. A posição inicial do cursor do computador é (0,0), apontando na direção de (0,1). -Then $D_n$ is an exotic drawing known as the Heighway Dragon of order $n$. For example, $D_{10}$ is shown below; counting each "F" as one step, the highlighted spot at (18,16) is the position reached after 500 steps. +Então $D_n$ é um desenho exótico conhecido como Dragão de Heighway da ordem $n$. Por exemplo, $D_{10}$ é mostrado abaixo. Contando cada "F" como uma etapa, o local destacado em (18,16) é a posição alcançada após 500 etapas. -drawing of the Heighway Dragon after 500 steps +desenho do Dragão de Heighway após 500 etapas -What is the position of the cursor after ${10}^{12}$ steps in $D_{50}$? Give your answer as a string in the form `x,y` with no spaces. +Qual é a posição do cursor depois de ${10}^{12}$ etapas em $D_{50}$? Dê sua resposta como uma string na forma `x,y` sem espaços. # --hints-- -`heighwayDragon()` should return a string. +`heighwayDragon()` deve retornar uma string. ```js assert(typeof heighwayDragon() === 'string'); ``` -`heighwayDragon()` should return the string `139776,963904`. +`heighwayDragon()` deve retornar a string `139776,963904`. ```js assert.strictEqual(heighwayDragon(), '139776,963904'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-221-alexandrian-integers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-221-alexandrian-integers.md index e7fedf26f75..4ec08b72f6e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-221-alexandrian-integers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-221-alexandrian-integers.md @@ -1,6 +1,6 @@ --- id: 5900f4491000cf542c50ff5c -title: 'Problem 221: Alexandrian Integers' +title: 'Problema 221: Inteiros alexandrinos' challengeType: 1 forumTopicId: 301864 dashedName: problem-221-alexandrian-integers @@ -8,22 +8,22 @@ dashedName: problem-221-alexandrian-integers # --description-- -We shall call a positive integer $A$ an "Alexandrian integer", if there exist integers $p$, $q$, $r$ such that: +Chamaremos um número inteiro positivo $A$ de "inteiro alexandrino" se existirem inteiros $p$, $q$, $r$, como: $$A = p \times q \times r$$ -and +e $$\frac{1}{A} = \frac{1}{p} + \frac{1}{q} + \frac{1}{r}$$ -For example, 630 is an Alexandrian integer ($p = 5$, $q = −7$, $r = −18$). In fact, 630 is the 6th Alexandrian integer, the first 6 Alexandrian integers being: 6, 42, 120, 156, 420 and 630. +Por exemplo, 630 é um inteiro alexandrino ($p = 5$, $q = − 7$, $r = − 18$). Na verdade, 630 é o 6° inteiro alexandrino, sendo os 6 primeiros números inteiros alexandrinos 6, 42, 120, 156, 420 e 630. -Find the 150000th Alexandrian integer. +Encontre o número 150.000º inteiro alexandrino. # --hints-- -`alexandrianIntegers()` should return `1884161251122450`. +`alexandrianIntegers()` deve retornar `1884161251122450`. ```js assert.strictEqual(alexandrianIntegers(), 1884161251122450); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-222-sphere-packing.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-222-sphere-packing.md index cdb6a9c3977..d394c0a9cbf 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-222-sphere-packing.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-222-sphere-packing.md @@ -1,6 +1,6 @@ --- id: 5900f44b1000cf542c50ff5d -title: 'Problem 222: Sphere Packing' +title: 'Problema 222: Embalagem de esferas' challengeType: 1 forumTopicId: 301865 dashedName: problem-222-sphere-packing @@ -8,13 +8,13 @@ dashedName: problem-222-sphere-packing # --description-- -What is the length of the shortest pipe, of internal radius 50mm, that can fully contain 21 balls of radii 30mm, 31mm, ..., 50mm? +Qual é o comprimento do tubo mais curto, de um raio interno de 50 mm, que pode conter totalmente 21 bolas de raios de 30 mm, 31 mm, ..., 50 mm? -Give your answer in micrometres (${10}^{-6}$ m) rounded to the nearest integer. +Dê sua resposta em micrômetros (${10}^{-6}$ m), arredondada para o mais próximo número inteiro. # --hints-- -`spherePacking()` should return `1590933`. +`spherePacking()` deve retornar `1590933`. ```js assert.strictEqual(spherePacking(), 1590933); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-223-almost-right-angled-triangles-i.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-223-almost-right-angled-triangles-i.md index 7fdbc36cbc6..f65143e51c3 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-223-almost-right-angled-triangles-i.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-223-almost-right-angled-triangles-i.md @@ -1,6 +1,6 @@ --- id: 5900f44b1000cf542c50ff5e -title: 'Problem 223: Almost right-angled triangles I' +title: 'Problema 223: Triângulos quase retos I' challengeType: 1 forumTopicId: 301866 dashedName: problem-223-almost-right-angled-triangles-i @@ -8,13 +8,13 @@ dashedName: problem-223-almost-right-angled-triangles-i # --description-- -Let us call an integer sided triangle with sides $a ≤ b ≤ c$ barely acute if the sides satisfy $a^2 + b^2 = c^2 + 1$. +Chamaremos um triângulo de comprimento dos lados expresso em números inteiros, com os lados $a ≤ b ≤ c$, de quase agudos se os lados satisfizerem $a^2 + b^2 = c^2 + 1$. -How many barely acute triangles are there with perimeter $≤ 25\\,000\\,000$? +Quantos triângulos quase agudos existem com o perímetro $≤ 25.000.000$? # --hints-- -`almostRightAngledTrianglesOne()` should return `61614848`. +`almostRightAngledTrianglesOne()` deve retornar `61614848`. ```js assert.strictEqual(almostRightAngledTrianglesOne(), 61614848); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-224-almost-right-angled-triangles-ii.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-224-almost-right-angled-triangles-ii.md index c9f9b44cb3f..5100be128ca 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-224-almost-right-angled-triangles-ii.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-224-almost-right-angled-triangles-ii.md @@ -1,6 +1,6 @@ --- id: 5900f44e1000cf542c50ff5f -title: 'Problem 224: Almost right-angled triangles II' +title: 'Problema 224: Triângulos quase retos II' challengeType: 1 forumTopicId: 301867 dashedName: problem-224-almost-right-angled-triangles-ii @@ -8,13 +8,13 @@ dashedName: problem-224-almost-right-angled-triangles-ii # --description-- -Let us call an integer sided triangle with sides $a ≤ b ≤ c$ barely obtuse if the sides satisfy $a^2 + b^2 = c^2 - 1$. +Chamaremos um triângulo de comprimento dos lados expresso em números inteiros, com os lados $a ≤ b ≤ c$, de quase obtusos se os lados satisfizerem $a^2 + b^2 = c^2 - 1$. -How many barely obtuse triangles are there with perimeter $≤ 75\\,000\\,000$? +Quantos triângulos quase obtusos existem com o perímetro $≤ 75.000.000$? # --hints-- -`almostRightAngledTrianglesTwo()` should return `4137330`. +`almostRightAngledTrianglesTwo()` deve retornar `4137330`. ```js assert.strictEqual(almostRightAngledTrianglesTwo(), 4137330); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-225-tribonacci-non-divisors.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-225-tribonacci-non-divisors.md index 2221b445314..77c89e68380 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-225-tribonacci-non-divisors.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-225-tribonacci-non-divisors.md @@ -1,6 +1,6 @@ --- id: 5900f44e1000cf542c50ff60 -title: 'Problem 225: Tribonacci non-divisors' +title: 'Problema 225: Não divisores Tribonacci' challengeType: 1 forumTopicId: 301868 dashedName: problem-225-tribonacci-non-divisors @@ -8,17 +8,17 @@ dashedName: problem-225-tribonacci-non-divisors # --description-- -The sequence 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653, 1201 ... +A sequência 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653, 1201... -is defined by $T_1 = T_2 = T_3 = 1$ and $T_n = T_{n - 1} + T_{n - 2} + T_{n - 3}$. +é definida por $T_1 = T_2 = T_3 = 1$ e $T_n = T_{n - 1} + T_{n - 2} + T_{n - 3}$. -It can be shown that 27 does not divide any terms of this sequence. In fact, 27 is the first odd number with this property. +Pode-se mostrar que 27 não divide nenhum termo desta sequência. De fato, 27 é o primeiro número ímpar com esta propriedade. -Find the ${124}^{\text{th}}$ odd number that does not divide any terms of the above sequence. +Encontre o ${124}^{\text{o}}$ número ímpar que não divide nenhum dos termos da sequência acima. # --hints-- -`tribonacciNonDivisors()` should return `2009`. +`tribonacciNonDivisors()` deve retornar `2009`. ```js assert.strictEqual(tribonacciNonDivisors(), 2009); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-226-a-scoop-of-blancmange.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-226-a-scoop-of-blancmange.md index fd8031f2594..b7fe596b26e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-226-a-scoop-of-blancmange.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-226-a-scoop-of-blancmange.md @@ -1,6 +1,6 @@ --- id: 5900f4511000cf542c50ff62 -title: 'Problem 226: A Scoop of Blancmange' +title: 'Problema 226: Uma colherada de manjar branco' challengeType: 1 forumTopicId: 301869 dashedName: problem-226-a-scoop-of-blancmange @@ -8,19 +8,19 @@ dashedName: problem-226-a-scoop-of-blancmange # --description-- -The blancmange curve is the set of points ($x$,$y$) such that $0 ≤ x ≤ 1$ and $\displaystyle y = \sum_{n = 0}^{\infty} \frac{s(2^nx)}{2^n}$, where $s(x)$ is the distance from $x$ to the nearest integer. +A curva de manjar branco é um conjunto de pontos ($x$,$y$), tal que $0 ≤ x ≤ 1$ e $\displaystyle y = \sum_{n = 0}^{\infty} \frac{s(2^nx)}{2^n}$, onde $s(x)$ é a distância de $x$ até o próximo número inteiro. -The area under the blancmange curve is equal to $\frac{1}{2}$, shown in pink in the diagram below. +A área abaixo da curva de manjar branco é igual a$\frac{1}{2}$, que aparece em rosa no diagrama abaixo. -diagram of blancmange curve, with circle C shown on diagram +diagrama da curva de manjar branco, com o círculo C mostrado no diagrama -Let $C$ be the circle with centre ($\frac{1}{4}$,$\frac{1}{2}$) and radius $\frac{1}{4}$, shown in black in the diagram. +Considere $C$ como sendo o círculo com o centro ($\frac{1}{4}$,$\frac{1}{2}$) e raio $\frac{1}{4}$, que aparece em preto no diagrama. -What area under the blancmange curve is enclosed by $C$? Give your answer rounded to eight decimal places in the form 0.abcdefgh +Qual área sob a curva de manjar branco está delimitada por $C$? Arredonde sua resposta para até oito casas decimais usando o formato 0.abcdefgh # --hints-- -`scoopOfBlancmange()` should return `0.11316017`. +`scoopOfBlancmange()` deve retornar `0.11316017`. ```js assert.strictEqual(scoopOfBlancmange(), 0.11316017); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-227-the-chase.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-227-the-chase.md index 3121c6ac8d8..00a1a05425b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-227-the-chase.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-227-the-chase.md @@ -1,6 +1,6 @@ --- id: 5900f44f1000cf542c50ff61 -title: 'Problem 227: The Chase' +title: 'Problema 227: A caçada' challengeType: 1 forumTopicId: 301870 dashedName: problem-227-the-chase @@ -8,23 +8,23 @@ dashedName: problem-227-the-chase # --description-- -"The Chase" is a game played with two dice and an even number of players. +"A caçada" é um jogo que consiste em dois dados e um número par de jogadores. -The players sit around a table; the game begins with two opposite players having one die each. On each turn, the two players with a die roll it. +Os jogadores sentam-se ao redor de uma mesa. O jogo começa com dois jogadores opostos tendo um dado cada. A cada turno, os dois jogadores que têm o dado o rolam. -If the player rolls a 1, he passes the die to his neighbour on the left. +Se o jogador rolar um 1, ele passa o dado ao vizinho à esquerda. -If the player rolls a 6, he passes the die to his neighbour on the right. +Se o jogador rolar um 6, ele passa o dado ao vizinho à direita. -Otherwise, he keeps the die for the next turn. +Caso contrário, ele mantém o dado no próximo turno. -The game ends when one player has both dice after they have been rolled and passed; that player has then lost. +O jogo termina quando um jogador tem os dois dados depois que eles forem rolados e passados. Aquele jogador perdeu. -In a game with 100 players, what is the expected number of turns the game lasts? Give your answer rounded to ten significant digits. +Em um jogo com 100 jogadores, qual é o número esperado de turnos que dure o jogo? Dê sua resposta arredondada para dez algarismos significativos (total de casas somando antes e depois da vírgula). # --hints-- -`theChase()` should return `3780.618622`. +`theChase()` deve retornar `3780.618622`. ```js assert.strictEqual(theChase(), 3780.618622); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-228-minkowski-sums.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-228-minkowski-sums.md index 3bccd240ed2..edc22925fb8 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-228-minkowski-sums.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-228-minkowski-sums.md @@ -1,6 +1,6 @@ --- id: 5900f4511000cf542c50ff63 -title: 'Problem 228: Minkowski Sums' +title: 'Problema 228: Somas de Minkowski' challengeType: 1 forumTopicId: 301871 dashedName: problem-228-minkowski-sums @@ -8,24 +8,24 @@ dashedName: problem-228-minkowski-sums # --description-- -Let $S_n$ be the regular $n$-sided polygon – or shape – whose vertices $v_k (k = 1, 2, \ldots, n)$ have coordinates: +Considere $S_n$ como o polígono – ou forma – regular de $n$ lados, cujos vértices $v_k (k = 1, 2, \ldots, n)$ têm as coordenadas: $$\begin{align} & x_k = cos(\frac{2k - 1}{n} × 180°) \\\\ & y_k = sin(\frac{2k - 1}{n} × 180°) \end{align}$$ -Each $S_n$ is to be interpreted as a filled shape consisting of all points on the perimeter and in the interior. +Cada $S_n$ deve ser interpretado como uma forma preenchida que consiste em todos os pontos no perímetro e no interior. -The Minkowski sum, $S + T$, of two shapes $S$ and $T$ is the result of adding every point in $S$ to every point in $T$, where point addition is performed coordinate-wise: $(u, v) + (x, y) = (u + x, v + y)$. +A soma de Minkowski, $S + T$, de duas formas $S$ e $T$ é o resultado de adicionar cada ponto em $S$ a cada ponto em $T$, onde a adição dos pontos é realizada através das coordenadas: $(u, v) + (x, y) = (u + x, v + y)$. -For example, the sum of $S_3$ and $S_4$ is the six-sided shape shown in pink below: +Por exemplo, a soma de $S_3$ e $S_4$ é a forma de seis lados mostrada em rosa abaixo: -image showing S_3, S_4 and S_3 + S_4 +imagem mostrando S_3, S_4 e S_3 + S_4 -How many sides does $S_{1864} + S_{1865} + \ldots + S_{1909}$ have? +Quantos lados tem $S_{1864} + S_{1865} + \ldots + S_{1909}$? # --hints-- -`minkowskiSums()` should return `86226`. +`minkowskiSums()` deve retornar `86226`. ```js assert.strictEqual(minkowskiSums(), 86226); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-229-four-representations-using-squares.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-229-four-representations-using-squares.md index 3903d30320f..4cd281e2017 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-229-four-representations-using-squares.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-229-four-representations-using-squares.md @@ -1,6 +1,6 @@ --- id: 5900f4521000cf542c50ff64 -title: 'Problem 229: Four Representations using Squares' +title: 'Problema 229: Quatro representações usando quadrados' challengeType: 1 forumTopicId: 301872 dashedName: problem-229-four-representations-using-squares @@ -8,29 +8,29 @@ dashedName: problem-229-four-representations-using-squares # --description-- -Consider the number 3600. It is very special, because +Considere o número 3600. Ele é muito especial, porque $$\begin{align} & 3600 = {48}^2 + {36}^2 \\\\ & 3600 = {20}^2 + {2×40}^2 \\\\ & 3600 = {30}^2 + {3×30}^2 \\\\ & 3600 = {45}^2 + {7×15}^2 \\\\ \end{align}$$ -Similarly, we find that $88201 = {99}^2 + {280}^2 = {287}^2 + 2 × {54}^2 = {283}^2 + 3 × {52}^2 = {197}^2 + 7 × {84}^2$. +Da mesma forma, descobrimos que $88201 = {99}^2 + {280}^2 = {287}^2 + 2 × {54}^2 = {283}^2 + 3 × {52}^2 = {197}^2 + 7 × {84}^2$. -In 1747, Euler proved which numbers are representable as a sum of two squares. We are interested in the numbers $n$ which admit representations of all of the following four types: +Em 1747, Euler provou quais números são representáveis como uma soma de dois quadrados. Estamos interessados nos números $n$ que admitem representações de todos os quatro tipos a seguir: $$\begin{align} & n = {a_1}^2 + {b_1}^2 \\\\ & n = {a_2}^2 + 2{b_2}^2 \\\\ & n = {a_3}^2 + 3{b_3}^2 \\\\ & n = {a_7}^2 + 7{b_7}^2 \\\\ \end{align}$$ -where the $a_k$ and $b_k$ are positive integers. +onde $a_k$ e $b_k$ são números inteiros positivos. -There are 75373 such numbers that do not exceed ${10}^7$. +Há 75373 números que não excedem ${10}^7$. -How many such numbers are there that do not exceed $2 × {10}^9$? +Quantos desses números existem e que não excedam $2 × {10}^9$? # --hints-- -`representationsUsingSquares()` should return `11325263`. +`representationsUsingSquares()` deve retornar `11325263`. ```js assert.strictEqual(representationsUsingSquares(), 11325263); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-230-fibonacci-words.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-230-fibonacci-words.md index bc6cd70f1cc..b5d8fc43267 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-230-fibonacci-words.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-230-fibonacci-words.md @@ -1,6 +1,6 @@ --- id: 5900f4531000cf542c50ff65 -title: 'Problem 230: Fibonacci Words' +title: 'Problema 230: Palavras de Fibonacci' challengeType: 1 forumTopicId: 301874 dashedName: problem-230-fibonacci-words @@ -8,37 +8,37 @@ dashedName: problem-230-fibonacci-words # --description-- -For any two strings of digits, $A$ and $B$, we define $F_{A,B}$ to be the sequence ($A, B, AB, BAB, ABBAB, \ldots$) in which each term is the concatenation of the previous two. +Para duas strings de algarismos quaisquer, $A$ e $B$, definimos $F_{A,B}$ como a sequência ($A, B, AB, BAB, ABBAB, \ldots$) na qual cada termo é a concatenação dos dois anteriores. -Further, we define $D_{A,B}(n)$ to be the $n^{\text{th}}$ digit in the first term of $F_{A,B}$ that contains at least $n$ digits. +Além disso, definimos $D_{A,B}(n)$ como o $n^{\text{o}}$ algarismo do primeiro termo de $F_{A,B}$ que contém, pelo menos, $n$ algarismos. -Example: +Exemplo: -Let $A = 1\\,415\\,926\\,535$, $B = 8\\,979\\,323\\,846$. We wish to find $D_{A,B}(35)$, say. +Considere $A = 1.415.926.535$, $B = 8.979.323.846$. Queremos encontrar, digamos, $D_{A,B}(35)$. -The first few terms of $F_{A,B}$ are: +Os primeiros termos de $F_{A,B}$ são: -$$\begin{align} & 1\\,415\\,926\\,535 \\\\ - & 8\\,979\\,323\\,846 \\\\ & 14\\,159\\,265\\,358\\,979\\,323\\,846 \\\\ - & 897\\,932\\,384\\,614\\,159\\,265\\,358\\,979\\,323\\,846 \\\\ & 14\\,159\\,265\\,358\\,979\\,323\\,846\\,897\\,932\\,384\\,614\\,15\color{red}{9}\\,265\\,358\\,979\\,323\\,846 \end{align}$$ +$$\begin{align} & 1.415.926\\,535 \\\\ + & 8.979.323.846 \\\\ & 14.159.265.358.979.323.846 \\\\ + & 897.932.384.614.159.265.358.979.323.846 \\\\ & 14.159.265.358.979.323.846.897.932.384.614.15\color{red}{9}.265.358.979.323.846 \end{align}$$ -Then $D_{A,B}(35)$ is the ${35}^{\text{th}}$ digit in the fifth term, which is 9. +Então, $D_{A,B}(35)$ é o ${35}^{\text{o}}$ algarismo no quinto termo, que é 9. -Now we use for $A$ the first 100 digits of $π$ behind the decimal point: +Agora, usamos para $A$ os primeiros 100 algarismos de $π$ antes do ponto decimal: -$$\begin{align} & 14\\,159\\,265\\,358\\,979\\,323\\,846\\,264\\,338\\,327\\,950\\,288\\,419\\,716\\,939\\,937\\,510 \\\\ - & 58\\,209\\,749\\,445\\,923\\,078\\,164\\,062\\,862\\,089\\,986\\,280\\,348\\,253\\,421\\,170\\,679 \end{align}$$ +$$\begin{align} & 14.159.265.358.979.323.846.264.338.327.950.288.419.716.939.937.510 \\\\ + & 58.209.749.445.923.078.164.062.862.089.986.280.348.253.421.170.679 \end{align}$$ -and for $B$ the next hundred digits: +e para $B$ os próximos cem algarismos: -$$\begin{align} & 82\\,148\\,086\\,513\\,282\\,306\\,647\\,093\\,844\\,609\\,550\\,582\\,231\\,725\\,359\\,408\\,128 \\\\ - & 48\\,111\\,745\\,028\\,410\\,270\\,193\\,852\\,110\\,555\\,964\\,462\\,294\\,895\\,493\\,038\\,196 \end{align}$$ +$$\begin{align} & 82.148.086.513.282.306.647.093.844.609.550.582.231.725.359.408.128 \\\\ + & 48.111.745.028.410.270.193.852.110.555.964.462.294.895.493.038.196 \end{align}$$ -Find $\sum_{n = 0, 1, \ldots, 17} {10}^n × D_{A,B}((127 + 19n) × 7^n)$. +Encontre $\sum_{n = 0, 1, \ldots, 17} {10}^n × D_{A,B}((127 + 19n) × 7^n)$. # --hints-- -`fibonacciWords()` should return `850481152593119200`. +`fibonacciWords()` deve retornar `850481152593119200`. ```js assert.strictEqual(fibonacciWords(), 850481152593119200); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-231-the-prime-factorisation-of-binomial-coefficients.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-231-the-prime-factorisation-of-binomial-coefficients.md index 498810cf48c..7f6a97fd401 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-231-the-prime-factorisation-of-binomial-coefficients.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-231-the-prime-factorisation-of-binomial-coefficients.md @@ -1,6 +1,6 @@ --- id: 5900f4531000cf542c50ff66 -title: 'Problem 231: The prime factorisation of binomial coefficients' +title: 'Problema 231: Fatoração de números primos de coeficientes binomiais' challengeType: 1 forumTopicId: 301875 dashedName: problem-231-the-prime-factorisation-of-binomial-coefficients @@ -8,17 +8,17 @@ dashedName: problem-231-the-prime-factorisation-of-binomial-coefficients # --description-- -The binomial coefficient $\displaystyle\binom{10}{3} = 120$. +O coeficiente binomial $\displaystyle\binom{10}{3} = 120$. $120 = 2^3 × 3 × 5 = 2 × 2 × 2 × 3 × 5$, and $2 + 2 + 2 + 3 + 5 = 14$. -So the sum of the terms in the prime factorisation of $\displaystyle\binom{10}{3}$ is $14$. +Portanto, a soma dos termos na fatoração de números primos de $\displaystyle\binom{10}{3}$ é $14$. -Find the sum of the terms in the prime factorisation of $\binom{20\\,000\\,000}{15\\,000\\,000}$. +Encontre a soma dos termos na fatoração de números primos de $\binom{20.000.000}{15.000.000}$. # --hints-- -`primeFactorisation()` should return `7526965179680`. +`primeFactorisation()` deve retornar `7526965179680`. ```js assert.strictEqual(primeFactorisation(), 7526965179680); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-232-the-race.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-232-the-race.md index c03c0d687b3..ecd0025e605 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-232-the-race.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-232-the-race.md @@ -1,6 +1,6 @@ --- id: 5900f4551000cf542c50ff67 -title: 'Problem 232: The Race' +title: 'Problema 232: A corrida' challengeType: 1 forumTopicId: 301876 dashedName: problem-232-the-race @@ -8,23 +8,23 @@ dashedName: problem-232-the-race # --description-- -Two players share an unbiased coin and take it in turns to play "The Race". +Dois jogadores compartilham uma moeda não viesada e a usam, cada um na sua vez, para jogar "A Corrida". -On Player 1's turn, he tosses the coin once: if it comes up Heads, he scores one point; if it comes up Tails, he scores nothing. +No turno do Jogador 1, ele joga uma vez a moeda: se der Cara, ele marca um ponto; se der Coroa, ele não marca nada. -On Player 2's turn, she chooses a positive integer $T$ and tosses the coin $T$ times: if it comes up all Heads, she scores $2^{T - 1}$ points; otherwise, she scores nothing. +Na vez do Jogador 2, ela escolhe um número inteiro positivo $T$ e joga a moeda $T$ vezes: se der Cara sempre, ele faz $2^{T - 1}$ pontos. Caso contrário, ele não pontua. -Player 1 goes first. The winner is the first to 100 or more points. +O jogador 1 joga primeiro. O vencedor é o primeiro a chegar a 100 pontos ou mais. -On each turn Player 2 selects the number, $T$, of coin tosses that maximises the probability of her winning. +Em cada turno, o Jogador 2 seleciona o número, $T$, de lançamentos da moeda que maximizam a probabilidade de sua vitória. -What is the probability that Player 2 wins? +Qual é a probabilidade de o Jogador 2 vencer? -Give your answer rounded to eight decimal places in the form 0.abcdefgh . +Arredonde sua resposta para até oito casas decimais usando o formato 0.abcdefgh. # --hints-- -`theRace()` should return `0.83648556`. +`theRace()` deve retornar `0.83648556`. ```js assert.strictEqual(theRace(), 0.83648556); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-233-lattice-points-on-a-circle.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-233-lattice-points-on-a-circle.md index db650947233..7bb2e065847 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-233-lattice-points-on-a-circle.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-233-lattice-points-on-a-circle.md @@ -1,6 +1,6 @@ --- id: 5900f4551000cf542c50ff68 -title: 'Problem 233: Lattice points on a circle' +title: 'Problema 233: Pontos de rede em um círculo' challengeType: 1 forumTopicId: 301877 dashedName: problem-233-lattice-points-on-a-circle @@ -8,15 +8,15 @@ dashedName: problem-233-lattice-points-on-a-circle # --description-- -Let $f(N)$ be the number of points with integer coordinates that are on a circle passing through $(0,0)$, $(N,0)$,$(0,N)$, and $(N,N)$. +Considere $f(N)$ como sendo o número de pontos com coordenadas compostas de números inteiros em um círculo que passa por $(0,0)$, $(N,0)$,$(0,N)$ e $(N,N)$. -It can be shown that $f(10000) = 36$. +Podemos mostrar que $f(10000) = 36$. -What is the sum of all positive integers $N ≤ {10}^{11}$ such that $f(N) = 420$? +Qual é a soma de todos os números inteiros positivos $N ≤ {10}^{11}$ tal que $f(N) = 420$? # --hints-- -`latticePointsOnACircle()` should return `271204031455541300`. +`latticePointsOnACircle()` deve retornar `271204031455541300`. ```js assert.strictEqual(latticePointsOnACircle(), 271204031455541300); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-234-semidivisible-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-234-semidivisible-numbers.md index ec01ca36a28..ca448662e3f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-234-semidivisible-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-234-semidivisible-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f4571000cf542c50ff69 -title: 'Problem 234: Semidivisible numbers' +title: 'Problema 234: Números semidivisíveis' challengeType: 1 forumTopicId: 301878 dashedName: problem-234-semidivisible-numbers @@ -8,19 +8,19 @@ dashedName: problem-234-semidivisible-numbers # --description-- -For an integer $n ≥ 4$, we define the lower prime square root of $n$, denoted by $lps(n)$, as the $\text{largest prime} ≤ \sqrt{n}$ and the upper prime square root of $n$, $ups(n)$, as the $\text{smallest prime} ≥ \sqrt{n}$. +Para um número inteiro $n ≥ 4$, definiremos a menor raiz quadrada de número primo de $n$, denotada por $lps(n)$, como $\text{maior primo} ≤ \sqrt{n}$ e a maior raiz quadrada de número primo de $n$, $ups(n)$, como $\text{menor primo} ≥ \sqrt{n}$. -So, for example, $lps(4) = 2 = ups(4)$, $lps(1000) = 31$, $ups(1000) = 37$. +Por exemplo, $lps(4) = 2 = ups(4)$, $lps(1000) = 31$, $ups(1000) = 37$. -Let us call an integer $n ≥ 4$ semidivisible, if one of $lps(n)$ and $ups(n)$ divides $n$, but not both. +Chamaremos um número inteiro $n ≥ 4$ de semidivisível se $lps(n)$ ou $ups(n)$ dividir $n$, mas não os dois. -The sum of the semidivisible numbers not exceeding 15 is 30, the numbers are 8, 10 and 12. 15 is not semidivisible because it is a multiple of both $lps(15) = 3$ and $ups(15) = 5$. As a further example, the sum of the 92 semidivisible numbers up to 1000 is 34825. +A soma dos números semidivisíveis não excedendo 15 é 30, e os números são 8, 10 e 12. 15 não é semidivisível, pois ele é um múltiplo de $lps(15) = 3$ e de $ups(15) = 5$. Como outro exemplo, a soma dos 92 números semidivisíveis até 1000 é 34825. -What is the sum of all semidivisible numbers not exceeding 999966663333? +Qual é a soma de todos os números semidivisíveis que não excedem 999966663333? # --hints-- -`semidivisibleNumbers()` should return `1259187438574927000`. +`semidivisibleNumbers()` deve retornar `1259187438574927000`. ```js assert.strictEqual(semidivisibleNumbers(), 1259187438574927000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-235-an-arithmetic-geometric-sequence.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-235-an-arithmetic-geometric-sequence.md index 893687367a5..1b11505e495 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-235-an-arithmetic-geometric-sequence.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-235-an-arithmetic-geometric-sequence.md @@ -1,6 +1,6 @@ --- id: 5900f4571000cf542c50ff6a -title: 'Problem 235: An Arithmetic Geometric sequence' +title: 'Problema 235: Uma sequência geométrica aritmética' challengeType: 1 forumTopicId: 301879 dashedName: problem-235-an-arithmetic-geometric-sequence @@ -8,17 +8,17 @@ dashedName: problem-235-an-arithmetic-geometric-sequence # --description-- -Given is the arithmetic-geometric sequence $u(k) = (900 - 3k)r^{k - 1}$. +Você é informado de que a sequência aritmética geométrica $u(k) = (900 - 3k)r^{k - 1}$. -Let $s(n) = \sum_{k=1 \ldots n} u(k)$. +Considere $s(n) = \sum_{k=1 \ldots n} u(k)$. -Find the value of $r$ for which $s(5000) = -600\\,000\\,000\\,000$. +Encontre o valor de $r$ para o qual $s(5000) = -600.000.000.000$. -Give your answer rounded to 12 places behind the decimal point. +Dê sua resposta arredondada para 12 casas depois da vírgula. # --hints-- -`arithmeticGeometricSequence()` should return `1.002322108633`. +`arithmeticGeometricSequence()` deve retornar `1.002322108633`. ```js assert.strictEqual(arithmeticGeometricSequence(), 1.002322108633); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-236-luxury-hampers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-236-luxury-hampers.md index 2ae12a0ab04..e914b6aacf0 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-236-luxury-hampers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-236-luxury-hampers.md @@ -1,6 +1,6 @@ --- id: 5900f4591000cf542c50ff6b -title: 'Problem 236: Luxury Hampers' +title: 'Problema 236: Cestos de luxo' challengeType: 1 forumTopicId: 301881 dashedName: problem-236-luxury-hampers @@ -8,38 +8,38 @@ dashedName: problem-236-luxury-hampers # --description-- -Suppliers 'A' and 'B' provided the following numbers of products for the luxury hamper market: +Os fornecedores "A" e "B" forneceram os seguintes números de produtos para o mercado de cestos de luxo: -| Product | 'A' | 'B' | -| ------------------ | ---- | ---- | -| Beluga Caviar | 5248 | 640 | -| Christmas Cake | 1312 | 1888 | -| Gammon Joint | 2624 | 3776 | -| Vintage Port | 5760 | 3776 | -| Champagne Truffles | 3936 | 5664 | +| Produto | 'A' | 'B' | +| ------------------- | ---- | ---- | +| Caviar Beluga | 5248 | 640 | +| Bolo de Natal | 1312 | 1888 | +| Carne de cervo | 2624 | 3776 | +| Vinho do Porto | 5760 | 3776 | +| Trufas no champanhe | 3936 | 5664 | -Although the suppliers try very hard to ship their goods in perfect condition, there is inevitably some spoilage - i.e. products gone bad. +Embora os fornecedores se esforcem muito por transportar seus produtos em condições perfeitas, há inevitavelmente alguns estragos, ou seja, os produtos que se perdem. -The suppliers compare their performance using two types of statistic: +Os fornecedores comparam seu desempenho usando dois tipos de estatística: -- The five per-product spoilage rates for each supplier are equal to the number of products gone bad divided by the number of products supplied, for each of the five products in turn. -- The overall spoilage rate for each supplier is equal to the total number of products gone bad divided by the total number of products provided by that supplier. +- As cinco taxas de desperdício por produto para cada fornecedor são iguais ao número de produtos que se perderam dividido pelo número de produtos fornecidos para cada um dos cinco produtos separadamente. +- A taxa de perda geral para cada fornecedor é igual ao número total de produtos que se perdeu dividido pelo número total de produtos fornecidos por esse fornecedor. -To their surprise, the suppliers found that each of the five per-product spoilage rates was worse (higher) for 'B' than for 'A' by the same factor (ratio of spoilage rates), $m > 1$; and yet, paradoxically, the overall spoilage rate was worse for 'A' than for 'B', also by a factor of $m$. +Para a surpresa deles, os fornecedores descobriram que cada uma das taxas de desperdício por produto era pior (superior) para 'B' do que para 'A' pelo mesmo fator (proporção de taxas de desperdício), $m > 1$; e, no entanto, paradoxalmente, a taxa geral de desperdício foi pior para o "A" do que para o "B", também por um fator de $m$. -There are thirty-five $m > 1$ for which this surprising result could have occurred, the smallest of which is $\frac{1476}{1475}$. +Há trinta e cinco $m > 1$ para os quais esse resultado surpreendente poderia ter ocorrido, sendo o menor deles $\frac{1476}{1475}$. -What's the largest possible value of $m$? Give your answer as a string with fraction reduced to its lowest terms, in the form `u/v`. +Qual é o maior valor possível de $m$? Dê sua resposta como uma string com uma fração reduzida aos termos mais baixos, na forma `u/v`. # --hints-- -`luxuryHampers()` should return a string. +`luxuryHampers()` deve retornar uma string. ```js assert(typeof luxuryHampers() === 'string'); ``` -`luxuryHampers()` should return the string `123/59`. +`luxuryHampers()` deve retornar a string `123/59`. ```js assert.strictEqual(luxuryHampers(), '123/59'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-237-tours-on-a-4-x-n-playing-board.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-237-tours-on-a-4-x-n-playing-board.md index ef7c2a30c04..d36c5246e40 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-237-tours-on-a-4-x-n-playing-board.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-237-tours-on-a-4-x-n-playing-board.md @@ -1,6 +1,6 @@ --- id: 5900f4591000cf542c50ff6c -title: 'Problem 237: Tours on a 4 x n playing board' +title: 'Problema 237: Passeios por um tabuleiro de 4 x n' challengeType: 1 forumTopicId: 301882 dashedName: problem-237-tours-on-a-4-x-n-playing-board @@ -8,22 +8,22 @@ dashedName: problem-237-tours-on-a-4-x-n-playing-board # --description-- -Let $T(n)$ be the number of tours over a 4 × $n$ playing board such that: +Considere $T(n)$ como o número de passeios sobre um tabuleiro de 4 × $n$, tal que: -- The tour starts in the top left corner. -- The tour consists of moves that are up, down, left, or right one square. -- The tour visits each square exactly once. -- The tour ends in the bottom left corner. +- O passeio começa no canto superior esquerdo. +- O passeio consiste em movimentos para cima, para baixo, para esquerda ou para direita de um quadrado. +- O passeio visita cada quadrado exatamente uma vez. +- O passeio termina no canto inferior esquerdo. -The diagram shows one tour over a 4 × 10 board: +O diagrama mostra um passeio sobre um tabuleiro de 4 × 10: -one tour over 4 x 10 board +um passeio sobre o tabuleiro de 4 x 10 -$T(10)$ is 2329. What is $T({10}^{12})$ modulo ${10}^8$? +$T(10)$ é 2329. Qual é $T({10}^{12})$ modulo ${10}^8$? # --hints-- -`toursOnPlayingBoard()` should return `15836928`. +`toursOnPlayingBoard()` deve retornar `15836928`. ```js assert.strictEqual(toursOnPlayingBoard(), 15836928); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-238-infinite-string-tour.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-238-infinite-string-tour.md index 6f49452d838..5744a80013b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-238-infinite-string-tour.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-238-infinite-string-tour.md @@ -1,6 +1,6 @@ --- id: 5900f45b1000cf542c50ff6d -title: 'Problem 238: Infinite string tour' +title: 'Problema 238: Passeio por uma string infinita' challengeType: 1 forumTopicId: 301883 dashedName: problem-238-infinite-string-tour @@ -8,32 +8,32 @@ dashedName: problem-238-infinite-string-tour # --description-- -Create a sequence of numbers using the "Blum Blum Shub" pseudo-random number generator: +Crie uma sequência de números usando o gerador de números pseudoaleatório "Blum Blum Shub": $$ s_0 = 14025256 \\\\ -s_{n + 1} = {s_n}^2 \\; mod \\; 20\\,300\\,713 $$ +s_{n + 1} = {s_n}^2 \\; mod \\; 20.300.713 $$ -Concatenate these numbers $s_0s_1s_2\ldots$ to create a string $w$ of infinite length. Then, $w = 14025256741014958470038053646\ldots$ +Concatene esses números $s_0s_1s_2\ldots$ para criar uma string $w$ de comprimento infinito. Assim, $w = 14025256741014958470038053646\ldots$ -For a positive integer $k$, if no substring of $w$ exists with a sum of digits equal to $k$, $p(k)$ is defined to be zero. If at least one substring of $w$ exists with a sum of digits equal to $k$, we define $p(k) = z$, where $z$ is the starting position of the earliest such substring. +Para um número inteiro positivo $k$, se não existir nenhuma substring de $w$ com uma soma dos algarismos igual a $k$, $p(k)$ é definido como zero. Se pelo menos uma substring de $w$ existir com a soma dos algarismos igual a $k$, nós definimos $p(k) = z$, onde $z$ é a posição de início da primeira substring desse tipo. -For instance: +Por exemplo: -The substrings 1, 14, 1402, … with respective sums of digits equal to 1, 5, 7, … start at position 1, hence $p(1) = p(5) = p(7) = \ldots = 1$. +As substrings 1, 14, 1402, … com as respectivas somas de algarismos iguais a 1, 5, 7, … começam na posição 1, e daí $p(1) = p(5) = p(7) = \ldots = 1$. -The substrings 4, 402, 4025, … with respective sums of digits equal to 4, 6, 11, … start at position 2, hence $p(4) = p(6) = p(11) = \ldots = 2$. +As substrings 4, 402, 4025, … com as respectivas somas de algarismos iguais a 4, 6, 11, … começam na posição 2, e daí $p(4) = p(6) = p(11) = \ldots = 2$. -The substrings 02, 0252, … with respective sums of digits equal to 2, 9, … start at position 3, hence $p(2) = p(9) = \ldots = 3$. +As substrings 02, 0252, … com as respectivas somas de algarismos iguais a 2, 9, … começam na posição 3, e daí $p(2) = p(9) = \ldots = 3$. -Note that substring 025 starting at position 3, has a sum of digits equal to 7, but there was an earlier substring (starting at position 1) with a sum of digits equal to 7, so $p(7) = 1$, not 3. +Observe que a substring 025, começando na posição 3, tem uma soma de algarismos igual a 7, mas havia uma substring anterior (começando na posição 1) com uma soma de algarismos igual a 7, então $p(7) = 1$, não 3. -We can verify that, for $0 < k ≤ {10}^3$, $\sum p(k) = 4742$. +Podemos verificar que, para $0 < k ≤ {10}^3$, $\sum p(k) = 4742$. -Find $\sum p(k)$, for $0 < k ≤ 2 \times {10}^{15}$. +Encontre $\sum p(k)$, por $0 < k ≤ 2 \times {10}^{15}$. # --hints-- -`infiniteStringTour()` should return `9922545104535660`. +`infiniteStringTour()` deve retornar `9922545104535660`. ```js assert.strictEqual(infiniteStringTour(), 9922545104535660); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-239-twenty-two-foolish-primes.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-239-twenty-two-foolish-primes.md index 9fff8274ba8..5e52a8cc4f9 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-239-twenty-two-foolish-primes.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-239-twenty-two-foolish-primes.md @@ -1,6 +1,6 @@ --- id: 5900f45c1000cf542c50ff6e -title: 'Problem 239: Twenty-two Foolish Primes' +title: 'Problema 239: Vinte e dois primos tolos' challengeType: 1 forumTopicId: 301884 dashedName: problem-239-twenty-two-foolish-primes @@ -8,15 +8,15 @@ dashedName: problem-239-twenty-two-foolish-primes # --description-- -A set of disks numbered 1 through 100 are placed in a line in random order. +Um conjunto de discos numerados de 1 a 100 é colocado em uma linha em ordem aleatória. -What is the probability that we have a partial derangement such that exactly 22 prime number discs are found away from their natural positions? (Any number of non-prime disks may also be found in or out of their natural positions.) +Qual é a probabilidade de termos um desvio parcial de tal forma que exatamente 22 discos de números primos sejam retirados de suas posições naturais? Qualquer número de discos não primos também pode ser encontrado em suas posições naturais ou fora dela. -Give your answer rounded to 12 places behind the decimal point in the form 0.abcdefghijkl. +Arredonde sua resposta para até doze casas decimais usando o formato 0.abcdefghijkl. # --hints-- -`twentyTwoFoolishPrimes()` should return `0.001887854841`. +`twentyTwoFoolishPrimes()` deve retornar `0.001887854841`. ```js assert.strictEqual(twentyTwoFoolishPrimes(), 0.001887854841); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-240-top-dice.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-240-top-dice.md index 97f89f17305..731c5baf722 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-240-top-dice.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-240-top-dice.md @@ -1,6 +1,6 @@ --- id: 5900f45d1000cf542c50ff6f -title: 'Problem 240: Top Dice' +title: 'Problema 240: Dados superiores' challengeType: 1 forumTopicId: 301887 dashedName: problem-240-top-dice @@ -8,17 +8,17 @@ dashedName: problem-240-top-dice # --description-- -There are 1111 ways in which five 6-sided dice (sides numbered 1 to 6) can be rolled so that the top three sum to 15. Some examples are: +Há 1111 maneiras pelas quais cinco dados de 6 lados (lados numerados de 1 a 6) podem ser rolados de modo que os três maiores somem 15. Alguns exemplos: $$\begin{align} & D_1,D_2,D_3,D_4,D_5 = 4,3,6,3,5 \\\\ & D_1,D_2,D_3,D_4,D_5 = 4,3,3,5,6 \\\\ & D_1,D_2,D_3,D_4,D_5 = 3,3,3,6,6 \\\\ & D_1,D_2,D_3,D_4,D_5 = 6,6,3,3,3 \end{align}$$ -In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so that the top ten sum to 70? +De quantas maneiras vinte dados de doze lados (lados numerados de 1 a 12) podem ser rolados de modo que a soma dos dez maiores seja 70? # --hints-- -`topDice()` should return `7448717393364182000`. +`topDice()` deve retornar `7448717393364182000`. ```js assert.strictEqual(topDice(), 7448717393364182000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-241-perfection-quotients.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-241-perfection-quotients.md index 492d3f61f8e..a214a013c49 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-241-perfection-quotients.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-241-perfection-quotients.md @@ -1,6 +1,6 @@ --- id: 5900f45d1000cf542c50ff70 -title: 'Problem 241: Perfection Quotients' +title: 'Problema 241: Quociente de perfeição' challengeType: 1 forumTopicId: 301888 dashedName: problem-241-perfection-quotients @@ -8,17 +8,17 @@ dashedName: problem-241-perfection-quotients # --description-- -For a positive integer $n$, let $σ(n)$ be the sum of all divisors of $n$, so e.g. $σ(6) = 1 + 2 + 3 + 6 = 12$. +Para um inteiro positivo $n$, considere $σ(n)$ como a soma de todos os divisores de $n$, por exemplo $σ(6) = 1 + 2 + 3 + 6 = 12$. -A perfect number, as you probably know, is a number with $σ(n) = 2n$. +Um número perfeito, como você provavelmente já sabe, é um número com $σ(n) = 2n$. -Let us define the perfection quotient of a positive integer as $p(n) = \frac{σ(n)}{n}$. +Vamos definir o quociente de perfeição de um inteiro positivo como $p(n) = \frac{σ(n)}{n}$. -Find the sum of all positive integers $n ≤ {10}^{18}$ for which $p(n)$ has the form $k + \frac{1}{2}$, where $k$ is an integer. +Encontre a soma de todos os números inteiros positivos $n ≤ {10}^{18}$ para os quais $p(n)$ tem o formato $k + \frac{1}{2}$, onde $k$ é um número inteiro. # --hints-- -`perfectionQuotients()` should return `482316491800641150`. +`perfectionQuotients()` deve retornar `482316491800641150`. ```js assert.strictEqual(perfectionQuotients(), 482316491800641150); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-242-odd-triplets.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-242-odd-triplets.md index abbcfca2a6a..24c185887c3 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-242-odd-triplets.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-242-odd-triplets.md @@ -1,6 +1,6 @@ --- id: 5900f45f1000cf542c50ff71 -title: 'Problem 242: Odd Triplets' +title: 'Problema 242: Trios de números ímpares' challengeType: 1 forumTopicId: 301889 dashedName: problem-242-odd-triplets @@ -8,17 +8,17 @@ dashedName: problem-242-odd-triplets # --description-- -Given the set {1,2,..., $n$}, we define $f(n, k)$ as the number of its $k$-element subsets with an odd sum of elements. For example, $f(5,3) = 4$, since the set {1,2,3,4,5} has four 3-element subsets having an odd sum of elements, i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}. +Dado o conjunto {1,2,..., $n$}, definimos $f(n, k)$ como o número de seus subconjuntos de $k$ elementos com uma soma ímpar de elementos. Por exemplo, $f(5,3) = 4$, já que o conjunto {1,2,3,4,5} tem quatro subconjuntos de 3 elementos com uma soma ímpar de elementos, sejam eles: {1,2,4}, {1,3,5}, {2,3,4} e {2,4,5}. -When all three values $n$, $k$ and $f(n, k)$ are odd, we say that they make an odd-triplet $[n, k, f(n, k)]$. +Quando todos os três valores de $n$, $k$ e $f(n, k)$ são ímpares, dizemos que eles fazem um trio de ímpares $[n, k, f(n, k)]$. -There are exactly five odd-triplets with $n ≤ 10$, namely: $[1, 1, f(1, 1) = 1]$, $[5, 1, f(5, 1) = 3]$, $[5, 5, f(5, 5) = 1]$, $[9, 1, f(9, 1) = 5]$ and $[9, 9, f(9, 9) = 1]$. +Há exatamente cinco trios de ímpares com $n ≤ 10$. São eles: $[1, 1, f(1, 1) = 1]$, $[5, 1, f(5, 1) = 3]$, $[5, 5, f(5, 5) = 1]$, $[9, 1, f(9, 1) = 5]$ e $[9, 9, f(9, 9) = 1]$. -How many odd-triplets are there with $n ≤ {10}^{12}$? +Quantos trios de ímpares existem com $n ≤ {10}^{12}$? # --hints-- -`oddTriplets()` should return `997104142249036700`. +`oddTriplets()` deve retornar `997104142249036700`. ```js assert.strictEqual(oddTriplets(), 997104142249036700); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-243-resilience.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-243-resilience.md index 67287eac731..1ce7cfbc378 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-243-resilience.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-243-resilience.md @@ -1,6 +1,6 @@ --- id: 5900f4601000cf542c50ff73 -title: 'Problem 243: Resilience' +title: 'Problema 243: Resiliência' challengeType: 1 forumTopicId: 301890 dashedName: problem-243-resilience @@ -8,23 +8,23 @@ dashedName: problem-243-resilience # --description-- -A positive fraction whose numerator is less than its denominator is called a proper fraction. +Uma fração positiva cujo numerador é menor do que o seu denominador é chamada de fração adequada. -For any denominator, $d$, there will be $d−1$ proper fractions; for example, with $d = 12$: +Para qualquer denominador, $d$, haverá $d−1$ frações adequadas; por exemplo, com $d = 12$: $$\frac{1}{12}, \frac{2}{12}, \frac{3}{12}, \frac{4}{12}, \frac{5}{12}, \frac{6}{12}, \frac{7}{12}, \frac{8}{12}, \frac{9}{12}, \frac{10}{12}, \frac{11}{12}$$ -We shall call a fraction that cannot be cancelled down a resilient fraction. +Chamaremos uma fração que não pode ser anulada de uma fração resiliente. -Furthermore we shall define the resilience of a denominator, $R(d)$, to be the ratio of its proper fractions that are resilient; for example, $R(12) = \frac{4}{11}$. +Além disso, definiremos a resiliência de um denominador, $R(d)$, como a razão entre suas frações adequadas que são resilientes; por exemplo, $R(12) = \frac{4}{11}$. -In fact, $d = 12$ is the smallest denominator having a resilience $R(d) < \frac{4}{10}$. +De fato, $d = 12$ é o menor denominador que tem uma resiliência $R(d) < \frac{4}{10}$. -Find the smallest denominator $d$, having a resilience $R(d) < \frac{15\\,499}{94\\,744}$. +Encontre o menor denominador $d$, tendo uma resiliência $R(d) < \frac{15.499}{94.744}$. # --hints-- -`resilience()` should return `892371480`. +`resilience()` deve retornar `892371480`. ```js assert.strictEqual(resilience(), 892371480); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-244-sliders.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-244-sliders.md index ebe4a76b838..751e6368494 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-244-sliders.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-244-sliders.md @@ -1,6 +1,6 @@ --- id: 5900f4601000cf542c50ff72 -title: 'Problem 244: Sliders' +title: 'Problema 244: Blocos deslizantes' challengeType: 1 forumTopicId: 301891 dashedName: problem-244-sliders @@ -8,31 +8,31 @@ dashedName: problem-244-sliders # --description-- -You probably know the game Fifteen Puzzle. Here, instead of numbered tiles, we have seven red tiles and eight blue tiles. +Você provavelmente conhece o Jogo do Quinze. Aqui, em vez de blocos numerados, temos sete blocos vermelhos e oito blocos azuis. -A move is denoted by the uppercase initial of the direction (Left, Right, Up, Down) in which the tile is slid, e.g. starting from configuration ($S$), by the sequence $LULUR$ we reach the configuration ($E$): +Um movimento é indicado pela primeira letra maiúscula da direção (Left - Esquerda, Right - Direita, Up - Acima e Down - Abaixo) na qual o bloco é deslizado, ou seja, a partir da configuração ($S$), pela sequência $LULUR$ que chegamos à configuração ($E$): -($S$) configuration S, ($E$) configuration E +($S$) configuration S, ($E$) configuração E -For each path, its checksum is calculated by (pseudocode): +Para cada caminho, seu valor de verificação é calculado por (pseudocódigo): $$\begin{align} & \text{checksum} = 0 \\\\ & \text{checksum} = (\text{checksum} × 243 + m_1) \\; \text{mod} \\; 100\\,000\\,007 \\\\ & \text{checksum} = (\text{checksum} × 243 + m_2) \\; \text{mod} \\; 100\\,000\\,007 \\\\ & \ldots \\\\ & \text{checksum} = (\text{checksum} × 243 + m_n) \\; \text{mod} \\; 100\\,000\\,007 \end{align}$$ -where $m_k$ is the ASCII value of the $k^{\text{th}}$ letter in the move sequence and the ASCII values for the moves are: +onde $m_k$ é o valor ASCII da $k^{\text{a}}$ letra na sequência de movimento e os valores ASCII dos movimentos são: $$\begin{array}{|c|c|} \hline L & 76 \\\\ \hline R & 82 \\\\ \hline U & 85 \\\\ \hline D & 68 \\\\ \hline \end{array}$$ -For the sequence $LULUR$ given above, the checksum would be 19761398. Now, starting from configuration ($S$), find all shortest ways to reach configuration ($T$). +Para a sequência $LULUR$ dada acima, o checksum seria 19761398. Agora, começando pela configuração ($S$), encontre todas as formas mais curtas para chegar à configuração ($T$). -($S$) configuration S, ($T$) configuration T +($S$) configuration S, ($T$) configuração T -What is the sum of all checksums for the paths having the minimal length? +Qual é a soma de todas as somas de checksums para os percursos de menor comprimento? # --hints-- -`sliders()` should return `96356848`. +`sliders()` deve retornar `96356848`. ```js assert.strictEqual(sliders(), 96356848); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-245-coresilience.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-245-coresilience.md index c3e090d0edb..712845f3cd3 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-245-coresilience.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-245-coresilience.md @@ -1,6 +1,6 @@ --- id: 5900f4621000cf542c50ff74 -title: 'Problem 245: Coresilience' +title: 'Problema 245: Corresiliência' challengeType: 1 forumTopicId: 301892 dashedName: problem-245-coresilience @@ -8,21 +8,21 @@ dashedName: problem-245-coresilience # --description-- -We shall call a fraction that cannot be cancelled down a resilient fraction. +Chamaremos uma fração que não pode ser anulada de uma fração resiliente. -Furthermore we shall define the resilience of a denominator, $R(d)$, to be the ratio of its proper fractions that are resilient; for example, $R(12) = \frac{4}{11}$. +Além disso, definiremos a resiliência de um denominador, $R(d)$, como a razão entre suas frações adequadas que são resilientes; por exemplo, $R(12) = \frac{4}{11}$. -The resilience of a number $d > 1$ is then $\frac{φ(d)}{d − 1}$ , where $φ$ is Euler's totient function. +A resiliência de um número $d > 1$ é então $\frac{φ(d)}{d − 1}$, onde $φ$ é a função totiente de Euler. -We further define the coresilience of a number $n > 1$ as $C(n) = \frac{n − φ(n)}{n − 1}$. +Também definiremos a corresiliência de um número $n > 1$ como $C(n) = \frac{n − φ(n)}{n − 1}$. -The coresilience of a prime $p$ is $C(p) = \frac{1}{p − 1}$. +A corresiliência de um número primo $p$ é $C(p) = \frac{1}{p − 1}$. -Find the sum of all composite integers $1 < n ≤ 2 × {10}^{11}$, for which $C(n)$ is a unit fraction. +Encontre a soma de todos os números inteiros compostos $1 < n ≤ 2 × {10}^{11}$, para os quais $C(n)$ é uma fração unitária. # --hints-- -`coresilience()` should return `288084712410001`. +`coresilience()` deve retornar `288084712410001`. ```js assert.strictEqual(coresilience(), 288084712410001); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-246-tangents-to-an-ellipse.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-246-tangents-to-an-ellipse.md index 16c5d89e23b..f8d94636759 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-246-tangents-to-an-ellipse.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-246-tangents-to-an-ellipse.md @@ -1,6 +1,6 @@ --- id: 5900f4621000cf542c50ff75 -title: 'Problem 246: Tangents to an ellipse' +title: 'Problema 246: Tangentes de uma elipse' challengeType: 1 forumTopicId: 301893 dashedName: problem-246-tangents-to-an-ellipse @@ -8,31 +8,31 @@ dashedName: problem-246-tangents-to-an-ellipse # --description-- -A definition for an ellipse is: +Uma definição para uma elipse é: -Given a circle $c$ with centre $M$ and radius $r$ and a point $G$ such that $d(G, M) < r$, the locus of the points that are equidistant from $c$ and $G$ form an ellipse. +Dado um círculo $c$ com centro $M$ e raio $r$, além de um ponto $G$ tal que $d(G, M) < r$, o local dos pontos que estão equidistantes de $c$ e $G$ formam uma elipse. -The construction of the points of the ellipse is shown below. +A construção dos pontos da elipse é mostrada abaixo. -animation of ellipse construction +animação de construção da elipse -Given are the points $M(-2000, 1500)$ and $G(8000, 1500)$. +São dados os pontos $M(-2000, 1500)$ e $G(8000, 1500)$. -Given is also the circle $c$ with centre $M$ and radius $15\\,000$. +Também é dado o círculo $c$ com centro $M$ e raio $15.000$. -The locus of the points that are equidistant from $G$ and $c$ form an ellipse $e$. +A localidade dos pontos que estão equidistantes de $G$ e $c$ forma uma elipse $e$. -From a point $P$ outside $e$ the two tangents $t_1$ and $t_2$ to the ellipse are drawn. +De um ponto $P$ fora de $e$, as duas tangentes $t_1$ e $t_2$ da elipse são desenhadas. -Let the points where $t_1$ and $t_2$ touch the ellipse be $R$ and $S$. +Considere os pontos em que $t_1$ e $t_2$ tocam a elipse como $R$ e $S$. -circle c with the centre M, radius 15000, and point P outsie of ellipse e; from point P two tangents t_1 and t_2 are drawn to the ellipse, with points touching ellipse are R and S +círculo c com o centro M, raio 15000 e ponto P fora da elipse; do ponto P, duas tangentes t_1 e t_2 são desenhadas para a elipse, com pontos que a tocam chamados R e S -For how many lattice points $P$ is angle $RPS$ greater than 45°? +Para quantos pontos da rede $P$ é um ângulo $RPS$ maior que 45°? # --hints-- -`tangentsToAnEllipse()` should return `810834388`. +`tangentsToAnEllipse()` deve retornar `810834388`. ```js assert.strictEqual(tangentsToAnEllipse(), 810834388); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-247-squares-under-a-hyperbola.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-247-squares-under-a-hyperbola.md index d84036f8701..8d13a569691 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-247-squares-under-a-hyperbola.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-247-squares-under-a-hyperbola.md @@ -1,6 +1,6 @@ --- id: 5900f4641000cf542c50ff76 -title: 'Problem 247: Squares under a hyperbola' +title: 'Problema 247: Quadrados sob uma hipérbole' challengeType: 1 forumTopicId: 301894 dashedName: problem-247-squares-under-a-hyperbola @@ -8,29 +8,29 @@ dashedName: problem-247-squares-under-a-hyperbola # --description-- -Consider the region constrained by $1 ≤ x$ and $0 ≤ y ≤ \frac{1}{x}$. +Considere a região restringida por $1 ≤ x$ e $0 ≤ y ≤ \frac{1}{x}$. -Let $S_1$ be the largest square that can fit under the curve. +Considere $S_1$ como o maior quadrado que pode caber sob a curva. -Let $S_2$ be the largest square that fits in the remaining area, and so on. +Considere $S_2$ como o maior quadrado que cabe na área restante e assim por diante. -Let the index of $S_n$ be the pair (left, below) indicating the number of squares to the left of $S_n$ and the number of squares below $S_n$. +Considere o índice de $S_n$ como o par (esquerda, abaixo) indicando o número de quadrados à esquerda de $S_n$ e o número de quadrados abaixo de $S_n$. -diagram with squares under the hyperbola +diagrama com quadrados sob a hipérbole -The diagram shows some such squares labelled by number. +O diagrama mostra alguns desses quadrados rotulados por número. -$S_2$ has one square to its left and none below, so the index of $S_2$ is (1, 0). +$S_2$ tem um quadrado à sua esquerda e nenhum abaixo, então o índice de $S_2$ é (1, 0). -It can be seen that the index of $S_{32}$ is (1,1) as is the index of $S_{50}$. +Podemos ver que o índice de $S_{32}$ é (1,1) como é o índice de $S_{50}$. -50 is the largest $n$ for which the index of $S_n$ is (1, 1). +50 é o maior $n$ para o qual o índice de $S_n$ é (1, 1). -What is the largest $n$ for which the index of $S_n$ is (3, 3)? +3 é o maior $n$ para o qual o índice de $S_n$ é (3, 3)? # --hints-- -`squaresUnderAHyperbola()` should return `782252`. +`squaresUnderAHyperbola()` deve retornar `782252`. ```js assert.strictEqual(squaresUnderAHyperbola(), 782252); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-248-numbers-for-which-eulers-totient-function-equals-13.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-248-numbers-for-which-eulers-totient-function-equals-13.md index 0df6dd5226a..c9b9a3f51f0 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-248-numbers-for-which-eulers-totient-function-equals-13.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-248-numbers-for-which-eulers-totient-function-equals-13.md @@ -1,6 +1,6 @@ --- id: 5900f4651000cf542c50ff77 -title: 'Problem 248: Numbers for which Euler’s totient function equals 13!' +title: 'Problema 248: Números para os quais a função totiente de Euler é igual a 13!' challengeType: 1 forumTopicId: 301895 dashedName: problem-248-numbers-for-which-eulers-totient-function-equals-13 @@ -8,13 +8,13 @@ dashedName: problem-248-numbers-for-which-eulers-totient-function-equals-13 # --description-- -The first number $n$ for which $φ(n) = 13!$ is $6\\,227\\,180\\,929$. +O primeiro número $n$ para o qual $φ(n) = 13!$ é $6.227.180.929$. -Find the ${150\\,000}^{\text{th}}$ such number. +Encontre o ${150.000}^{\text{o}}$ número desse tipo. # --hints-- -`eulersTotientFunctionEquals()` should return `23507044290`. +`eulersTotientFunctionEquals()` deve retornar `23507044290`. ```js assert.strictEqual(eulersTotientFunctionEquals(), 23507044290); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-249-prime-subset-sums.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-249-prime-subset-sums.md index 09232c7c178..cb91c169073 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-249-prime-subset-sums.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-249-prime-subset-sums.md @@ -1,6 +1,6 @@ --- id: 5900f4671000cf542c50ff79 -title: 'Problem 249: Prime Subset Sums' +title: 'Problema 249: Soma de subconjuntos de números primos' challengeType: 1 forumTopicId: 301896 dashedName: problem-249-prime-subset-sums @@ -8,15 +8,15 @@ dashedName: problem-249-prime-subset-sums # --description-- -Let $S = \\{2, 3, 5, \ldots, 4999\\}$ be the set of prime numbers less than 5000. +Considere $S = \\{2, 3, 5, \ldots, 4999\\}$ como o conjunto de números primos menores que 5000. -Find the number of subsets of $S$, the sum of whose elements is a prime number. +Encontre o número de subconjuntos de $S$, cuja soma dos elementos é um número primo. -Enter the rightmost 16 digits as your answer. +Insira os 16 algarismos mais à direita para sua resposta. # --hints-- -`primeSubsetSums()` should return `9275262564250418`. +`primeSubsetSums()` deve retornar `9275262564250418`. ```js assert.strictEqual(primeSubsetSums(), 9275262564250418); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-250-250250.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-250-250250.md index c526154b6e7..819e157241e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-250-250250.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-250-250250.md @@ -1,6 +1,6 @@ --- id: 5900f4661000cf542c50ff78 -title: 'Problem 250: 250250' +title: 'Problema 250: 250250' challengeType: 1 forumTopicId: 301898 dashedName: problem-250-250250 @@ -8,11 +8,11 @@ dashedName: problem-250-250250 # --description-- -Find the number of non-empty subsets of $\\{{1}^{1}, {2}^{2}, {3}^{3}, \ldots, {250250}^{250250}\\}$, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer. +Encontre o número de subconjuntos não vazios de $\\{{1}^{1}, {2}^{2}, {3}^{3}, \ldots, {250250}^{250250}\\}$ cuja soma de elementos é divisível por 250. Insira os 16 algarismos mais à direita para sua resposta. # --hints-- -`twoHundredFifty()` should return `1425480602091519`. +`twoHundredFifty()` deve retornar `1425480602091519`. ```js assert.strictEqual(twoHundredFifty(), 1425480602091519); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-251-cardano-triplets.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-251-cardano-triplets.md index 8f4013595f3..dea6bec4adf 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-251-cardano-triplets.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-251-cardano-triplets.md @@ -1,6 +1,6 @@ --- id: 5900f4671000cf542c50ff7a -title: 'Problem 251: Cardano Triplets' +title: 'Problema 251: Trios de Cardano' challengeType: 1 forumTopicId: 301899 dashedName: problem-251-cardano-triplets @@ -8,19 +8,19 @@ dashedName: problem-251-cardano-triplets # --description-- -A triplet of positive integers ($a$,$b$,$c$) is called a Cardano Triplet if it satisfies the condition: +Um trio de números inteiros positivos ($a$,$b$,$c$) é chamado de trio de Cardano se satisfizer a condição: $$\sqrt[3]{a + b \sqrt{c}} + \sqrt[3]{a - b \sqrt{c}} = 1$$ -For example, (2,1,5) is a Cardano Triplet. +Por exemplo, (2,1,5) é um trio de Cardano. -There exist 149 Cardano Triplets for which $a + b + c ≤ 1000$. +Há 149 trios de Cardano para os quais $a + b + c ≤ 1000$. -Find how many Cardano Triplets exist such that $a + b + c ≤ 110\\,000\\,000$. +Encontre quantos trios de Cardano existem tal que $a + b + c ≤ 110.000.000$. # --hints-- -`cardanoTriplets()` should return `18946051`. +`cardanoTriplets()` deve retornar `18946051`. ```js assert.strictEqual(cardanoTriplets(), 18946051); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-252-convex-holes.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-252-convex-holes.md index ec671c067aa..9e02391c9bd 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-252-convex-holes.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-252-convex-holes.md @@ -1,6 +1,6 @@ --- id: 5900f4691000cf542c50ff7b -title: 'Problem 252: Convex Holes' +title: 'Problema 252: Orifícios convexos' challengeType: 1 forumTopicId: 301900 dashedName: problem-252-convex-holes @@ -8,24 +8,24 @@ dashedName: problem-252-convex-holes # --description-- -Given a set of points on a plane, we define a convex hole to be a convex polygon having as vertices any of the given points and not containing any of the given points in its interior (in addition to the vertices, other given points may lie on the perimeter of the polygon). +Dado um conjunto de pontos em um plano, definimos um orifício convexo como um polígono convexo que tenha como vértices qualquer um dos pontos dados e não contenha nenhum dos pontos dados em seu interior (além dos vértices, outros pontos dados podem estar no perímetro do polígono). -As an example, the image below shows a set of twenty points and a few such convex holes. The convex hole shown as a red heptagon has an area equal to 1049694.5 square units, which is the highest possible area for a convex hole on the given set of points. +Como exemplo, a imagem abaixo apresenta um conjunto de vinte pontos e alguns desses orifícios convexos. O orifício convexo mostrado como um heptágono vermelho tem uma área igual a 1049694,5 unidades quadradas, que é a maior área possível para um orifício convexo no conjunto de pontos fornecido. -set of twenty points and convex holes on plane +conjunto de vinte pontos e orifícios convexos no plano -For our example, we used the first 20 points ($T_{2k − 1}$, $T_{2k}$), for $k = 1, 2, \ldots, 20$, produced with the pseudo-random number generator: +Para nosso exemplo, usamos os primeiros 20 pontos ($T_{2k − 1}$, $T_{2k}$), para $k = 1, 2, \ldots, 20$, produzidos com o gerador de números pseudoaleatório: -$$\begin{align} S_0 & = 290\\,797 \\\\ - S_{n+1} & = {S_n}^2 \\; \text{mod} \\; 50\\,515\\,093 \\\\ T_n & = (S_n \\; \text{mod} \\; 2000) − 1000 \end{align}$$ +$$\begin{align} S_0 & = 290.797 \\\\ + S_{n+1} & = {S_n}^2 \\; \text{mod} \\; 50.515.093 \\\\ T_n & = (S_n \\; \text{mod} \\; 2000) − 1000 \end{align}$$ -i.e. (527, 144), (−488, 732), (−454, −947), … +por exemplo: (527, 144), (-488, 732), (-454, − 947), … -What is the maximum area for a convex hole on the set containing the first 500 points in the pseudo-random sequence? Specify your answer including one digit after the decimal point. +Qual é a área máxima para um orifício convexo no conjunto que contém os primeiros 500 pontos da sequência pseudoaleatória? Dê sua resposta com 1 algarismo após o ponto (1 casa depois da vírgula). # --hints-- -`convexHoles()` should return `104924`. +`convexHoles()` deve retornar `104924`. ```js assert.strictEqual(convexHoles(), 104924); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-254-sums-of-digit-factorials.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-254-sums-of-digit-factorials.md index 3d91777d0a4..815f86b51a4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-254-sums-of-digit-factorials.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-254-sums-of-digit-factorials.md @@ -1,6 +1,6 @@ --- id: 5900f46b1000cf542c50ff7d -title: 'Problem 254: Sums of Digit Factorials' +title: 'Problema 254: Soma de algarismos fatoriais' challengeType: 1 forumTopicId: 301902 dashedName: problem-254-sums-of-digit-factorials @@ -8,21 +8,21 @@ dashedName: problem-254-sums-of-digit-factorials # --description-- -Define $f(n)$ as the sum of the factorials of the digits of $n$. For example, $f(342) = 3! + 4! + 2! = 32$. +Defina $f(n)$ como a soma dos fatoriais dos algarismos de $n$. Por exemplo, $f(342) = 3! + 4! + 2! = 32$. -Define $sf(n)$ as the sum of the digits of $f(n)$. So $sf(342) = 3 + 2 = 5$. +Defina $sf(n)$ como a soma dos algarismos de $f(n)$. Então, $sf(342) = 3 + 2 = 5$. -Define $g(i)$ to be the smallest positive integer $n$ such that $sf(n) = i$. Though $sf(342)$ is 5, $sf(25)$ is also 5, and it can be verified that $g(5)$ is 25. +Defina $g(i)$ como o menor número inteiro positivo $n$, tal que $sf(n) = i$. Embora $sf(342)$ seja 5, $sf(25)$ também é 5. Além disso, pode-se verificar que $g(5)$ é 25. -Define $sg(i)$ as the sum of the digits of $g(i)$. So $sg(5) = 2 + 5 = 7$. +Defina $sg(i)$ como a soma dos algarismos de $g(i)$. Então, $sg(5) = 2 + 5 = 7$. -Further, it can be verified that $g(20)$ is 267 and $\sum sg(i)$ for $1 ≤ i ≤ 20$ is 156. +Além disso, pode ser verificado que $g(20)$ é 267 e $\sum sg(i)$ para $1 ≤ i ≤ 20$ é 156. -What is $\sum sg(i)$ for $1 ≤ i ≤ 150$? +Qual é a $\sum sg(i)$ para $1 ≤ n ≤ 150$? # --hints-- -`sumsOfDigitFactorials()` should return `8184523820510`. +`sumsOfDigitFactorials()` deve retornar `8184523820510`. ```js assert.strictEqual(sumsOfDigitFactorials(), 8184523820510); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-255-rounded-square-roots.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-255-rounded-square-roots.md index abfbcfe2047..147907bd506 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-255-rounded-square-roots.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-255-rounded-square-roots.md @@ -1,6 +1,6 @@ --- id: 5900f46d1000cf542c50ff7f -title: 'Problem 255: Rounded Square Roots' +title: 'Problema 255: Raízes quadradas arredondadas' challengeType: 1 forumTopicId: 301903 dashedName: problem-255-rounded-square-roots @@ -8,40 +8,40 @@ dashedName: problem-255-rounded-square-roots # --description-- -We define the rounded-square-root of a positive integer $n$ as the square root of $n$ rounded to the nearest integer. +Definimos a raiz quadrada arredondada de um número inteiro positivo $n$ como a raiz quadrada de $n$ arredondada para o número inteiro mais próximo. -The following procedure (essentially Heron's method adapted to integer arithmetic) finds the rounded-square-root of $n$: +O procedimento a seguir (essencialmente, o método de Heron adaptado para a aritmética de números inteiros) encontra a raiz arredondada de $n$: -Let $d$ be the number of digits of the number $n$. +Considere $d$ como o número de algarismos do número $n$. -If $d$ is odd, set $x_0 = 2 × {10}^{\frac{d - 1}{2}}$. +Se $d$ for ímpar, defina $x_0 = 2 × {10}^{\frac{d - 1}{2}}$. -If $d$ is even, set $x_0 = 7 × {10}^{\frac{d - 2}{2}}$. +Se $d$ for par, defina $x_0 = 7 × {10}^{\frac{d - 2}{2}}$. -Repeat: +Repita: $$x_{k + 1} = \left\lfloor\frac{x_k + \left\lceil\frac{n}{x_k}\right\rceil}{2}\right\rfloor$$ -until $x_{k + 1} = x_k$. +até $x_{k + 1} = x_k$. -As an example, let us find the rounded-square-root of $n = 4321$. +Como exemplo, vamos encontrar a raiz quadrada arredondada de $n = 4321$. -$n$ has 4 digits, so $x_0 = 7 × {10}^{\frac{4-2}{2}} = 70$. +$n$ tem 4 algarismos, então $x_0 = 7 × {10}^{\frac{4-2}{2}} = 70$. $$x_1 = \left\lfloor\frac{70 + \left\lceil\frac{4321}{70}\right\rceil}{2}\right\rfloor = 66 \\\\ x_2 = \left\lfloor\frac{66 + \left\lceil\frac{4321}{66}\right\rceil}{2}\right\rfloor = 66$$ -Since $x_2 = x_1$, we stop here. So, after just two iterations, we have found that the rounded-square-root of 4321 is 66 (the actual square root is 65.7343137…). +Como $x_2 = x_1$, paramos aqui. Então, depois de apenas duas iterações, descobrimos que a raiz arredondada de 4321 é 66 (a raiz quadrada real é 65.7343137…). -The number of iterations required when using this method is surprisingly low. For example, we can find the rounded-square-root of a 5-digit integer ($10\\,000 ≤ n ≤ 99\\,999$) with an average of 3.2102888889 iterations (the average value was rounded to 10 decimal places). +O número de iterações necessárias ao usar este método é surpreendentemente baixo. Por exemplo, podemos encontrar a raiz quadrada arredondada de um inteiro de 5 algarismos ($10.000 ≤ n ≤ 99.999$) com uma média de 3,2102888889 iterações (o valor médio foi arredondado para 10 casas decimais). -Using the procedure described above, what is the average number of iterations required to find the rounded-square-root of a 14-digit number (${10}^{13} ≤ n < {10}^{14}$)? Give your answer rounded to 10 decimal places. +Usando o procedimento descrito acima, qual é o número médio de iterações necessárias para encontrar a raiz quadrada arredondada de um número de 14 algarismos (${10}^{13} ≤ n < {10}^{14}$)? Dê sua resposta arredondada para 10 casas decimais. -**Note:** The symbols $⌊x⌋$ and $⌈x⌉$ represent the floor function and ceiling function respectively. +**Observação:** os símbolos $⌊x⌋$ e $⌈x⌉$ representam as funções piso e teto, respectivamente. # --hints-- -`roundedSquareRoots()` should return `4.447401118`. +`roundedSquareRoots()` deve retornar `4.447401118`. ```js assert.strictEqual(roundedSquareRoots(), 4.447401118); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-256-tatami-free-rooms.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-256-tatami-free-rooms.md index 170443188b8..09d54ac6605 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-256-tatami-free-rooms.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-256-tatami-free-rooms.md @@ -1,6 +1,6 @@ --- id: 5900f46c1000cf542c50ff7e -title: 'Problem 256: Tatami-Free Rooms' +title: 'Problema 256: Cômodos sem tatami' challengeType: 1 forumTopicId: 301904 dashedName: problem-256-tatami-free-rooms @@ -8,29 +8,29 @@ dashedName: problem-256-tatami-free-rooms # --description-- -Tatami are rectangular mats, used to completely cover the floor of a room, without overlap. +Tatamis são tapetes retangulares, usados para cobrir completamente o piso de um cômodo, sem sobreposição. -Assuming that the only type of available tatami has dimensions 1×2, there are obviously some limitations for the shape and size of the rooms that can be covered. +Assumindo que o único tipo de tatami disponível tem dimensões de 1×2, existem, obviamente, algumas limitações quanto à forma e tamanho dos cômodos que podem ser cobertos. -For this problem, we consider only rectangular rooms with integer dimensions $a$, $b$ and even size $s = a \times b$. We use the term 'size' to denote the floor surface area of the room, and — without loss of generality — we add the condition $a ≤ b$. +Para esse problema, consideramos apenas cômodos retangulares com dimensões inteiras $a$, $b$ e tamanho $s = a \times b$. Usamos o termo 'tamanho' para indicar a área de superfície do chão do cômodo e — sem perda de generalidade — adicionamos a condição de que $a ≤ b$. -There is one rule to follow when laying out tatami: there must be no points where corners of four different mats meet. For example, consider the two arrangements below for a 4×4 room: +Há uma regra a seguir quando se monta o tatami: não pode haver pontos onde se encontrem cantos de quatro tapetes diferentes. Por exemplo, considere as duas disposições abaixo para um cômodo de 4×4: -two arrangements of mats in 4x4 room +dois arranjos de tapetes em um cômodo de 4x4 -The arrangement on the left is acceptable, whereas the one on the right is not: a red "X" in the middle, marks the point where four tatami meet. +O arranjo da esquerda é aceitável, enquanto o da direita não é: um "X" vermelho no meio, marca o ponto onde quatro tatamis se encontram. -Because of this rule, certain even-sized rooms cannot be covered with tatami: we call them tatami-free rooms. Further, we define $T(s)$ as the number of tatami-free rooms of size $s$. +Devido a esta regra, alguns cômodos de mesmo tamanho não podem ser cobertos por tatami: damos a eles o nome de cômodos sem tatami. Além disso, definimos $T(s)$ como o número de cômodos sem tatami no tamanho $s$. -The smallest tatami-free room has size $s = 70$ and dimensions 7×10. All the other rooms of size $s = 70$ can be covered with tatami; they are: 1×70, 2×35 and 5×14. Hence, $T(70) = 1$. +O menor cômodo sem tatami tem tamanho $s = 70$ e dimensões de 7×10. Todos os outros cômodos do tamanho $s = 70$ podem ser cobertos com tatami; eles são: 1×70, 2×35 e 5×14. Portanto, $T(70) = 1$. -Similarly, we can verify that $T(1320) = 5$ because there are exactly 5 tatami-free rooms of size $s = 1320$: 20×66, 22×60, 24×55, 30×44 and 33×40. In fact, $s = 1320$ is the smallest room-size $s$ for which $T(s) = 5$. +Da mesma forma, podemos verificar que $T(1320) = 5$ porque há exatamente 5 cômodos sem tatami $s = 1320$: 20×66, 22×60, 24×55, 30×44 e 33×40. Na verdade, $s = 1320$ é o menor tamanho de cômodo $s$ para o qual $T(s) = 5$. -Find the smallest room-size $s$ for which $T(s) = 200$. +Encontre o menor tamanho de cômodo $s$ para o qual $T(s) = 200$. # --hints-- -`tatamiFreeRooms()` should return `85765680`. +`tatamiFreeRooms()` deve retornar `85765680`. ```js assert.strictEqual(tatamiFreeRooms(), 85765680); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-257-angular-bisectors.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-257-angular-bisectors.md index 60864ac52e1..955ac401135 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-257-angular-bisectors.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-257-angular-bisectors.md @@ -1,6 +1,6 @@ --- id: 5900f46e1000cf542c50ff80 -title: 'Problem 257: Angular Bisectors' +title: 'Problema 257: Bissetores angulares' challengeType: 1 forumTopicId: 301905 dashedName: problem-257-angular-bisectors @@ -8,19 +8,19 @@ dashedName: problem-257-angular-bisectors # --description-- -Given is an integer sided triangle $ABC$ with sides $a ≤ b ≤ c$ ($AB = c$, $BC = a$ and $AC = b$). +É fornecido um triângulo de lado inteiro $ABC$ com lados $a ≤ b ≤ c$ ($AB = c$, $BC = a$ e $AC = b$). -The angular bisectors of the triangle intersect the sides at points $E$, $F$ and $G$ (see picture below). +Os bissetores angulares do triângulo cruzam os lados nos pontos $E$, $F$ e $G$ (veja a imagem abaixo). -triangle ABC, with angular bisectors intersecting sides at the points E, F and G +triângulo ABC, com bissetores angulares que se cruzam com os lados nos pontos E, F e G -The segments $EF$, $EG$ and $FG$ partition the triangle $ABC$ into four smaller triangles: $AEG$, $BFE$, $CGF$ and $EFG$. It can be proven that for each of these four triangles the ratio $\frac{\text{area}(ABC)}{\text{area}(\text{subtriangle})}$ is rational. However, there exist triangles for which some or all of these ratios are integral. +Os segmentos $EF$, $EG$ e $FG$ particionam o triângulo $ABC$ em quatro triângulos menores: $AEG$, $BFE$, $CGF$ e $EFG$. Pode ser provado que, para cada um desses quatro triângulos, a razão $\frac{\text{área}(ABC)}{\text{área}(\text{subtriângulo})}$ é racional. No entanto, existem triângulos para os quais algumas ou todas essas razões são inteiras. -How many triangles $ABC$ with perimeter $≤ 100\\,000\\,000$ exist so that the ratio $\frac{\text{area}(ABC)}{\text{area}(AEG)}$ is integral? +Quantos triângulos $ABC$ com o perímetro $^\\100.000.000$ existem para que a razão $\frac{\text{área}(ABC)}{\text{área}(AEG)}$ seja integral? # --hints-- -`angularBisectors()` should return `139012411`. +`angularBisectors()` deve retornar `139012411`. ```js assert.strictEqual(angularBisectors(), 139012411); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-258-a-lagged-fibonacci-sequence.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-258-a-lagged-fibonacci-sequence.md index d21eb673b78..d99ac6f6ba6 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-258-a-lagged-fibonacci-sequence.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-258-a-lagged-fibonacci-sequence.md @@ -1,6 +1,6 @@ --- id: 5900f46e1000cf542c50ff81 -title: 'Problem 258: A lagged Fibonacci sequence' +title: 'Problema 258: Uma sequência de Fibonacci com atraso' challengeType: 1 forumTopicId: 301906 dashedName: problem-258-a-lagged-fibonacci-sequence @@ -8,16 +8,16 @@ dashedName: problem-258-a-lagged-fibonacci-sequence # --description-- -A sequence is defined as: +Uma sequência é definida como: -- $g_k = 1$, for $0 ≤ k ≤ 1999$ -- $g_k = g_{k - 2000} + g_{k - 1999}$, for $k ≥ 2000$. +- $g_k = 1$, para $0 ≤ k ≤ 1999$ +- $g_k = g_{k - 2000} + g_{k - 1999}$, para $k ≥ 2000$. -Find $g_k$ mod 20092010 for $k = {10}^{18}$. +Encontre $g_k$ mod 20092010 para $k = {10}^{18}$. # --hints-- -`laggedFibonacciSequence()` should return `12747994`. +`laggedFibonacciSequence()` deve retornar `12747994`. ```js assert.strictEqual(laggedFibonacciSequence(), 12747994); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-261-pivotal-square-sums.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-261-pivotal-square-sums.md index af6e1b5aa27..2dbe378d547 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-261-pivotal-square-sums.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-261-pivotal-square-sums.md @@ -1,6 +1,6 @@ --- id: 5900f4711000cf542c50ff84 -title: 'Problem 261: Pivotal Square Sums' +title: 'Problema 261: Soma dos quadrados pivotais' challengeType: 1 forumTopicId: 301910 dashedName: problem-261-pivotal-square-sums @@ -8,21 +8,21 @@ dashedName: problem-261-pivotal-square-sums # --description-- -Let us call a positive integer $k$ a square-pivot, if there is a pair of integers $m > 0$ and $n ≥ k$, such that the sum of the ($m + 1$) consecutive squares up to $k$ equals the sum of the $m$ consecutive squares from ($n + 1$) on: +Vamos chamar um número inteiro positivo $k$ de um quadrado pivotal se houver um par de números inteiros $m > 0$ e $n ≥ k$, tal que a soma dos quadrados consecutivos ($m + 1$) até $k$ é igual a soma dos $m$ quadrados consecutivos de ($n + 1$) em: $${(k - m)}^2 + \ldots + k^2 = {(n + 1)}^2 + \ldots + {(n + m)}^2$$ -Some small square-pivots are +Alguns quadrados pivotais pequenos são $$\begin{align} & \mathbf{4}: 3^2 + \mathbf{4}^2 = 5^2 \\\\ & \mathbf{21}: {20}^2 + \mathbf{21}^2 = {29}^2 \\\\ & \mathbf{24}: {21}^2 + {22}^2 + {23}^2 + \mathbf{24}^2 = {25}^2 + {26}^2 + {27}^2 \\\\ & \mathbf{110}: {108}^2 + {109}^2 + \mathbf{110}^2 = {133}^2 + {134}^2 \\\\ \end{align}$$ -Find the sum of all distinct square-pivots $≤ {10}^{10}$. +Encontre a soma de todos os quadrados pivotais distintos $≤ {10}^{10}$. # --hints-- -`pivotalSquareSums()` should return `238890850232021`. +`pivotalSquareSums()` deve retornar `238890850232021`. ```js assert.strictEqual(pivotalSquareSums(), 238890850232021); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-262-mountain-range.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-262-mountain-range.md index d340e834fa6..cf44c86a9fb 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-262-mountain-range.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-262-mountain-range.md @@ -1,6 +1,6 @@ --- id: 5900f4731000cf542c50ff85 -title: 'Problem 262: Mountain Range' +title: 'Problema 262: Cadeia de montanhas' challengeType: 1 forumTopicId: 301911 dashedName: problem-262-mountain-range @@ -8,23 +8,23 @@ dashedName: problem-262-mountain-range # --description-- -The following equation represents the continuous topography of a mountainous region, giving the elevation $h$ at any point ($x$,$y$): +A seguinte equação representa a topografia contínua de uma região montanhosa, dando a elevação $h$ em qualquer ponto ($x$,$y$): $$h = \left(5000 - \frac{x^2 + y^2 + xy}{200} + \frac{25(x + y)}{2}\right) \times e^{-\left|\frac{x^2 + y^2}{1\\,000\\,000} - \frac{3(x + y)}{2000} + \frac{7}{10}\right|}$$ -A mosquito intends to fly from A(200,200) to B(1400,1400), without leaving the area given by $0 ≤ x$, $y ≤ 1600$. +Um mosquito pretende voar de A(200,200) para B(1400,1400), sem sair da área dada por $0 ≤ x$, $y ≤ 1600$. -Because of the intervening mountains, it first rises straight up to a point A', having elevation $f$. Then, while remaining at the same elevation $f$, it flies around any obstacles until it arrives at a point B' directly above B. +Por causa das montanhas no caminho, primeiro ele sobe em linha reta até um ponto A', tendo a elevação $f$. Então, enquanto permanece na mesma elevação $f$, ele voa em torno de quaisquer obstáculos até chegar em um ponto B' diretamente acima de B. -First, determine $f_{min}$ which is the minimum constant elevation allowing such a trip from A to B, while remaining in the specified area. Then, find the length of the shortest path between A' and B', while flying at that constant elevation $f_{min}$. +Primeiro, determine $f_{min}$, que é a elevação mínima constante que permite esse percurso de A a B, enquanto permanece na área especificada. Depois, encontre o comprimento do caminho mais curto entre A' e B', enquanto ele voa naquela elevação constante de $f_{min}$. -Give that length as your answer, rounded to three decimal places. +Dê esse comprimento como sua resposta, arredondado para três casas decimais. -**Note:** For convenience, the elevation function shown above is repeated below, in a form suitable for most programming languages: `h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) )* exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )`. +**Observação:** por conveniência, a função de elevação mostrada acima é repetida abaixo, em uma forma adequada para a maioria das linguagens de programação: `h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) )* exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )`. # --hints-- -`mountainRange()` should return `2531.205`. +`mountainRange()` deve retornar `2531.205`. ```js assert.strictEqual(mountainRange(), 2531.205); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-263-an-engineers-dream-come-true.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-263-an-engineers-dream-come-true.md index 8fec64cc250..b700adeac82 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-263-an-engineers-dream-come-true.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-263-an-engineers-dream-come-true.md @@ -1,6 +1,6 @@ --- id: 5900f4741000cf542c50ff86 -title: 'Problem 263: An engineers'' dream come true' +title: 'Problema 263: O sonho de um engenheiro se torna realidade' challengeType: 1 forumTopicId: 301912 dashedName: problem-263-an-engineers-dream-come-true @@ -8,30 +8,30 @@ dashedName: problem-263-an-engineers-dream-come-true # --description-- -Consider the number 6. The divisors of 6 are: 1,2,3 and 6. +Considere o número 6. Os divisores de 6 são: 1, 2, 3 e 6. -Every number from 1 up to and including 6 can be written as a sum of distinct divisors of 6: +Cada número de 1 até 6 pode ser escrito como uma soma de divisores distintos de 6: $1 = 1$, $2 = 2$, $3 = 1 + 2$, $4 = 1 + 3$, $5 = 2 + 3$, $6 = 6$. -A number $n$ is called a practical number if every number from 1 up to and including $n$ can be expressed as a sum of distinct divisors of $n$. +Um número $n$ é chamado de número prático se cada número de 1 até $n$ puder ser expresso como uma soma dos divisores distintos de $n$. -A pair of consecutive prime numbers with a difference of six is called a sexy pair (since "sex" is the Latin word for "six"). The first sexy pair is (23, 29). +Um par de números primos consecutivos com uma diferença de seis é chamado de par sexy (já que "sex" é a palavra latina para "seis"). O primeiro par sexy é (23, 29). -We may occasionally find a triple-pair, which means three consecutive sexy prime pairs, such that the second member of each pair is the first member of the next pair. +Podemos ocasionalmente encontrar um trio de pares, o que significa três pares sexy de números primos consecutivos, de modo que o segundo membro de cada par seja o primeiro membro do próximo par. -We shall call a number $n$ such that: +Chamaremos um número $n$ com as seguintes configurações: -- ($n - 9$, $n - 3$), ($n - 3$, $n + 3$), ($n + 3$, $n + 9$) form a triple-pair, and -- the numbers $n - 8$, $n - 4$, $n$, $n + 4$ and $n + 8$ are all practical, +- ($n - 9$, $n - 3$), ($n - 3$, $n + 3$), ($n + 3$, $n + 9$) formam um trio de pares, e +- os números $n - 8$, $n - 4$, $n$, $n + 4$ e $n + 8$ sejam todos práticos, -an engineers’ paradise. +de paraíso do engenheiro. -Find the sum of the first four engineers’ paradises. +Encontre a soma dos primeiros quatro paraísos do engenheiro. # --hints-- -`engineersDreamComeTrue()` should return `2039506520`. +`engineersDreamComeTrue()` deve retornar `2039506520`. ```js assert.strictEqual(engineersDreamComeTrue(), 2039506520); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-264-triangle-centres.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-264-triangle-centres.md index dc22c0cf51b..208648eff3f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-264-triangle-centres.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-264-triangle-centres.md @@ -1,6 +1,6 @@ --- id: 5900f4751000cf542c50ff87 -title: 'Problem 264: Triangle Centres' +title: 'Problema 264: Centros dos triângulos' challengeType: 1 forumTopicId: 301913 dashedName: problem-264-triangle-centres @@ -8,15 +8,15 @@ dashedName: problem-264-triangle-centres # --description-- -Consider all the triangles having: +Considere todos os triângulos que têm: -- All their vertices on lattice points. -- Circumcentre at the origin O. -- Orthocentre at the point H(5, 0). +- Todos os seus vértices em pontos da rede. +- Circuncentro na origem O. +- Ortocentro no ponto H(5, 0). -There are nine such triangles having a $\text{perimeter} ≤ 50$. +Há nove triângulos desse tipo tendo um $\text{perímetro} ≤ 50$. -Listed and shown in ascending order of their perimeter, they are: +Listados e mostrados em ordem ascendente de perímetro, eles são: @@ -34,18 +34,18 @@ A(8, 1), B(1, -8), C(-4, 7)
A(2, 9), B(9, -2), C(-6, -7)
A(9, 2), B(2, -9), C(-6, 7)
- +
nine triangles ABC with perimeter ≤ 50nove triângulos ABC com o perímetro ≤ 50
-The sum of their perimeters, rounded to four decimal places, is 291.0089. +A soma dos seus perímetros, arredondada para quatro casas decimais, é 291,0089. -Find all such triangles with a $\text{perimeter} ≤ {10}^5$. Enter as your answer the sum of their perimeters rounded to four decimal places. +Encontre todos os triângulos desse tipo com um $\text{perímetro} ≤ {10}^5$. Insira como resposta a soma dos seus perímetros, arredondada para quatro casas decimais. # --hints-- -`triangleCentres()` should return `2816417.1055`. +`triangleCentres()` deve retornar `2816417.1055`. ```js assert.strictEqual(triangleCentres(), 2816417.1055); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-265-binary-circles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-265-binary-circles.md index 4262d97c798..69e15321de9 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-265-binary-circles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-265-binary-circles.md @@ -1,6 +1,6 @@ --- id: 5900f4761000cf542c50ff88 -title: 'Problem 265: Binary Circles' +title: 'Problema 265: Círculos binários' challengeType: 1 forumTopicId: 301914 dashedName: problem-265-binary-circles @@ -8,26 +8,26 @@ dashedName: problem-265-binary-circles # --description-- -$2^N$ binary digits can be placed in a circle so that all the $N$-digit clockwise subsequences are distinct. +Os algarismos binários $2^N$ podem ser colocados em um círculo de modo que todas as subsequências de $N$ algarismos no sentido horário sejam distintas. -For $N = 3$, two such circular arrangements are possible, ignoring rotations: +Para $N = 3$, dois arranjos circulares são possíveis, ignorando rotações: -two circular arrangements for N = 3 +dois arranjos circulares para N = 3 -For the first arrangement, the 3-digit subsequences, in clockwise order, are: 000, 001, 010, 101, 011, 111, 110 and 100. +Para o primeiro arranjo, as subsequências de 3 algarismos, no sentido horário, são: 000, 001, 010, 101, 011, 111, 110 e 100. -Each circular arrangement can be encoded as a number by concatenating the binary digits starting with the subsequence of all zeros as the most significant bits and proceeding clockwise. The two arrangements for $N = 3$ are thus represented as 23 and 29: +Cada arranjo circular pode ser codificado como um número, concatenando os algarismos binários, começando com a subsequência de todos os zeros, como os bits mais significativos e prosseguindo no sentido horário. Os dois arranjos para $N = 3$ são, portanto, representados como 23 e 29: $${00010111}_2 = 23\\\\ {00011101}_2 = 29$$ -Calling $S(N)$ the sum of the unique numeric representations, we can see that $S(3) = 23 + 29 = 52$. +Chamando $S(N)$ de soma das representações numéricas únicas, podemos ver que $S(3) = 23 + 29 = 52$. -Find $S(5)$. +Encontre $S(5)$. # --hints-- -`binaryCircles()` should return `209110240768`. +`binaryCircles()` deve retornar `209110240768`. ```js assert.strictEqual(binaryCircles(), 209110240768); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-266-pseudo-square-root.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-266-pseudo-square-root.md index 2b22e967efb..06a8388d451 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-266-pseudo-square-root.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-266-pseudo-square-root.md @@ -1,6 +1,6 @@ --- id: 5900f4771000cf542c50ff89 -title: 'Problem 266: Pseudo Square Root' +title: 'Problema 266: Pseudorraiz quadrada' challengeType: 1 forumTopicId: 301915 dashedName: problem-266-pseudo-square-root @@ -8,19 +8,19 @@ dashedName: problem-266-pseudo-square-root # --description-- -The divisors of 12 are: 1,2,3,4,6 and 12. +Os divisores de 12 são: 1, 2, 3, 4, 6 e 12. -The largest divisor of 12 that does not exceed the square root of 12 is 3. +O maior divisor de 12 que não excede a raiz quadrada de 12 é 3. -We shall call the largest divisor of an integer $n$ that does not exceed the square root of $n$ the pseudo square root ($PSR$) of $n$. +Vamos chamar o maior divisor de um inteiro $n$ que não excede a raiz quadrada de $n$ como a pseudorraiz quadrada ($PSR$) de $n$. -It can be seen that $PSR(3102) = 47$. +Podemos ver que $PSR(3102) = 47$. -Let $p$ be the product of the primes below 190. Find $PSR(p)\bmod {10}^{16}$. +Considere $p$ como o produto dos números primos abaixo de 190. Encontre $PSR(p)\bmod {10}^{16}$. # --hints-- -`pseudoSquareRoot()` should return `1096883702440585`. +`pseudoSquareRoot()` deve retornar `1096883702440585`. ```js assert.strictEqual(pseudoSquareRoot(), 1096883702440585); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-267-billionaire.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-267-billionaire.md index 8dbe1d8ab66..d6e96b20bcf 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-267-billionaire.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-267-billionaire.md @@ -1,6 +1,6 @@ --- id: 5900f4771000cf542c50ff8a -title: 'Problem 267: Billionaire' +title: 'Problema 267: Bilionário' challengeType: 1 forumTopicId: 301916 dashedName: problem-267-billionaire @@ -8,21 +8,21 @@ dashedName: problem-267-billionaire # --description-- -You are given a unique investment opportunity. +Você recebe uma oportunidade única de investimento. -Starting with £1 of capital, you can choose a fixed proportion, $f$, of your capital to bet on a fair coin toss repeatedly for 1000 tosses. +Começando com £1 do capital, você pode escolher uma proporção fixa, $f$, do seu capital para apostar em uma moeda justa repetidamente por 1000 lançamentos. -Your return is double your bet for heads and you lose your bet for tails. +Seu retorno é o dobro da sua aposta para cara e você perde a aposta para coroa. -For example, if $f = \frac{1}{4}$, for the first toss you bet £0.25, and if heads comes up you win £0.5 and so then have £1.5. You then bet £0.375 and if the second toss is tails, you have £1.125. +Por exemplo, se $f = \frac{1}{4}$, para o primeiro lançamento, você aposta £0,25. Se cara aparecer, você ganha £0,5 e passa a ter £1,5. Você aposta £0,375 e, se o segundo lançamento for coroa, terá £1,125. -Choosing $f$ to maximize your chances of having at least £1,000,000,000 after 1,000 flips, what is the chance that you become a billionaire? +Escolhendo $f$ para maximizar suas chances de ter pelo menos £1.000.000.000 depois de 1.000 lançamentos da moeda, qual é a chance de você se tornar um bilionário? -All computations are assumed to be exact (no rounding), but give your answer rounded to 12 digits behind the decimal point in the form 0.abcdefghijkl. +Todos os cálculos devem ser exatos (sem arredondamento), mas sua resposta deve ser arredondada para 12 algarismos depois da vírgula na forma 0.abcdefghijkl. # --hints-- -`billionaire()` should return `0.999992836187`. +`billionaire()` deve retornar `0.999992836187`. ```js assert.strictEqual(billionaire(), 0.999992836187); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md index bd295d89e67..b227faafeeb 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md @@ -1,7 +1,7 @@ --- id: 5900f4791000cf542c50ff8b title: >- - Problem 268: Counting numbers with at least four distinct prime factors less than 100 + Problema 268: Contagem de números com pelo menos quatro divisores primos distintos menores que 100 challengeType: 1 forumTopicId: 301917 dashedName: >- @@ -10,13 +10,13 @@ dashedName: >- # --description-- -It can be verified that there are 23 positive integers less than 1000 that are divisible by at least four distinct primes less than 100. +É possível verificar que há 23 números inteiros positivos inferiores a 1000 que são divisíveis por, pelo menos, quatro números primos distintos inferiores a 100. -Find how many positive integers less than ${10}^{16}$ are divisible by at least four distinct primes less than 100. +Encontre quantos números inteiros positivos inferiores a ${10}^{16}$ que são divisíveis por, pelo menos, quatro números primos distintos inferiores a 100. # --hints-- -`fourDistinctPrimeFactors()` should return `785478606870985`. +`fourDistinctPrimeFactors()` deve retornar `785478606870985`. ```js assert.strictEqual(fourDistinctPrimeFactors(), 785478606870985); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-269-polynomials-with-at-least-one-integer-root.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-269-polynomials-with-at-least-one-integer-root.md index 3b66b2a2ab1..85c53e1bed8 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-269-polynomials-with-at-least-one-integer-root.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-269-polynomials-with-at-least-one-integer-root.md @@ -1,6 +1,6 @@ --- id: 5900f4791000cf542c50ff8c -title: 'Problem 269: Polynomials with at least one integer root' +title: 'Problema 269: Polinômios com pelo menos uma raiz inteira' challengeType: 1 forumTopicId: 301918 dashedName: problem-269-polynomials-with-at-least-one-integer-root @@ -8,27 +8,27 @@ dashedName: problem-269-polynomials-with-at-least-one-integer-root # --description-- -A root or zero of a polynomial $P(x)$ is a solution to the equation $P(x) = 0$. +Uma raiz ou zero de um polinômio $P(x)$ é uma solução para a equação $P(x) = 0$. -Define $P_n$ as the polynomial whose coefficients are the digits of $n$. +Defina $P_n$ como o polinômio cujos coeficientes são os algarismos de $n$. -For example, $P_{5703}(x) = 5x^3 + 7x^2 + 3$. +Por exemplo, $P_{5703}(x) = 5x^3 + 7x^2 + 3$. -We can see that: +Podemos ver que: -- $P_n(0)$ is the last digit of $n$, -- $P_n(1)$ is the sum of the digits of $n$, -- $Pn(10)$ is $n$ itself. +- $P_n(0)$ é o último algarismo de $n$, +- $P_n(1)$ é a soma dos algarismos de $n$, +- $Pn(10)$ é o próprio $n$. -Define $Z(k)$ as the number of positive integers, $n$, not exceeding $k$ for which the polynomial $P_n$ has at least one integer root. +Defina $Z(k)$ como a quantidade de números inteiros positivos, $n$, sem exceder $k$, para a qual o polinômio $P_n$ tem pelo menos uma raiz inteira. -It can be verified that $Z(100\\,000)$ is 14696. +Podemos verificar que $Z(100.000)$ é 14696. -What is $Z({10}^{16})$? +Qual é a $Z({10}^{16})$? # --hints-- -`polynomialsWithOneIntegerRoot()` should return `1311109198529286`. +`polynomialsWithOneIntegerRoot()` deve retornar `1311109198529286`. ```js assert.strictEqual(polynomialsWithOneIntegerRoot(), 1311109198529286); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-270-cutting-squares.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-270-cutting-squares.md index 0458e257f05..96f4225db47 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-270-cutting-squares.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-270-cutting-squares.md @@ -1,6 +1,6 @@ --- id: 5900f47c1000cf542c50ff8e -title: 'Problem 270: Cutting Squares' +title: 'Problema 270: Corte dos quadrados' challengeType: 1 forumTopicId: 301920 dashedName: problem-270-cutting-squares @@ -8,21 +8,21 @@ dashedName: problem-270-cutting-squares # --description-- -A square piece of paper with integer dimensions $N×N$ is placed with a corner at the origin and two of its sides along the $x$- and $y$-axes. Then, we cut it up respecting the following rules: +Um pedaço de papel quadrado com dimensões inteiras $N×N$ é colocado com um canto na origem e dois de seus lados ao longo dos eixos $x$ e $y$. Depois, cortamos os quadrados respeitando as seguintes regras: -- We only make straight cuts between two points lying on different sides of the square, and having integer coordinates. -- Two cuts cannot cross, but several cuts can meet at the same border point. -- Proceed until no more legal cuts can be made. +- Fazemos apenas cortes retos entre dois pontos que estejam em lados diferentes do quadrado e que tenham como coordenadas números inteiros. +- Dois cortes não podem se cruzar, mas vários cortes podem se encontrar no mesmo ponto das arestas. +- Prosseguimos até que não seja possível fazer mais cortes. -Counting any reflections or rotations as distinct, we call $C(N)$ the number of ways to cut an $N×N$ square. For example, $C(1) = 2$ and $C(2) = 30$ (shown below). +Contando quaisquer reflexões ou rotações distintas, chamamos de $C(N)$ o número de maneiras de cortar um quadrado $N×N$. Por exemplo, $C(1) = 2$ e $C(2) = 30$ (mostrados abaixo). -ways to cut 2x2 square, counting reflections and rotations as distinct +maneiras de cortar o quadrado 2x2, contando reflexões e rotações como distintas -What is $C(30)\bmod {10}^8$ ? +Qual é o $C(30)\bmod {10}^8$ ? # --hints-- -`cuttingSquares()` should return `82282080`. +`cuttingSquares()` deve retornar `82282080`. ```js assert.strictEqual(cuttingSquares(), 82282080); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-271-modular-cubes-part-1.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-271-modular-cubes-part-1.md index f1dbf4b5666..99d19792cdb 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-271-modular-cubes-part-1.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-271-modular-cubes-part-1.md @@ -1,6 +1,6 @@ --- id: 5900f47b1000cf542c50ff8d -title: 'Problem 271: Modular Cubes, part 1' +title: 'Problema 271: Cubos modulares, parte 1' challengeType: 1 forumTopicId: 301921 dashedName: problem-271-modular-cubes-part-1 @@ -8,15 +8,15 @@ dashedName: problem-271-modular-cubes-part-1 # --description-- -For a positive number $n$, define $S(n)$ as the sum of the integers $x$, for which $1 < x < n$ and $x^3 \equiv 1\bmod n$. +Para um número positivo $n$, defina $S(n)$ como a soma dos números inteiros $x$, para a qual $1 < x < n$ e $x^3 \equiv 1\bmod n$. -When $n = 91$, there are 8 possible values for $x$, namely: 9, 16, 22, 29, 53, 74, 79, 81. Thus, $S(91) = 9 + 16 + 22 + 29 + 53 + 74 + 79 + 81 = 363$. +Quando $n = 91$, existem 8 valores possíveis $x$: 9, 16, 22, 29, 53, 74, 79 e 81. Portanto, $S(91) = 9 + 16 + 22 + 29 + 53 + 74 + 79 + 81 = 363$. -Find $S(13\\,082\\,761\\,331\\,670\\,030)$. +Encontre $S(13.082.761.331.670.030)$. # --hints-- -`modularCubesOne()` should return `4617456485273130000`. +`modularCubesOne()` deve retornar `4617456485273130000`. ```js assert.strictEqual(modularCubesOne(), 4617456485273130000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-272-modular-cubes-part-2.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-272-modular-cubes-part-2.md index d764ea6563b..13a84b3a973 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-272-modular-cubes-part-2.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-272-modular-cubes-part-2.md @@ -1,6 +1,6 @@ --- id: 5900f47d1000cf542c50ff8f -title: 'Problem 272: Modular Cubes, part 2' +title: 'Problema 272: Cubos modulares, parte 2' challengeType: 1 forumTopicId: 301922 dashedName: problem-272-modular-cubes-part-2 @@ -8,15 +8,15 @@ dashedName: problem-272-modular-cubes-part-2 # --description-- -For a positive number $n$, define $C(n)$ as the number of the integers $x$, for which $1 < x < n$ and $x^3 \equiv 1\bmod n$. +Para um número positivo $n$, defina $C(n)$ como a quantidade de números inteiros $x$, para a qual $1 < x < n$ e $x^3 \equiv 1\bmod n$. -When $n = 91$, there are 8 possible values for $x$, namely: 9, 16, 22, 29, 53, 74, 79, 81. Thus, $C(91) = 8$. +Quando $n = 91$, existem 8 valores possíveis $x$: 9, 16, 22, 29, 53, 74, 79 e 81. Assim, $C(91) = 8$. -Find the sum of the positive numbers $n ≤ {10}^{11}$ for which $C(n)=242$. +Encontre a soma dos números positivos $n ≤ {10}^{11}$ para a qual $C(n)=242$. # --hints-- -`modularCubesTwo()` should return `8495585919506151000`. +`modularCubesTwo()` deve retornar `8495585919506151000`. ```js assert.strictEqual(modularCubesTwo(), 8495585919506151000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-273-sum-of-squares.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-273-sum-of-squares.md index d5ffc27c633..e80171c0bca 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-273-sum-of-squares.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-273-sum-of-squares.md @@ -1,6 +1,6 @@ --- id: 5900f47e1000cf542c50ff90 -title: 'Problem 273: Sum of Squares' +title: 'Problema 273: Soma dos quadrados' challengeType: 1 forumTopicId: 301923 dashedName: problem-273-sum-of-squares @@ -8,21 +8,21 @@ dashedName: problem-273-sum-of-squares # --description-- -Consider equations of the form: $a^2 + b^2 = N$, $0 ≤ a ≤ b$, $a$, $b$ and $N$ integer. +Considere as equações da forma: $a^2 + b^2 = N$, $0 ≤ a ≤ b$, sendo $a$, $b$ e $N$ números inteiros. -For $N = 65$ there are two solutions: +Para $N = 65$, existem duas soluções: -$a = 1, b = 8$ and $a = 4, b = 7$. +$a = 1, b = 8$ e $a = 4, b = 7$. -We call $S(N)$ the sum of the values of $a$ of all solutions of $a^2 + b^2 = N$, $0 ≤ a ≤ b$, $a$, $b$ and $N$ integer. +Chamamos de $S(N)$ a soma dos valores de $a$ de todas as soluções de $a^2 + b^2 = N$, $0 ≤ a ≤ b$, sendo $a$, $b$ e $N$ números inteiros. -Thus $S(65) = 1 + 4 = 5$. +Portanto, $S(65) = 1 + 4 = 5$. -Find $\sum S(N)$, for all squarefree $N$ only divisible by primes of the form $4k + 1$ with $4k + 1 < 150$. +Encontre $\sum S(N)$, para todos os $N$ sem quadrados, divisíveis apenas por números primos da forma $4k + 1$, com $4k + 1 < 150$. # --hints-- -`sumOfSquares()` should return `2032447591196869000`. +`sumOfSquares()` deve retornar `2032447591196869000`. ```js assert.strictEqual(sumOfSquares(), 2032447591196869000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-274-divisibility-multipliers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-274-divisibility-multipliers.md index bf56b697151..7a6a7f5d748 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-274-divisibility-multipliers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-274-divisibility-multipliers.md @@ -1,6 +1,6 @@ --- id: 5900f47f1000cf542c50ff91 -title: 'Problem 274: Divisibility Multipliers' +title: 'Problema 274: Multiplicadores de divisibilidade' challengeType: 1 forumTopicId: 301924 dashedName: problem-274-divisibility-multipliers @@ -8,25 +8,25 @@ dashedName: problem-274-divisibility-multipliers # --description-- -For each integer $p > 1$ coprime to 10 there is a positive divisibility multiplier $m < p$ which preserves divisibility by $p$ for the following function on any positive integer, $n$: +Para cada número inteiro $p > 1$ coprimo de 10, há um multiplicador positivo de divisibilidade $m < p$ que preserva a divisibilidade por $p$ para a seguinte função em qualquer número inteiro positivo, $n$: -$f(n) = (\text{all but the last digit of} \\; n) + (\text{the last digit of} \\; n) \times m$ +$f(n) = (\text{todos exceto o último algarismo de} \\; n) + (\text{o último algarismo de} \\; n) \times m$ -That is, if $m$ is the divisibility multiplier for $p$, then $f(n)$ is divisible by $p$ if and only if $n$ is divisible by $p$. +Ou seja, se $m$ for o multiplicador de divisibilidade para $p$, então $f(n)$ é divisível por $p$ se e somente se $n$ for divisível por $p$. -(When $n$ is much larger than $p$, $f(n)$ will be less than $n$ and repeated application of $f$ provides a multiplicative divisibility test for $p$.) +Quando $n$ for muito maior que $p$, $f(n)$ será menor que $n$ e a aplicação repetida de $f$ fornecerá um teste de multiplicador de divisibilidade para $p$. -For example, the divisibility multiplier for 113 is 34. +Por exemplo, o multiplicador de divisibilidade para 113 é 34. -$f(76275) = 7627 + 5 \times 34 = 7797$: 76275 and 7797 are both divisible by 113 +$f(76275) = 7627 + 5 \times 34 = 7797$: 76275 e 7797 são divisíveis por 113 -$f(12345) = 1234 + 5 \times 34 = 1404$: 12345 and 1404 are both not divisible by 113 +$f(12345) = 1234 + 5 \times 34 = 1404$: 12345 e 1404 não são divisíveis por 113 -The sum of the divisibility multipliers for the primes that are coprime to 10 and less than 1000 is 39517. What is the sum of the divisibility multipliers for the primes that are coprime to 10 and less than ${10}^7$? +A soma dos multiplicadores de divisibilidade dos números primos que são coprimos de 10 e menores que 1000 é 39517. Qual é a soma dos multiplicadores de divisibilidade dos números primos que são coprimos de 10 e menores que ${10}^7$? # --hints-- -`divisibilityMultipliers()` should return `1601912348822`. +`divisibilityMultipliers()` deve retornar `1601912348822`. ```js assert.strictEqual(divisibilityMultipliers(), 1601912348822); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-275-balanced-sculptures.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-275-balanced-sculptures.md index decc755a9ee..42e5da7bed8 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-275-balanced-sculptures.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-275-balanced-sculptures.md @@ -1,6 +1,6 @@ --- id: 5900f4801000cf542c50ff92 -title: 'Problem 275: Balanced Sculptures' +title: 'Problema 275: Esculturas balanceadas' challengeType: 1 forumTopicId: 301925 dashedName: problem-275-balanced-sculptures @@ -8,24 +8,24 @@ dashedName: problem-275-balanced-sculptures # --description-- -Let us define a balanced sculpture of order $n$ as follows: +Vamos definir uma escultura balanceada de ordem $n$ da seguinte forma: -- A polyomino made up of $n + 1$ tiles known as the blocks ($n$ tiles) and the plinth (remaining tile); -- the plinth has its centre at position ($x = 0$, $y = 0$); -- the blocks have $y$-coordinates greater than zero (so the plinth is the unique lowest tile); -- the centre of mass of all the blocks, combined, has $x$-coordinate equal to zero. +- Um poliminó composto por $n + 1$ blocos, sendo que $n$ são os "blocos" e o bloco restante (+1) é o "pedestal"; +- o pedestal tem seu centro na posição ($x = 0$, $y = 0$); +- os blocos têm coordenadas $y$ maiores que zero (portanto o pedestal é o único bloco inferior); +- o centro de massa de todos os blocos, combinados, tem a coordenada $x$ igual a zero. -When counting the sculptures, any arrangements which are simply reflections about the $y$-axis, are not counted as distinct. For example, the 18 balanced sculptures of order 6 are shown below; note that each pair of mirror images (about the $y$-axis) is counted as one sculpture: +Ao contar as esculturas, todos os arranjos que são simplesmente reflexões sobre o eixo $y$, não são contados como distintos. Por exemplo, as 18 esculturas equilibradas de ordem 6 são mostradas abaixo. Observe que cada par de imagens espelhadas (sobre o eixo $y$) é contado como uma escultura: -18 balanced sculptures of order 6 +18 esculturas balanceadas da ordem de 6 -There are 964 balanced sculptures of order 10 and 360505 of order 15. +Existem 964 esculturas equilibradas da ordem de 10 e 360505 da ordem de 15. -How many balanced sculptures are there of order 18? +Quantas esculturas equilibradas existem na ordem de 18? # --hints-- -`balancedSculptures()` should return `15030564`. +`balancedSculptures()` deve retornar `15030564`. ```js assert.strictEqual(balancedSculptures(), 15030564); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-276-primitive-triangles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-276-primitive-triangles.md index 26ce00839b4..f8aa0dcc756 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-276-primitive-triangles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-276-primitive-triangles.md @@ -1,6 +1,6 @@ --- id: 5900f4801000cf542c50ff93 -title: 'Problem 276: Primitive Triangles' +title: 'Problema 276: Triângulos primitivos' challengeType: 1 forumTopicId: 301926 dashedName: problem-276-primitive-triangles @@ -8,15 +8,15 @@ dashedName: problem-276-primitive-triangles # --description-- -Consider the triangles with integer sides $a$, $b$ and $c$ with $a ≤ b ≤ c$. +Considere os triângulos com os lados inteiros $a$, $b$ e $c$ com $a ≤ b ≤ c$. -An integer sided triangle $(a,b,c)$ is called primitive if $gcd(a,b,c) = 1$. +Um triângulo que tem seus lados sendo números inteiros $(a,b,c)$ é chamado primitivo se $gcd(a,b,c) = 1$. -How many primitive integer sided triangles exist with a perimeter not exceeding $10\\,000\\,000$? +Quantos triângulos primitivos (com os lados sendo números inteiros) existem com um perímetro que não excede $10.000.000$? # --hints-- -`primitiveTriangles()` should return `5777137137739633000`. +`primitiveTriangles()` deve retornar `5777137137739633000`. ```js assert.strictEqual(primitiveTriangles(), 5777137137739633000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-277-a-modified-collatz-sequence.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-277-a-modified-collatz-sequence.md index c80635aa3d8..182776fa2cc 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-277-a-modified-collatz-sequence.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-277-a-modified-collatz-sequence.md @@ -1,6 +1,6 @@ --- id: 5900f4811000cf542c50ff94 -title: 'Problem 277: A Modified Collatz sequence' +title: 'Problema 277: Uma sequência de Collatz modificada' challengeType: 1 forumTopicId: 301927 dashedName: problem-277-a-modified-collatz-sequence @@ -8,29 +8,29 @@ dashedName: problem-277-a-modified-collatz-sequence # --description-- -A modified Collatz sequence of integers is obtained from a starting value $a_1$ in the following way: +Uma sequência de Collatz modificada de inteiros é obtida a partir do valor inicial $a_1$ da seguinte forma: -$a_{n + 1} = \frac{a_n}{3}$ if $a_n$ is divisible by 3. We shall denote this as a large downward step, "D". +$a_{n + 1} = \frac{a_n}{3}$ se $a_n$ for divisível por 3. Vamos apresentar isto como um grande passo descendente, "D". -$a_{n + 1} = \frac{4a_n + 2}{3}$ if $a_n$ divided by 3 gives a remainder of 1. We shall denote this as an upward step, "U". +$a_{n + 1} = \frac{4a_n + 2}{3}$ se $a_n$ dividido por 3 dá resto 1. Vamos apresentar isto como um grande passo ascendente, "U". -$a_{n + 1} = \frac{2a_n - 1}{3}$ if $a_n$ divided by 3 gives a remainder of 2. We shall denote this as a small downward step, "d". +$a_{n + 1} = \frac{2a_n - 1}{3}$ se $a_n$ dividido por 3 tem 2 como resto. Vamos apresentar isto como um pequeno passo descendente, "d". -The sequence terminates when some $a_n = 1$. +A sequência termina quando algum $a_n = 1$. -Given any integer, we can list out the sequence of steps. For instance if $a_1 = 231$, then the sequence $\\{a_n\\} = \\{231, 77, 51, 17, 11, 7, 10, 14, 9, 3, 1\\}$ corresponds to the steps "DdDddUUdDD". +Dado qualquer número inteiro, podemos listar a sequência de passos. Por exemplo, se $a_1 = 231$, então a sequência $\\{a_n\\} = \\{231, 77, 51, 17, 11, 7, 10, 14, 9, 3, 1\\}$ corresponde aos passos "DdDddUUdDD". -Of course, there are other sequences that begin with that same sequence "DdDddUUdDD....". +Claro, há outras sequências que começam com a mesma sequência "DdDUUdD...". -For instance, if $a_1 = 1004064$, then the sequence is DdDddUUdDDDdUDUUUdDdUUDDDUdDD. +Por exemplo, se $a_1 = 1004064$, então a sequência será DdDddUUdDDDdUDUUUdDdUUDDDUdDD. -In fact, 1004064 is the smallest possible $a_1 > {10}^6$ that begins with the sequence DdDddUUdDD. +Na verdade, 1004064 é o menor número possível $a_1 > {10}^6$ que começa com a sequência DdDddUUdDD. -What is the smallest $a_1 > {10}^{15}$ that begins with the sequence "UDDDUdddDDUDDddDdDddDDUDDdUUDd"? +Qual é o menor número $a_1 > {10}^{15}$ que começa com a sequência "UDDDUdddDDUDDddDdDddDDUDDdUUDd"? # --hints-- -`modifiedCollatzSequence()` should return `1125977393124310`. +`modifiedCollatzSequence()` deve retornar `1125977393124310`. ```js assert.strictEqual(modifiedCollatzSequence(), 1125977393124310); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-278-linear-combinations-of-semiprimes.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-278-linear-combinations-of-semiprimes.md index 215c51cb036..449e13ae433 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-278-linear-combinations-of-semiprimes.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-278-linear-combinations-of-semiprimes.md @@ -1,6 +1,6 @@ --- id: 5900f4831000cf542c50ff95 -title: 'Problem 278: Linear Combinations of Semiprimes' +title: 'Problema 278: Combinações lineares de semiprimos' challengeType: 1 forumTopicId: 301928 dashedName: problem-278-linear-combinations-of-semiprimes @@ -8,17 +8,17 @@ dashedName: problem-278-linear-combinations-of-semiprimes # --description-- -Given the values of integers $1 < a_1 < a_2 < \ldots < a_n$, consider the linear combination $q_1a_1 + q_2a_2 + \ldots + q_na_n = b$, using only integer values $q_k ≥ 0$. +Dados os valores de números inteiros $1 < a_1 < a_2 < \ldots < a_n$, considere a combinação linear $q_1a_1 + q_2a_2 + \ldots + q_na_n = b$, usando somente valores em números inteiros $q_k ≥ 0$. -Note that for a given set of $a_k$, it may be that not all values of $b$ are possible. For instance, if $a_1 = 5$ and $a_2 = 7$, there are no $q_1 ≥ 0$ and $q_2 ≥ 0$ such that $b$ could be 1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 or 23. +Observe que, para um determinado conjunto de $a_k$, pode ser que nem todos os valores de $b$ sejam possíveis. Por exemplo, se $a_1 = 5$ e $a_2 = 7$, não existem $q_1 ≥ 0$ e $q_2 ≥ 0$ tal que $b$ possa ser 1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 ou 23. -In fact, 23 is the largest impossible value of $b$ for $a_1 = 5$ and $a_2 = 7$. We therefore call $f(5, 7) = 23$. Similarly, it can be shown that $f(6, 10, 15)=29$ and $f(14, 22, 77) = 195$. +De fato, 23 é o maior valor impossível de $b$ para $a_1 = 5$ e $a_2 = 7$. Portanto, consideramos $f(5, 7) = 23$. Da mesma forma, pode ser mostrado que $f(6, 10, 15)=29$ e $f(14, 22, 77) = 195$. -Find $\sum f(pq,pr,qr)$, where $p$, $q$ and $r$ are prime numbers and $p < q < r < 5000$. +Encontre $\sum f(pq,pr,qr)$, onde $p$, $q$ e $r$ são números primos e $p < q < r < 5000$. # --hints-- -`linearCombinationOfSemiprimes()` should return `1228215747273908500`. +`linearCombinationOfSemiprimes()` deve retornar `1228215747273908500`. ```js assert.strictEqual(linearCombinationOfSemiprimes(), 1228215747273908500); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-279-triangles-with-integral-sides-and-an-integral-angle.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-279-triangles-with-integral-sides-and-an-integral-angle.md index 9d50a5ebc61..e3a1ecf235e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-279-triangles-with-integral-sides-and-an-integral-angle.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-279-triangles-with-integral-sides-and-an-integral-angle.md @@ -1,6 +1,6 @@ --- id: 5900f4841000cf542c50ff96 -title: 'Problem 279: Triangles with integral sides and an integral angle' +title: 'Problema 279: Triângulos com lados e ângulo em números inteiros' challengeType: 1 forumTopicId: 301929 dashedName: problem-279-triangles-with-integral-sides-and-an-integral-angle @@ -8,11 +8,11 @@ dashedName: problem-279-triangles-with-integral-sides-and-an-integral-angle # --description-- -How many triangles are there with integral sides, at least one integral angle (measured in degrees), and a perimeter that does not exceed ${10}^8$? +Quantos triângulos existem com lados compostos de números inteiros, ao menos um ângulo em número inteiro (medido em graus) e com um perímetro que não exceda ${10}^8$? # --hints-- -`trianglesWithIntegralSidesAndAngle()` should return `416577688`. +`trianglesWithIntegralSidesAndAngle()` deve retornar `416577688`. ```js assert.strictEqual(trianglesWithIntegralSidesAndAngle(), 416577688); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-280-ant-and-seeds.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-280-ant-and-seeds.md index 5057b8bd47c..b9b786f0d98 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-280-ant-and-seeds.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-280-ant-and-seeds.md @@ -1,6 +1,6 @@ --- id: 5900f4841000cf542c50ff97 -title: 'Problem 280: Ant and seeds' +title: 'Problema 280: Formiga e sementes' challengeType: 1 forumTopicId: 301931 dashedName: problem-280-ant-and-seeds @@ -8,15 +8,15 @@ dashedName: problem-280-ant-and-seeds # --description-- -A laborious ant walks randomly on a 5x5 grid. The walk starts from the central square. At each step, the ant moves to an adjacent square at random, without leaving the grid; thus there are 2, 3 or 4 possible moves at each step depending on the ant's position. +Uma formiga trabalhadora anda aleatoriamente em uma grade de 5x5. A caminhada começa do quadrado central. Em cada etapa, a formiga se move aleatoriamente para um quadrado adjacente, sem sair da grade; assim, há 2, 3 ou 4 movimentos possíveis para cada passo, dependendo da posição da formiga. -At the start of the walk, a seed is placed on each square of the lower row. When the ant isn't carrying a seed and reaches a square of the lower row containing a seed, it will start to carry the seed. The ant will drop the seed on the first empty square of the upper row it eventually reaches. +No início da caminhada, uma semente é colocada em cada quadrado da linha inferior. Quando a formiga não estiver carregando uma semente e atingir um quadrado da linha inferior que contém uma semente, começará a carregar a semente. A formiga soltará a semente no primeiro quadrado vazio da linha superior que ela eventualmente alcance. -What's the expected number of steps until all seeds have been dropped in the top row? Give your answer rounded to 6 decimal places. +Qual é o número esperado de passos até que todas as sementes sejam largadas na linha superior? Dê sua resposta arredondada para 6 casas decimais. # --hints-- -`antAndSeeds()` should return `430.088247`. +`antAndSeeds()` deve retornar `430.088247`. ```js assert.strictEqual(antAndSeeds(), 430.088247); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-282-the-ackermann-function.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-282-the-ackermann-function.md index c9cbb75087d..9651421ba0f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-282-the-ackermann-function.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-282-the-ackermann-function.md @@ -1,6 +1,6 @@ --- id: 5900f4861000cf542c50ff99 -title: 'Problem 282: The Ackermann function' +title: 'Problema 282: A função de Ackermann' challengeType: 1 forumTopicId: 301933 dashedName: problem-282-the-ackermann-function @@ -8,18 +8,18 @@ dashedName: problem-282-the-ackermann-function # --description-- -For non-negative integers $m$, $n$, the Ackermann function $A(m, n)$ is defined as follows: +Para números inteiros não negativos $m$, $n$, a função de Ackermann $A(m, n)$ é definida da seguinte forma: $$A(m, n) = \begin{cases} n + 1 & \text{if $m = 0$} \\\\ A(m - 1, 1) & \text{if $m > 0$ and $n = 0$} \\\\ A(m - 1, A(m, n - 1)) & \text{if $m > 0$ and $n > 0$} \end{cases}$$ -For example $A(1, 0) = 2$, $A(2, 2) = 7$ and $A(3, 4) = 125$. +Por exemplo $A(1, 0) = 2$, $A(2, 2) = 7$ e $A(3, 4) = 125$. -Find $\displaystyle\sum_{n = 0}^6 A(n, n)$ and give your answer mod ${14}^8$. +Encontre $\displaystyle\sum_{n = 0}^6 A(n, n)$ e dê sua resposta mod ${14}^8$. # --hints-- -`ackermanFunction()` should return `1098988351`. +`ackermanFunction()` deve retornar `1098988351`. ```js assert.strictEqual(ackermanFunction(), 1098988351); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-284-steady-squares.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-284-steady-squares.md index d6c86b00055..aad6cf7293e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-284-steady-squares.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-284-steady-squares.md @@ -1,6 +1,6 @@ --- id: 5900f4891000cf542c50ff9b -title: 'Problem 284: Steady Squares' +title: 'Problema 284: Quadrados estáveis' challengeType: 1 forumTopicId: 301935 dashedName: problem-284-steady-squares @@ -8,23 +8,23 @@ dashedName: problem-284-steady-squares # --description-- -The 3-digit number 376 in the decimal numbering system is an example of numbers with the special property that its square ends with the same digits: ${376}^2 = 141376$. Let's call a number with this property a steady square. +O número de 3 algarismos 376 no sistema de numeração decimal é um exemplo de números com a propriedade especial de que o quadrado termina com os mesmos algarismos: ${376}^2 = 141376$. Vamos chamar um número com essa propriedade de um quadrado estável. -Steady squares can also be observed in other numbering systems. In the base 14 numbering system, the 3-digit number $c37$ is also a steady square: $c37^2 = aa0c37$, and the sum of its digits is $c+3+7=18$ in the same numbering system. The letters $a$, $b$, $c$ and $d$ are used for the 10, 11, 12 and 13 digits respectively, in a manner similar to the hexadecimal numbering system. +Os quadrados estáveis também podem ser observados em outros sistemas de numeração. No sistema de numeração de base 14, o número de 3 algarismos $c37$ também é um quadrado estável: $c37^2 = aa0c37$ e a soma de seus algarismos é $c+3+7=18$ no mesmo sistema de numeração. As letras $a$, $b$, $c$ e $d$ são usadas para os algarismos 10, 11, 12 e 13, respectivamente, de uma maneira semelhante ao sistema de numeração hexadecimal. -For $1 ≤ n ≤ 9$, the sum of the digits of all the $n$-digit steady squares in the base 14 numbering system is $2d8$ (582 decimal). Steady squares with leading 0's are not allowed. +Para $1 ≤ n ≤ 9$, a soma dos algarismos de todos os quadrados estáveis de $n$ algarismos no sistema de numeração de base 14 é $2d8$ (582 no sistema decimal). Não são permitidos quadrados estáveis com zeros à esquerda. -Find the sum of the digits of all the $n$-digit steady squares in the base 14 numbering system for $1 ≤ n ≤ 10000$ (decimal) and give your answer as a string in the base 14 system using lower case letters where necessary. +Encontre a soma dos algarismos de todos os quadrados estáveis de $n$ algarismos no sistema de numeração de base 14 para $1 ≤ n ≤ 10000$ (no sistema decimal) e dê sua resposta como uma string no sistema de base 14 usando letras minúsculas, quando necessário. # --hints-- -`steadySquares()` should return a string. +`steadySquares()` deve retornar uma string. ```js assert(typeof steadySquares() === 'string'); ``` -`steadySquares()` should return the string `5a411d7b`. +`steadySquares()` deve retornar a string `5a411d7b`. ```js assert.strictEqual(steadySquares(), '5a411d7b'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-285-pythagorean-odds.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-285-pythagorean-odds.md index 5c6e49167f9..0f3b0d3d00e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-285-pythagorean-odds.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-285-pythagorean-odds.md @@ -1,6 +1,6 @@ --- id: 5900f48a1000cf542c50ff9c -title: 'Problem 285: Pythagorean odds' +title: 'Problema 285: Probabilidades pitagóricas' challengeType: 1 forumTopicId: 301936 dashedName: problem-285-pythagorean-odds @@ -8,19 +8,19 @@ dashedName: problem-285-pythagorean-odds # --description-- -Albert chooses a positive integer $k$, then two real numbers $a$, $b$ are randomly chosen in the interval [0,1] with uniform distribution. +Albert escolhe um número inteiro positivo $k$, depois dois números reais $a$, $b$ são escolhidos aleatoriamente no intervalo [0,1] com distribuição uniforme. -The square root of the sum ${(ka + 1)}^2 + {(kb + 1)}^2$ is then computed and rounded to the nearest integer. If the result is equal to $k$, he scores $k$ points; otherwise he scores nothing. +A raiz quadrada da soma ${(ka + 1)}^2 + {(kb + 1)}^2$ é então computada e arredondada para o número inteiro mais próximo. Se o resultado for igual a $k$, ele pontua $k$ pontos. Caso contrário, ele não pontua. -For example, if $k = 6$, $a = 0.2$ and $b = 0.85$, then ${(ka + 1)}^2 + {(kb + 1)}^2 = 42.05$. The square root of 42.05 is 6.484... and when rounded to the nearest integer, it becomes 6. This is equal to $k$, so he scores 6 points. +Por exemplo, if $k = 6$, $a = 0.2$ e $b = 0.85$, então ${(ka + 1)}^2 + {(kb + 1)}^2 = 42.05$. A raiz quadrada de 42,05 é 6,484... e, quando arredondada para o inteiro mais próximo, ela se torna 6. Isso é igual a $k$, então ele marca 6 pontos. -It can be shown that if he plays 10 turns with $k = 1, k = 2, \ldots, k = 10$, the expected value of his total score, rounded to five decimal places, is 10.20914. +Pode-se mostra que, se ele jogar 10 vezes, com $k = 1, k = 2, \ldots, k = 10$, o valor esperado de sua pontuação total, arredondado para cinco casas decimais, é 10,20914. -If he plays ${10}^5$ turns with $k = 1, k = 2, k = 3, \ldots, k = {10}^5$, what is the expected value of his total score, rounded to five decimal places? +Se ele jogar ${10}^5$ vezes com $k = 1, k = 2, k = 3, \ldots, k = {10}^5$, qual é o valor esperado de sua pontuação total, arredondada para cinco casas decimais? # --hints-- -`pythagoreanOdds()` should return `157055.80999`. +`pythagoreanOdds()` deve retornar `157055.80999`. ```js assert.strictEqual(pythagoreanOdds(), 157055.80999); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-286-scoring-probabilities.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-286-scoring-probabilities.md index 26e3e198604..95b742873c5 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-286-scoring-probabilities.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-286-scoring-probabilities.md @@ -1,6 +1,6 @@ --- id: 5900f48a1000cf542c50ff9d -title: 'Problem 286: Scoring probabilities' +title: 'Problema 286: Probabilidades de pontuação' challengeType: 1 forumTopicId: 301937 dashedName: problem-286-scoring-probabilities @@ -8,15 +8,15 @@ dashedName: problem-286-scoring-probabilities # --description-- -Barbara is a mathematician and a basketball player. She has found that the probability of scoring a point when shooting from a distance $x$ is exactly ($1 - \frac{x}{q}$), where $q$ is a real constant greater than 50. +Barbara é matemática e jogadora de basquete. Ela descobriu que a probabilidade de marcar um ponto ao lançar a bola de uma distância $x$ é exatamente ($1 - \frac{x}{q}$), onde $q$ é uma constante real maior que 50. -During each practice run, she takes shots from distances $x = 1, x = 2, \ldots, x = 50$ and, according to her records, she has precisely a 2 % chance to score a total of exactly 20 points. +Durante cada prática, ela arremessa das distâncias $x = 1, x = 2, \ldots, x = 50$ e, de acordo com os seus registros, tem precisamente 2% de chance de fazer um total de 20 pontos. -Find $q$ and give your answer rounded to 10 decimal places. +Encontre $q$ e dê sua resposta arredondada para 10 casas decimais. # --hints-- -`scoringProbabilities()` should return `52.6494571953`. +`scoringProbabilities()` deve retornar `52.6494571953`. ```js assert.strictEqual(scoringProbabilities(), 52.6494571953); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-287-quadtree-encoding-a-simple-compression-algorithm.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-287-quadtree-encoding-a-simple-compression-algorithm.md index 707a6fa97e7..3f08d5c10a9 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-287-quadtree-encoding-a-simple-compression-algorithm.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-287-quadtree-encoding-a-simple-compression-algorithm.md @@ -1,6 +1,6 @@ --- id: 5900f48b1000cf542c50ff9e -title: 'Problem 287: Quadtree encoding (a simple compression algorithm)' +title: 'Problema 287: Codificação quadtree (um algoritmo simples de compressão)' challengeType: 1 forumTopicId: 301938 dashedName: problem-287-quadtree-encoding-a-simple-compression-algorithm @@ -8,32 +8,32 @@ dashedName: problem-287-quadtree-encoding-a-simple-compression-algorithm # --description-- -The quadtree encoding allows us to describe a $2^N×2^N$ black and white image as a sequence of bits (0 and 1). Those sequences are to be read from left to right like this: +A codificação quadtree nos permite descrever uma imagem $2^N×2^N$ preta e branca como uma sequência de bits (0 e 1). Essas sequências devem ser lidas da esquerda para a direita assim: -- the first bit deals with the complete $2^N×2^N$ region; -- "0" denotes a split: - - the current $2^n×2^n$ region is divided into 4 sub-regions of dimension $2^{n - 1}×2^{n - 1}$, - - the next bits contains the description of the top left, top right, bottom left and bottom right sub-regions - in that order; -- "10" indicates that the current region contains only black pixels; -- "11" indicates that the current region contains only white pixels. +- o primeiro bit tem a ver com a região completa do $2^N×2^N$; +- "0" indica uma divisão: + - a região atual $2^n×2^n$ é dividida em 4 sub-regiões de dimensão $2^{n - 1}×2^{n - 1}$, + - os próximos bits contêm a descrição das sub-regiões superior esquerda, superior direita, inferior esquerda e inferior direita - nessa ordem; +- "10" indica que a região atual contém apenas pixels pretos; +- "11" indica que a região atual contém apenas pixels brancos. -Consider the following 4×4 image (colored marks denote places where a split can occur): +Considere a seguinte imagem 4×4 (pontos coloridos denotam lugares onde uma divisão pode ocorrer): -4x4 image with colored marks denoting place where split can occur +imagem 4x4 com marcas coloridas denotam lugares onde a divisão pode ocorrer -This image can be described by several sequences, for example : "001010101001011111011010101010", of length 30, or "0100101111101110", of length 16, which is the minimal sequence for this image. +Essa imagem pode ser descrita por várias sequências, por exemplo: "001010101001011111011010101010", de comprimento 30, ou "0100101111101110", de comprimento 16, que é a sequência mínima para essa imagem. -For a positive integer $N$, define $D_N$ as the $2^N×2^N$ image with the following coloring scheme: +Para um número inteiro positivo $N$, defina $D_N$ como a imagem $2^N×2^N$ com o seguinte esquema de cores: -- the pixel with coordinates $x = 0$, $y = 0$ corresponds to the bottom left pixel, -- if ${(x - 2^{N - 1})}^2 + {(y - 2^{N - 1})}^2 ≤ 2^{2N - 2}$ then the pixel is black, -- otherwise the pixel is white. +- o pixel com coordenadas $x = 0$, $y = 0$ corresponde ao pixel inferior esquerdo, +- se ${(x - 2^{N - 1})}^2 + {(y - 2^{N - 1})}^2 ≤ 2^{2N - 2}$, o pixel é preto, +- caso contrário, o pixel é branco. -What is the length of the minimal sequence describing $D_{24}$? +Qual é o comprimento da sequência mínima que descreve $D_{24}$? # --hints-- -`quadtreeEncoding()` should return `313135496`. +`quadtreeEncoding()` deve retornar `313135496`. ```js assert.strictEqual(quadtreeEncoding(), 313135496); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-289-eulerian-cycles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-289-eulerian-cycles.md index e491cab3612..b0b60738f04 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-289-eulerian-cycles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-289-eulerian-cycles.md @@ -1,6 +1,6 @@ --- id: 5900f48d1000cf542c50ffa0 -title: 'Problem 289: Eulerian Cycles' +title: 'Problema 289: Ciclos eulerianos' challengeType: 1 forumTopicId: 301940 dashedName: problem-289-eulerian-cycles @@ -8,23 +8,23 @@ dashedName: problem-289-eulerian-cycles # --description-- -Let $C(x,y)$ be a circle passing through the points ($x$, $y$), ($x$, $y + 1$), ($x + 1$, $y$) and ($x + 1$, $y + 1$). +Considere $C(x,y)$ como um círculo passando pelos pontos ($x$, $y$), ($x$, $y + 1$), ($x + 1$, $y$) e ($x + 1$, $y + 1$). -For positive integers $m$ and $n$, let $E(m,n)$ be a configuration which consists of the $m·n$ circles: { $C(x,y)$: $0 ≤ x < m$, $0 ≤ y < n$, $x$ and $y$ are integers } +Para os números positivos inteiros $m$ e $n$, considere $E(m,n)$ como a configuração que consiste em $m·n$ círculos: { $C(x,y)$: $0 ≤ x < m$, $0 ≤ y < n$, sendo que $x$ e $y$ são números inteiros } -An Eulerian cycle on $E(m,n)$ is a closed path that passes through each arc exactly once. Many such paths are possible on $E(m,n)$, but we are only interested in those which are not self-crossing: A non-crossing path just touches itself at lattice points, but it never crosses itself. +Um ciclo euleriano em $E(m,n)$ é um caminho fechado que passa por cada arco exatamente uma vez. Muitos caminhos são possíveis em $E(m,n)$, mas apenas nos interessamos por aqueles que não são cruzam a si mesmos: um caminho que não cruze a si mesmo apenas toca nos pontos da rede, mas nunca cruza a si mesmo. -The image below shows $E(3,3)$ and an example of an Eulerian non-crossing path. +A imagem abaixo mostra $E(3,3)$ e um exemplo de um caminho que euleriano sem cruzamentos. -Eulerian cycle E(3, 3) and Eulerian non-crossing path +ciclo Euleriano (3, 3) e caminho euleriano sem cruzamento -Let $L(m,n)$ be the number of Eulerian non-crossing paths on $E(m,n)$. For example, $L(1,2) = 2$, $L(2,2) = 37$ and $L(3,3) = 104290$. +Considere $L(m,n)$ como o número de caminhos eulerianos sem cruzamento em $E(m,n)$. Por exemplo, $L(1,2) = 2$, $L(2,2) = 37$ e $L(3,3) = 104290$. -Find $L(6,10)\bmod {10}^{10}$. +Encontre $L(6,10)\bmod {10}^{10}$. # --hints-- -`eulerianCycles()` should return `6567944538`. +`eulerianCycles()` deve retornar `6567944538`. ```js assert.strictEqual(eulerianCycles(), 6567944538); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-290-digital-signature.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-290-digital-signature.md index a6b3636eefd..fb94c70a149 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-290-digital-signature.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-290-digital-signature.md @@ -1,6 +1,6 @@ --- id: 5900f48f1000cf542c50ffa1 -title: 'Problem 290: Digital Signature' +title: 'Problema 290: Assinatura digital' challengeType: 1 forumTopicId: 301942 dashedName: problem-290-digital-signature @@ -8,11 +8,11 @@ dashedName: problem-290-digital-signature # --description-- -How many integers $0 ≤ n < {10}^{18}$ have the property that the sum of the digits of $n$ equals the sum of digits of $137n$? +Quantos números inteiros $0 ≤ n < {10}^{18}$ têm a propriedade de que a soma dos algarismos de $n$ é igual à soma dos algarismos de $137n$? # --hints-- -`digitalSignature()` should return `20444710234716470`. +`digitalSignature()` deve retornar `20444710234716470`. ```js assert.strictEqual(digitalSignature(), 20444710234716470); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-291-panaitopol-primes.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-291-panaitopol-primes.md index bb33727271a..14a032a8619 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-291-panaitopol-primes.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-291-panaitopol-primes.md @@ -1,6 +1,6 @@ --- id: 5900f48f1000cf542c50ffa2 -title: 'Problem 291: Panaitopol Primes' +title: 'Problema 291: Números primos de Panaitopol' challengeType: 1 forumTopicId: 301943 dashedName: problem-291-panaitopol-primes @@ -8,13 +8,13 @@ dashedName: problem-291-panaitopol-primes # --description-- -A prime number $p$ is called a Panaitopol prime if $p = \frac{x^4 - y^4}{x^3 + y^3}$ for some positive integers $x$ and $y$. +Um número primo $p$ é chamado de primo de Panaitopol se $p = \frac{x^4 - y^4}{x^3 + y^3}$ para alguns inteiros positivos $x$ e $y$. -Find how many Panaitopol primes are less than $5 × {10}^{15}$. +Encontre quantos primos de Panaitopol são menores que $5 × {10}^{15}$. # --hints-- -`panaitopolPrimes()` should return `4037526`. +`panaitopolPrimes()` deve retornar `4037526`. ```js assert.strictEqual(panaitopolPrimes(), 4037526); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-292-pythagorean-polygons.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-292-pythagorean-polygons.md index 8e0dd899454..8604353e4d6 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-292-pythagorean-polygons.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-292-pythagorean-polygons.md @@ -1,6 +1,6 @@ --- id: 5900f4911000cf542c50ffa3 -title: 'Problem 292: Pythagorean Polygons' +title: 'Problema 292: Polígonos de Pitágoras' challengeType: 1 forumTopicId: 301944 dashedName: problem-292-pythagorean-polygons @@ -8,24 +8,24 @@ dashedName: problem-292-pythagorean-polygons # --description-- -We shall define a pythagorean polygon to be a convex polygon with the following properties: +Definiremos um polígono pitagórico como sendo um polígono convexo com as seguintes propriedades: -- there are at least three vertices, -- no three vertices are aligned, -- each vertex has integer coordinates, -- each edge has integer length. +- existem pelo menos três vértices, +- não há três vértices alinhados, +- cada vértice tem coordenadas inteiras, +- cada aresta tem comprimento inteiro. -For a given integer $n$, define $P(n)$ as the number of distinct pythagorean polygons for which the perimeter is $≤ n$. +Para um número inteiro determinado $n$, defina $P(n)$ como o número de polígonos pitagóricos distintos para os quais o perímetro é $≤ n$. -Pythagorean polygons should be considered distinct as long as none is a translation of another. +Os polígonos pitagóricos devem ser considerados distintos, desde que um não seja uma tradução de outro. -You are given that $P(4) = 1$, $P(30) = 3655$ and $P(60) = 891045$. +Você é informado de que $P(4) = 1$, $P(30) = 3655$ e $P(60) = 891045$. -Find $P(120)$. +Encontre $P(120)$. # --hints-- -`pythagoreanPolygons()` should return `3600060866`. +`pythagoreanPolygons()` deve retornar `3600060866`. ```js assert.strictEqual(pythagoreanPolygons(), 3600060866); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-293-pseudo-fortunate-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-293-pseudo-fortunate-numbers.md index 0c8076828de..01e0fe4c7da 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-293-pseudo-fortunate-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-293-pseudo-fortunate-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f4931000cf542c50ffa4 -title: 'Problem 293: Pseudo-Fortunate Numbers' +title: 'Problema 293: Pseudonúmeros da sorte' challengeType: 1 forumTopicId: 301945 dashedName: problem-293-pseudo-fortunate-numbers @@ -8,19 +8,19 @@ dashedName: problem-293-pseudo-fortunate-numbers # --description-- -An even positive integer $N$ will be called admissible, if it is a power of 2 or its distinct prime factors are consecutive primes. +Um número inteiro positivo e par $N$ será chamado de admissível se for uma potência de 2 ou seus fatores primos distintos forem números primos consecutivos. -The first twelve admissible numbers are 2, 4, 6, 8, 12, 16, 18, 24, 30, 32, 36, 48. +Os primeiros doze números admissíveis são 2, 4, 6, 8, 12, 16, 18, 24, 30, 32, 36 e 48. -If $N$ is admissible, the smallest integer $M > 1$ such that $N + M$ is prime, will be called the pseudo-Fortunate number for $N$. +Se $N$ for admissível, o menor inteiro $M > 1$ tal que $N + M$ é um número primo, será chamado de pseudonúmero da sorte para $N$. -For example, $N = 630$ is admissible since it is even and its distinct prime factors are the consecutive primes 2, 3, 5 and 7. The next prime number after 631 is 641; hence, the pseudo-Fortunate number for 630 is $M = 11$. It can also be seen that the pseudo-Fortunate number for 16 is 3. +Por exemplo, $N = 630$ é admissível, pois é par e seus fatores primos distintos são os números primos consecutivos 2, 3, 5 e 7. O próximo número primo depois de 631 é 641; portanto, o pseudonúmero da sorte para 630 é $M = 11$. Também se pode ver que o pseudonúmero da sorte para 16 é 3. -Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers $N$ less than ${10}^9$. +Encontre a soma de todos os pseudonúmeros da sorte distintos para números admissíveis $N$ inferiores a ${10}^9$. # --hints-- -`pseudoFortunateNumbers()` should return `2209`. +`pseudoFortunateNumbers()` deve retornar `2209`. ```js assert.strictEqual(pseudoFortunateNumbers(), 2209); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-294-sum-of-digits---experience-23.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-294-sum-of-digits---experience-23.md index b32ebc882de..e9f3dc1d01e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-294-sum-of-digits---experience-23.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-294-sum-of-digits---experience-23.md @@ -1,6 +1,6 @@ --- id: 5900f4931000cf542c50ffa5 -title: 'Problem 294: Sum of digits - experience #23' +title: 'Problema 294: Soma dos algarismos - experiência nº 23' challengeType: 1 forumTopicId: 301946 dashedName: problem-294-sum-of-digits---experience-23 @@ -8,20 +8,20 @@ dashedName: problem-294-sum-of-digits---experience-23 # --description-- -For a positive integer $k$, define $d(k)$ as the sum of the digits of $k$ in its usual decimal representation. Thus $d(42) = 4 + 2 = 6$. +Para um número inteiro positivo $k$, defina $d(k)$ como a soma dos algarismos de $k$ em sua representação decimal normal. Portanto, $d(42) = 4 + 2 = 6$. -For a positive integer $n$, define $S(n)$ as the number of positive integers $k < {10}^n$ with the following properties: +Para um número inteiro positivo $n$, defina $S(n)$ como a quantidade de número inteiros positivos $k < {10}^n$ com as seguintes propriedades: -- $k$ is divisible by 23 and, +- $k$ é divisível por 23 e - $d(k) = 23$. -You are given that $S(9) = 263\\,626$ and $S(42) = 6\\,377\\,168\\,878\\,570\\,056$. +Você é informado de que $S(9) = 263.626$ e $S(42) = 6.377.168.878.570.056$. -Find $S({11}^{12})$ and give your answer $\bmod {10}^9$. +Encontre $S({11}^{12})$ e dê sua resposta $\bmod {10}^9$. # --hints-- -`experience23()` should return `789184709`. +`experience23()` deve retornar `789184709`. ```js assert.strictEqual(experience23(), 789184709); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-295-lenticular-holes.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-295-lenticular-holes.md index 9354ea7c840..d87b4f85268 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-295-lenticular-holes.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-295-lenticular-holes.md @@ -1,6 +1,6 @@ --- id: 5900f4931000cf542c50ffa6 -title: 'Problem 295: Lenticular holes' +title: 'Problema 295: Orifícios lenticulares' challengeType: 1 forumTopicId: 301947 dashedName: problem-295-lenticular-holes @@ -8,32 +8,32 @@ dashedName: problem-295-lenticular-holes # --description-- -We call the convex area enclosed by two circles a lenticular hole if: +Chamamos a área convexa criada no cruzamento de dois círculos de um orifício lenticular se: -- The centres of both circles are on lattice points. -- The two circles intersect at two distinct lattice points. -- The interior of the convex area enclosed by both circles does not contain any lattice points. +- Os centros de ambos os círculos estão em pontos da rede. +- Os dois círculos se cruzam em dois pontos da rede distintos. +- O interior da área convexa criada pelos dois círculos não contém pontos da rede. -Consider the circles: +Considere os círculos: $$\begin{align} & C_0: x^2 + y^2 = 25 \\\\ & C_1: {(x + 4)}^2 + {(y - 4)}^2 = 1 \\\\ & C_2: {(x - 12)}^2 + {(y - 4)}^2 = 65 \end{align}$$ -The circles $C_0$, $C_1$ and $C_2$ are drawn in the picture below. +Os círculos $C_0$, $C_1$ e $C_2$ estão desenhados na imagem abaixo. -C_0, C_1 and C_2 circles +círculos C_0, C_1 e C_2 -$C_0$ and $C_1$ form a lenticular hole, as well as $C_0$ and $C_2$. +$C_0$ e $C_1$ formam um orifício lenticular, assim como $C_0$ e $C_2$. -We call an ordered pair of positive real numbers ($r_1$, $r_2$) a lenticular pair if there exist two circles with radii $r_1$ and $r_2$ that form a lenticular hole. We can verify that ($1$, $5$) and ($5$, $\sqrt{65}$) are the lenticular pairs of the example above. +Chamamos de par ordenado de números reais positivos ($r_1$, $r_2$) um par lenticular se existirem dois círculos com raio $r_1$ e $r_2$ que formem um orifício lenticular. Podemos verificar que ($1$, $5$) e ($5$, $\sqrt{65}$) são os pares lenticulares do exemplo acima. -Let $L(N)$ be the number of distinct lenticular pairs ($r_1$, $r_2$) for which $0 < r_1 ≤ r_2 ≤ N$. We can verify that $L(10) = 30$ and $L(100) = 3442$. +Considere $L(N)$ como o número de pares lenticulares distintos ($r_1$, $r_2$) para os quais $0 < r_1 ≤ r_2 ≤ N$. Podemos verificar que $L(10) = 30$ e $L(100) = 3442$. -Find $L(100\\,000)$. +Encontre $L(100.000)$. # --hints-- -`lenticularHoles()` should return `4884650818`. +`lenticularHoles()` deve retornar `4884650818`. ```js assert.strictEqual(lenticularHoles(), 4884650818); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-297-zeckendorf-representation.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-297-zeckendorf-representation.md index 55f3adbfd1c..586513ff425 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-297-zeckendorf-representation.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-297-zeckendorf-representation.md @@ -1,6 +1,6 @@ --- id: 5900f4951000cf542c50ffa8 -title: 'Problem 297: Zeckendorf Representation' +title: 'Problema 297: Representação de Zeckendorf' challengeType: 1 forumTopicId: 301949 dashedName: problem-297-zeckendorf-representation @@ -8,25 +8,25 @@ dashedName: problem-297-zeckendorf-representation # --description-- -Each new term in the Fibonacci sequence is generated by adding the previous two terms. +Cada novo número na sequência de Fibonacci é gerado pela soma dos dois números anteriores. -Starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89. +Começando com 1 e 2, os primeiros 10 termos serão: 1, 2, 3, 5, 8, 13, 21, 34, 55 e 89. -Every positive integer can be uniquely written as a sum of nonconsecutive terms of the Fibonacci sequence. For example, 100 = 3 + 8 + 89. +Cada número inteiro positivo pode ser escrito exclusivamente como uma soma de termos não consecutivos da sequência de Fibonacci. Por exemplo, 100 = 3 + 8 + 89. -Such a sum is called the Zeckendorf representation of the number. +Tal soma se chama a representação de Zeckendorf do número. -For any integer $n>0$, let $z(n)$ be the number of terms in the Zeckendorf representation of $n$. +Para qualquer número inteiro $n>0$, considere $z(n)$ como o número de termos na representação de Zeckendorf de $n$. -Thus, $z(5) = 1$, $z(14) = 2$, $z(100) = 3$ etc. +Assim, $z(5) = 1$, $z(14) = 2$, $z(100) = 3$ etc. -Also, for $0 < n < {10}^6$, $\sum z(n) = 7\\,894\\,453$. +Além disso, para $0 < n < {10}^6$, $\sum z(n) = 7.894.453$. -Find $\sum z(n)$ for $0 < n < {10}^{17}$. +Encontre $\sum z(n)$ para $0 < n < {10}^{17}$. # --hints-- -`zeckendorfRepresentation()` should return `2252639041804718000`. +`zeckendorfRepresentation()` deve retornar `2252639041804718000`. ```js assert.strictEqual(zeckendorfRepresentation(), 2252639041804718000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-298-selective-amnesia.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-298-selective-amnesia.md index da401b24b95..1cb861c56d7 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-298-selective-amnesia.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-298-selective-amnesia.md @@ -1,6 +1,6 @@ --- id: 5900f4971000cf542c50ffa9 -title: 'Problem 298: Selective Amnesia' +title: 'Problema 298: Amnésia seletiva' challengeType: 1 forumTopicId: 301950 dashedName: problem-298-selective-amnesia @@ -8,30 +8,30 @@ dashedName: problem-298-selective-amnesia # --description-- -Larry and Robin play a memory game involving of a sequence of random numbers between 1 and 10, inclusive, that are called out one at a time. Each player can remember up to 5 previous numbers. When the called number is in a player's memory, that player is awarded a point. If it's not, the player adds the called number to his memory, removing another number if his memory is full. +Larry e Robin jogam um jogo de memória envolvendo uma sequência de números aleatórios entre 1 e 10, que são chamados um a cada turno. Cada jogador pode se lembrar de até 5 números anteriores. Quando o número chamado estiver na memória de um jogador, este jogador recebe um ponto. Caso contrário, o jogador adiciona o número chamado à memória, removendo outro número se a memória estiver cheia. -Both players start with empty memories. Both players always add new missed numbers to their memory but use a different strategy in deciding which number to remove: Larry's strategy is to remove the number that hasn't been called in the longest time. Robin's strategy is to remove the number that's been in the memory the longest time. +Os dois jogadores começam com as memórias vazias. Os dois jogadores sempre adicionam novos números perdidos à sua memória, mas usam uma estratégia diferente para decidir qual número remover: a estratégia de Larry é remover o número que não foi chamado há mais tempo. A estratégia de Robin é remover o número que esteve na memória por mais tempo. -Example game: +Jogo de exemplo: -| Turn | Called number | Larry's memory | Larry's score | Robin's memory | Robin's score | -| ---- | ------------- | --------------:| ------------- | -------------- | ------------- | -| 1 | 1 | 1 | 0 | 1 | 0 | -| 2 | 2 | 1,2 | 0 | 1,2 | 0 | -| 3 | 4 | 1,2,4 | 0 | 1,2,4 | 0 | -| 4 | 6 | 1,2,4,6 | 0 | 1,2,4,6 | 0 | -| 5 | 1 | 1,2,4,6 | 1 | 1,2,4,6 | 1 | -| 6 | 8 | 1,2,4,6,8 | 1 | 1,2,4,6,8 | 1 | -| 7 | 10 | 1,4,6,8,10 | 1 | 2,4,6,8,10 | 1 | -| 8 | 2 | 1,2,6,8,10 | 1 | 2,4,6,8,10 | 2 | -| 9 | 4 | 1,2,4,8,10 | 1 | 2,4,6,8,10 | 3 | -| 10 | 1 | 1,2,4,8,10 | 2 | 1,4,6,8,10 | 3 | +| Turno | Número chamado | Memória de Larry | Pontuação de Larry | Memória de Robin | Pontuação de Robin | +| ----- | -------------- | ----------------:| ------------------ | ---------------- | ------------------ | +| 1 | 1 | 1 | 0 | 1 | 0 | +| 2 | 2 | 1,2 | 0 | 1,2 | 0 | +| 3 | 4 | 1,2,4 | 0 | 1,2,4 | 0 | +| 4 | 6 | 1,2,4,6 | 0 | 1,2,4,6 | 0 | +| 5 | 1 | 1,2,4,6 | 1 | 1,2,4,6 | 1 | +| 6 | 8 | 1,2,4,6,8 | 1 | 1,2,4,6,8 | 1 | +| 7 | 10 | 1,4,6,8,10 | 1 | 2,4,6,8,10 | 1 | +| 8 | 2 | 1,2,6,8,10 | 1 | 2,4,6,8,10 | 2 | +| 9 | 4 | 1,2,4,8,10 | 1 | 2,4,6,8,10 | 3 | +| 10 | 1 | 1,2,4,8,10 | 2 | 1,4,6,8,10 | 3 | -Denoting Larry's score by $L$ and Robin's score by $R$, what is the expected value of $|L - R|$ after 50 turns? Give your answer rounded to eight decimal places using the format x.xxxxxxxx . +Chamando a pontuação de Larry de $L$ e a pontuação do Robin de $R$, qual é o valor esperado de $|L - R|$ após 50 turnos? Arredonde sua resposta para até oito casas decimais usando o formato x.xxxxxxxx. # --hints-- -`selectiveAmnesia()` should return `1.76882294`. +`selectiveAmnesia()` deve retornar `1.76882294`. ```js assert.strictEqual(selectiveAmnesia(), 1.76882294); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-299-three-similar-triangles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-299-three-similar-triangles.md index 5bd781949f5..964532c919c 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-299-three-similar-triangles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-299-three-similar-triangles.md @@ -1,6 +1,6 @@ --- id: 5900f4971000cf542c50ffaa -title: 'Problem 299: Three similar triangles' +title: 'Problema 299: Três triângulos similares' challengeType: 1 forumTopicId: 301951 dashedName: problem-299-three-similar-triangles @@ -8,29 +8,29 @@ dashedName: problem-299-three-similar-triangles # --description-- -Four points with integer coordinates are selected: +Quatro pontos com coordenadas em números inteiros são selecionadas: -$A(a, 0)$, $B(b, 0)$, $C(0, c)$ and $D(0, d)$, with $0 < a < b$ and $0 < c < d$. +$A(a, 0)$, $B(b, 0)$, $C(0, c)$ e $D(0, d)$, com $0 < a < b$ e $0 < c < d$. -Point $P$, also with integer coordinates, is chosen on the line $AC$ so that the three triangles $ABP$, $CDP$ and $BDP$ are all similar. +O ponto $P$, também com coordenadas em número inteiros, é escolhido na linha $AC$ de modo que os três triângulos, $ABP$, $CDP$ e $BDP$, são todos similares. -points A, B, C, D and P creating three triangles: ABP, CDP, and BDP +pontos A, B, C, D e P criando três triângulos: ABP, CDP e BDP -It is easy to prove that the three triangles can be similar, only if $a = c$. +É fácil provar que os três triângulos podem ser similares apenas se $a = c$. -So, given that $a = c$, we are looking for triplets ($a$, $b$, $d$) such that at least one point $P$ (with integer coordinates) exists on $AC$, making the three triangles $ABP$, $CDP$ and $BDP$ all similar. +Então, dado que $a = c$, estamos procurando por trios ($a$, $b$, $d$), de modo que pelo menos um ponto $P$ (com coordenadas em números inteiros) existe em $AC$, tornando todos os três triângulos $ABP$, $CDP$ e $BDP$ similares. -For example, if $(a, b, d) = (2, 3, 4)$, it can be easily verified that point $P(1, 1)$ satisfies the above condition. Note that the triplets (2,3,4) and (2,4,3) are considered as distinct, although point $P(1, 1)$ is common for both. +Por exemplo, se $(a, b, d) = (2, 3, 4)$, pode ser facilmente verificado que o ponto $P(1, 1)$ satisfaz a condição acima. Observe que os trios (2,3,4) e (2,4,3) são considerados distintos, embora o ponto $P(1, 1)$ seja comum para ambos. -If $b + d < 100$, there are 92 distinct triplets ($a$, $b$, $d$) such that point $P$ exists. +Se $b + d < 100$, existem 92 trios distintos ($a$, $b$, $d$) de modo que o ponto $P$ exista. -If $b + d < 100\\,000$, there are 320471 distinct triplets ($a$, $b$, $d$) such that point $P$ exists. +Se $b + d < 100.000$, existem 320471 trios distintos ($a$, $b$, $d$) de modo que o ponto $P$ exista. -If $b + d < 100\\,000\\,000$, how many distinct triplets ($a$, $b$, $d$) are there such that point $P$ exists? +Se $b + d < 100.000.000$, quantos trios distintos ($a$, $b$, $d$) existem de modo que o ponto $P$ exista? # --hints-- -`threeSimilarTriangles()` should return `549936643`. +`threeSimilarTriangles()` deve retornar `549936643`. ```js assert.strictEqual(threeSimilarTriangles(), 549936643); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-300-protein-folding.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-300-protein-folding.md index d5f2020b784..8e26cb4e111 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-300-protein-folding.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-201-to-300/problem-300-protein-folding.md @@ -1,6 +1,6 @@ --- id: 5900f49a1000cf542c50ffac -title: 'Problem 300: Protein folding' +title: 'Problema 300: Enovelamento de proteínas' challengeType: 1 forumTopicId: 301954 dashedName: problem-300-protein-folding @@ -8,29 +8,29 @@ dashedName: problem-300-protein-folding # --description-- -In a very simplified form, we can consider proteins as strings consisting of hydrophobic (H) and polar (P) elements, e.g. HHPPHHHPHHPH. +De maneira muito simplificada, podemos considerar as proteínas como strings consistindo em elementos hidrofóbicos (H) e polares (P), por exemplo, HHPPHHHPHHPH. -For this problem, the orientation of a protein is important; e.g. HPP is considered distinct from PPH. Thus, there are $2^n$ distinct proteins consisting of $n$ elements. +Para este problema, a orientação de uma proteína é importante; por exemplo, HPP é considerado diferente de PPH. Portanto, existem $2^n$ proteínas distintas compostas por $n$ elementos. -When one encounters these strings in nature, they are always folded in such a way that the number of H-H contact points is as large as possible, since this is energetically advantageous. +Quando alguém encontra essas strings na natureza, elas estão sempre enoveladas de modo que o número de pontos de contato de H-H é tão grande quanto possível, pois isso é energeticamente vantajoso. -As a result, the H-elements tend to accumulate in the inner part, with the P-elements on the outside. +Como resultado, os elementos H tendem a se acumular na parte interna, com os elementos P ficando do lado de fora. -Natural proteins are folded in three dimensions of course, but we will only consider protein folding in two dimensions. +As proteínas naturais são enoveladas em três dimensões, é claro, mas só vamos considerar um enovelamento proteico em duas dimensões. -The figure below shows two possible ways that our example protein could be folded (H-H contact points are shown with red dots). +A figura abaixo mostra duas maneiras possíveis de o nosso exemplo de proteína poder ser enovelado (pontos de contato H-H são mostrados como pontos vermelhos). -two possible ways to fold example protein +duas maneiras possíveis de exemplo de enovelamento de proteínas -The folding on the left has only six H-H contact points, thus it would never occur naturally. On the other hand, the folding on the right has nine H-H contact points, which is optimal for this string. +O enovelamento da esquerda tem apenas seis pontos de contato H-H e, por isso, nunca ocorreria naturalmente. Por outro lado, o enovelamento à direita tem nove pontos de contato H-H, o que é ideal para esta string. -Assuming that H and P elements are equally likely to occur in any position along the string, the average number of H-H contact points in an optimal folding of a random protein string of length 8 turns out to be $\frac{850}{2^8} = 3.3203125$. +Assumindo que os elementos H e P têm igual probabilidade de ocorrer em qualquer posição ao longo da string, o número médio de pontos de contato de H-H em um enovelamento ideal de uma string de proteína aleatória de comprimento 8 acaba sendo $\frac{850}{2^8} = 3.3203125$. -What is the average number of H-H contact points in an optimal folding of a random protein string of length 15? Give your answer using as many decimal places as necessary for an exact result. +Qual é o número médio de pontos de contato de H-H em um enovelamento ideal de uma string de proteína aleatória de comprimento 15? Dê sua resposta usando tantas casas decimais quantas for necessário para um resultado exato. # --hints-- -`proteinFolding()` should return `8.0540771484375`. +`proteinFolding()` deve retornar `8.0540771484375`. ```js assert.strictEqual(proteinFolding(), 8.0540771484375); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-301-nim.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-301-nim.md index b66b1b9ae06..493b98d9bc1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-301-nim.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-301-nim.md @@ -1,6 +1,6 @@ --- id: 5900f4991000cf542c50ffab -title: 'Problem 301: Nim' +title: 'Problema 301: Nim' challengeType: 1 forumTopicId: 301955 dashedName: problem-301-nim @@ -8,31 +8,31 @@ dashedName: problem-301-nim # --description-- -Nim is a game played with heaps of stones, where two players take it in turn to remove any number of stones from any heap until no stones remain. +Nim é um jogo jogado com pilhas de pedras, onde dois jogadores, cada um em seu turno, removem um número de pedras qualquer de alguma das pilhas até que nenhuma pedra permaneça. -We'll consider the three-heap normal-play version of Nim, which works as follows: +Vamos considerar a versão normal de jogo do Nim, com três pilhas, que funciona da seguinte forma: -- At the start of the game there are three heaps of stones. -- On his turn the player removes any positive number of stones from any single heap. -- The first player unable to move (because no stones remain) loses. +- No início do jogo, há três pilhas de pedras. +- Em sua vez, o jogador remove qualquer número positivo de pedras de qualquer pilha. +- O primeiro jogador que não puder fazer movimentos (por não haver pedras sobrando) perde. -If ($n_1$, $n_2$, $n_3$) indicates a Nim position consisting of heaps of size $n_1$, $n_2$ and $n_3$ then there is a simple function $X(n_1,n_2,n_3)$ — that you may look up or attempt to deduce for yourself — that returns: +Se ($n_1$, $n_2$, $n_3$) indica uma posição do Nim composta por pilhas de tamanho $n_1$, $n_2$ e $n_3$, há uma função simples $X(n_1,n_2, _3)$ — que você pode procurar ou tentar deduzir por conta própria — que retorna: -- zero if, with perfect strategy, the player about to move will eventually lose; or -- non-zero if, with perfect strategy, the player about to move will eventually win. +- zero se, com estratégia perfeita, o jogador que está prestes a fazer seu movimento perder; ou +- diferente de zero se, com a estratégia perfeita, o jogador que está prestes a fazer seu movimento vencer. -For example $X(1, 2, 3) = 0$ because, no matter what the current player does, his opponent can respond with a move that leaves two heaps of equal size, at which point every move by the current player can be mirrored by his opponent until no stones remain; so the current player loses. To illustrate: +Por exemplo $X(1, 2, 3) = 0$ porque, independentemente do jogador atual, o oponente dele pode responder com um movimento que deixa duas pilhas de tamanho igual, ponto em que qualquer movimento do jogador atual pode ser espelhado por seu oponente até que nenhuma pedra permaneça e o jogador atual perca. Para ilustrar: -- current player moves to (1,2,1) -- opponent moves to (1,0,1) -- current player moves to (0,0,1) -- opponent moves to (0,0,0), and so wins. +- o jogador atual deixa (1,2,1) nas pilhas +- oponente deixa (1,0,1) +- o jogador atual deixa (0,0,1) nas pilhas +- o oponente deixa (0,0,0) e ganha. -For how many positive integers $n ≤ 2^{30}$ does $X(n, 2n, 3n) = 0$? +Para quantos números inteiros positivos $n ≤ 2^{30}$ temos que $X(n, 2n, 3n) = 0$? # --hints-- -`nim()` should return `2178309`. +`nim()` deve retornar `2178309`. ```js assert.strictEqual(nim(), 2178309); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-302-strong-achilles-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-302-strong-achilles-numbers.md index 4c5301c49bf..808bff1dc07 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-302-strong-achilles-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-302-strong-achilles-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f49b1000cf542c50ffad -title: 'Problem 302: Strong Achilles Numbers' +title: 'Problema 302: Números de Aquiles fortes' challengeType: 1 forumTopicId: 301956 dashedName: problem-302-strong-achilles-numbers @@ -8,23 +8,23 @@ dashedName: problem-302-strong-achilles-numbers # --description-- -A positive integer $n$ is powerful if $p^2$ is a divisor of $n$ for every prime factor $p$ in $n$. +Um número inteiro positivo $n$ é poderoso se $p^2$ é um divisor de $n$ para cada fator primo $p$ em $n$. -A positive integer $n$ is a perfect power if $n$ can be expressed as a power of another positive integer. +Um número inteiro positivo $n$ é uma potência perfeita se $n$ puder ser expresso como uma potência de outro número inteiro positivo. -A positive integer $n$ is an Achilles number if $n$ is powerful but not a perfect power. For example, 864 and 1800 are Achilles numbers: $864 = 2^5 \times 3^3$ and $1800 = 2^3 \times 3^2 \times 5^2$. +Um número inteiro positivo $n$ é um número de Aquiles se $n$ for poderoso mas não for uma potência perfeita. Por exemplo, 864 e 1800 são números de Aquiles: $864 = 2^5 \times 3^3$ e $1800 = 2^3 \times 3^2 \times 5^2$. -We shall call a positive integer $S$ a Strong Achilles number if both $S$ and $φ(S)$ are Achilles numbers. $φ$ denotes Euler's totient function. +Vamos chamar um número inteiro positivo $S$ de número de Aquiles forte se $S$ e $φ(S)$ forem números de Aquiles. $φ$ é a função totiente de Euler. -For example, 864 is a Strong Achilles number: $φ(864) = 288 = 2^5 \times 3^2$. However, 1800 isn't a Strong Achilles number because: $φ(1800) = 480 = 2^5 \times 3^1 \times 5^1$. +Por exemplo, 864 é um número de Aquiles forte: $φ(864) = 288 = 2^5 \times 3^2$. No entanto, 1800 não é um número de Aquiles forte porque: $φ(1800) = 480 = 2^5 \times 3^1 \times 5^1$. -There are 7 Strong Achilles numbers below ${10}^4$ and 656 below ${10}^8$. +Há 7 números de Aquiles fortes abaixo de ${10}^4$ e 656 abaixo de ${10}^8$. -How many Strong Achilles numbers are there below ${10}^{18}$? +Quantos números de Aquiles fortes existem abaixo de ${10}^{18}$? # --hints-- -`strongAchillesNumbers()` should return `1170060`. +`strongAchillesNumbers()` deve retornar `1170060`. ```js assert.strictEqual(strongAchillesNumbers(), 1170060); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-303-multiples-with-small-digits.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-303-multiples-with-small-digits.md index 108d8bd39fc..cbee472f897 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-303-multiples-with-small-digits.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-303-multiples-with-small-digits.md @@ -1,6 +1,6 @@ --- id: 5900f49b1000cf542c50ffae -title: 'Problem 303: Multiples with small digits' +title: 'Problema 303: Múltiplos com algarismos pequenos' challengeType: 1 forumTopicId: 301957 dashedName: problem-303-multiples-with-small-digits @@ -8,17 +8,17 @@ dashedName: problem-303-multiples-with-small-digits # --description-- -For a positive integer $n$, define $f(n)$ as the least positive multiple of $n$ that, written in base 10, uses only digits $≤ 2$. +Para um número inteiro positivo $n$, defina $f(n)$ como o menor múltiplo positivo de $n$ que, escrito na base 10, usa apenas algarismos $≤ 2$. -Thus $f(2) = 2$, $f(3) = 12$, $f(7) = 21$, $f(42) = 210$, $f(89) = 1\\,121\\,222$. +Assim $f(2) = 2$, $f(3) = 12$, $f(7) = 21$, $f(42) = 210$, $f(89) = 1.121.222$. -Also, $\displaystyle\sum_{n = 1}^{100} \frac{f(n)}{n} = 11\\,363\\,107$. +Além disso, $\displaystyle\sum_{n = 1}^{100} \frac{f(n)}{n} = 11.363.107$. -Find $\displaystyle\sum_{n = 1}^{10\\,000} \frac{f(n)}{n}$. +Encontre $\displaystyle\sum_{n = 1}^{10.000} \frac{f(n)}{n}$. # --hints-- -`multiplesWithSmallDigits()` should return `1111981904675169`. +`multiplesWithSmallDigits()` deve retornar `1111981904675169`. ```js assert.strictEqual(multiplesWithSmallDigits(), 1111981904675169); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-304-primonacci.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-304-primonacci.md index a4939940a8f..59b5dcfb344 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-304-primonacci.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-304-primonacci.md @@ -1,6 +1,6 @@ --- id: 5900f49d1000cf542c50ffaf -title: 'Problem 304: Primonacci' +title: 'Problema 304: Primonacci' challengeType: 1 forumTopicId: 301958 dashedName: problem-304-primonacci @@ -8,19 +8,19 @@ dashedName: problem-304-primonacci # --description-- -For any positive integer $n$ the function $\text{next_prime}(n)$ returns the smallest prime $p$ such that $p > n$. +Para qualquer número inteiro positivo $n$, a função $\text{next_prime}(n)$ retorna o menor número primo $p$, tal que $p > n$. -The sequence $a(n)$ is defined by: $a(1) = \text{next_prime}({10}^{14})$ and $a(n) = \text{next_prime}(a(n - 1))$ for $n > 1$. +A sequência $a(n)$ é definida por: $a(1) = \text{next_prime}({10}^{14})$ e $a(n) = \text{next_prime}(a(n - 1))$ para $n > 1$. -The fibonacci sequence $f(n)$ is defined by: $f(0) = 0$, $f(1) = 1$ and $f(n) = f(n - 1) + f(n - 2)$ for $n > 1$. +A sequência de Fibonacci $f(n)$ é definida por: $f(0) = 0$, $f(1) = 1$ e $f(n) = f(n - 1) + f(n - 2)$ para $n > 1$. -The sequence $b(n)$ is defined as $f(a(n))$. +A sequência $b(n)$ é definida como $f(a(n))$. -Find $\sum b(n)$ for $1≤n≤100\\,000$. Give your answer $\bmod 1\\,234\\,567\\,891\\,011$. +Encontre $\sum b(n)$ para $1≤n≤100.000$. Dê a sua resposta $\bmod 1.234.567.891.011$. # --hints-- -`primonacci()` should return `283988410192`. +`primonacci()` deve retornar `283988410192`. ```js assert.strictEqual(primonacci(), 283988410192); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-305-reflexive-position.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-305-reflexive-position.md index 566e7b7b76c..d9beae79cd8 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-305-reflexive-position.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-305-reflexive-position.md @@ -1,6 +1,6 @@ --- id: 5900f49d1000cf542c50ffb0 -title: 'Problem 305: Reflexive Position' +title: 'Problema 305: Posição reflexiva' challengeType: 1 forumTopicId: 301959 dashedName: problem-305-reflexive-position @@ -8,19 +8,19 @@ dashedName: problem-305-reflexive-position # --description-- -Let's call $S$ the (infinite) string that is made by concatenating the consecutive positive integers (starting from 1) written down in base 10. +Vamos chamar de $S$ a string (infinita) que é feita concatenando os números inteiros positivos consecutivos (começando de 1) escrita na base 10. -Thus, $S = 1234567891011121314151617181920212223242\ldots$ +Assim, $S = 1234567891011121314151617181920212223242\ldots$ -It's easy to see that any number will show up an infinite number of times in $S$. +É fácil ver que qualquer número vai aparecer um número infinito de vezes em $S$. -Let's call $f(n)$ the starting position of the $n^{\text{th}}$ occurrence of $n$ in $S$. For example, $f(1) = 1$, $f(5) = 81$, $f(12) = 271$ and $f(7780) = 111\\,111\\,365$. +Vamos chamar de $f(n)$ na posição inicial da $n^{\text{-ésima}}$ ocorrência de $n$ em $S$. Por exemplo, $f(1) = 1$, $f(5) = 81$, $f(12) = 271$ e $f(7780) = 111.111.365$. -Find $\sum f(3^k) for 1 ≤ k ≤ 13$. +Encontre $\sum f(3^k) para 1 ≤ k ≤ 13$. # --hints-- -`reflexivePosition()` should return `18174995535140`. +`reflexivePosition()` deve retornar `18174995535140`. ```js assert.strictEqual(reflexivePosition(), 18174995535140); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-307-chip-defects.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-307-chip-defects.md index 3f0fd2be0cb..86b8d580903 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-307-chip-defects.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-307-chip-defects.md @@ -1,6 +1,6 @@ --- id: 5900f4a01000cf542c50ffb2 -title: 'Problem 307: Chip Defects' +title: 'Problema 307: Defeitos do chip' challengeType: 1 forumTopicId: 301961 dashedName: problem-307-chip-defects @@ -8,15 +8,15 @@ dashedName: problem-307-chip-defects # --description-- -$k$ defects are randomly distributed amongst $n$ integrated-circuit chips produced by a factory (any number of defects may be found on a chip and each defect is independent of the other defects). +$k$ defeitos são distribuídos aleatoriamente entre $n$ chips de circuito integrado produzidos por uma fábrica (qualquer número de defeitos pode ser encontrado em um chip e cada defeito é independente dos outros defeitos). -Let $p(k,n)$ represent the probability that there is a chip with at least 3 defects. For instance $p(3,7) ≈ 0.0204081633$. +Considere $p(k,n)$ como representando a probabilidade de haver um chip com pelo menos 3 defeitos. Por exemplo, $p(3,7) ≈ 0.0204081633$. -Find $p(20\\,000, 1\\,000\\,000)$ and give your answer rounded to 10 decimal places in the form 0.abcdefghij +Encontre $p(20.000, 1.000.000)$ e dê a sua resposta arredondada para 10 casas decimais na forma 0.abcdefghij # --hints-- -`chipDefects()` should return `0.7311720251`. +`chipDefects()` deve retornar `0.7311720251`. ```js assert.strictEqual(chipDefects(), 0.7311720251); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-310-nim-square.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-310-nim-square.md index 4eacb352843..7d99927e98b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-310-nim-square.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-310-nim-square.md @@ -1,6 +1,6 @@ --- id: 5900f4a21000cf542c50ffb5 -title: 'Problem 310: Nim Square' +title: 'Problema 310: Nim quadrado' challengeType: 1 forumTopicId: 301966 dashedName: problem-310-nim-square @@ -8,19 +8,19 @@ dashedName: problem-310-nim-square # --description-- -Alice and Bob play the game Nim Square. +Alice e Bob jogam o jogo Nim quadrado. -Nim Square is just like ordinary three-heap normal play Nim, but the players may only remove a square number of stones from a heap. +Nim quadrado é como o jogo de três pilhas de pedras comum (o Nim), mas os jogadores só podem remover um número quadrado de pedras de um pilha. -The number of stones in the three heaps is represented by the ordered triple ($a$, $b$, $c$). +O número de pedras nas três pilhas é representado pelo trio ordenado ($a$, $b$, $c$). -If $0 ≤ a ≤ b ≤ c ≤ 29$ then the number of losing positions for the next player is 1160. +Se $0 ≤ a ≤ b ≤ c ≤ 29$, o número de posições de derrota para o segundo jogador é 1160. -Find the number of losing positions for the next player if $0 ≤ a ≤ b ≤ c ≤ 100\\,000$. +Encontre o número de posições de derrota para o segundo jogador se $0 ≤ a ≤ b ≤ c ≤ 100.000$. # --hints-- -`nimSquare()` should return `2586528661783`. +`nimSquare()` deve retornar `2586528661783`. ```js assert.strictEqual(nimSquare(), 2586528661783); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-311-biclinic-integral-quadrilaterals.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-311-biclinic-integral-quadrilaterals.md index 97736d98034..0b3537101a6 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-311-biclinic-integral-quadrilaterals.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-311-biclinic-integral-quadrilaterals.md @@ -1,6 +1,6 @@ --- id: 5900f4a31000cf542c50ffb6 -title: 'Problem 311: Biclinic Integral Quadrilaterals' +title: 'Problema 311: Quadriláteros inteiros biclínicos' challengeType: 1 forumTopicId: 301967 dashedName: problem-311-biclinic-integral-quadrilaterals @@ -8,23 +8,23 @@ dashedName: problem-311-biclinic-integral-quadrilaterals # --description-- -$ABCD$ is a convex, integer sided quadrilateral with $1 ≤ AB < BC < CD < AD$. +$ABCD$ é um quadrilátero de lados expressos em números inteiros e convexo, com $1 ≤ AB < BC < CD < AD$. -$BD$ has integer length. $O$ is the midpoint of $BD$. $AO$ has integer length. +$BD$ tem comprimento inteiro. $O$ é o ponto central de $BD$. $AO$ tem comprimento inteiro. -We'll call $ABCD$ a biclinic integral quadrilateral if $AO = CO ≤ BO = DO$. +Vamos chamar $ABCD$ de um quadrilátero integral biclínico se $AO = CO ≤ BO = DO$. -For example, the following quadrilateral is a biclinic integral quadrilateral: $AB = 19$, $BC = 29$, $CD = 37$, $AD = 43$, $BD = 48$ and $AO = CO = 23$. +Por exemplo, o quadrilátero a seguir é um quadrilátero integral biclínico: $AB = 19$, $BC = 29$, $CD = 37$, $AD = 43$, $BD = 48$ e $AO = CO = 23$. -quadrilateral ABCD, with point O, an midpoint of BD +quadrilátero ABCD, com ponto O, um ponto médio de BD -Let $B(N)$ be the number of distinct biclinic integral quadrilaterals $ABCD$ that satisfy ${AB}^2 + {BC}^2 + {CD}^2 + {AD}^2 ≤ N$. We can verify that $B(10\\,000) = 49$ and $B(1\\,000\\,000) = 38239$. +Considere $B(N)$ como o número de quadriláteros integrais biclínicos distintos $ABCD$ que satisfazem ${AB}^2 + {BC}^2 + {CD}^2 + {AD}^2 ≤ N$. Podemos verificar que $B(10.000) = 49$ e $B(1.000.000) = 38239$. -Find $B(10\\,000\\,000\\,000)$. +Encontre $B(10.000.000.000)$. # --hints-- -`biclinicIntegralQuadrilaterals()` should return `2466018557`. +`biclinicIntegralQuadrilaterals()` deve retornar `2466018557`. ```js assert.strictEqual(biclinicIntegralQuadrilaterals(), 2466018557); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-312-cyclic-paths-on-sierpiski-graphs.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-312-cyclic-paths-on-sierpiski-graphs.md index 122f28f97dc..a3b756a6e5d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-312-cyclic-paths-on-sierpiski-graphs.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-312-cyclic-paths-on-sierpiski-graphs.md @@ -1,6 +1,6 @@ --- id: 5900f4a51000cf542c50ffb7 -title: 'Problem 312: Cyclic paths on Sierpiński graphs' +title: 'Problema 312: Caminhos cíclicos em gráficos de Sierpiński' challengeType: 1 forumTopicId: 301968 dashedName: problem-312-cyclic-paths-on-sierpiski-graphs @@ -8,26 +8,26 @@ dashedName: problem-312-cyclic-paths-on-sierpiski-graphs # --description-- -- A Sierpiński graph of order-1 ($S_1$) is an equilateral triangle. -- $S_{n + 1}$ is obtained from $S_n$ by positioning three copies of $S_n$ so that every pair of copies has one common corner. +- Um gráfico de Sierpiński de ordem 1 ($S_1$) é um triângulo equilátero. +- $S_{n + 1}$ é obtido de $S_n$ posicionando três cópias de $S_n$ de modo que cada par de cópias tenha um canto comum. -Sierpinski graphs of order-1 to order-5 +gráficos de Sierpiński de ordem 1 até a ordem 5 -Let $C(n)$ be the number of cycles that pass exactly once through all the vertices of $S_n$. For example, $C(3) = 8$ because eight such cycles can be drawn on $S_3$, as shown below: +Considere $C(n)$ como o número de ciclos que passam exatamente uma vez por todos os vértices de $S_n$. Por exemplo, $C(3) = 8$, porque oito desses ciclos podem ser desenhados em $S_3$, como mostrado abaixo: -eight cycles that pass exactly once through all vertices of S_3 +oito ciclos que passam exatamente uma vez por todos os vértices de S_3 -It can also be verified that: +Também pode ser verificado que: $$\begin{align} & C(1) = C(2) = 1 \\\\ - & C(5) = 71\\,328\\,803\\,586\\,048 \\\\ & C(10 000)\bmod {10}^8 = 37\\,652\\,224 \\\\ - & C(10 000)\bmod {13}^8 = 617\\,720\\,485 \\\\ \end{align}$$ + & C(5) = 71.328.803.586.048 \\\\ & C(10 000)\bmod {10}^8 = 37.652.224 \\\\ + & C(10 000)\bmod {13}^8 = 617.720.485 \\\\ \end{align}$$ -Find $C(C(C(10\\,000)))\bmod {13}^8$. +Encontre $C(C(C(10.000)))\bmod {13}^8$. # --hints-- -`pathsOnSierpinskiGraphs()` should return `324681947`. +`pathsOnSierpinskiGraphs()` deve retornar `324681947`. ```js assert.strictEqual(pathsOnSierpinskiGraphs(), 324681947); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-313-sliding-game.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-313-sliding-game.md index 8f5726b71f4..efd7c414763 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-313-sliding-game.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-313-sliding-game.md @@ -1,6 +1,6 @@ --- id: 5900f4a61000cf542c50ffb8 -title: 'Problem 313: Sliding game' +title: 'Problema 313: Jogo de deslizar' challengeType: 1 forumTopicId: 301969 dashedName: problem-313-sliding-game @@ -8,21 +8,21 @@ dashedName: problem-313-sliding-game # --description-- -In a sliding game a counter may slide horizontally or vertically into an empty space. The objective of the game is to move the red counter from the top left corner of a grid to the bottom right corner; the space always starts in the bottom right corner. For example, the following sequence of pictures show how the game can be completed in five moves on a 2 by 2 grid. +Em um jogo de deslizar, um contador pode deslizar horizontalmente ou verticalmente para um espaço vazio. O objetivo do jogo é mover o contador vermelho do canto superior esquerdo de uma grade para o canto inferior direito; o espaço sempre começa no canto inferior direito. Por exemplo, a sequência de imagens a seguir mostra como o jogo pode ser concluído em cinco movimentos em uma grade de 2 em 2. -completing game in five moves on grid 2x2 +completando o jogo em cinco movimentos na grade 2x2 -Let $S(m, n)$ represent the minimum number of moves to complete the game on an $m$ by $n$ grid. For example, it can be verified that $S(5, 4) = 25$. +Considere $S(m, n)$ como representante do número mínimo de movimentos para completar o jogo em uma grade de $m$ por $n$. Por exemplo, pode-se verificar que $S(5, 4) = 25$. -initial grid state and final grid state for game on grid 5x4 +estado inicial da grade e estado final da grade para um jogo na grade 5x4 -There are exactly 5482 grids for which $S(m, n) = p^2$, where $p < 100$ is prime. +Há exatamente 5482 grades quadriculadas, para as quais $S(m, n) = p^2$, em que $p < 100$ é um número primo. -How many grids does $S(m, n) = p^2$, where $p < {10}^6$ is prime? +Em quantas grades $S(m, n) = p^2$, onde $p < {10}^6$ é um número primo? # --hints-- -`slidingGame()` should return `2057774861813004`. +`slidingGame()` deve retornar `2057774861813004`. ```js assert.strictEqual(slidingGame(), 2057774861813004); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-314-the-mouse-on-the-moon.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-314-the-mouse-on-the-moon.md index 899395668c7..5679b166c5a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-314-the-mouse-on-the-moon.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-314-the-mouse-on-the-moon.md @@ -1,6 +1,6 @@ --- id: 5900f4a71000cf542c50ffb9 -title: 'Problem 314: The Mouse on the Moon' +title: 'Problema 314: O rato na lua' challengeType: 1 forumTopicId: 301970 dashedName: problem-314-the-mouse-on-the-moon @@ -8,23 +8,23 @@ dashedName: problem-314-the-mouse-on-the-moon # --description-- -The moon has been opened up, and land can be obtained for free, but there is a catch. You have to build a wall around the land that you stake out, and building a wall on the moon is expensive. Every country has been allotted a 500 m by 500 m square area, but they will possess only that area which they wall in. 251001 posts have been placed in a rectangular grid with 1 meter spacing. The wall must be a closed series of straight lines, each line running from post to post. +A lua foi liberada e terrenos podiam ser obtidos gratuitamente, mas tem uma pegadinha. É preciso construir um muro ao redor do terreno de que nos apropriamos. Construir um muro na lua é caro. Todos os países receberam um dote de 500 m por 500 m quadrados, mas eles só possuem as áreas que eles cercarem com o muro. 251001 postes foram colocados em uma grade retangular com um espaçamento de 1 metro. O muro deve ser uma série fechada de linhas retas, cada linha indo de um poste a outro. -The bigger countries of course have built a 2000 m wall enclosing the entire 250 000 $\text{m}^2$ area. The Duchy of Grand Fenwick, has a tighter budget, and has asked you (their Royal Programmer) to compute what shape would get best maximum $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio. +Os países maiores construíram, é claro, uma parede de 2000 metros que inclui toda a área de 250 000 $\text{m}^2$. O Ducado do Grande Fenwick tem um orçamento mais apertado. Ele pediu para você (o Programador Real) calcular qual formato obteria a melhor proporção máxima de $\frac{\text{área cercada}}{\text{comprimento do muro}}$. -You have done some preliminary calculations on a sheet of paper. For a 2000 meter wall enclosing the 250 000 $\text{m}^2$ area the $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio is 125. +Você já fez cálculos preliminares em uma folha de papel. Para um muro de 2000 metros cercando a área de 250 000 $\text{m}^2$, a proporção de $\frac{\text{área cercada}}{\text{comprimento do muro}}$ é de 125. -Although not allowed, but to get an idea if this is anything better: if you place a circle inside the square area touching the four sides the area will be equal to $π \times {250}^2 \text{m}^2$ and the perimeter will be $π \times 500 \text{m}$, so the $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio will also be 125. +Embora não seja permitido, mas para ter uma ideia se isto era melhor: se você colocar um círculo dentro da área quadrada tocando os quatro lados, a área será igual a $π \times {250}^2 \text{m}^2$ e o perímetro será $π \times 500 \text{m}$, então a proporção $\frac{\text{área cercada}}{\text{comprimento do muro}}$ também será 125. -However, if you cut off from the square four triangles with sides 75 m, 75 m and $75\sqrt{2}$ m the total area becomes 238750 $\text{m}^2$ and the perimeter becomes $1400 + 300\sqrt{2}$ m. So this gives an $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio of 130.87, which is significantly better. +No entanto, se você cortar do quadrado quatro triângulos com lados 75 m, 75 m e $75\sqrt{2}$ m, a área total se torna 238750 $\text{m}^2$ e o perímetro se torna $1400 + 300\sqrt{2}$ m. Então, isso dá uma proporção de $\frac{\text{área cercada}}{\text{comprimento do muro}}$ de 130,87, o que é significativamente melhor. -picture showing difference in enclosed-area between circle and square with cut off four triangles +imagem mostrando a diferença na área cercada entre círculo e o quadrado com o corte de quatro triângulos -Find the maximum $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio. Give your answer rounded to 8 places behind the decimal point in the form abc.defghijk. +Encontre a proporção máxima de $\frac{\text{área cercada}}{\text{comprimento do muro}}$. Arredonde sua resposta para até 8 casas decimais usando o formato abc.defghijk. # --hints-- -`theMouseOnTheMoon()` should return `132.52756426`. +`theMouseOnTheMoon()` deve retornar `132.52756426`. ```js assert.strictEqual(theMouseOnTheMoon(), 132.52756426); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-315-digital-root-clocks.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-315-digital-root-clocks.md index 59389d4a7ff..70803783049 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-315-digital-root-clocks.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-315-digital-root-clocks.md @@ -1,6 +1,6 @@ --- id: 5900f4a71000cf542c50ffba -title: 'Problem 315: Digital root clocks' +title: 'Problema 315: Relógios de raiz digital' challengeType: 1 forumTopicId: 301971 dashedName: problem-315-digital-root-clocks @@ -8,45 +8,45 @@ dashedName: problem-315-digital-root-clocks # --description-- -animation of Sam's and Max's clocks calculating digital roots starting from 137 +animação dos relógios de Sam e de Max, calculando raízes dos algarismos a partir de 137 -Sam and Max are asked to transform two digital clocks into two "digital root" clocks. +Sam e Max são convidados a transformar dois relógios digitais em dois relógios "de raízes digitais". -A digital root clock is a digital clock that calculates digital roots step by step. +Um relógio de raiz digital é um relógio digital que calcula gradualmente as raízes dos algarismos. -When a clock is fed a number, it will show it and then it will start the calculation, showing all the intermediate values until it gets to the result. For example, if the clock is fed the number 137, it will show: `137` → `11` → `2` and then it will go black, waiting for the next number. +Quando um relógio recebe um número, ele vai mostrá-lo e então ele vai iniciar o cálculo, mostrar todos os valores intermédios até que chegue ao resultado. Por exemplo, se o relógio receber o número 137, vai mostrar: `137` → `11` → `2` e então vai ficar preto, esperando o próximo número. -Every digital number consists of some light segments: three horizontal (top, middle, bottom) and four vertical (top-left, top-right, bottom-left, bottom-right). Number `1` is made of vertical top-right and bottom-right, number `4` is made by middle horizontal and vertical top-left, top-right and bottom-right. Number `8` lights them all. +Todo número digital consiste em alguns segmentos de luz: três horizontais (superior, médio, inferior) e quatro verticais (superior esquerdo, superior direito, inferior esquerdo e inferior direito). O número `1` é feito do canto superior direito e do canto inferior direito verticais. O número `4` é feito pela linha do meio horizontal e pelo canto superior esquerdo, canto superior direito e canto inferior direito. O número `8` ilumina todas as luzes. -The clocks consume energy only when segments are turned on/off. To turn on a `2` will cost 5 transitions, while a `7` will cost only 4 transitions. +Os relógios consomem energia apenas quando os segmentos são ligados/desligados. Para ativar um `2` custará 5 transições, enquanto um `7` custará apenas 4 transições. -Sam and Max built two different clocks. +Sam e Max construíram dois relógios diferentes. -Sam's clock is fed e.g. number 137: the clock shows `137`, then the panel is turned off, then the next number (`11`) is turned on, then the panel is turned off again and finally the last number (`2`) is turned on and, after some time, off. +O relógio de Sam recebe, por exemplo, o número 137: o relógio mostra `137`, então o painel é desligado. Depois, o próximo número (`11`) é ligado, e o painel é desligado novamente. Por fim, o último número (`2`) é ligado e, após algum tempo, desligado. -For the example, with number 137, Sam's clock requires: +Por exemplo, com o número 137, o relógio de Sam exige: -- `137`: $(2 + 5 + 4) × 2 = 22$ transitions (`137` on/off). -- `11`: $(2 + 2) × 2 = 8$ transitions (`11` on/off). -- `2`: $(5) × 2 = 10$ transitions (`2` on/off). +- `137`: $(2 + 5 + 4) × 2 = 22$ transições (`137` ligado/desligado). +- `11`: $(2 + 2) × 2 = 8$ transições (`11` ligado/desligado). +- `2`: $(5) × 2 = 10$ transições (`2` ligado/desligado). -For a grand total of 40 transitions. +Isso dá um total de 40 transições. -Max's clock works differently. Instead of turning off the whole panel, it is smart enough to turn off only those segments that won't be needed for the next number. +O relógio do Max funciona de maneira diferente. Em vez de desligar todo o painel, é inteligente o suficiente para desativar apenas os segmentos que não serão necessários para o próximo número. -For number 137, Max's clock requires: +Para o número 137, o relógio do Max exige: -- `137` : $2 + 5 + 4 = 11$ transitions (`137` on), $7$ transitions (to turn off the segments that are not needed for number `11`). -- `11` : $0$ transitions (number `11` is already turned on correctly), $3$ transitions (to turn off the first `1` and the bottom part of the second `1`; the top part is common with number `2`). -- `2` : $4$ transitions (to turn on the remaining segments in order to get a `2`), $5$ transitions (to turn off number `2`). +- `137` : $2 + 5 + 4 = 11$ transições (`137` ligado), $7$ transições (para desativar os segmentos que não são necessários para o número `11`). +- `11` : $0$ transições (número `11` já está ativado corretamente), $3$ transições (para desativar o primeiro `1` e a parte inferior do segundo `1`; a parte superior é comum com o número `2`). +- `2` : $4$ transições (para ativar os segmentos restantes para obter um `2`), $5$ transições (para desativar o número `2`). -For a grand total of 30 transitions. +Isso dá um total de 30 transições. -Of course, Max's clock consumes less power than Sam's one. The two clocks are fed all the prime numbers between $A = {10}^7$ and $B = 2 × {10}^7$. Find the difference between the total number of transitions needed by Sam's clock and that needed by Max's one. +Claro, o relógio de Max consome menos energia que o de Sam. Os dois relógios recebem todos os números primos entre $A = {10}^7$ e $B = 2 × {10}^7$. Encontre a diferença entre o número total de transições necessárias pelo relógio de Sam e as necessárias pelo relógio de Max. # --hints-- -`digitalRootClocks()` should return `13625242`. +`digitalRootClocks()` deve retornar `13625242`. ```js assert.strictEqual(digitalRootClocks(), 13625242); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-316-numbers-in-decimal-expansions.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-316-numbers-in-decimal-expansions.md index 991df99ffa1..b7c6ee9b052 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-316-numbers-in-decimal-expansions.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-316-numbers-in-decimal-expansions.md @@ -1,6 +1,6 @@ --- id: 5900f4a81000cf542c50ffbb -title: 'Problem 316: Numbers in decimal expansions' +title: 'Problema 316: Números em expansões decimais' challengeType: 1 forumTopicId: 301972 dashedName: problem-316-numbers-in-decimal-expansions @@ -8,31 +8,31 @@ dashedName: problem-316-numbers-in-decimal-expansions # --description-- -Let $p = p_1 p_2 p_3 \ldots$ be an infinite sequence of random digits, selected from {0,1,2,3,4,5,6,7,8,9} with equal probability. +Considere $p = p_1 p_2 p_3 \ldots$ como uma sequência infinita de algarismos aleatórios, selecionada a partir de {0,1,2,3,4,5, 6.7.7.8,9} com igual probabilidade. -It can be seen that $p$ corresponds to the real number $0.p_1 p_2 p_3 \ldots$. +Pode-se ver que $p$ corresponde ao número real $0.p_1 p_2 p_3 \ldots$. -It can also be seen that choosing a random real number from the interval [0,1) is equivalent to choosing an infinite sequence of random digits selected from {0,1,2,3,4,5,6,7,8,9} with equal probability. +Também pode-se ver que escolher um número aleatório real no intervalo [0, 1) equivale a escolher uma sequência infinita de algarismos aleatórios selecionados a partir de {0,1, 2, 3,4,5, 6,7,8,9} com igual probabilidade. -For any positive integer $n$ with $d$ decimal digits, let $k$ be the smallest index such that $p_k, p_{k + 1}, \ldots p_{k + d - 1}$ are the decimal digits of $n$, in the same order. +Para qualquer número inteiro positivo $n$ com $d$ algarismos decimais, considere $k$ como o menor índice de tal forma que $p_k, p_{k + 1}, \ldots p_{k + d - 1}$ são os algarismos decimais de $n$, na mesma ordem. -Also, let $g(n)$ be the expected value of $k$; it can be proven that $g(n)$ is always finite and, interestingly, always an integer number. +Além disso, considere $g(n)$ como o valor esperado de $k$; pode-se provar que $g(n)$ é sempre finito e, curiosamente, sempre um número inteiro. -For example, if $n = 535$, then +Por exemplo, se $n = 535$, então -for $p = 31415926\mathbf{535}897\ldots$, we get $k = 9$ +para $p = 31415926\mathbf{535}897\ldots$, temos que $k = 9$ -for $p = 35528714365004956000049084876408468\mathbf{535}4\ldots$, we get $k = 36$ +para $p = 35528714365004956000049084876408468\mathbf{535}4\ldots$, temos que $k = 36$ -etc and we find that $g(535) = 1008$. +etc. e vemos que $g(535) = 1008$. -Given that $\displaystyle\sum_{n = 2}^{999} g\left(\left\lfloor\frac{{10}^6}{n}\right\rfloor\right) = 27280188$, find $\displaystyle\sum_{n = 2}^{999\\,999} g\left(\left\lfloor\frac{{10}^{16}}{n}\right\rfloor\right)$. +Dado que $\displaystyle\sum_{n = 2}^{999} g\left(\left\lfloor\frac{{10}^6}{n}\right\rfloor\right) = 27280188$, find $\displaystyle\sum_{n = 2}^{999.999} g\left(\left\lfloor\frac{{10}^{16}}{n}\right\rfloor\right)$. -**Note:** $\lfloor x\rfloor$ represents the floor function. +**Observação:** $\lfloor x\rfloor$ representa a função piso. # --hints-- -`numbersInDecimalExpansion()` should return `542934735751917760`. +`numbersInDecimalExpansion()` deve retornar `542934735751917760`. ```js assert.strictEqual(numbersInDecimalExpansion(), 542934735751917760); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-317-firecracker.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-317-firecracker.md index f9715cfd8df..201cb630ea5 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-317-firecracker.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-317-firecracker.md @@ -1,6 +1,6 @@ --- id: 5900f4aa1000cf542c50ffbc -title: 'Problem 317: Firecracker' +title: 'Problema 317: Fogos de artifício' challengeType: 1 forumTopicId: 301973 dashedName: problem-317-firecracker @@ -8,15 +8,15 @@ dashedName: problem-317-firecracker # --description-- -A firecracker explodes at a height of 100 m above level ground. It breaks into a large number of very small fragments, which move in every direction; all of them have the same initial velocity of 20 $\frac{\text{m}}{\text{s}}$. +Um fogo de artifício explode a uma altura de 100 m acima do solo. Ele explode em um grande número de fragmentos muito pequenos, que se movem em todas as direções; todos eles têm a mesma velocidade inicial de 20 $\frac{\text{m}}{\text{s}}$. -We assume that the fragments move without air resistance, in a uniform gravitational field with $g=9.81 \frac{\text{m}}{\text{s}^2}$. +Assumimos que os fragmentos se movem sem resistência do ar, em um campo gravitacional uniforme com $g=9,81 \frac{\text{m}}{\text{s}^2}$. -Find the volume (in $\text{m}^3$) of the region through which the fragments move before reaching the ground. Give your answer rounded to four decimal places. +Encontre o volume (em $\text{m}^3$) da região através da qual os fragmentos se movem antes de chegar ao chão. Dê sua resposta arredondada para quatro casas decimais. # --hints-- -`firecracker()` should return `1856532.8455`. +`firecracker()` deve retornar `1856532.8455`. ```js assert.strictEqual(firecracker(), 1856532.8455); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-318-2011-nines.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-318-2011-nines.md index f4b4f8315b5..100277c73c7 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-318-2011-nines.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-318-2011-nines.md @@ -1,6 +1,6 @@ --- id: 5900f4ab1000cf542c50ffbd -title: 'Problem 318: 2011 nines' +title: 'Problema 318: 2011 noves' challengeType: 1 forumTopicId: 301974 dashedName: problem-318-2011-nines @@ -8,9 +8,9 @@ dashedName: problem-318-2011-nines # --description-- -Consider the real number $\sqrt{2} + \sqrt{3}$. +Considere o número real $\sqrt{2} + \sqrt{3}$. -When we calculate the even powers of $\sqrt{2} + \sqrt{3}$ we get: +Quando calculamos as potências pares de $\sqrt{2} + \sqrt{3}$ obtemos: $$\begin{align} & {(\sqrt{2} + \sqrt{3})}^2 = 9.898979485566356\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^4 = 97.98979485566356\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^6 = 969.998969071069263\ldots \\\\ @@ -18,19 +18,19 @@ $$\begin{align} & {(\sqrt{2} + \sqrt{3})}^2 = 9.898979485566356\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^{12} = 940897.9999989371855\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^{14} = 9313929.99999989263\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^{16} = 92198401.99999998915\ldots \\\\ \end{align}$$ -It looks like that the number of consecutive nines at the beginning of the fractional part of these powers is non-decreasing. In fact it can be proven that the fractional part of ${(\sqrt{2} + \sqrt{3})}^{2n}$ approaches 1 for large $n$. +Parece que o número de noves consecutivos no início da parte fracionária dessas potências não diminui. Na verdade, pode ser provado que a parte fracionária de ${(\sqrt{2} + \sqrt{3})}^{2n}$ aproxima-se de 1 para $n$ grandes. -Consider all real numbers of the form $\sqrt{p} + \sqrt{q}$ with $p$ and $q$ positive integers and $p < q$, such that the fractional part of ${(\sqrt{p} + \sqrt{q})}^{2n}$ approaches 1 for large $n$. +Considere todos os números reais da forma $\sqrt{p} + \sqrt{q}$ com $p$ e $q$ números inteiros positivos e $p < q$, tal que a parte fracionária de ${(\sqrt{p} + \sqrt{q})}^{2n}$ se aproxima de 1 para $n$ grandes. -Let $C(p,q,n)$ be the number of consecutive nines at the beginning of the fractional part of ${(\sqrt{p} + \sqrt{q})}^{2n}$. +Considere $C(p,q,n)$ como o número de noves consecutivos no início da parte fracionária de ${(\sqrt{p} + \sqrt{q})}^{2n}$. -Let $N(p,q)$ be the minimal value of $n$ such that $C(p,q,n) ≥ 2011$. +Considere $N(p,q)$ como o valor mínimo de $n$, tal que $C(p,q,n) ≥ 2011$. -Find $\sum N(p,q)$ for $p + q ≤ 2011$. +Encontre $\sum N(p,q)$ para $p + q ≤ 2011$. # --hints-- -`twoThousandElevenNines()` should return `709313889`. +`twoThousandElevenNines()` deve retornar `709313889`. ```js assert.strictEqual(twoThousandElevenNines(), 709313889); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-319-bounded-sequences.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-319-bounded-sequences.md index 36341fac54b..df96cc74e14 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-319-bounded-sequences.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-319-bounded-sequences.md @@ -1,6 +1,6 @@ --- id: 5900f4ab1000cf542c50ffbe -title: 'Problem 319: Bounded Sequences' +title: 'Problema 319: Sequências limitadas' challengeType: 1 forumTopicId: 301975 dashedName: problem-319-bounded-sequences @@ -8,21 +8,21 @@ dashedName: problem-319-bounded-sequences # --description-- -Let $x_1, x_2, \ldots, x_n$ be a sequence of length $n$ such that: +Considere $x_1, x_2, \ldots, x_n$ como uma sequência de comprimento $n$ para que: - $x_1 = 2$ -- for all $1 < i ≤ n : x_{i - 1} < x_i$ -- for all $i$ and $j$ with $1 ≤ i, j ≤ n : {(x_i)}^j < {(x_j + 1)}^i$ +- para todos os $1 < i ≤ n : x_{i - 1} < x_i$ +- para todos os $i$ e $j$ com $1 ≤ i, j ≤ n : {(x_i)}^j < {(x_j + 1)}^i$ -There are only five such sequences of length 2, namely: {2,4}, {2,5}, {2,6}, {2,7} and {2,8}. There are 293 such sequences of length 5; three examples are given below: {2,5,11,25,55}, {2,6,14,36,88}, {2,8,22,64,181}. +Há apenas cinco sequências de comprimento 2. Sejam elas: {2,4}, {2,5}, {2,6}, {2,7} e {2,8}. Há 293 sequências de comprimento 5. Três exemplos são dados abaixo: {2,5,11,25,55}, {2,6,14,36,88}, {2,8,22,64,181}. -Let $t(n)$ denote the number of such sequences of length $n$. You are given that $t(10) = 86195$ and $t(20) = 5227991891$. +Considere que $t(n)$ indica o número de tais sequências de comprimento $n$. Você é informado de que $t(10) = 86195$ e $t(20) = 5227991891$. -Find $t({10}^{10})$ and give your answer modulo $10^9$. +Encontre $t({10}^{10})$ e dê sua resposta modulo $10^9$. # --hints-- -`boundedSequences()` should return `268457129`. +`boundedSequences()` deve retornar `268457129`. ```js assert.strictEqual(boundedSequences(), 268457129); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-320-factorials-divisible-by-a-huge-integer.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-320-factorials-divisible-by-a-huge-integer.md index b0f0cc5c6ae..3298a38f15b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-320-factorials-divisible-by-a-huge-integer.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-320-factorials-divisible-by-a-huge-integer.md @@ -1,6 +1,6 @@ --- id: 5900f4ae1000cf542c50ffbf -title: 'Problem 320: Factorials divisible by a huge integer' +title: 'Problema 320: Fatoriais divisíveis por um número inteiro muito grande' challengeType: 1 forumTopicId: 301977 dashedName: problem-320-factorials-divisible-by-a-huge-integer @@ -8,17 +8,17 @@ dashedName: problem-320-factorials-divisible-by-a-huge-integer # --description-- -Let $N(i)$ be the smallest integer $n$ such that $n!$ is divisible by $(i!)^{1234567890}$ +Considere $N(i)$ como o menor número inteiro $n$, tal que $n!$ é divisível por $(i!)^{1234567890}$ -Let $S(u) = \sum N(i)$ for $10 ≤ i ≤ u$. +Considere $S(u) = \sum N(i)$ para $10 ≤ i ≤ u$. -$S(1000)=614\\,538\\,266\\,565\\,663$. +$S(1000)=614.538.266.565.663$. -Find $S(1\\,000\\,000)\bmod {10}^{18}$. +Encontre $S(1.000.000)\bmod {10}^{18}$. # --hints-- -`divisibleByHugeInteger()` should return `278157919195482660`. +`divisibleByHugeInteger()` deve retornar `278157919195482660`. ```js assert.strictEqual(divisibleByHugeInteger(), 278157919195482660); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-321-swapping-counters.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-321-swapping-counters.md index 177610fd3c7..578fcfdcaaf 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-321-swapping-counters.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-321-swapping-counters.md @@ -1,6 +1,6 @@ --- id: 5900f4ae1000cf542c50ffc0 -title: 'Problem 321: Swapping Counters' +title: 'Problema 321: Trocando contadores' challengeType: 1 forumTopicId: 301978 dashedName: problem-321-swapping-counters @@ -8,25 +8,25 @@ dashedName: problem-321-swapping-counters # --description-- -A horizontal row comprising of $2n + 1$ squares has $n$ red counters placed at one end and $n$ blue counters at the other end, being separated by a single empty square in the center. For example, when $n = 3$. +Uma linha horizontal que compreende $2n + 1$ quadrados tem $n$ contadores vermelhos colocados em uma extremidade e $n$ contadores azuis na outra extremidade, estando separados por um único quadrado vazio no centro. Por exemplo, para $n = 3$. -three squares with red and blue counters placed on opposite ends of the row, separated by one empty square +três quadrados com contadores vermelhos e azuis colocados em pontas opostas da linha, separados por um quadrado vazio -A counter can move from one square to the next (slide) or can jump over another counter (hop) as long as the square next to that counter is unoccupied. +Um contador pode se mover de um quadrado para o próximo (deslizando) ou pular sobre outro contador (salto) desde que o quadrado ao lado desse contador esteja desocupado. -allowed moves of the counter +movimentos permitidos do contador -Let $M(n)$ represent the minimum number of moves/actions to completely reverse the positions of the colored counters; that is, move all the red counters to the right and all the blue counters to the left. +Considere $M(n)$ como representando o número mínimo de movimentos/ações para reverter completamente as posições dos contadores coloridos; ou seja, mover todos os contadores vermelhos para a direita e todos os contadores azuis para a esquerda. -It can be verified $M(3) = 15$, which also happens to be a triangle number. +Pode-se verificar que $M(3) = 15$, que também é um número triangular. -If we create a sequence based on the values of n for which $M(n)$ is a triangle number then the first five terms would be: 1, 3, 10, 22, and 63, and their sum would be 99. +Se criarmos uma sequência baseada nos valores de n para os quais $M(n)$ é um número triangular, então os primeiros cinco termos seriam: 1, 3, 10, 22 e 63, a soma destes sendo 99. -Find the sum of the first forty terms of this sequence. +Encontre a soma dos primeiros quarenta termos desta sequência. # --hints-- -`swappingCounters()` should return `2470433131948040`. +`swappingCounters()` deve retornar `2470433131948040`. ```js assert.strictEqual(swappingCounters(), 2470433131948040); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-322-binomial-coefficients-divisible-by-10.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-322-binomial-coefficients-divisible-by-10.md index 2c1725a5c4b..c30b97e977a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-322-binomial-coefficients-divisible-by-10.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-322-binomial-coefficients-divisible-by-10.md @@ -1,6 +1,6 @@ --- id: 5900f4af1000cf542c50ffc1 -title: 'Problem 322: Binomial coefficients divisible by 10' +title: 'Problema 322: Coeficientes binomiais divisíveis por 10' challengeType: 1 forumTopicId: 301979 dashedName: problem-322-binomial-coefficients-divisible-by-10 @@ -8,15 +8,15 @@ dashedName: problem-322-binomial-coefficients-divisible-by-10 # --description-- -Let $T(m, n)$ be the number of the binomial coefficients ${}^iC_n$ that are divisible by 10 for $n ≤ i < m$ ($i$, $m$ and $n$ are positive integers). +Considere $T(m, n)$ como o número de coeficientes binomiais ${}^iC_n$ que são divisíveis por 10 para $n ≤ i < m$ ($i$, $m$ e $n$ são números inteiros positivos). -You are given that $T({10}^9, {10}^7 - 10) = 989\\,697\\,000$. +Você é informado de que $T({10}^9, {10}^7 - 10) = 989.697.000$. -Find $T({10}^{18}, {10}^{12} - 10)$. +Encontre $T({10}^{18}, {10}^{12} - 10)$. # --hints-- -`binomialCoefficientsDivisibleBy10()` should return `999998760323314000`. +`binomialCoefficientsDivisibleBy10()` deve retornar `999998760323314000`. ```js assert.strictEqual(binomialCoefficientsDivisibleBy10(), 999998760323314000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-323-bitwise-or-operations-on-random-integers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-323-bitwise-or-operations-on-random-integers.md index 7cd5acf36cc..167281a3eec 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-323-bitwise-or-operations-on-random-integers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-323-bitwise-or-operations-on-random-integers.md @@ -1,6 +1,6 @@ --- id: 5900f4b01000cf542c50ffc2 -title: 'Problem 323: Bitwise-OR operations on random integers' +title: 'Problema 323: Operações bitwise-OR em números inteiros aleatórios' challengeType: 1 forumTopicId: 301980 dashedName: problem-323-bitwise-or-operations-on-random-integers @@ -8,20 +8,20 @@ dashedName: problem-323-bitwise-or-operations-on-random-integers # --description-- -Let $y_0, y_1, y_2, \ldots$ be a sequence of random unsigned 32 bit integers (i.e. $0 ≤ y_i < 2^{32}$, every value equally likely). +Considere $y_0, y_1, y_2, \ldots$ como sendo uma sequência de números inteiros de 32 bits aleatórios e sem sinal (ou seja, $0 ≤ y_i < 2^{32}$, com qualquer valor sendo igualmente possível). -For the sequence $x_i$ the following recursion is given: +Para a sequência $x_i$, é dada a seguinte recursão: -- $x_0 = 0$ and -- $x_i = x_{i - 1} \mathbf{|} y_{i - 1}$, for $i > 0$. ($\mathbf{|}$ is the bitwise-OR operator) +- $x_0 = 0$ e +- $x_i = x_{i - 1} \mathbf{|} y_{i - 1}$, para $i > 0$. ($\mathbf{|}$ é a operação bitwise-OR) -It can be seen that eventually there will be an index $N$ such that $x_i = 2^{32} - 1$ (a bit-pattern of all ones) for all $i ≥ N$. +Pode-se ver que, eventualmente, haverá um índice $N$, tal que $x_i = 2^{32} - 1$ (um padrão de bits somente composto de 1s) para todos $i ≥ N$. -Find the expected value of $N$. Give your answer rounded to 10 digits after the decimal point. +Encontre o valor esperado de $N$. Dê sua resposta arredondada para 10 casas depois da vírgula. # --hints-- -`bitwiseOrOnRandomIntegers()` should return `6.3551758451`. +`bitwiseOrOnRandomIntegers()` deve retornar `6.3551758451`. ```js assert.strictEqual(bitwiseOrOnRandomIntegers(), 6.3551758451); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-324-building-a-tower.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-324-building-a-tower.md index e79296a5f0f..e691f4fcd68 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-324-building-a-tower.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-324-building-a-tower.md @@ -1,6 +1,6 @@ --- id: 5900f4b11000cf542c50ffc3 -title: 'Problem 324: Building a tower' +title: 'Problema 324: Construção de uma torre' challengeType: 1 forumTopicId: 301981 dashedName: problem-324-building-a-tower @@ -8,19 +8,19 @@ dashedName: problem-324-building-a-tower # --description-- -Let $f(n)$ represent the number of ways one can fill a $3×3×n$ tower with blocks of $2×1×1$. You're allowed to rotate the blocks in any way you like; however, rotations, reflections etc of the tower itself are counted as distinct. +Considere $f(n)$ como o número de maneiras que se pode preencher uma torre $3×3×n$ com blocos de $2×1×1$. Você tem permissão para girar os blocos da forma que quiser; no entanto, as rotações, reflexões etc. da própria torre serão contadas como distintas. -For example (with $q = 100\\,000\\,007$): +Por exemplo (com $q = 100.000.007$): $$\begin{align} & f(2) = 229, \\\\ - & f(4) = 117\\,805, \\\\ & f(10)\bmod q = 96\\,149\\,360, \\\\ - & f({10}^3)\bmod q = 24\\,806\\,056, \\\\ & f({10}^6)\bmod q = 30\\,808\\,124. \end{align}$$ + & f(4) = 117.805, \\\\ & f(10)\bmod q = 96.149.360, \\\\ + & f({10}^3)\bmod q = 24.806.056, \\\\ & f({10}^6)\bmod q = 30.808.124. \end{align}$$ -Find $f({10}^{10000})\bmod 100\\,000\\,007$. +Encontre $f({10}^{10000})\bmod 100.000.007$. # --hints-- -`buildingTower()` should return `96972774`. +`buildingTower()` deve retornar `96972774`. ```js assert.strictEqual(buildingTower(), 96972774); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-325-stone-game-ii.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-325-stone-game-ii.md index b1392c1e246..88b67a67f37 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-325-stone-game-ii.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-325-stone-game-ii.md @@ -1,6 +1,6 @@ --- id: 5900f4b11000cf542c50ffc4 -title: 'Problem 325: Stone Game II' +title: 'Problema 325: Jogo da pedra II' challengeType: 1 forumTopicId: 301982 dashedName: problem-325-stone-game-ii @@ -8,23 +8,23 @@ dashedName: problem-325-stone-game-ii # --description-- -A game is played with two piles of stones and two players. On each player's turn, the player may remove a number of stones from the larger pile. The number of stones removes must be a positive multiple of the number of stones in the smaller pile. +Uma partida é jogada com duas pilhas de pedras e dois jogadores. No turno de cada jogador, ele pode remover um número de pedras da pilha maior. O número de pedras removidas deve ser um múltiplo positivo do número de pedras na pilha menor. -E.g., let the ordered pair (6,14) describe a configuration with 6 stones in the smaller pile and 14 stones in the larger pile, then the first player can remove 6 or 12 stones from the larger pile. +Exemplo: considere o par ordenado (6,14) como capaz de descrever uma configuração com 6 pedras na pilha menor e 14 pedras na pilha maior. Então, o primeiro jogador pode remover 6 ou 12 pedras da pilha maior. -The player taking all the stones from a pile wins the game. +O jogador que pegar todas as pedras de uma pilha ganha o jogo. -A winning configuration is one where the first player can force a win. For example, (1,5), (2,6) and (3,12) are winning configurations because the first player can immediately remove all stones in the second pile. +Uma configuração vencedora é aquela onde o primeiro jogador pode forçar uma vitória. Por exemplo, (1,5), (2,6) e (3,12) são configurações vencedores porque o primeiro jogador pode remover imediatamente todas as pedras na segunda pilha. -A losing configuration is one where the second player can force a win, no matter what the first player does. For example, (2,3) and (3,4) are losing configurations: any legal move leaves a winning configuration for the second player. +Uma configuração perdedora é aquela onde o segundo jogador pode forçar uma vitória, não importando o que o primeiro jogador faça. Por exemplo, (2,3) e (3,4) são configurações perdedoras: qualquer movimento legal deixa uma configuração vencedora para o segundo jogador. -Define $S(N)$ as the sum of ($x_i + y_i$) for all losing configurations ($x_i$, $y_i$), $0 < x_i < y_i ≤ N$. We can verify that $S(10) = 211$ and $S({10}^4) = 230\\,312\\,207\\,313$. +Defina $S(N)$ como a soma de ($x_i + y_i$) para todas as configurações perdedoras ($x_i$, $y_i$), $0 < x_i < y_i ≤ N$. Podemos verificar que $S(10) = 211$ e $S({10}^4) = 230.312.207.313$. -Find $S({10}^{16})\bmod 7^{10}$. +Encontre $S({10}^{16})\bmod 7^{10}$. # --hints-- -`stoneGameTwo()` should return `54672965`. +`stoneGameTwo()` deve retornar `54672965`. ```js assert.strictEqual(stoneGameTwo(), 54672965); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-326-modulo-summations.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-326-modulo-summations.md index e43a4a9f23c..8e86f36dd63 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-326-modulo-summations.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-326-modulo-summations.md @@ -1,6 +1,6 @@ --- id: 5900f4b21000cf542c50ffc5 -title: 'Problem 326: Modulo Summations' +title: 'Problema 326: Somas de módulos' challengeType: 1 forumTopicId: 301983 dashedName: problem-326-modulo-summations @@ -8,23 +8,23 @@ dashedName: problem-326-modulo-summations # --description-- -Let $a_n$ be a sequence recursively defined by: $a_1 = 1$, $\displaystyle a_n = \left(\sum_{k = 1}^{n - 1} k \times a_k\right)\bmod n$. +Considere $a_n$ como sendo uma sequência recursivamente definida por: $a_1 = 1$, $\displaystyle a_n = \left(\sum_{k = 1}^{n - 1} k \times a_k\right)\bmod n$. -So the first 10 elements of $a_n$ are: 1, 1, 0, 3, 0, 3, 5, 4, 1, 9. +Portanto, os primeiros 10 elementos de $a_n$ são: 1, 1, 0, 3, 0, 3, 5, 4, 1, 9. -Let $f(N, M)$ represent the number of pairs $(p, q)$ such that: +Considere $f(N, M)$ como representando o número de pares $(p, q)$, de modo que: -$$ 1 \le p \le q \le N \\; \text{and} \\; \left(\sum_{i = p}^q a_i\right)\bmod M = 0$$ +$$ 1 \le p \le q \le N \\; \text{e} \\; \left(\sum_{i = p}^q a_i\right)\bmod M = 0$$ -It can be seen that $f(10, 10) = 4$ with the pairs (3,3), (5,5), (7,9) and (9,10). +Pode-se ver que $f(10, 10) = 4$ com os pares (3,3), (5,5), (7,9) e (9,10). -You are also given that $f({10}^4, {10}^3) = 97\\,158$. +Você também é informado de que $f({10}^4, {10}^3) = 97.158$. -Find $f({10}^{12}, {10}^6)$. +Encontre $f({10}^{12}, {10}^6)$. # --hints-- -`moduloSummations()` should return `1966666166408794400`. +`moduloSummations()` deve retornar `1966666166408794400`. ```js assert.strictEqual(moduloSummations(), 1966666166408794400); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-327-rooms-of-doom.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-327-rooms-of-doom.md index d324e96908a..c51f725d42e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-327-rooms-of-doom.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-327-rooms-of-doom.md @@ -1,6 +1,6 @@ --- id: 5900f4b31000cf542c50ffc6 -title: 'Problem 327: Rooms of Doom' +title: 'Problema 327: Salas da destruição' challengeType: 1 forumTopicId: 301984 dashedName: problem-327-rooms-of-doom @@ -8,35 +8,35 @@ dashedName: problem-327-rooms-of-doom # --description-- -A series of three rooms are connected to each other by automatic doors. +Uma série de três salas está interligada por portas automáticas. -series of three rooms, connected to each other by automatic doors +série de três salas interligada por portas automáticas -Each door is operated by a security card. Once you enter a room, the door automatically closes, and that security card cannot be used again. A machine will dispense an unlimited number of cards at the start, but each room (including the starting room) contains scanners. If they detect that you are holding more than three security cards or if they detect an unattended security card on the floor, then all the doors will become permanently locked. However, each room contains a box where you may safely store any number of security cards for use at a later stage. +Cada porta é operada por um cartão de segurança. Ao entrar em uma sala, a porta fecha automaticamente e esse cartão de segurança não poderá ser usado novamente. Uma máquina vai dispensar um número ilimitado de cartões no início, mas cada sala (incluindo a sala inicial) contém scanners. Caso eles detectem que você está segurando mais de três cartões de segurança ou caso eles detectem um cartão de segurança solto no chão, todas as portas ficarão permanentemente trancadas. No entanto, cada sala contém uma caixa onde você pode armazenar com segurança qualquer número de cartões de segurança para uso em uma fase posterior. -If you simply tried to travel through the rooms one at a time then as you entered room 3 you would have used all three cards and would be trapped in that room forever! +Se simplesmente tentássemos atravessar a sala uma por vez, quando entrássemos na sala 3, teríamos usado todos os três cartões e ficaríamos presos para sempre! -However, if you make use of the storage boxes, then escape is possible. For example, you could enter room 1 using your first card, place one card in the storage box, and use your third card to exit the room back to the start. Then after collecting three more cards from the dispensing machine you could use one to enter room 1 and collect the card you placed in the box a moment ago. You now have three cards again and will be able to travel through the remaining three doors. This method allows you to travel through all three rooms using six security cards in total. +No entanto, se utilizarmos as caixas de armazenamento, é possível escapar. Por exemplo, você pode entrar na sala 1 usando seu primeiro cartão, colocar um cartão na caixa de armazenamento, e usar seu terceiro cartão para sair da sala de volta ao início. Então, depois de coletar mais três cartões da máquina de dispensar, você poderia usar um para entrar na sala 1 e coletar o cartão que você colocou na caixa há alguns instantes. Você tem agora três cartões novamente e poderá passar pelas três portas que restam. Esse método permite que você viaje através de todas as três salas usando seis cartões de segurança no total. -It is possible to travel through six rooms using a total of 123 security cards while carrying a maximum of 3 cards. +É possível viajar através de seis salas utilizando um total de 123 cartões de segurança, enquanto se carrega um máximo de 3 cartões. -Let $C$ be the maximum number of cards which can be carried at any time. +Considere $C$ como o número máximo de cartões que podem ser transportados a qualquer momento. -Let $R$ be the number of rooms to travel through. +Considere $R$ como o número de salas a percorrer. -Let $M(C, R)$ be the minimum number of cards required from the dispensing machine to travel through $R$ rooms carrying up to a maximum of $C$ cards at any time. +Considere $M(C, R)$ como o número mínimo de cartões necessários da máquina de dispensa de cartões para viajar $R$ salas carregando até um máximo de $C$ cartões a qualquer momento. -For example, $M(3, 6) = 123$ and $M(4, 6) = 23$. +Por exemplo, $M(3, 6) = 123$ e $M(4, 6) = 23$. -And, $\sum M(C, 6) = 146$ for $3 ≤ C ≤ 4$. +E $\sum M(C, 6) = 146$ para $3 ≤ C ≤ 4$. -You are given that $\sum M(C, 10) = 10382$ for $3 ≤ C ≤ 10$. +Você é informado que $\sum M(C, 10) = 10382$ para $3 ≤ C ≤ 10$. -Find $\sum M(C, 30)$ for $3 ≤ C ≤ 40$. +Encontre $\sum M(C, 30)$ para $3 ≤ C ≤ 40$. # --hints-- -`roomsOfDoom()` should return `34315549139516`. +`roomsOfDoom()` deve retornar `34315549139516`. ```js assert.strictEqual(roomsOfDoom(), 34315549139516); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-328-lowest-cost-search.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-328-lowest-cost-search.md index 3d3d44147e3..27926a26063 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-328-lowest-cost-search.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-328-lowest-cost-search.md @@ -1,6 +1,6 @@ --- id: 5900f4b41000cf542c50ffc7 -title: 'Problem 328: Lowest-cost Search' +title: 'Problema 328: Pesquisa pelo menor custo' challengeType: 1 forumTopicId: 301985 dashedName: problem-328-lowest-cost-search @@ -8,29 +8,29 @@ dashedName: problem-328-lowest-cost-search # --description-- -We are trying to find a hidden number selected from the set of integers {1, 2, ..., $n$} by asking questions. Each number (question) we ask, has a cost equal to the number asked and we get one of three possible answers: +Estamos tentando encontrar um número oculto selecionado de um conjunto de números inteiros {1, 2, ..., $n$} fazendo perguntas. Cada número (pergunta) que perguntamos, tem um custo igual ao número solicitado e nós recebemos uma de três respostas possíveis: -- "Your guess is lower than the hidden number", or -- "Yes, that's it!", or -- "Your guess is higher than the hidden number". +- "Seu palpite é menor que o número oculto", ou +- "Sim, é isso!", ou +- "Seu palpite é maior que o número oculto". -Given the value of $n$, an optimal strategy minimizes the total cost (i.e. the sum of all the questions asked) for the worst possible case. E.g. +Dado o valor de $n$, uma estratégia ideal minimiza o custo total (ou seja, a soma de todas as perguntas feitas) para o pior caso possível. Ex: -If $n = 3$, the best we can do is obviously to ask the number "2". The answer will immediately lead us to find the hidden number (at a total cost = 2). +Se $n = 3$, o melhor que podemos fazer é obviamente perguntar o número "2". A resposta nos levará imediatamente a encontrar o número oculto (a um custo total de 2). -If $n = 8$, we might decide to use a "binary search" type of strategy: Our first question would be "4" and if the hidden number is higher than 4 we will need one or two additional questions. Let our second question be "6". If the hidden number is still higher than 6, we will need a third question in order to discriminate between 7 and 8. Thus, our third question will be "7" and the total cost for this worst-case scenario will be $4 + 6 + 7 = \mathbf{\color{red}{17}}$. +Se $n = 8$, nós podemos decidir usar um tipo de estratégia com "busca binária": nossa primeira questão seria "4" e se o número oculto for maior que 4, precisaremos de uma ou duas questões adicionais. Considere que nossa segunda pergunta seja "6". Se o número oculto ainda for superior a 6, necessitaremos de uma terceira pergunta para discriminar entre 7 e 8. Assim, nossa terceira pergunta será "7" e o custo total para este cenário pior, será $4 + 6 + 7 = \mathbf{\color{red}{17}}$. -We can improve considerably the worst-case cost for $n = 8$, by asking "5" as our first question. If we are told that the hidden number is higher than 5, our second question will be "7", then we'll know for certain what the hidden number is (for a total cost of $5 + 7 = \mathbf{\color{blue}{12}}$). If we are told that the hidden number is lower than 5, our second question will be "3" and if the hidden number is lower than 3 our third question will be "1", giving a total cost of $5 + 3 + 1 = \mathbf{\color{blue}{9}}$. Since $\mathbf{\color{blue}{12 > 9}}$, the worst-case cost for this strategy is 12. That's better than what we achieved previously with the "binary search" strategy; it is also better than or equal to any other strategy. So, in fact, we have just described an optimal strategy for $n = 8$. +Podemos melhorar consideravelmente o pior custo para $n = 8$, tendo "5" como nossa primeira pergunta. Se nos disserem que o número oculto é maior que 5, a nossa segunda pergunta será "7", então saberemos com certeza qual é o número oculto (para um custo total de $5 + 7 = \mathbf{\color{blue}{12}}$). Se nos disserem que o número oculto é menor que 5, nossa segunda pergunta será "3". Se for menor que 3, nossa terceira pergunta será "1", dando um custo total de $5 + 3 + 1 = \mathbf{\color{blue}{9}}$. Como $\mathbf{\color{blue}{12 > 9}}$, o pior caso de custo para esta estratégia é 12. Isso é melhor do que o que alcançamos anteriormente com a estratégia de "busca binária"; também é melhor ou igual a qualquer outra estratégia. Então, de fato, acabamos de descrever uma estratégia ideal para $n = 8$. -Let $C(n)$ be the worst-case cost achieved by an optimal strategy for $n$, as described above. Thus $C(1) = 0$, $C(2) = 1$, $C(3) = 2$ and $C(8) = 12$. +Considere $C(n)$ como o pior caso de custo alcançado com uma estratégia ideal para $n$, como descrito acima. Assim, $C(1) = 0$, $C(2) = 1$, $C(3) = 2$ e $C(8) = 12$. -Similarly, $C(100) = 400$ and $\displaystyle\sum_{n = 1}^{100} C(n) = 17575$. +Da mesma forma, $C(100) = 400$ e $\displaystyle\sum_{n = 1}^{100} C(n) = 17575$. -Find $\displaystyle\sum_{n = 1}^{200\\,000} C(n)$. +Encontre $\displaystyle\sum_{n = 1}^{200.000} C(n)$. # --hints-- -`lowestCostSearch()` should return `260511850222`. +`lowestCostSearch()` deve retornar `260511850222`. ```js assert.strictEqual(lowestCostSearch(), 260511850222); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-329-prime-frog.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-329-prime-frog.md index e14df07e58a..6c87868e62f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-329-prime-frog.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-329-prime-frog.md @@ -1,6 +1,6 @@ --- id: 5900f4b51000cf542c50ffc8 -title: 'Problem 329: Prime Frog' +title: 'Problema 329: Sapo primo' challengeType: 1 forumTopicId: 301986 dashedName: problem-329-prime-frog @@ -8,27 +8,27 @@ dashedName: problem-329-prime-frog # --description-- -Susan has a prime frog. +Susan tem um sapo primo. -Her frog is jumping around over 500 squares numbered 1 to 500. +Seu sapo está pulando por 500 quadrados numerados de 1 a 500. -He can only jump one square to the left or to the right, with equal probability, and he cannot jump outside the range [1;500]. (if it lands at either end, it automatically jumps to the only available square on the next move.) +Ele só pode pular um quadrado para a esquerda ou para a direita, com igual probabilidade, e não pode pular fora do intervalo [1;500]. Se ele cair em qualquer uma das extremidades, ele pula automaticamente para o único quadrado disponível na próxima vez. -When he is on a square with a prime number on it, he croaks 'P' (PRIME) with probability $\frac{2}{3}$ or 'N' (NOT PRIME) with probability $\frac{1}{3}$ just before jumping to the next square. When he is on a square with a number on it that is not a prime he croaks 'P' with probability $\frac{1}{3}$ or 'N' with probability $\frac{2}{3}$ just before jumping to the next square. +Quando ele está em um quadrado que tem um número primo, ele coaxa 'P' (PRIMO) com probabilidade $\frac{2}{3}$ ou 'N' (NÃO PRIMO) com probabilidade $\frac{1}{3}$ antes de pular para o próximo quadrado. Quando ele está em um quadrado que tem um número não primo, ele coaxa 'P' com probabilidade $\frac{1}{3}$ ou 'N' com probabilidade $\frac{2}{3}$ antes de pular para o próximo quadrado. -Given that the frog's starting position is random with the same probability for every square, and given that she listens to his first 15 croaks, what is the probability that she hears the sequence PPPPNNPPPNPPNPN? +Dado que a posição inicial do sapo é aleatória com a mesma probabilidade para cada quadrado, e tendo em conta que Susan ouve seus primeiros 15 coaxos, qual é a probabilidade de ouvir a sequência PPPPNNPPPNPPNPN? -Give your answer as a string as a fraction `p/q` in reduced form. +Dê sua resposta como uma string de uma fração `p/q` na forma reduzida. # --hints-- -`primeFrog()` should return a string. +`primeFrog()` deve retornar uma string. ```js assert(typeof primeFrog() === 'string'); ``` -`primeFrog()` should return the string `199740353/29386561536000`. +`primeFrog()` deve retornar a string `199740353/29386561536000`. ```js assert.strictEqual(primeFrog(), '199740353/29386561536000'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-330-eulers-number.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-330-eulers-number.md index 33079aadd49..0762e4a6bec 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-330-eulers-number.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-330-eulers-number.md @@ -1,6 +1,6 @@ --- id: 5900f4b71000cf542c50ffc9 -title: 'Problem 330: Euler''s Number' +title: 'Problema 330: Números de Euler' challengeType: 1 forumTopicId: 301988 dashedName: problem-330-eulers-number @@ -8,27 +8,27 @@ dashedName: problem-330-eulers-number # --description-- -An infinite sequence of real numbers $a(n)$ is defined for all integers $n$ as follows: +Uma sequência infinita de números reais $a(n)$ é definida para todos os números inteiros $n$ da seguinte forma: $$ a(n) = \begin{cases} 1 & n < 0 \\\\ \displaystyle \sum_{i = 1}^{\infty} \frac{a(n - 1)}{i!} & n \ge 0 \end{cases} $$ -For example, +Por exemplo: $$\begin{align} & a(0) = \frac{1}{1!} + \frac{1}{2!} + \frac{1}{3!} + \ldots = e − 1 \\\\ & a(1) = \frac{e − 1}{1!} + \frac{1}{2!} + \frac{1}{3!} + \ldots = 2e − 3 \\\\ & a(2) = \frac{2e − 3}{1!} + \frac{e − 1}{2!} + \frac{1}{3!} + \ldots = \frac{7}{2} e − 6 \end{align}$$ -with $e = 2.7182818\ldots$ being Euler's constant. +com $e = 2.7182818\ldots$ sendo a constante de Euler. -It can be shown that $a(n)$ is of the form $\displaystyle\frac{A(n)e + B(n)}{n!}$ for integers $A(n)$ and $B(n)$. +Pode-se mostrar que $a(n)$ está no formato $\displaystyle\frac{A(n)e + B(n)}{n!}$ para os números inteiros $A(n)$ e $B(n)$. -For example $\displaystyle a(10) = \frac{328161643e − 652694486}{10!}$. +Por exemplo, $\displaystyle a(10) = \frac{328161643e − 652694486}{10!}$. -Find $A({10}^9)$ + $B({10}^9)$ and give your answer $\bmod 77\\,777\\,777$. +Encontre $A({10}^9)$ + $B({10}^9)$ e dê sua resposta $\bmod 77\\,777\\,777$. # --hints-- -`eulersNumber()` should return `15955822`. +`eulersNumber()` deve retornar `15955822`. ```js assert.strictEqual(eulersNumber(), 15955822); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-331-cross-flips.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-331-cross-flips.md index 84e5ffbdd51..a04bd1b575d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-331-cross-flips.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-331-cross-flips.md @@ -1,6 +1,6 @@ --- id: 5900f4b71000cf542c50ffca -title: 'Problem 331: Cross flips' +title: 'Problema 331: Viradas cruzadas' challengeType: 1 forumTopicId: 301989 dashedName: problem-331-cross-flips @@ -8,25 +8,25 @@ dashedName: problem-331-cross-flips # --description-- -N×N disks are placed on a square game board. Each disk has a black side and white side. +Discos NxN são colocados em um tabuleiro de jogo quadrado. Cada disco tem um lado preto e um lado branco. -At each turn, you may choose a disk and flip all the disks in the same row and the same column as this disk: thus $2 × N - 1$ disks are flipped. The game ends when all disks show their white side. The following example shows a game on a 5×5 board. +A cada turno, você pode escolher um disco e virar todos os discos na mesma linha e na mesma coluna que este disco: portanto, $2 × N - 1$ discos são virados. O jogo termina quando todos os discos mostrarem o lado branco. O exemplo a seguir mostra um jogo em um tabuleiro 5×5. -animation showing game on 5x5 board +animação mostrando o jogo no tabuleiro 5x5 -It can be proven that 3 is the minimal number of turns to finish this game. +Pode-se provar que 3 é o número mínimo de turnos para terminar este jogo. -The bottom left disk on the $N×N$ board has coordinates (0, 0); the bottom right disk has coordinates ($N - 1$,$0$) and the top left disk has coordinates ($0$,$N - 1$). +O disco do canto inferior esquerdo no tabuleiro $N×N$ tem coordenadas (0, 0). O disco inferior direito tem coordenadas ($N - 1$,$0$) e o disco superior esquerdo têm coordenadas ($0$,$N - 1$). -Let $C_N$ be the following configuration of a board with $N × N$ disks: A disk at ($x$, $y$) satisfying $N - 1 \le \sqrt{x^2 + y^2} \lt N$, shows its black side; otherwise, it shows its white side. $C_5$ is shown above. +Considere $C_N$ como sendo a seguinte configuração de tabuleiro com $N × N$ discos: um disco em ($x$, $y$) satisfazendo $N - 1 \le \sqrt{x^2 + y^2} \lt N$, exibe o lado preto; do contrário, ele exibe o lado branco. $C_5$ é mostrado acima. -Let $T(N)$ be the minimal number of turns to finish a game starting from configuration $C_N$ or 0 if configuration $C_N$ is unsolvable. We have shown that $T(5) = 3$. You are also given that $T(10) = 29$ and $T(1\\,000) = 395\\,253$. +Considere $T(N)$ como o número mínimo de turnos para concluir um jogo começando da configuração $C_N$ ou 0 se a configuração $C_N$ não tiver resolução. Mostramos que $T(5) = 3$. Você também é informado de que $T(10) = 29$ e $T(1.000) = 395.253$. -Find $\displaystyle \sum_{i = 3}^{31} T(2^i - i)$. +Encontre $\displaystyle \sum_{i = 3}^{31} T(2^i - i)$. # --hints-- -`crossFlips()` should return `467178235146843500`. +`crossFlips()` deve retornar `467178235146843500`. ```js assert.strictEqual(crossFlips(), 467178235146843500); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-332-spherical-triangles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-332-spherical-triangles.md index 54fe2d09a50..96745d4dbc2 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-332-spherical-triangles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-332-spherical-triangles.md @@ -1,6 +1,6 @@ --- id: 5900f4b91000cf542c50ffcb -title: 'Problem 332: Spherical triangles' +title: 'Problema 332: Triângulos esféricos' challengeType: 1 forumTopicId: 301990 dashedName: problem-332-spherical-triangles @@ -8,25 +8,25 @@ dashedName: problem-332-spherical-triangles # --description-- -A spherical triangle is a figure formed on the surface of a sphere by three great circular arcs intersecting pairwise in three vertices. +Um triângulo esférico é uma figura formada na superfície de uma esfera por três grandes arcos circulares que se cruzam entre pares em três vértices. -spherical triangle formed on the surface of a sphere +triângulo esférico formado na superfície de uma esfera -Let $C(r)$ be the sphere with the centre (0,0,0) and radius $r$. +Considere $C(r)$ como a esfera com o centro (0,0,0) e raio $r$. -Let $Z(r)$ be the set of points on the surface of $C(r)$ with integer coordinates. +Considere $Z(r)$ como o conjunto de pontos na superfície de $C(r)$ com coordenadas em números inteiros. -Let $T(r)$ be the set of spherical triangles with vertices in $Z(r)$. Degenerate spherical triangles, formed by three points on the same great arc, are not included in $T(r)$. +Considere $T(r)$ como o conjunto de triângulos esféricos com vértices em $Z(r)$. Triângulos esféricos degenerados, formados por três pontos no mesmo grande arco, não estão incluídos em $T(r)$. -Let $A(r)$ be the area of the smallest spherical triangle in $T(r)$. +Considere $A(r)$ como a área do menor triângulo esférico em $T(r)$. -For example $A(14)$ is 3.294040 rounded to six decimal places. +Por exemplo, $A(14)$ é 3,294040 arredondado para seis casas decimais. -Find $\displaystyle \sum_{r = 1}^{50} A(r)$. Give your answer rounded to six decimal places. +Encontre $\displaystyle \sum_{r = 1}^{50} A(r)$. Dê sua resposta arredondada para seis casas decimais. # --hints-- -`sphericalTriangles()` should return `2717.751525`. +`sphericalTriangles()` deve retornar `2717.751525`. ```js assert.strictEqual(sphericalTriangles(), 2717.751525); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-333-special-partitions.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-333-special-partitions.md index 27cad095741..ce4adf91739 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-333-special-partitions.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-333-special-partitions.md @@ -1,6 +1,6 @@ --- id: 5900f4b91000cf542c50ffcc -title: 'Problem 333: Special partitions' +title: 'Problema 333: Partições especiais' challengeType: 1 forumTopicId: 301991 dashedName: problem-333-special-partitions @@ -8,26 +8,26 @@ dashedName: problem-333-special-partitions # --description-- -All positive integers can be partitioned in such a way that each and every term of the partition can be expressed as $2^i \times 3^j$, where $i, j ≥ 0$. +Todos os números inteiros positivos podem ser divididos de tal forma que cada termo da partição pode ser expresso como $2^i \times 3^j$, onde $i, j ≥ 0$. -Let's consider only those such partitions where none of the terms can divide any of the other terms. For example, the partition of $17 = 2 + 6 + 9 = (2^1 \times 3^0 + 2^1 \times 3^1 + 2^0 \times 3^2)$ would not be valid since 2 can divide 6. Neither would the partition $17 = 16 + 1 = (2^4 \times 3^0 + 2^0 \times 3^0)$ since 1 can divide 16. The only valid partition of 17 would be $8 + 9 = (2^3 \times 3^0 + 2^0 \times 3^2)$. +Consideremos apenas aquelas partições em que nenhum dos termos pode dividir qualquer um dos outros termos. Por exemplo, a partição de $17 = 2 + 6 + 9 = (2^1 \times 3^0 + 2^1 \times 3^1 + 2^0 \times 3^2)$ não seria válida, pois 2 pode dividir 6. Tão pouco a partição $17 = 16 + 1 = (2^4 \times 3^0 + 2^0 \times 3^0)$ seria válida, já que 1 pode dividir 16. A única partição válida de 17 seria $8 + 9 = (2^3 \times 3^0 + 2^0 \times 3^2)$. -Many integers have more than one valid partition, the first being 11 having the following two partitions. +Muitos números inteiros têm mais de uma partição válida, sendo o primeiro 11 tendo as duas partições que seguem. $$\begin{align} & 11 = 2 + 9 = (2^1 \times 3^0 + 2^0 \times 3^2) \\\\ & 11 = 8 + 3 = (2^3 \times 3^0 + 2^0 \times 3^1) \end{align}$$ -Let's define $P(n)$ as the number of valid partitions of $n$. For example, $P(11) = 2$. +Vamos definir $P(n)$ como o número de partições válidas de $n$. Por exemplo, $P(11) = 2$. -Let's consider only the prime integers $q$ which would have a single valid partition such as $P(17)$. +Vamos considerar apenas os números inteiros primos $q$ que teriam uma única partição válida como $P(17)$. -The sum of the primes $q <100$ such that $P(q) = 1$ equals 233. +A soma dos primos $q <100$, tal que $P(q) = 1$ é igual a 233. -Find the sum of the primes $q < 1\\,000\\,000$ such that $P(q) = 1$. +Encontre a soma dos números primos $q < 1.000.000$ tal que $P(q) = 1$. # --hints-- -`specialPartitions()` should return `3053105`. +`specialPartitions()` deve retornar `3053105`. ```js assert.strictEqual(specialPartitions(), 3053105); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-334-spilling-the-beans.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-334-spilling-the-beans.md index b301ac71594..745db1b805e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-334-spilling-the-beans.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-334-spilling-the-beans.md @@ -1,6 +1,6 @@ --- id: 5900f4ba1000cf542c50ffcd -title: 'Problem 334: Spilling the beans' +title: 'Problema 334: Derramando feijões' challengeType: 1 forumTopicId: 301992 dashedName: problem-334-spilling-the-beans @@ -8,26 +8,26 @@ dashedName: problem-334-spilling-the-beans # --description-- -In Plato's heaven, there exist an infinite number of bowls in a straight line. Each bowl either contains some or none of a finite number of beans. A child plays a game, which allows only one kind of move: removing two beans from any bowl, and putting one in each of the two adjacent bowls. The game ends when each bowl contains either one or no beans. +No céu de Platão, existe um número infinito de tigelas em linha reta. Cada tigela contém alguns ou nenhum de um número finito de feijões. Uma criança joga um jogo, que permite apenas um tipo de movimento: remover dois feijões de qualquer tigela. Ela coloca um em cada uma das duas tigelas adjacentes. O jogo termina quando cada tigela contém um ou nenhum feijão. -For example, consider two adjacent bowls containing 2 and 3 beans respectively, all other bowls being empty. The following eight moves will finish the game: +Por exemplo, considere duas tigelas adjacentes contendo 2 e 3 feijões, respectivamente. Todas as outras estão vazias. Os oito movimentos seguintes terminarão o jogo: -animation of game when two adjacent bowls contain 2 and 3 beans respectively +animação do jogo quando duas tigelas adjacentes contêm 2 e 3 feijões, respectivamente -You are given the following sequences: +Você recebe as seguintes sequências: $$\begin{align} & t_0 = 123456, \\\\ - & t_i = \begin{cases} \frac{t_{i - 1}}{2}, & \text{if $t_{i - 1}$ is even} \\\\ - \left\lfloor\frac{t_{i - 1}}{2}\right\rfloor \oplus 926252, & \text{if $t_{i - 1}$ is odd} \end{cases} \\\\ - & \qquad \text{where $⌊x⌋$ is the floor function and $\oplus$ is the bitwise XOR operator.} \\\\ & b_i = (t_i\bmod 2^{11}) + 1. \end{align}$$ + & t_i = \begin{cases} \frac{t_{i - 1}}{2}, & \text{if $t_{i - 1}$ é par} \\\\ + \left\lfloor\frac{t_{i - 1}}{2}\right\rfloor \oplus 926252, & \text{if $t_{i - 1}$ é ímpar} \end{cases} \\\\ + & \qquad \text{onde $⌊x⌋$ é a função piso e $\oplus$ é o operador bitwise XOR.} \\\\ & b_i = (t_i\bmod 2^{11}) + 1. \end{align}$$ -The first two terms of the last sequence are $b_1 = 289$ and $b_2 = 145$. If we start with $b_1$ and $b_2$ beans in two adjacent bowls, 3419100 moves would be required to finish the game. +Os dois primeiros termos da última sequência são $b_1 = 289$ e $b_2 = 145$. Se começarmos com $b_1$ e $b_2$ feijões em duas tigelas adjacentes, 3419100 movimentos seriam necessários para terminar o jogo. -Consider now 1500 adjacent bowls containing $b_1, b_2, \ldots, b_{1500}$ beans respectively, all other bowls being empty. Find how many moves it takes before the game ends. +Considere agora 1500 tigelas adjacentes contendo $b_1, b_2, \ldots, b_{1500}$ feijões, respectivamente. Todas as outras tigelas estão vazias. Descubra quantos movimentos são necessários antes de o jogo terminar. # --hints-- -`spillingTheBeans()` should return `150320021261690850`. +`spillingTheBeans()` deve retornar `150320021261690850`. ```js assert.strictEqual(spillingTheBeans(), 150320021261690850); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-335-gathering-the-beans.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-335-gathering-the-beans.md index c1b35177c9b..39ed882ae30 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-335-gathering-the-beans.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-335-gathering-the-beans.md @@ -1,6 +1,6 @@ --- id: 5900f4bd1000cf542c50ffce -title: 'Problem 335: Gathering the beans' +title: 'Problema 335: Juntando feijões' challengeType: 1 forumTopicId: 301993 dashedName: problem-335-gathering-the-beans @@ -8,19 +8,19 @@ dashedName: problem-335-gathering-the-beans # --description-- -Whenever Peter feels bored, he places some bowls, containing one bean each, in a circle. After this, he takes all the beans out of a certain bowl and drops them one by one in the bowls going clockwise. He repeats this, starting from the bowl he dropped the last bean in, until the initial situation appears again. For example with 5 bowls he acts as follows: +Sempre que Peter se sente entediado, coloca algumas tigelas, contendo um feijão em cada, em um círculo. Depois disso, ele tira todos os feijões de uma determinada tigela e os coloca um a um nos copos indo no sentido horário. Ele repete isso, começando pela tigela em que deixou cair o último feijão, até que a situação inicial volte a aparecer. Por exemplo, com 5 tigelas, ele age da seguinte forma: -animation of moving beans in 5 bowls +animação de mover feijões em 5 tigelas -So with 5 bowls it takes Peter 15 moves to return to the initial situation. +Assim, com 5 tigelas, é preciso que Peter faça 15 movimentos para regressar à situação inicial. -Let $M(x)$ represent the number of moves required to return to the initial situation, starting with $x$ bowls. Thus, $M(5) = 15$. It can also be verified that $M(100) = 10920$. +Considere $M(x)$ como a representação do número de movimentos necessários para retornar à situação inicial, começando com $x$ tigelas. Assim, $M(5) = 15$. Pode-se verificar que $M(100) = 10920$. -Find $\displaystyle\sum_{k = 0}^{{10}^{18}} M(2^k + 1)$. Give your answer modulo $7^9$. +Encontre $\displaystyle\sum_{k = 0}^{{10}^{18}} M(2^k + 1)$. Dê sua resposta modulo $7^9$. # --hints-- -`gatheringTheBeans()` should return `5032316`. +`gatheringTheBeans()` deve retornar `5032316`. ```js assert.strictEqual(gatheringTheBeans(), 5032316); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-337-totient-stairstep-sequences.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-337-totient-stairstep-sequences.md index ed090ed3f86..e23b61a3906 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-337-totient-stairstep-sequences.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-337-totient-stairstep-sequences.md @@ -1,6 +1,6 @@ --- id: 5900f4be1000cf542c50ffd0 -title: 'Problem 337: Totient Stairstep Sequences' +title: 'Problema 337: Sequências de degraus totientes' challengeType: 1 forumTopicId: 301995 dashedName: problem-337-totient-stairstep-sequences @@ -8,25 +8,25 @@ dashedName: problem-337-totient-stairstep-sequences # --description-- -Let $\\{a_1, a_2, \ldots, a_n\\}$ be an integer sequence of length $n$ such that: +Considere $\\{a_1, a_2, \ldots, a_n\\}$ como uma sequência de números inteiros de comprimento $n$, tal que: - $a_1 = 6$ -- for all $1 ≤ i < n$ : $φ(a_i) < φ(a_{i + 1}) < a_i < a_{i + 1}$ +- para todo $1 ≤ i < n$ : $φ(a_i) < φ(a_{i + 1}) < a_i < a_{i + 1}$ -$φ$ denotes Euler's totient function. +$φ$ denota a função totiente de Euler. -Let $S(N)$ be the number of such sequences with $a_n ≤ N$. +Considere $S(N)$ como o número dessas sequências, com $a_n ≤ N$. -For example, $S(10) = 4$: {6}, {6, 8}, {6, 8, 9} and {6, 10}. +Por exemplo, $S(10) = 4$: {6}, {6, 8}, {6, 8, 9} e {6, 10}. -We can verify that $S(100) = 482\\,073\\,668$ and $S(10\\,000)\bmod {10}^8 = 73\\,808\\,307$. +Podemos verificar que $S(100) = 482.073.668$ e $S(10.000)\bmod {10}^8 = 73.808.307$. -Find $S(20\\,000\\,000)\bmod {10}^8$. +Encontre $S(20.000.000)\bmod {10}^8$. # --hints-- -`totientStairstepSequences()` should return `85068035`. +`totientStairstepSequences()` deve retornar `85068035`. ```js assert.strictEqual(totientStairstepSequences(), 85068035); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-338-cutting-rectangular-grid-paper.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-338-cutting-rectangular-grid-paper.md index 9a2143b65fd..852c0a6464e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-338-cutting-rectangular-grid-paper.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-338-cutting-rectangular-grid-paper.md @@ -1,6 +1,6 @@ --- id: 5900f4be1000cf542c50ffd1 -title: 'Problem 338: Cutting Rectangular Grid Paper' +title: 'Problema 338: Corte de papel de grade retangular' challengeType: 1 forumTopicId: 301996 dashedName: problem-338-cutting-rectangular-grid-paper @@ -8,25 +8,25 @@ dashedName: problem-338-cutting-rectangular-grid-paper # --description-- -A rectangular sheet of grid paper with integer dimensions $w$ × $h$ is given. Its grid spacing is 1. +Você recebe uma folha retangular de papel de grade com dimensões em números inteiros $w$ × $h$. O espaçamento da grade é de 1. -When we cut the sheet along the grid lines into two pieces and rearrange those pieces without overlap, we can make new rectangles with different dimensions. +Quando cortamos as folhas ao longo das linhas da grade em duas partes e reorganizamos essas peças sem sobreposição, podemos criar retângulos com dimensões diferentes. -For example, from a sheet with dimensions 9 × 4, we can make rectangles with dimensions 18 × 2, 12 × 3 and 6 × 6 by cutting and rearranging as below: +Por exemplo, a partir de uma folha com dimensões 9 × 4, podemos fazer retângulos com dimensões 18 × 2, 12 × 3 e 6 × 6 cortando e reorganizando como vemos abaixo: -sheet with 9 x 4 dimensions cut in three different ways to make rectangles with 18 x 2, 12 x 3 and 6 x 6 dimensions +folha com dimensões 9 x 4 cortada em três maneiras diferentes para criar retângulos com dimensões 18 x 2, 12 x 3 e 6 x 6 -Similarly, from a sheet with dimensions 9 × 8, we can make rectangles with dimensions 18 × 4 and 12 × 6. +Da mesma forma, a partir de uma folha com dimensões 9 × 8, podemos fazer retângulos com dimensões 18 × 4 e 12 × 6. -For a pair $w$ and $h$, let $F(w, h)$ be the number of distinct rectangles that can be made from a sheet with dimensions $w$ × $h$. For example, $F(2, 1) = 0$, $F(2, 2) = 1$, $F(9, 4) = 3$ and $F(9, 8) = 2$. Note that rectangles congruent to the initial one are not counted in $F(w, h)$. Note also that rectangles with dimensions $w$ × $h$ and dimensions $h$ × $w$ are not considered distinct. +Para um par $w$ e $h$, considere $F(w, h)$ como o número de retângulos distintos que podem ser feitos a partir de uma folha com dimensões $w$ × $h$. Por exemplo, $F(2, 1) = 0$, $F(2, 2) = 1$, $F(9, 4) = 3$ e $F(9, 8) = 2$. Observe que os retângulos congruentes com o inicial não são contados em $F(w, h)$. Observe também que os retângulos com dimensões $w$ × $h$ e as dimensões $h$ × $w$ não são considerados distintos. -For an integer $N$, let $G(N)$ be the sum of $F(w, h)$ for all pairs $w$ and $h$ which satisfy $0 < h ≤ w ≤ N$. We can verify that $G(10) = 55$, $G({10}^3) = 971\\,745$ and $G({10}^5) = 9\\,992\\,617\\,687$. +Para um número inteiro $N$, considere $G(N)$ como a soma de $F(w, h)$ para todos os pares $w$ e $h$ que satisfazem $0 < h ≤ w ≤ N$. Podemos verificar que $G(10) = 55$, $G({10}^3) = 971.745$ e $G({10}^5) = 9.992.617.687$. -Find $G({10}^{12})$. Give your answer modulo ${10}^8$. +Encontre $G({10}^{12})$. Dê sua resposta modulo ${10}^8$. # --hints-- -`cuttingRectangularGridPaper()` should return `15614292`. +`cuttingRectangularGridPaper()` deve retornar `15614292`. ```js assert.strictEqual(cuttingRectangularGridPaper(), 15614292); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-339-peredur-fab-efrawg.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-339-peredur-fab-efrawg.md index 7c1934c581b..64a18ea6644 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-339-peredur-fab-efrawg.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-339-peredur-fab-efrawg.md @@ -1,6 +1,6 @@ --- id: 5900f4c01000cf542c50ffd2 -title: 'Problem 339: Peredur fab Efrawg' +title: 'Problema 339: Peredur fab Efrawg' challengeType: 1 forumTopicId: 301997 dashedName: problem-339-peredur-fab-efrawg @@ -8,17 +8,17 @@ dashedName: problem-339-peredur-fab-efrawg # --description-- -"And he came towards a valley, through which ran a river; and the borders of the valley were wooded, and on each side of the river were level meadows. And on one side of the river he saw a flock of white sheep, and on the other a flock of black sheep. And whenever one of the white sheep bleated, one of the black sheep would cross over and become white; and when one of the black sheep bleated, one of the white sheep would cross over and become black." - Peredur the Son of Evrawc +"E ele veio na direção de um vale, pelo qual atravessava um rio; e as fronteiras do vale tinham bosques, e de cada lado do rio haviam planícies verdes. De um lado do rio, ele viu um rebanho de ovelhas brancas. Do outro, um rebanho de ovelhas negras. E sempre que uma das ovelhas brancas balia, uma das ovelhas negras cruzava e se tornava branca. Quando uma das ovelhas negras balia, uma das ovelhas brancas cruzava e se tornava negra." - Peredur, filho de Evrawc -Initially, each flock consists of $n$ sheep. Each sheep (regardless of color) is equally likely to be the next sheep to bleat. After a sheep has bleated and a sheep from the other flock has crossed over, Peredur may remove a number of white sheep in order to maximize the expected final number of black sheep. Let $E(n)$ be the expected final number of black sheep if Peredur uses an optimal strategy. +Inicialmente, cada rebanho consiste em $n$ ovelhas. Cada ovelha (independente da cor) tem a mesma probabilidade de ser a ovelha seguinte a balir. Depois que uma ovelha balir e que uma ovelha do outro rebanho tiver cruzado, Peredur pode remover um número de ovelhas brancas para maximizar o número final esperado de ovelhas negras. Considere $E(n)$ como o número final esperado de ovelhas negras se Peredur usar uma estratégia ideal. -You are given that $E(5) = 6.871346$ rounded to 6 places behind the decimal point. +Você é informado de que $E(5) = 6,871346$, arredondado para 6 casas decimais depois da vírgula. -Find $E(10\\,000)$ and give your answer rounded to 6 places behind the decimal point. +Encontre $E(10.000)$ e dê sua resposta arredondada para 6 casas decimais depois da vírgula. # --hints-- -`peredurFabEfrawg()` should return `19823.542204`. +`peredurFabEfrawg()` deve retornar `19823.542204`. ```js assert.strictEqual(peredurFabEfrawg(), 19823.542204); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-341-golombs-self-describing-sequence.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-341-golombs-self-describing-sequence.md index f3ebbd9cdd0..21735cc6a67 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-341-golombs-self-describing-sequence.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-341-golombs-self-describing-sequence.md @@ -1,6 +1,6 @@ --- id: 5900f4c11000cf542c50ffd3 -title: 'Problem 341: Golomb''s self-describing sequence' +title: 'Problema 341: Sequência autodescritiva de Golomb' challengeType: 1 forumTopicId: 302000 dashedName: problem-341-golombs-self-describing-sequence @@ -8,20 +8,20 @@ dashedName: problem-341-golombs-self-describing-sequence # --description-- -The Golomb's self-describing sequence ($G(n)$) is the only nondecreasing sequence of natural numbers such that $n$ appears exactly $G(n)$ times in the sequence. The values of $G(n)$ for the first few $n$ are +A sequência autodescritiva de Golomb ($G(n)$) é a única sequência não decrescente de números naturais, tal que $n$ aparece exatamente $G(n)$ vezes na sequência. Os valores de $G(n)$ para os primeiros $n$ são $$\begin{array}{c} n & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 & 14 & 15 & \ldots \\\\ G(n) & 1 & 2 & 2 & 3 & 3 & 4 & 4 & 4 & 5 & 5 & 5 & 6 & 6 & 6 & 6 & \ldots \end{array}$$ -You are given that $G({10}^3) = 86$, $G({10}^6) = 6137$. +Você é informado de que $G({10}^3) = 86$, $G({10}^6) = 6137$. -You are also given that $\sum G(n^3) = 153\\,506\\,976$ for $1 ≤ n < {10}^3$. +Você também fica sabendo de que $\sum G(n^3) = 153.506.976$ para $1 ≤ n < {10}^3$. -Find $\sum G(n^3)$ for $1 ≤ n < {10}^6$. +Encontre $\sum G(n^3)$ para $1 ≤ n < {10}^6$. # --hints-- -`golombsSequence()` should return `56098610614277016`. +`golombsSequence()` deve retornar `56098610614277016`. ```js assert.strictEqual(golombsSequence(), 56098610614277016); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-342-the-totient-of-a-square-is-a-cube.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-342-the-totient-of-a-square-is-a-cube.md index 85990bc5b54..57b7dbbae87 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-342-the-totient-of-a-square-is-a-cube.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-342-the-totient-of-a-square-is-a-cube.md @@ -1,6 +1,6 @@ --- id: 5900f4c31000cf542c50ffd5 -title: 'Problem 342: The totient of a square is a cube' +title: 'Problema 342: O totiente de um quadrado é um cubo' challengeType: 1 forumTopicId: 302001 dashedName: problem-342-the-totient-of-a-square-is-a-cube @@ -8,18 +8,18 @@ dashedName: problem-342-the-totient-of-a-square-is-a-cube # --description-- -Consider the number 50. +Considere o número 50. -${50}^2 = 2500 = 2^2 × 5^4$, so $φ(2500) = 2 × 4 × 5^3 = 8 × 5^3 = 2^3 × 5^3$. $φ$ denotes Euler's totient function. +${50}^2 = 2500 = 2^2 × 5^4$, então $φ(2500) = 2 × 4 × 5^3 = 8 × 5^3 = 2^3 × 5^3$. $φ$ é a função totiente de Euler. -So 2500 is a square and $φ(2500)$ is a cube. +Portanto, 2500 é um quadrado e $φ(2500)$ é um cubo. -Find the sum of all numbers $n$, $1 < n < {10}^{10}$ such that $φ(n^2)$ is a cube. +Encontre a soma de todos os números $n$, $1 < n < {10}^{10}$, tal que $φ(n^2)$ é um cubo. # --hints-- -`totientOfSquare()` should return `5943040885644`. +`totientOfSquare()` deve retornar `5943040885644`. ```js assert.strictEqual(totientOfSquare(), 5943040885644); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-343-fractional-sequences.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-343-fractional-sequences.md index f284af9e94b..35b64e5bda6 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-343-fractional-sequences.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-343-fractional-sequences.md @@ -1,6 +1,6 @@ --- id: 5900f4c41000cf542c50ffd6 -title: 'Problem 343: Fractional Sequences' +title: 'Problema 343: Sequências fracionárias' challengeType: 1 forumTopicId: 302002 dashedName: problem-343-fractional-sequences @@ -8,28 +8,28 @@ dashedName: problem-343-fractional-sequences # --description-- -For any positive integer $k$, a finite sequence $a_i$ of fractions $\frac{x_i}{y_i}$ is defined by: +Para qualquer número inteiro positivo $k$, uma sequência finita $a_i$ de frações $\frac{x_i}{y_i}$ é definida por: -- $a_1 = \displaystyle\frac{1}{k}$ and -- $a_i = \displaystyle\frac{(x_{i - 1} + 1)}{(y_{i - 1} - 1)}$ reduced to lowest terms for $i > 1$. +- $a_1 = \displaystyle\frac{1}{k}$ e +- $a_i = \displaystyle\frac{(x_{i - 1} + 1)}{(y_{i - 1} - 1)}$ reduzida aos menores termos para $i > 1$. -When $a_i$ reaches some integer $n$, the sequence stops. (That is, when $y_i = 1$.) +Quando $a_i$ alcança um número inteiro $n$, a sequência para. (Ou seja, quando $y_i = 1$.) -Define $f(k) = n$. +Defina $f(k) = n$. -For example, for $k = 20$: +Por exemplo, para $k = 20$: $$\frac{1}{20} → \frac{2}{19} → \frac{3}{18} = \frac{1}{6} → \frac{2}{5} → \frac{3}{4} → \frac{4}{3} → \frac{5}{2} → \frac{6}{1} = 6$$ -So $f(20) = 6$. +Então, $f(20) = 6$. -Also $f(1) = 1$, $f(2) = 2$, $f(3) = 1$ and $\sum f(k^3) = 118\\,937$ for $1 ≤ k ≤ 100$. +Além disso $f(1) = 1$, $f(2) = 2$, $f(3) = 1$ e $\sum f(k^3) = 118.937$ para $1 ≤ k ≤ 100$. -Find $\sum f(k^3)$ for $1 ≤ k ≤ 2 × {10}^6$. +Encontre $\sum f(k^3)$ para $1 ≤ k ≤ 2 × {10}^6$. # --hints-- -`fractionalSequences()` should return `269533451410884200`. +`fractionalSequences()` deve retornar `269533451410884200`. ```js assert.strictEqual(fractionalSequences(), 269533451410884200); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-344-silver-dollar-game.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-344-silver-dollar-game.md index 0f9fcc5f2e6..cce17e5c467 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-344-silver-dollar-game.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-344-silver-dollar-game.md @@ -1,6 +1,6 @@ --- id: 5900f4c51000cf542c50ffd7 -title: 'Problem 344: Silver dollar game' +title: 'Problema 344: Jogo do dólar de prata' challengeType: 1 forumTopicId: 302003 dashedName: problem-344-silver-dollar-game @@ -8,29 +8,29 @@ dashedName: problem-344-silver-dollar-game # --description-- -One variant of N.G. de Bruijn's silver dollar game can be described as follows: +O jogo de N.G. de Bruijn, conhecido como o jogo do dólar de prata, tem uma variante que pode ser descrita da seguinte forma: -On a strip of squares a number of coins are placed, at most one coin per square. Only one coin, called the silver dollar, has any value. Two players take turns making moves. At each turn a player must make either a regular or a special move. +Em uma faixa de quadrados, várias moedas são colocadas, estando, no máximo, uma moeda por quadrado. Apenas uma moeda, chamada de dólar de prata, tem qualquer valor. Dois jogadores se revezam fazendo movimentos. Em cada turno, um jogador deve fazer um movimento regular ou especial. -A regular move consists of selecting one coin and moving it one or more squares to the left. The coin cannot move out of the strip or jump on or over another coin. +Um movimento regular consiste em selecionar uma moeda e movê-la um ou mais quadrados para a esquerda. A moeda não pode se mover para fora da faixa nem saltar sobre ou por cima de outra moeda. -Alternatively, the player can choose to make the special move of pocketing the leftmost coin rather than making a regular move. If no regular moves are possible, the player is forced to pocket the leftmost coin. +Como alternativa, o jogador pode escolher fazer o movimento especial de guardar a moeda mais à esquerda, em vez de fazer um movimento regular. Se nenhum movimento regular for possível, o jogador será forçado a guardar a moeda mais à esquerda. -The winner is the player who pockets the silver dollar. +O vencedor é o jogador que guarda o dólar de prata. -silver dollar game +jogo do dólar de prata -A winning configuration is an arrangement of coins on the strip where the first player can force a win no matter what the second player does. +Uma configuração vencedora é um arranjo de moedas na faixa onde o primeiro jogador pode forçar uma vitória, não importa o que o segundo jogador fizer. -Let $W(n, c)$ be the number of winning configurations for a strip of $n$ squares, $c$ worthless coins and one silver dollar. +Considere $W(n, c)$ como o número de configurações vencedoras para uma faixa de $n$ quadrados, $c$ moedas sem valor e um dólar de prata. -You are given that $W(10, 2) = 324$ and $W(100, 10) = 1\\,514\\,704\\,946\\,113\\,500$. +Você é informado de que $W(10, 2) = 324$ e $W(100, 10) = 1.514.704.946.113.500$. -Find $W(1\\,000\\,000, 100)$ modulo the semiprime $1000\\,036\\,000\\,099 (= 1\\,000\\,003 \times 1\\,000\\,033)$. +Encontre $W(1.000.000, 100)$ modulo o número semiprimo $1000.036.000.099 (= 1.000.003 \times 1.000.033)$. # --hints-- -`silverDollarGame()` should return `65579304332`. +`silverDollarGame()` deve retornar `65579304332`. ```js assert.strictEqual(silverDollarGame(), 65579304332); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-345-matrix-sum.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-345-matrix-sum.md index 19aa26fd74f..afb4faf1215 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-345-matrix-sum.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-345-matrix-sum.md @@ -1,6 +1,6 @@ --- id: 5900f4c81000cf542c50ffda -title: 'Problem 345: Matrix Sum' +title: 'Problema 345: Soma interna da matriz' challengeType: 1 forumTopicId: 302004 dashedName: problem-345-matrix-sum @@ -8,15 +8,15 @@ dashedName: problem-345-matrix-sum # --description-- -We define the Matrix Sum of a matrix as the maximum sum of matrix elements with each element being the only one in his row and column. +Definimos a soma interna da matriz como a soma máxima dos elementos da matriz com cada elemento sendo o único em sua linha e coluna. -For example, the Matrix Sum of the matrix below equals $3315 ( = 863 + 383 + 343 + 959 + 767)$: +Por exemplo, a soma interna da matriz abaixo é igual a $3315 ( = 863 + 383 + 343 + 959 + 767)$: $$\begin{array}{rrrrr} 7 & 53 & 183 & 439 & \color{lime}{863} \\\\ 497 & \color{lime}{383} & 563 & 79 & 973 \\\\ 287 & 63 & \color{lime}{343} & 169 & 583 \\\\ 627 & 343 & 773 & \color{lime}{959} & 943 \\\\ \color{lime}{767} & 473 & 103 & 699 & 303 \end{array}$$ -Find the Matrix Sum of: +Encontre a soma interna da matriz de: $$\\begin{array}{r} 7 & 53 & 183 & 439 & 863 & 497 & 383 & 563 & 79 & 973 & 287 & 63 & 343 & 169 & 583 \\\\ 627 & 343 & 773 & 959 & 943 & 767 & 473 & 103 & 699 & 303 & 957 & 703 & 583 & 639 & 913 \\\\ 447 & 283 & 463 & 29 & 23 & 487 & 463 & 993 & 119 & 883 & 327 & 493 & 423 & 159 & 743 \\\\ @@ -29,7 +29,7 @@ $$\\begin{array}{r} 7 & 53 & 183 & 439 & 863 & 497 & 383 & 563 & 79 & 973 # --hints-- -`matrixSum()` should return `13938`. +`matrixSum()` deve retornar `13938`. ```js assert.strictEqual(matrixSum(), 13938); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-346-strong-repunits.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-346-strong-repunits.md index 98b7cc48b2f..9ec3ed48be8 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-346-strong-repunits.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-346-strong-repunits.md @@ -1,6 +1,6 @@ --- id: 5900f4c71000cf542c50ffd8 -title: 'Problem 346: Strong Repunits' +title: 'Problema 346: Repunits fortes' challengeType: 1 forumTopicId: 302005 dashedName: problem-346-strong-repunits @@ -8,15 +8,15 @@ dashedName: problem-346-strong-repunits # --description-- -The number 7 is special, because 7 is 111 written in base 2, and 11 written in base 6 (i.e. $7_{10} = {11}_6 = {111}_2$). In other words, 7 is a repunit in at least two bases $b > 1$. +O número 7 é especial, porque 7 é 111 escrito na base 2 e 11 escrito na base 6 (ou seja, $7_{10} = {11}_6 = {111}_2$). Em outras palavras, 7 é um repunit em pelo menos duas bases $b > 1$. -We shall call a positive integer with this property a strong repunit. It can be verified that there are 8 strong repunits below 50: {1, 7, 13, 15, 21, 31, 40, 43}. Furthermore, the sum of all strong repunits below 1000 equals 15864. +Vamos chamar um número inteiro positivo com essa propriedade de um repunit forte. É possível verificar que há 8 repunits fortes abaixo de 50: {1, 7, 13, 15, 21, 31, 40, 43}. Além disso, a soma de todos os repunits fortes inferiores a 1000 é igual a 15864. -Find the sum of all strong repunits below ${10}^{12}$. +Encontre a soma de todos os repunits fortes abaixo de ${10}^{12}$. # --hints-- -`strongRepunits()` should return `336108797689259260`. +`strongRepunits()` deve retornar `336108797689259260`. ```js assert.strictEqual(strongRepunits(), 336108797689259260); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-347-largest-integer-divisible-by-two-primes.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-347-largest-integer-divisible-by-two-primes.md index 15174e82655..cb070aae9d1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-347-largest-integer-divisible-by-two-primes.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-347-largest-integer-divisible-by-two-primes.md @@ -1,6 +1,6 @@ --- id: 5900f4c81000cf542c50ffd9 -title: 'Problem 347: Largest integer divisible by two primes' +title: 'Problema 347: Maior número inteiro divisível por dois primos' challengeType: 1 forumTopicId: 302006 dashedName: problem-347-largest-integer-divisible-by-two-primes @@ -8,21 +8,21 @@ dashedName: problem-347-largest-integer-divisible-by-two-primes # --description-- -The largest integer $≤ 100$ that is only divisible by both the primes 2 and 3 is 96, as $96 = 32 \times 3 = 2^5 \times 3$. +O maior número inteiro $≤ 100$ que só é divisível pelos dois primos 2 e 3 é 96, como $96 = 32 \times 3 = 2^5 \times 3$. -For two distinct primes $p$ and $q$ let $M(p, q, N)$ be the largest positive integer $≤ N$ only divisible by both $p$ and $q$ and $M(p, q, N)=0$ if such a positive integer does not exist. +Para dois primos distintos $p$ e $q$, considere $M(p, q, N)$ como o maior número inteiro positivo $≤ N$ divisível apenas por $p$ e $q$ e $M(p, q, N)=0$ se um número inteiro positivo como esse não existir. -E.g. $M(2, 3, 100) = 96$. +Ex: $M(2, 3, 100) = 96$. -$M(3, 5, 100) = 75$ and not 90 because 90 is divisible by 2, 3 and 5. Also $M(2, 73, 100) = 0$ because there does not exist a positive integer $≤ 100$ that is divisible by both 2 and 73. +$M(3, 5, 100) = 75$ e não 90, pois 90 é divisível por 2, 3 e 5. Além disso $M(2, 73, 100) = 0$, pois não existe um número positivo inteiro $≤ 100$ que seja divisível por 2 e por 73. -Let $S(N)$ be the sum of all distinct $M(p, q, N)$. $S(100)=2262$. +Considere $S(N)$ como a soma de todos os $M(p, q, N)$ distintos. $S(100)=2262$. -Find $S(10\\,000\\,000)$. +Encontre $S(10.000.000)$. # --hints-- -`integerDivisibleByTwoPrimes()` should return `11109800204052`. +`integerDivisibleByTwoPrimes()` deve retornar `11109800204052`. ```js assert.strictEqual(integerDivisibleByTwoPrimes(), 11109800204052); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-348-sum-of-a-square-and-a-cube.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-348-sum-of-a-square-and-a-cube.md index 8e69b16ca7a..529f8590683 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-348-sum-of-a-square-and-a-cube.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-348-sum-of-a-square-and-a-cube.md @@ -1,6 +1,6 @@ --- id: 5900f4c81000cf542c50ffdb -title: 'Problem 348: Sum of a square and a cube' +title: 'Problema 348: Soma de um quadrado e de um cubo' challengeType: 1 forumTopicId: 302007 dashedName: problem-348-sum-of-a-square-and-a-cube @@ -8,21 +8,21 @@ dashedName: problem-348-sum-of-a-square-and-a-cube # --description-- -Many numbers can be expressed as the sum of a square and a cube. Some of them in more than one way. +Muitos números podem ser expressos como a soma de um quadrado e um cubo. Alguns deles de mais de uma forma. -Consider the palindromic numbers that can be expressed as the sum of a square and a cube, both greater than 1, in exactly 4 different ways. +Considere os números palíndromos que podem ser expressos como a soma de um quadrado e um cubo, ambos maiores do que 1, em exatamente 4 formas diferentes. -For example, 5229225 is a palindromic number and it can be expressed in exactly 4 different ways: +Por exemplo, 5229225 é um número palíndromo e pode ser expresso de exatamente 4 formas diferentes: $$\begin{align} & {2285}^2 + {20}^3 \\\\ & {2223}^2 + {66}^3 \\\\ & {1810}^2 + {125}^3 \\\\ & {1197}^2 + {156}^3 \end{align}$$ -Find the sum of the five smallest such palindromic numbers. +Encontre a soma dos cinco menores números palíndromos deste tipo. # --hints-- -`sumOfSquareAndCube()` should return `1004195061`. +`sumOfSquareAndCube()` deve retornar `1004195061`. ```js assert.strictEqual(sumOfSquareAndCube(), 1004195061); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-349-langtons-ant.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-349-langtons-ant.md index 71fe17860a2..1ea5bf0d839 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-349-langtons-ant.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-349-langtons-ant.md @@ -1,6 +1,6 @@ --- id: 5900f4ca1000cf542c50ffdc -title: 'Problem 349: Langton''s ant' +title: 'Problema 349: Formiga de Langton' challengeType: 1 forumTopicId: 302008 dashedName: problem-349-langtons-ant @@ -8,18 +8,18 @@ dashedName: problem-349-langtons-ant # --description-- -An ant moves on a regular grid of squares that are coloured either black or white. +Uma formiga se move em uma grade regular de quadrados coloridos em preto ou branco. -The ant is always oriented in one of the cardinal directions (left, right, up or down) and moves from square to adjacent square according to the following rules: +A formiga está sempre orientada em uma das direções cardeais (esquerda, direita, para cima ou para baixo) e se move do quadrado para um quadrado adjacente de acordo com as seguintes regras: -- if it is on a black square, it flips the color of the square to white, rotates 90° counterclockwise and moves forward one square. -- if it is on a white square, it flips the color of the square to black, rotates 90° clockwise and moves forward one square. +- se estiver em um quadrado preto, ela transforma a cor do quadrado em branco, gira 90° no sentido anti-horário e avança um quadrado. +- se estiver em um quadrado branco, ela transforma a cor do quadrado em preto, gira 90° no sentido horário e avança um quadrado. -Starting with a grid that is entirely white, how many squares are black after ${10}^{18}$ moves of the ant? +Começando com uma grade que é inteiramente branca, quantos quadrados são pretos após ${10}^{18}$ movimentos da formiga? # --hints-- -`langtonsAnt()` should return `115384615384614940`. +`langtonsAnt()` deve retornar `115384615384614940`. ```js assert.strictEqual(langtonsAnt(), 115384615384614940); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-350-constraining-the-least-greatest-and-the-greatest-least.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-350-constraining-the-least-greatest-and-the-greatest-least.md index b40eb3cd67a..132661f981b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-350-constraining-the-least-greatest-and-the-greatest-least.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-350-constraining-the-least-greatest-and-the-greatest-least.md @@ -1,6 +1,6 @@ --- id: 5900f4cb1000cf542c50ffdd -title: 'Problem 350: Constraining the least greatest and the greatest least' +title: 'Problema 350: Restringindo o menor máximo e o maior mínimo' challengeType: 1 forumTopicId: 302010 dashedName: problem-350-constraining-the-least-greatest-and-the-greatest-least @@ -8,23 +8,23 @@ dashedName: problem-350-constraining-the-least-greatest-and-the-greatest-least # --description-- -A list of size $n$ is a sequence of $n$ natural numbers. Examples are (2, 4, 6), (2, 6, 4), (10, 6, 15, 6), and (11). +Uma lista de tamanho $n$ é uma sequência de $n$ números naturais. Os exemplos são (2, 4, 6), (2, 6, 4), (10, 6, 15, 6) e (11). -The greatest common divisor, or $gcd$, of a list is the largest natural number that divides all entries of the list. Examples: $gcd(2, 6, 4) = 2$, $gcd(10, 6, 15, 6) = 1$ and $gcd(11) = 11$. +O maior divisor comum, ou $gcd$, de uma lista é o maior número natural que divide todas as entradas da lista. Exemplos: $gcd(2, 6, 4) = 2$, $gcd(10, 6, 15, 6) = 1$ e $gcd(11) = 11$. -The least common multiple, or $lcm$, of a list is the smallest natural number divisible by each entry of the list. Examples: $lcm(2, 6, 4) = 12$, $lcm(10, 6, 15, 6) = 30$ and $lcm(11) = 11$. +O mínimo múltiplo comum, ou $lcm$, de uma lista é o menor número natural divisível por cada entradas da lista. Exemplos: $lcm(2, 6, 4) = 12$, $lcm(10, 6, 15, 6) = 30$ e $lcm(11) = 11$. -Let $f(G, L, N)$ be the number of lists of size $N$ with $gcd ≥ G$ and $lcm ≤ L$. For example: +Considere $f(G, L, N)$ como o número de listas de tamanho $N$ com $gcd ≥ G$ e $lcm ≤ L$. Por exemplo: $$\begin{align} & f(10, 100, 1) = 91 \\\\ & f(10, 100, 2) = 327 \\\\ & f(10, 100, 3) = 1135 \\\\ - & f(10, 100, 1000)\bmod {101}^4 = 3\\,286\\,053 \end{align}$$ + & f(10, 100, 1000)\bmod {101}^4 = 3.286.053 \end{align}$$ -Find $f({10}^6, {10}^{12}, {10}^{18})\bmod {101}^4$. +Encontre $f({10}^6, {10}^{12}, {10}^{18})\bmod {101}^4$. # --hints-- -`leastGreatestAndGreatestLeast()` should return `84664213`. +`leastGreatestAndGreatestLeast()` deve retornar `84664213`. ```js assert.strictEqual(leastGreatestAndGreatestLeast(), 84664213); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-351-hexagonal-orchards.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-351-hexagonal-orchards.md index fa6811e9185..a13103e9bef 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-351-hexagonal-orchards.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-351-hexagonal-orchards.md @@ -1,6 +1,6 @@ --- id: 5900f4cb1000cf542c50ffde -title: 'Problem 351: Hexagonal orchards' +title: 'Problema 351: Pomares hexagonais' challengeType: 1 forumTopicId: 302011 dashedName: problem-351-hexagonal-orchards @@ -8,21 +8,21 @@ dashedName: problem-351-hexagonal-orchards # --description-- -A hexagonal orchard of order $n$ is a triangular lattice made up of points within a regular hexagon with side $n$. The following is an example of a hexagonal orchard of order 5: +Um pomar hexagonal de ordem $n$ é uma rede triangular, composta de pontos dentro de um hexágono regular com o lado $n$. Abaixo, vemos um exemplo de pomar hexagonal da ordem 5: -hexagonal orchard of order 5, with highlighted in green points, which are hidden from the center by a point closer to it +pomar hexagonal de ordem 5, com pontos verdes em destaque, que são escondidos do centro por um ponto mais próximo dele -Highlighted in green are the points which are hidden from the center by a point closer to it. It can be seen that for a hexagonal orchard of order 5, 30 points are hidden from the center. +O destaque em verde são os pontos que ficam ocultados do centro por um ponto mais próximo dele. Pode-se ver que, para um pomar hexagonal da ordem 5, 30 pontos estão escondidos do centro. -Let $H(n)$ be the number of points hidden from the center in a hexagonal orchard of order $n$. +Considere $H(n)$ como o número de pontos escondidos do centro em um pomar hexagonal de ordem $n$. -$H(5) = 30$. $H(10) = 138$. $H(1\\,000)$ = $1\\,177\\,848$. +$H(5) = 30$. $H(10) = 138$. $H(1.000)$ = $1.177.848$. -Find $H(100\\,000\\,000)$. +Encontre $H(100.000.000)$. # --hints-- -`hexagonalOrchards()` should return `11762187201804552`. +`hexagonalOrchards()` deve retornar `11762187201804552`. ```js assert.strictEqual(hexagonalOrchards(), 11762187201804552); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-352-blood-tests.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-352-blood-tests.md index b0de4ec7213..3c399d28345 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-352-blood-tests.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-352-blood-tests.md @@ -1,6 +1,6 @@ --- id: 5900f4cd1000cf542c50ffdf -title: 'Problem 352: Blood tests' +title: 'Problema 352: Testes sanguíneos' challengeType: 1 forumTopicId: 302012 dashedName: problem-352-blood-tests @@ -8,43 +8,43 @@ dashedName: problem-352-blood-tests # --description-- -Each one of the 25 sheep in a flock must be tested for a rare virus, known to affect 2% of the sheep population. +Cada uma das 25 ovelhas que se encontram em um rebanho tem de ser testada para um vírus raro, conhecido por afetar 2% da população de ovinos. -An accurate and extremely sensitive PCR test exists for blood samples, producing a clear positive / negative result, but it is very time-consuming and expensive. +Existe um teste de PCR preciso e extremamente sensível para amostras de sangue, produzindo um resultado claramente positivo/negativo, mas é muito demorado e caro. -Because of the high cost, the vet-in-charge suggests that instead of performing 25 separate tests, the following procedure can be used instead: +Devido ao alto custo, a veterinária encarregada sugere que, em vez de executar 25 testes separados, o seguinte procedimento seja usado: -The sheep are split into 5 groups of 5 sheep in each group. For each group, the 5 samples are mixed together and a single test is performed. Then, +As ovelhas são divididas em 5 grupos de 5 ovelhas em cada grupo. Para cada grupo, as 5 amostras são misturadas e realiza-se um único teste. Então, -- If the result is negative, all the sheep in that group are deemed to be virus-free. -- If the result is positive, 5 additional tests will be performed (a separate test for each animal) to determine the affected individual(s). +- Se o resultado for negativo, todas as ovelhas desse grupo são consideradas sem vírus. +- Se o resultado for positivo, serão realizados 5 testes adicionais (um teste separado para cada animal) para determinar o(s) indivíduo(s). -Since the probability of infection for any specific animal is only 0.02, the first test (on the pooled samples) for each group will be: +Como a probabilidade de infecção para qualquer animal específico é de apenas 0,02, o primeiro teste (nas amostras em conjunto) de cada grupo será: -- Negative (and no more tests needed) with probability ${0.98}^5 = 0.9039207968$. -- Positive (5 additional tests needed) with probability $1 - 0.9039207968 = 0.0960792032$. +- Negativo (e sem mais testes necessários) com probabilidade ${0.98}^5 = 0.9039207968$. +- Positivo (5 testes adicionais necessários) com probabilidade $1 - 0.9039207968 = 0.0960792032$. -Thus, the expected number of tests for each group is $1 + 0.0960792032 × 5 = 1.480396016$. +Assim, o número esperado de testes para cada grupo é $1 + 0.0960792032 × 5 = 1.480396016$. -Consequently, all 5 groups can be screened using an average of only $1.480396016 × 5 = \mathbf{7.40198008}$ tests, which represents a huge saving of more than 70%! +Consequentemente, todos os 5 grupos podem ser avaliados com uma média de apenas US$1.480396016 × 5 = \mathbf{7.40198008}$ testes, o que representa uma grande economia de mais de 70%! -Although the scheme we have just described seems to be very efficient, it can still be improved considerably (always assuming that the test is sufficiently sensitive and no adverse effects are caused by mixing different samples). E.g.: +Embora o regime que acabamos de descrever pareça muito eficiente, ele ainda pode ser melhorado consideravelmente (partindo sempre do princípio de que o teste é suficientemente sensível e que não há efeitos adversos causados pela mistura de amostras diferentes). Ex: -- We may start by running a test on a mixture of all the 25 samples. It can be verified that in about 60.35% of the cases this test will be negative, thus no more tests will be needed. Further testing will only be required for the remaining 39.65% of the cases. -- If we know that at least one animal in a group of 5 is infected and the first 4 individual tests come out negative, there is no need to run a test on the fifth animal (we know that it must be infected). -- We can try a different number of groups / different number of animals in each group, adjusting those numbers at each level so that the total expected number of tests will be minimised. +- Podemos começar por fazer um teste com uma mistura de todas as 25 amostras. É possível verificar que em cerca de 60,35% dos casos este teste será negativo, pelo que não serão necessários mais testes. Só serão necessários mais testes para os 39,65% restantes dos casos. +- Se sabemos que pelo menos um animal em um grupo de 5 é infectado e que os 4 primeiros testes individuais são negativos, não há necessidade de realizar um ensaio no quinto animal (sabemos que deve ser infectado). +- Podemos tentar um número diferente de grupos/um número diferente de animais em cada grupo, ajustando esses números a cada nível para que o número total esperado de testes seja minimizado. -To simplify the very wide range of possibilities, there is one restriction we place when devising the most cost-efficient testing scheme: whenever we start with a mixed sample, all the sheep contributing to that sample must be fully screened (i.e. a verdict of infected / virus-free must be reached for all of them) before we start examining any other animals. +Para simplificar a vasta gama de possibilidades, há uma restrição que impomos ao criar o esquema de testes mais econômico: sempre que começamos com uma amostra mista, todas as ovelhas que contribuem para essa amostra devem ser totalmente testadas (ou seja, é preciso chegar a um veredito sobre ela estar infectada/sem vírus) antes de começarmos a examinar qualquer outro animal. -For the current example, it turns out that the most cost-efficient testing scheme (we'll call it the optimal strategy) requires an average of just 4.155452 tests! +Para o exemplo atual, ocorre que o esquema de testes mais econômico (chamamos isso de estratégia ideal) requer uma média de apenas 4,155452 testes! -Using the optimal strategy, let $T(s, p)$ represent the average number of tests needed to screen a flock of $s$ sheep for a virus having probability $p$ to be present in any individual. Thus, rounded to six decimal places, $T(25, 0.02) = 4.155452$ and $T(25, 0.10) = 12.702124$. +Usando a estratégia ideal, considere $T(s, p)$ como representando o número médio de testes necessários para analisar um rebanho de $s$ ovelhas para o vírus, com a probabilidade de $p$ de o vírus estar presente em qualquer indivíduo. Assim, arredondado para seis casas decimais, $T(25, 0,02) = 4,155452$ e $T(25, 0,10) = 12,702124$. -Find $\sum T(10\\,000, p)$ for $p = 0.01, 0.02, 0.03, \ldots 0.50$. Give your answer rounded to six decimal places. +Encontre $\sum T(10.000, p)$ para $p = 0.01, 0.02, 0.03, \ldots 0.50$. Dê sua resposta arredondada para seis casas decimais. # --hints-- -`bloodTests()` should return `378563.260589`. +`bloodTests()` deve retornar `378563.260589`. ```js assert.strictEqual(bloodTests(), 378563.260589); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-353-risky-moon.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-353-risky-moon.md index 83cb0d40c9e..ac7e17e803d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-353-risky-moon.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-353-risky-moon.md @@ -1,6 +1,6 @@ --- id: 5900f4cd1000cf542c50ffe0 -title: 'Problem 353: Risky moon' +title: 'Problema 353: Lua perigosa' challengeType: 1 forumTopicId: 302013 dashedName: problem-353-risky-moon @@ -8,27 +8,27 @@ dashedName: problem-353-risky-moon # --description-- -A moon could be described by the sphere $C(r)$ with centre (0, 0, 0) and radius $r$. +Uma lua poderia ser descrita pela esfera $C(r)$ com centro (0, 0, 0) e raio $r$. -There are stations on the moon at the points on the surface of $C(r)$ with integer coordinates. The station at (0, 0, $r$) is called North Pole station, the station at (0, 0, $-r$) is called South Pole station. +Há estações na lua em pontos na superfície de $C(r)$ com coordenadas em números inteiros. A estação em (0, 0, $r$) é chamada de estação do Polo Norte, enquanto a estação em (0, 0, $-r$) é chamada de estação do Polo Sul. -All stations are connected with each other via the shortest road on the great arc through the stations. A journey between two stations is risky. If $d$ is the length of the road between two stations, $\{\left(\frac{d}{πr}\right)}^2$ is a measure for the risk of the journey (let us call it the risk of the road). If the journey includes more than two stations, the risk of the journey is the sum of risks of the used roads. +Todas as estações estão ligadas entre si através da estrada mais curta no grande arco que passa pelas estações. Uma jornada entre duas estações é arriscada. Se $d$ é o comprimento da estrada entre duas estações, $\{\left(\frac{d}{πr}\right)}^2$ é uma medida para o risco da jornada (vamos chamá-la de risco da estrada). Se a viagem inclui mais de duas estações, o risco da viagem é a soma dos riscos das estradas utilizadas. -A direct journey from the North Pole station to the South Pole station has the length $πr$ and risk 1. The journey from the North Pole station to the South Pole station via (0, $r$, 0) has the same length, but a smaller risk: +Uma jornada direta da estação do Polo Norte para a estação do Polo Sul tem o comprimento $πr$ e o risco 1. A viagem da estação do Polo Norte para a estação do Polo do Sul via (0, $r$, 0) tem o mesmo comprimento, mas um risco menor: $${\left(\frac{\frac{1}{2}πr}{πr}\right)}^2+{\left(\frac{\frac{1}{2}πr}{πr}\right)}^2 = 0.5$$ -The minimal risk of a journey from the North Pole station to the South Pole station on $C(r)$ is $M(r)$. +O risco mínimo de uma jornada da estação do Polo Norte até a estação do Polo Sul em $C(r)$ é $M(r)$. -You are given that $M(7) = 0.178\\,494\\,399\\,8$ rounded to 10 digits behind the decimal point. +Você é informado que $M(7) = 0.1784943998$ arredondado para 10 casas depois da vírgula. -Find $\displaystyle\sum_{n = 1}^{15} M(2^n - 1)$. +Encontre $\displaystyle\sum_{n = 1}^{15} M(2^n - 1)$. -Give your answer rounded to 10 digits behind the decimal point in the form a.bcdefghijk. +Arredonde sua resposta para até 10 casas depois da vírgula usando o formato a.bcdefghijk. # --hints-- -`riskyMoon()` should return `1.2759860331`. +`riskyMoon()` deve retornar `1.2759860331`. ```js assert.strictEqual(riskyMoon(), 1.2759860331); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-354-distances-in-a-bees-honeycomb.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-354-distances-in-a-bees-honeycomb.md index f7d023146ca..f622a478045 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-354-distances-in-a-bees-honeycomb.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-354-distances-in-a-bees-honeycomb.md @@ -1,6 +1,6 @@ --- id: 5900f4cf1000cf542c50ffe1 -title: 'Problem 354: Distances in a bee''s honeycomb' +title: 'Problema 354: Distâncias em uma colmeia de abelhas' challengeType: 1 forumTopicId: 302014 dashedName: problem-354-distances-in-a-bees-honeycomb @@ -8,19 +8,19 @@ dashedName: problem-354-distances-in-a-bees-honeycomb # --description-- -Consider a honey bee's honeycomb where each cell is a perfect regular hexagon with side length 1. +Considere uma colmeia de abelhas onde cada célula é um hexágono regular perfeito com o comprimento de lado 1. -honeycomb with hexagon sides of length 1 +colmeia de hexágonos com comprimento de lado 1 -One particular cell is occupied by the queen bee. For a positive real number $L$, let $B(L)$ count the cells with distance $L$ from the queen bee cell (all distances are measured from centre to centre); you may assume that the honeycomb is large enough to accommodate for any distance we wish to consider. +Uma célula específica é ocupada pela abelha rainha. Para um número positivo real $L$, considere $B(L)$ como a contagem das células com distância $L$ da célula da abelha rainha (todas as distâncias são medidas do centro ao centro); você pode presumir que a colmeia é suficientemente grande para acomodar qualquer distância que queiramos considerar. -For example, $B(\sqrt{3}) = 6$, $B(\sqrt{21}) = 12$ and $B(111\\,111\\,111) = 54$. +Por exemplo, $B(\sqrt{3}) = 6$, $B(\sqrt{21}) = 12$ e $B(111.111.111) = 54$. -Find the number of $L ≤ 5 \times {10}^{11}$ such that $B(L) = 450$. +Encontre o número de $L ≤ 5 \times {10}^{11}$, tal que $B(L) = 450$. # --hints-- -`distancesInHoneycomb()` should return `58065134`. +`distancesInHoneycomb()` deve retornar `58065134`. ```js assert.strictEqual(distancesInHoneycomb(), 58065134); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-355-maximal-coprime-subset.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-355-maximal-coprime-subset.md index a7e2179ec87..f55bbd1d554 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-355-maximal-coprime-subset.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-355-maximal-coprime-subset.md @@ -1,6 +1,6 @@ --- id: 5900f4d01000cf542c50ffe2 -title: 'Problem 355: Maximal coprime subset' +title: 'Problema 355: Subconjunto máximo de coprimos' challengeType: 1 forumTopicId: 302015 dashedName: problem-355-maximal-coprime-subset @@ -8,15 +8,15 @@ dashedName: problem-355-maximal-coprime-subset # --description-- -Define $Co(n)$ to be the maximal possible sum of a set of mutually co-prime elements from $\\{1, 2, \ldots, n\\}$. For example $Co(10)$ is 30 and hits that maximum on the subset $\\{1, 5, 7, 8, 9\\}$. +Defina $Co(n)$ como a soma máxima possível de um conjunto de elementos mutuamente coprimos de $\\{1, 2, \ldots, n\\}$. Por exemplo $Co(10)$ é 30 e atinge esse máximo no subconjunto $\\{1, 5, 7, 8, 9\\}$. -You are given that $Co(30) = 193$ and $Co(100) = 1356$. +Você é informado de que $Co(30) = 193$ e $Co(100) = 1356$. -Find $Co(200\\,000)$. +Encontre $Co(200.000)$. # --hints-- -`maximalCoprimeSubset()` should return `1726545007`. +`maximalCoprimeSubset()` deve retornar `1726545007`. ```js assert.strictEqual(maximalCoprimeSubset(), 1726545007); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-356-largest-roots-of-cubic-polynomials.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-356-largest-roots-of-cubic-polynomials.md index ec4939b68f1..5be5f36ae4e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-356-largest-roots-of-cubic-polynomials.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-356-largest-roots-of-cubic-polynomials.md @@ -1,6 +1,6 @@ --- id: 5900f4d01000cf542c50ffe3 -title: 'Problem 356: Largest roots of cubic polynomials' +title: 'Problema 356: Maiores raízes de polinômios cúbicos' challengeType: 1 forumTopicId: 302016 dashedName: problem-356-largest-roots-of-cubic-polynomials @@ -8,17 +8,17 @@ dashedName: problem-356-largest-roots-of-cubic-polynomials # --description-- -Let $a_n$ be the largest real root of a polynomial $g(x) = x^3 - 2^n \times x^2 + n$. +Considere $a_n$ como sendo a maior raiz real de um polinômio $g(x) = x^3 - 2^n \times x^2 + n$. -For example, $a_2 = 3.86619826\ldots$ +Por exemplo, $a_2 = 3.86619826\ldots$ -Find the last eight digits of $\displaystyle\sum_{i = 1}^{30} \lfloor {a_i}^{987654321}\rfloor$. +Encontre os oito últimos algarismos de $\displaystyle\sum_{i = 1}^{30} \lfloor {a_i}^{987654321}\rfloor$. -**Note:** $\lfloor a\rfloor$ represents the floor function. +**Observação:** $\lfloor a\rfloor$ representa a função piso. # --hints-- -`rootsOfCubicPolynomials()` should return `28010159`. +`rootsOfCubicPolynomials()` deve retornar `28010159`. ```js assert.strictEqual(rootsOfCubicPolynomials(), 28010159); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-357-prime-generating-integers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-357-prime-generating-integers.md index 003fc35bdd6..b85b69be2d7 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-357-prime-generating-integers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-357-prime-generating-integers.md @@ -1,6 +1,6 @@ --- id: 5900f4d11000cf542c50ffe4 -title: 'Problem 357: Prime generating integers' +title: 'Problema 357: Números inteiros geradores de primos' challengeType: 1 forumTopicId: 302017 dashedName: problem-357-prime-generating-integers @@ -8,15 +8,15 @@ dashedName: problem-357-prime-generating-integers # --description-- -Consider the divisors of 30: 1, 2, 3, 5, 6, 10, 15, 30. +Considere os divisores de 30: 1, 2, 3, 5, 6, 10, 15, 30. -It can be seen that for every divisor $d$ of 30, $d + \frac{30}{d}$ is prime. +Pode-se ver que, para cada divisor $d$ de 30, $d + \frac{30}{d}$ é primo. -Find the sum of all positive integers $n$ not exceeding $100\\,000\\,000$ such that for every divisor $d$ of $n$, $d + \frac{n}{d}$ is prime. +Encontre a soma de todos os números inteiros positivos $n$ não excedendo $100.000.000$, tal que, para cada divisor $d$ de $n$, $d + \frac{n}{d}$ é um número primo. # --hints-- -`primeGeneratingIntegers()` should return `1739023853137`. +`primeGeneratingIntegers()` deve retornar `1739023853137`. ```js assert.strictEqual(primeGeneratingIntegers(), 1739023853137); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-358-cyclic-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-358-cyclic-numbers.md index 9a7f94d3bff..4c5ae91bd0b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-358-cyclic-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-358-cyclic-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f4d21000cf542c50ffe5 -title: 'Problem 358: Cyclic numbers' +title: 'Problema 358: Números cíclicos' challengeType: 1 forumTopicId: 302018 dashedName: problem-358-cyclic-numbers @@ -8,30 +8,30 @@ dashedName: problem-358-cyclic-numbers # --description-- -A cyclic number with $n$ digits has a very interesting property: +Um número cíclico com $n$ algarismos possui uma propriedade muito interessante: -When it is multiplied by 1, 2, 3, 4, ... $n$, all the products have exactly the same digits, in the same order, but rotated in a circular fashion! +Quando é multiplicado por 1, 2, 3, 4, ... $n$, todos os produtos têm exatamente os mesmos algarismos, na mesma ordem, mas giraram de modo circular! -The smallest cyclic number is the 6-digit number 142857: +O menor número cíclico é o número de 6 algarismos 142857: $$\begin{align} & 142857 × 1 = 142857 \\\\ & 142857 × 2 = 285714 \\\\ & 142857 × 3 = 428571 \\\\ & 142857 × 4 = 571428 \\\\ & 142857 × 5 = 714285 \\\\ & 142857 × 6 = 857142 \end{align}$$ -The next cyclic number is 0588235294117647 with 16 digits: +O próximo número cíclico é 0588235294117647, com 16 algarismos: $$\begin{align} & 0588235294117647 × 1 = 0588235294117647 \\\\ & 0588235294117647 × 2 = 1176470588235294 \\\\ & 0588235294117647 × 3 = 1764705882352941 \\\\ & \ldots \\\\ & 0588235294117647 × 16 = 9411764705882352 \end{align}$$ -Note that for cyclic numbers, leading zeros are important. +Observe que, para números cíclicos, zeros à esquerda são importantes. -There is only one cyclic number for which, the eleven leftmost digits are 00000000137 and the five rightmost digits are 56789 (i.e., it has the form $00000000137\ldots56789$ with an unknown number of digits in the middle). Find the sum of all its digits. +Há apenas um número cíclico para o qual os onze algarismos mais à esquerda são 00000000137 e os cinco algarismos mais à direita são 56789 (ou seja, tem a forma $00000000137\ldots56789$ com um número desconhecido de algarismos no meio). Encontre a soma de todos os seus algarismos. # --hints-- -`cyclicNumbers()` should return `3284144505`. +`cyclicNumbers()` deve retornar `3284144505`. ```js assert.strictEqual(cyclicNumbers(), 3284144505); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-359-hilberts-new-hotel.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-359-hilberts-new-hotel.md index 0cfd6a75f09..e741f6c8f23 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-359-hilberts-new-hotel.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-359-hilberts-new-hotel.md @@ -1,6 +1,6 @@ --- id: 5900f4d31000cf542c50ffe6 -title: 'Problem 359: Hilbert''s New Hotel' +title: 'Problema 359: O novo hotel Hilbert' challengeType: 1 forumTopicId: 302019 dashedName: problem-359-hilberts-new-hotel @@ -8,35 +8,35 @@ dashedName: problem-359-hilberts-new-hotel # --description-- -An infinite number of people (numbered 1, 2, 3, etc.) are lined up to get a room at Hilbert's newest infinite hotel. The hotel contains an infinite number of floors (numbered 1, 2, 3, etc.), and each floor contains an infinite number of rooms (numbered 1, 2, 3, etc.). +Um número infinito de pessoas (numeradas 1, 2, 3, etc.) está alinhado para conseguir um quarto no novíssimo hotel infinito Hilbert. O hotel contém um número infinito de andares (numerados 1, 2, 3, etc.). Cada andar contém um número infinito de quartos (numerados 1, 2, 3, etc.). -Initially the hotel is empty. Hilbert declares a rule on how the $n^{\text{th}}$ person is assigned a room: person $n$ gets the first vacant room in the lowest numbered floor satisfying either of the following: +Inicialmente, o hotel está vazio. Hilbert declara uma regra sobre como a $n^{\text{a}}$ pessoa é atribuída a um quarto: a pessoa $n$ obtém o primeiro quarto vago no andar de numeração mais baixa satisfazendo qualquer um dos seguintes: -- the floor is empty -- the floor is not empty, and if the latest person taking a room in that floor is person $m$, then $m + n$ is a perfect square +- o andar está vazio +- o andar não está vazio, e se a última pessoa que está pegando um quarto nesse andar é a pessoa $m$, então $m + n$ é um quadrado perfeito -Person 1 gets room 1 in floor 1 since floor 1 is empty. +A pessoa 1 pega o quarto 1 no andar 1, já que o andar 1 está vazio. -Person 2 does not get room 2 in floor 1 since 1 + 2 = 3 is not a perfect square. +A pessoa 2 não consegue o quarto 2 no andar 1, já que 1 + 2 = 3 não é um quadrado perfeito. -Person 2 instead gets room 1 in floor 2 since floor 2 is empty. +A pessoa 2, em vez disso, pega o quarto 1 no andar 2, já que o andar 2 está vazio. -Person 3 gets room 2 in floor 1 since 1 + 3 = 4 is a perfect square. +A pessoa 3 consegue o quarto 2 no andar 1, já que 1 + 3 = 4 é um quadrado perfeito. -Eventually, every person in the line gets a room in the hotel. +No fim, cada pessoa na fila pegará um quarto no hotel. -Define $P(f, r)$ to be $n$ if person $n$ occupies room $r$ in floor $f$, and 0 if no person occupies the room. Here are a few examples: +Defina $P(f, r)$ como $n$ se a pessoa $n$ ocupar o quarto $r$ no andar $f$, e 0 se ninguém ocupar o quarto. Aqui estão alguns exemplos: $$\begin{align} & P(1, 1) = 1 \\\\ & P(1, 2) = 3 \\\\ & P(2, 1) = 2 \\\\ & P(10, 20) = 440 \\\\ & P(25, 75) = 4863 \\\\ & P(99, 100) = 19454 \end{align}$$ -Find the sum of all $P(f, r)$ for all positive $f$ and $r$ such that $f × r = 71\\,328\\,803\\,586\\,048$ and give the last 8 digits as your answer. +Encontre a soma de todos os $P(f, r)$ para todos os números positivos $f$ e $r$, tal que $f × r = 71.328.803.586.048$ e dê os últimos 8 algarismos como resposta. # --hints-- -`hilbertsNewHotel()` should return `40632119`. +`hilbertsNewHotel()` deve retornar `40632119`. ```js assert.strictEqual(hilbertsNewHotel(), 40632119); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-360-scary-sphere.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-360-scary-sphere.md index 932a0a9dc4e..edc403d392d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-360-scary-sphere.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-360-scary-sphere.md @@ -1,6 +1,6 @@ --- id: 5900f4d41000cf542c50ffe7 -title: 'Problem 360: Scary Sphere' +title: 'Problema 360: Esfera assustadora' challengeType: 1 forumTopicId: 302021 dashedName: problem-360-scary-sphere @@ -8,21 +8,21 @@ dashedName: problem-360-scary-sphere # --description-- -Given two points ($x_1$, $y_1$, $z_1$) and ($x_2$, $y_2$, $z_2$) in three dimensional space, the Manhattan distance between those points is defined as $|x_1 - x_2| + |y_1 - y_2| + |z_1 - z_2|$. +Dados dois pontos, ($x_1$, $y_1$, $z_1$) e ($x_2$, $y_2$, $z_2$), em um espaço tridimensional, a distância de Manhattan entre esses pontos está definida como $|x_1 - x_2| + |y_1 - y_2| + |z_1 - z_2|$. -Let $C(r)$ be a sphere with radius $r$ and center in the origin $O(0, 0, 0)$. +Considere $C(r)$ como uma esfera com o raio $r$ e o centro na origem $O(0, 0, 0)$. -Let $I(r)$ be the set of all points with integer coordinates on the surface of $C(r)$. +Considere $I(r)$ como o conjunto de todos os pontos com coordenadas em números inteiros na superfície de $C(r)$. -Let $S(r)$ be the sum of the Manhattan distances of all elements of $I(r)$ to the origin $O$. +Considere $S(r)$ como a soma das distâncias de Manhattan de todos os elementos de $I(r)$ até a origem $O$. -E.g. $S(45)=34518$. +Ex: $S(45)=34518$. -Find $S({10}^{10})$. +Encontre $S({10}^{10})$. # --hints-- -`scarySphere()` should return `878825614395267100`. +`scarySphere()` deve retornar `878825614395267100`. ```js assert.strictEqual(scarySphere(), 878825614395267100); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-361-subsequence-of-thue-morse-sequence.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-361-subsequence-of-thue-morse-sequence.md index efae1fb220c..05dc7ee25e1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-361-subsequence-of-thue-morse-sequence.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-361-subsequence-of-thue-morse-sequence.md @@ -1,6 +1,6 @@ --- id: 5900f4d51000cf542c50ffe8 -title: 'Problem 361: Subsequence of Thue-Morse sequence' +title: 'Problema 361: Subsequência da sequência de Thue-Morse' challengeType: 1 forumTopicId: 302022 dashedName: problem-361-subsequence-of-thue-morse-sequence @@ -8,28 +8,28 @@ dashedName: problem-361-subsequence-of-thue-morse-sequence # --description-- -The Thue-Morse sequence $\\{T_n\\}$ is a binary sequence satisfying: +A sequência Thue-Morse $\\{T_n\\}$ é uma sequência binária satisfatória: - $T_0 = 0$ - $T_{2n} = T_n$ - $T_{2n + 1} = 1 - T_n$ -The first several terms of $\\{T_n\\}$ are given as follows: $01101001\color{red}{10010}1101001011001101001\ldots$. +Os primeiros termos de $\\{T_n\\}$ são atribuídos da seguinte forma: $01101001\color{red}{10010}1101001011001101001\ldots$. -We define $\\{A_n\\}$ as the sorted sequence of integers such that the binary expression of each element appears as a subsequence in $\\{T_n\\}$. For example, the decimal number 18 is expressed as 10010 in binary. 10010 appears in $\\{T_n\\}$ ($T_8$ to $T_{12}$), so 18 is an element of $\\{A_n\\}$. The decimal number 14 is expressed as 1110 in binary. 1110 never appears in $\\{T_n\\}$, so 14 is not an element of $\\{A_n\\}$. +Definimos $\\{A_n\\}$ como uma sequência ordenada de inteiros, de modo que a expressão binária de cada elemento apareça como uma subsequência em $\\{T_n\\}$. Por exemplo, o número decimal 18 é expresso como 10010 em binário. 10010 aparece em $\\{T_n\\}$ ($T_8$ a $T_{12}$), portanto 18 é um elemento de $\\{A_n\\}$. O número decimal 14 é expresso como 1110 no binário. 1110 nunca aparece em $\\{T_n\\}$, portanto 14 não é um elemento de $\\{A_n\\}$. -The first several terms of $A_n$ are given as follows: +Os primeiros termos de $A_n$ são atribuídos da seguinte forma: $$\begin{array}{cr} n & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & \ldots \\\\ A_n & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 9 & 10 & 11 & 12 & 13 & 18 & \ldots \end{array}$$ -We can also verify that $A_{100} = 3251$ and $A_{1000} = 80\\,852\\,364\\,498$. +Também podemos verificar que $A_{100} = 3251$ e $A_{1000} = 80.852.364.498$. -Find the last 9 digits of $\displaystyle\sum_{k = 1}^{18} A_{{10}^k}$. +Encontre os últimos 9 algarismos de $\displaystyle\sum_{k = 1}^{18} A_{{10}^k}$. # --hints-- -`subsequenceOfThueMorseSequence()` should return `178476944`. +`subsequenceOfThueMorseSequence()` deve retornar `178476944`. ```js assert.strictEqual(subsequenceOfThueMorseSequence(), 178476944); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-362-squarefree-factors.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-362-squarefree-factors.md index 19f6b0f9cdc..555db5276ca 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-362-squarefree-factors.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-362-squarefree-factors.md @@ -1,6 +1,6 @@ --- id: 5900f4d61000cf542c50ffe9 -title: 'Problem 362: Squarefree factors' +title: 'Problema 362: Fatores não quadráticos' challengeType: 1 forumTopicId: 302023 dashedName: problem-362-squarefree-factors @@ -8,25 +8,25 @@ dashedName: problem-362-squarefree-factors # --description-- -Consider the number 54. +Considere o número 54. -54 can be factored in 7 distinct ways into one or more factors larger than 1: +54 pode ser fatorado de 7 formas distintas em um ou mais fatores maiores que 1: -$$54, 2 × 27, 3 × 18, 6 × 9, 3 × 3 × 6, 2 × 3 × 9 \text{ and } 2 × 3 × 3 × 3$$ +$$54, 2 × 27, 3 × 18, 6 × 9, 3 × 3 × 6 2 × 3 × 9 \text{ e } 2 × 3 × 3 × 3$$ -If we require that the factors are all squarefree only two ways remain: $3 × 3 × 6$ and $2 × 3 × 3 × 3$. +Se precisarmos que todos os fatores não sejam quadráticos, apenas duas formas permanecem: $3 × 3 × 6$ e $2 × 3 × 3 × 3 × 3$. -Let's call $Fsf(n)$ the number of ways $n$ can be factored into one or more squarefree factors larger than 1, so $Fsf(54) = 2$. +Vamos chamar $Fsf(n)$ o número de formas $n$ que pode ser fatorado em um ou mais fatores não quadráticos maiores que 1, então $Fsf(54) = 2$. -Let $S(n)$ be $\sum Fsf(k)$ for $k = 2$ to $n$. +Considere $S(n)$ como $\sum Fsf(k)$ para $k = 2$ a $n$. -$S(100) = 193$. +$S(100)=193$. -Find $S(10\\,000\\,000\\,000)$. +Encontre $S(10.000.000.000)$. # --hints-- -`squarefreeFactors()` should return `457895958010`. +`squarefreeFactors()` deve retornar `457895958010`. ```js assert.strictEqual(squarefreeFactors(), 457895958010); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-363-bzier-curves.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-363-bzier-curves.md index df13df6a0c5..ef2bd6acf42 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-363-bzier-curves.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-363-bzier-curves.md @@ -1,6 +1,6 @@ --- id: 5900f4d91000cf542c50ffeb -title: 'Problem 363: Bézier Curves' +title: 'Problema 363: Curva de Bézier' challengeType: 1 forumTopicId: 302024 dashedName: problem-363-bzier-curves @@ -8,29 +8,29 @@ dashedName: problem-363-bzier-curves # --description-- -A cubic Bézier curve is defined by four points: $P_0$, $P_1$, $P_2$ and $P_3$. +Uma curva cúbica de Bézier é definida por quatro pontos: $P_0$, $P_1$, $P_2$ e $P_3$. -The curve is constructed as follows: +A curva é construída da seguinte forma: -construction of Bézier curve +construção da curva de Bézier -On the segments $P_0P_1$, $P_1P_2$ and $P_2P_3$ the points $Q_0$,$Q_1$ and $Q_2$ are drawn such that $\frac{P_0Q_0}{P_0P_1} = \frac{P_1Q_1}{P_1P_2} = \frac{P_2Q_2}{P_2P_3} = t$, with $t$ in [0,1]. +Nos segmentos $P_0P_1$, $P_1P_2$ e $P_2P_3$ os pontos $Q_0$,$Q_1$ e $Q_2$ estão desenhados tal que $\frac{P_0Q_0}{P_0P_1} = \frac{P_1Q_1}{P_1P_2} = \frac{P_2Q_2}{P_2P_3} = t$, com $t$ em [0,1]. -On the segments $Q_0Q_1$ and $Q_1Q_2$ the points $R_0$ and $R_1$ are drawn such that $\frac{Q_0R_0}{Q_0Q_1} = \frac{Q_1R_1}{Q_1Q_2} = t$ for the same value of $t$. +Nos segmentos $Q_0Q_1$ e $Q_1Q_2$ os pontos $R_0$ e $R_1$ estão desenhados, tal que $\frac{Q_0R_0}{Q_0Q_1} = \frac{Q_1R_1}{Q_1Q_2} = t$ pelo mesmo valor de $t$. -On the segment $R_0R_1$ the point $B$ is drawn such that $\frac{R_0B}{R_0R_1} = t$ for the same value of $t$. +No segmento $R_0R_1$ o ponto $B$ é desenhado de modo que $\frac{R_0B}{R_0R_1} = t$ tenha o mesmo valor de $t$. -The Bézier curve defined by the points $P_0$, $P_1$, $P_2$, $P_3$ is the locus of $B$ as $Q_0$ takes all possible positions on the segment $P_0P_1$. (Please note that for all points the value of $t$ is the same.) +A curva de Bézier definida pelos pontos $P_0$, $P_1$, $P_2$, $P_3$ é a localidade de $B$, pois $Q_0$ ocupa todas as posições possíveis no segmento $P_0P_1$. Observe que, para todos os pontos, o valor de $t$ é o mesmo. -From the construction it is clear that the Bézier curve will be tangent to the segments $P_0P_1$ in $P_0$ and $P_2P_3$ in $P_3$. +A partir da construção, fica claro que a curva de Bézier será tangente aos segmentos $P_0P_1$ em $P_0$ e $P_2P_3$ em $P_3$. -A cubic Bézier curve with $P_0 = (1, 0)$, $P_1 = (1, v)$, $P_2 = (v, 1)$ and $P_3 = (0, 1)$ is used to approximate a quarter circle. The value $v > 0$ is chosen such that the area enclosed by the lines $OP_0$, $OP_3$ and the curve is equal to $\frac{π}{4}$ (the area of the quarter circle). +Uma curva de Bézier cúbica com $P_0 = (1, 0)$, $P_1 = (1, v)$, $P_2 = (v, 1)$ e $P_3 = (0, 1)$ é usada para aproximar um quarto de círculo. O valor $v > 0$ foi escolhido de modo que a área circundada pelas linhas $OP_0$, $OP_3$ e a curva é igual a $\frac{π}{4}$ (a área do quarto de círculo). -By how many percent does the length of the curve differ from the length of the quarter circle? That is, if $L$ is the length of the curve, calculate $100 × \displaystyle\frac{L − \frac{π}{2}}{\frac{π}{2}}$. Give your answer rounded to 10 digits behind the decimal point. +Qual a porcentagem do comprimento da curva que difere do comprimento do quarto de círculo? Ou seja, se $L$ for o comprimento da curva, calcule $100 × \displaystyle\frac{L – \frac{π}{2}}{\frac{π}{2}}$. Dê sua resposta arredondada para 10 casas depois da vírgula. # --hints-- -`bezierCurves()` should return `0.0000372091`. +`bezierCurves()` deve retornar `0.0000372091`. ```js assert.strictEqual(bezierCurves(), 0.0000372091); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-365-a-huge-binomial-coefficient.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-365-a-huge-binomial-coefficient.md index 46dc7abf5d6..21f83a90f45 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-365-a-huge-binomial-coefficient.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-365-a-huge-binomial-coefficient.md @@ -1,6 +1,6 @@ --- id: 5900f4da1000cf542c50ffec -title: 'Problem 365: A huge binomial coefficient' +title: 'Problema 365: Um coeficiente binomial enorme' challengeType: 1 forumTopicId: 302026 dashedName: problem-365-a-huge-binomial-coefficient @@ -8,15 +8,15 @@ dashedName: problem-365-a-huge-binomial-coefficient # --description-- -The binomial coefficient $\displaystyle\binom{{10}^{18}}{{10}^9}$ is a number with more than 9 billion ($9 × {10}^9$) digits. +O coeficiente binomial $\displaystyle\binom{{10}^{18}}{{10}^9}$ é um número com mais de 9 bilhões de algarismos ($9 × {10}^9$). -Let $M(n, k, m)$ denote the binomial coefficient $\displaystyle\binom{n}{k}$ modulo $m$. +Considere $M(n, k, m)$ como o coeficiente binomial $\displaystyle\binom{n}{k}$ modulo $m$. -Calculate $\sum M({10}^{18}, {10}^9, p \times q \times r)$ for $1000 < p < q < r < 5000$ and $p$, $q$, $r$ prime. +Calcule $\sum M({10}^{18}, {10}^9, p \times q \times r)$ para$1000 < p < q < r < 5000$ e com $p$, $q$, $r$ sendo números primos. # --hints-- -`hugeBinomialCoefficient()` should return `162619462356610300`. +`hugeBinomialCoefficient()` deve retornar `162619462356610300`. ```js assert.strictEqual(hugeBinomialCoefficient(), 162619462356610300); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-366-stone-game-iii.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-366-stone-game-iii.md index e4c51cb8c50..41e83ca95a5 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-366-stone-game-iii.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-366-stone-game-iii.md @@ -1,6 +1,6 @@ --- id: 5900f4da1000cf542c50ffed -title: 'Problem 366: Stone Game III' +title: 'Problema 366: Jogo da pedra III' challengeType: 1 forumTopicId: 302027 dashedName: problem-366-stone-game-iii @@ -8,41 +8,41 @@ dashedName: problem-366-stone-game-iii # --description-- -Two players, Anton and Bernhard, are playing the following game. +Dois jogadores, Anton e Bernhard, estão jogando o seguinte jogo. -There is one pile of $n$ stones. +Existe uma pilha de $n$ pedras. -The first player may remove any positive number of stones, but not the whole pile. +O primeiro jogador pode remover qualquer número positivo de pedras, mas não a pilha toda. -Thereafter, each player may remove at most twice the number of stones his opponent took on the previous move. +Depois disso, cada jogador pode remover, no máximo, o dobro das pedras que seu oponente removeu no movimento anterior. -The player who removes the last stone wins. +O jogador que remover a última pedra ganha. -E.g. $n = 5$ +Ex: $n = 5$ -If the first player takes anything more than one stone the next player will be able to take all remaining stones. +Se o primeiro jogador pegar mais do que uma pedra, o próximo jogador será capaz de pegar todas as pedras restantes. -If the first player takes one stone, leaving four, his opponent will take also one stone, leaving three stones. +Se o primeiro jogador pegar uma pedra, deixando quatro, o oponente dele pegará também uma pedra, deixando três pedras. -The first player cannot take all three because he may take at most $2 \times 1 = 2$ stones. So let's say he also takes one stone, leaving 2. +O primeiro jogador não pode pegar todas as três pedras restantes porque ele pode pegar no máximo $2 \times 1 = 2$ pedras. Então digamos que ele também leve uma pedra, deixando 2. -The second player can take the two remaining stones and wins. +O segundo jogador pode pegar as duas pedras restantes e ganhar. -So 5 is a losing position for the first player. +Portanto, 5 é uma posição em que o primeiro jogador perde. -For some winning positions there is more than one possible move for the first player. +Para algumas posições vencedoras, há mais de um movimento possível para o primeiro jogador. -E.g. when $n = 17$ the first player can remove one or four stones. +Ex: quando $n = 17$, o primeiro jogador pode remover uma ou quatro pedras. -Let $M(n)$ be the maximum number of stones the first player can take from a winning position at his first turn and $M(n) = 0$ for any other position. +Considere $M(n)$ como o número máximo de pedras que o primeiro jogador pode remover em uma posição vencedora em seu primeiro movimento e $M(n) = 0$ para qualquer outra posição. -$\sum M(n)$ for $n ≤ 100$ is 728. +A $\sum M(n)$ para $n ≤ 100$ é 728. -Find $\sum M(n)$ for $n ≤ {10}^{18}$. Give your answer modulo ${10}^8$. +Encontre a $\sum M(n)$ para $n ≤ {10}^{18}$. Dê sua resposta modulo ${10}^8$. # --hints-- -`stoneGameThree()` should return `88351299`. +`stoneGameThree()` deve retornar `88351299`. ```js assert.strictEqual(stoneGameThree(), 88351299); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-367-bozo-sort.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-367-bozo-sort.md index 01a24b3c665..00fb447f4b8 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-367-bozo-sort.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-367-bozo-sort.md @@ -1,6 +1,6 @@ --- id: 5900f4db1000cf542c50ffee -title: 'Problem 367: Bozo sort' +title: 'Problema 367: Ordenação do Bozo' challengeType: 1 forumTopicId: 302028 dashedName: problem-367-bozo-sort @@ -8,29 +8,29 @@ dashedName: problem-367-bozo-sort # --description-- -Bozo sort, not to be confused with the slightly less efficient bogo sort, consists out of checking if the input sequence is sorted and if not swapping randomly two elements. This is repeated until eventually the sequence is sorted. +A ordenação do Bozo – não confunda com a ordenação Bogo, ligeiramente menos eficiente – consiste em verificar se a sequência de entrada está ordenada e, se não estiver, trocar aleatoriamente dois elementos. Isso é repetido até que a sequência esteja ordenada. -If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of swaps, averaged over all $4!$ input sequences is $24.75$. +Se considerarmos todas as permutações dos primeiros 4 números naturais como entrada, o valor da expectativa do número de trocas, na média sobre todas as sequências de entrada $4!$, é $24,75$. -The already sorted sequence takes 0 steps. +A sequência já classificada leva 0 etapas. -In this problem we consider the following variant on bozo sort. +Neste problema, consideramos a seguinte variante na ordenação do Bozo. -If the sequence is not in order we pick three elements at random and shuffle these three elements randomly. +Se a sequência não estiver em ordem, selecionamos três elementos aleatoriamente e embaralhamos esses três elementos aleatoriamente. -All $3! = 6$ permutations of those three elements are equally likely. +Todas as permutações $3! = 6$ desses três elementos são igualmente prováveis. -The already sorted sequence will take 0 steps. +A sequência já classificada levará 0 etapas. -If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of shuffles, averaged over all $4!$ input sequences is $27.5$. +Se considerarmos todas as permutações dos primeiros 4 números naturais como entrada, o valor da expectativa do número de embaralhamentos, na média sobre todas as sequências de entrada $4!$, é $27,5$. -Consider as input sequences the permutations of the first 11 natural numbers. +Considere como sequências de entrada as permutações dos primeiros 11 números naturais. -Averaged over all $11!$ input sequences, what is the expected number of shuffles this sorting algorithm will perform? Give your answer rounded to the nearest integer. +Com a média sobre todas as sequências de entrada $11!$, qual é o número esperado de embaralhamentos que este algoritmo de ordenação executará? Dê a sua resposta arredondada para o número inteiro mais próximo. # --hints-- -`bozoSort()` should return `48271207`. +`bozoSort()` deve retornar `48271207`. ```js assert.strictEqual(bozoSort(), 48271207); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-368-a-kempner-like-series.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-368-a-kempner-like-series.md index afc2e6dc9b8..a60e73c03e6 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-368-a-kempner-like-series.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-368-a-kempner-like-series.md @@ -1,6 +1,6 @@ --- id: 5900f4dd1000cf542c50ffef -title: 'Problem 368: A Kempner-like series' +title: 'Problema 368: Uma série semelhante à de Kempner' challengeType: 1 forumTopicId: 302029 dashedName: problem-368-a-kempner-like-series @@ -8,24 +8,24 @@ dashedName: problem-368-a-kempner-like-series # --description-- -The harmonic series $1 + \dfrac{1}{2} + \dfrac{1}{3} + \dfrac{1}{4} + \ldots$ is well known to be divergent. +A série harmônica $1 + \dfrac{1}{2} + \dfrac{1}{3} + \dfrac{1}{4} + \ldots$ é conhecido por ser divergente. -If we however omit from this series every term where the denominator has a 9 in it, the series remarkably enough converges to approximately 22.9206766193. This modified harmonic series is called the Kempner series. +No entanto, se omitirmos desta série todos os termos em que o denominador tem um 9, a série converge consideravelmente para aproximadamente 22,9206766193. Esta série harmônica modificada é chamada de série de Kempner. -Let us now consider another modified harmonic series by omitting from the harmonic series every term where the denominator has 3 or more equal consecutive digits. One can verify that out of the first 1200 terms of the harmonic series, only 20 terms will be omitted. +Consideremos agora outra série harmônica modificada, omitindo da série harmônica todos os termos em que o denominador tem 3 ou mais algarismos iguais consecutivos. Pode-se verificar que, dos primeiros 1200 termos da série harmônica, apenas 20 termos serão omitidos. -These 20 omitted terms are: +Estes 20 termos omitidos são: $$\dfrac{1}{111}, \dfrac{1}{222}, \dfrac{1}{333}, \dfrac{1}{444}, \dfrac{1}{555}, \dfrac{1}{666}, \dfrac{1}{777}, \dfrac{1}{888}, \dfrac{1}{999}, \dfrac{1}{1000}, \dfrac{1}{1110}, \\\\ \dfrac{1}{1111}, \dfrac{1}{1112}, \dfrac{1}{1113}, \dfrac{1}{1114}, \dfrac{1}{1115}, \dfrac{1}{1116}, \dfrac{1}{1117}, \dfrac{1}{1118}, \dfrac{1}{1119}$$ -This series converges as well. +Esta série também converge. -Find the value the series converges to. Give your answer rounded to 10 digits behind the decimal point. +Encontre o valor para o qual a série converge. Dê sua resposta arredondada para 10 casas depois da vírgula. # --hints-- -`kempnerLikeSeries()` should return `253.6135092068`. +`kempnerLikeSeries()` deve retornar `253.6135092068`. ```js assert.strictEqual(kempnerLikeSeries(), 253.6135092068); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-369-badugi.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-369-badugi.md index b297bf965da..c807087ceba 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-369-badugi.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-369-badugi.md @@ -1,6 +1,6 @@ --- id: 5900f4de1000cf542c50fff0 -title: 'Problem 369: Badugi' +title: 'Problema 369: Badugi' challengeType: 1 forumTopicId: 302030 dashedName: problem-369-badugi @@ -8,15 +8,15 @@ dashedName: problem-369-badugi # --description-- -In a standard 52 card deck of playing cards, a set of 4 cards is a Badugi if it contains 4 cards with no pairs and no two cards of the same suit. +Em um baralho padrão de 52 cartas, um conjunto de 4 cartas é um Badugi caso tenha 4 cartas sem pares e se não houver duas cartas do mesmo naipe. -Let $f(n)$ be the number of ways to choose $n$ cards with a 4 card subset that is a Badugi. For example, there are $2\\,598\\,960$ ways to choose five cards from a standard 52 card deck, of which $514\\,800$ contain a 4 card subset that is a Badugi, so $f(5) = 514800$. +Considere $f(n)$ como o número de maneiras de escolher $n$ cartas com um subconjunto de 4 cartas que é um Badugi. Por exemplo, há $2.598.960$ maneiras de escolher cinco cartas de um baralho padrão de 52 cartas. Dessas, $514.800$ contêm um subconjunto que é um Badugi. Assim, $f(5) = 514800$. -Find $\sum f(n)$ for $4 ≤ n ≤ 13$. +Encontre $\sum f(n)$ para $4 ≤ n ≤ 13$. # --hints-- -`badugi()` should return `862400558448`. +`badugi()` deve retornar `862400558448`. ```js assert.strictEqual(badugi(), 862400558448); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-370-geometric-triangles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-370-geometric-triangles.md index dd37d167a05..b1d7984397f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-370-geometric-triangles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-370-geometric-triangles.md @@ -1,6 +1,6 @@ --- id: 5900f4de1000cf542c50fff1 -title: 'Problem 370: Geometric triangles' +title: 'Problema 370: Triângulos geométricos' challengeType: 1 forumTopicId: 302032 dashedName: problem-370-geometric-triangles @@ -8,17 +8,17 @@ dashedName: problem-370-geometric-triangles # --description-- -Let us define a geometric triangle as an integer sided triangle with sides $a ≤ b ≤ c$ so that its sides form a geometric progression, i.e. $b^2 = a \times c$. +Vamos definir um triângulo geométrico como um triângulo de lados compostos de números inteiros, com os lados $a ≤ b ≤ c$, de modo que seus lados formem uma progressão geométrica, ou seja, $b^2 = a \times c$. -An example of such a geometric triangle is the triangle with sides $a = 144$, $b = 156$ and $c = 169$. +Um exemplo de um triângulo geométrico como este é o triângulo de lados $a = 144$, $b = 156$ e $c = 169$. -There are $861\\,805$ geometric triangles with $\text{perimeter} ≤ {10}^6$. +Existem $861.805$ triângulos geométricos com $\text{perímetro} ≤ {10}^6$. -How many geometric triangles exist with $\text{perimeter} ≤ 2.5 \times {10}^{13}$? +Quantos triângulos geométricos existem com $\text{perímetro} ≤ 2,5 \times {10}^{13}$? # --hints-- -`geometricTriangles()` should return `41791929448408`. +`geometricTriangles()` deve retornar `41791929448408`. ```js assert.strictEqual(geometricTriangles(), 41791929448408); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-372-pencils-of-rays.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-372-pencils-of-rays.md index 9a8e0ff315d..77ef38de544 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-372-pencils-of-rays.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-372-pencils-of-rays.md @@ -1,6 +1,6 @@ --- id: 5900f4e11000cf542c50fff3 -title: 'Problem 372: Pencils of rays' +title: 'Problema 372: Feixe de raios' challengeType: 1 forumTopicId: 302034 dashedName: problem-372-pencils-of-rays @@ -8,17 +8,17 @@ dashedName: problem-372-pencils-of-rays # --description-- -Let $R(M, N)$ be the number of lattice points ($x$, $y$) which satisfy $M \lt x \le N$, $M \lt y \le N$ and $\left\lfloor\frac{y^2}{x^2}\right\rfloor$ is odd. +Considere $R(M, N)$ como o número de pontos da rede($x$, $y$) que satisfaz $M \lt x \le N$, $M \lt y \le N$ e que $\left\lfloor\frac{y^2}{x^2}\right\rfloor$ é ímpar. -We can verify that $R(0, 100) = 3\\,019$ and $R(100, 10\\,000) = 29\\,750\\,422$. +Podemos verificar que $R(0, 100) = 3.019$ e $R(100, 10.000) = 29.750.422$. -Find $R(2 \times {10}^6, {10}^9)$. +Encontre $R(2 \times {10}^6, {10}^9)$. -**Note:** $\lfloor x\rfloor$ represents the floor function. +**Observação:** $\lfloor x\rfloor$ representa a função piso. # --hints-- -`pencilsOfRays()` should return `301450082318807040`. +`pencilsOfRays()` deve retornar `301450082318807040`. ```js assert.strictEqual(pencilsOfRays(), 301450082318807040); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-373-circumscribed-circles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-373-circumscribed-circles.md index dbe4e1d47e4..6a1b63c2d47 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-373-circumscribed-circles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-373-circumscribed-circles.md @@ -1,6 +1,6 @@ --- id: 5900f4e11000cf542c50fff4 -title: 'Problem 373: Circumscribed Circles' +title: 'Problema 373: Círculos circunscritos' challengeType: 1 forumTopicId: 302035 dashedName: problem-373-circumscribed-circles @@ -8,17 +8,17 @@ dashedName: problem-373-circumscribed-circles # --description-- -Every triangle has a circumscribed circle that goes through the three vertices. Consider all integer sided triangles for which the radius of the circumscribed circle is integral as well. +Todo triângulo tem um círculo circunscrito que atravessa os três vértices. Considere todos os triângulos com os lados compostos de números inteiros para os quais o raio do círculo circunscrito também é um número inteiro. -Let $S(n)$ be the sum of the radii of the circumscribed circles of all such triangles for which the radius does not exceed $n$. +Considere $S(n)$ como a soma dos raios dos círculos circunscritos de todos os triângulos para os quais o raio não excede $n$. -$S(100) = 4\\,950$ and $S(1\\,200) = 1\\,653\\,605$. +$S(100) = 4.950$ e $S(1.200) = 1.653.605$. -Find $S({10}^7)$. +Encontre $S({10}^7)$. # --hints-- -`circumscribedCircles()` should return `727227472448913`. +`circumscribedCircles()` deve retornar `727227472448913`. ```js assert.strictEqual(circumscribedCircles(), 727227472448913); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-374-maximum-integer-partition-product.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-374-maximum-integer-partition-product.md index e2578270e64..70aca0c1e0a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-374-maximum-integer-partition-product.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-374-maximum-integer-partition-product.md @@ -1,6 +1,6 @@ --- id: 5900f4e51000cf542c50fff6 -title: 'Problem 374: Maximum Integer Partition Product' +title: 'Problema 374: Produto da partição inteira máxima' challengeType: 1 forumTopicId: 302036 dashedName: problem-374-maximum-integer-partition-product @@ -8,27 +8,27 @@ dashedName: problem-374-maximum-integer-partition-product # --description-- -An integer partition of a number $n$ is a way of writing $n$ as a sum of positive integers. +Uma partição inteira de um número $n$ é uma maneira de escrever $n$ como uma soma dos números inteiros positivos. -Partitions that differ only in the order of their summands are considered the same. A partition of $n$ into distinct parts is a partition of $n$ in which every part occurs at most once. +Partições que diferem apenas da ordem de seus somandos são consideradas iguais. Uma partição de $n$ em partes distintas é uma partição de $n$ na qual cada parte ocorre no máximo uma vez. -The partitions of 5 into distinct parts are: +As partições de 5 em partes distintas são: -5, 4 + 1 and 3 + 2. +5, 4 + 1 e 3 + 2. -Let $f(n)$ be the maximum product of the parts of any such partition of $n$ into distinct parts and let $m(n)$ be the number of elements of any such partition of $n$ with that product. +Considere $f(n)$ como o produto máximo das partes de qualquer partição de $n$ em partes distintas e $m(n)$ o número de elementos de qualquer partição $n$ com esse produto. -So $f(5) = 6$ and $m(5) = 2$. +Assim, $f(5) = 6$ e $m(5) = 2$. -For $n = 10$ the partition with the largest product is $10 = 2 + 3 + 5$, which gives $f(10) = 30$ and $m(10) = 3$. And their product, $f(10) \times m(10) = 30 \times 3 = 90$ +Para $n = 10$, a partição com o maior produto é $10 = 2 + 3 + 5$, o que dá $f(10) = 30$ e $m(10) = 3$. E seu produto, $f(10) \times m(10) = 30 \times 3 = 90$ -It can be verified that $\sum f(n) \times m(n)$ for $1 ≤ n ≤ 100 = 1\\,683\\,550\\,844\\,462$. +Pode-se verificar que $\sum f(n) \times m(n)$ para $1 ≤ n ≤ 100 = 1.683.550.844.462$. -Find $\sum f(n) \times m(n)$ for $1 ≤ n ≤ {10}^{14}$. Give your answer modulo $982\\,451\\,653$, the 50 millionth prime. +Encontre a $\sum f(n) \times m(n)$ para $1 ≤ n ≤ {10}^{14}$. Dê sua resposta modulo $982.451.653$, o quinquagésimo milionésimo número primo. # --hints-- -`maximumIntegerPartitionProduct()` should return `334420941`. +`maximumIntegerPartitionProduct()` deve retornar `334420941`. ```js assert.strictEqual(maximumIntegerPartitionProduct(), 334420941); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-375-minimum-of-subsequences.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-375-minimum-of-subsequences.md index 082d94ef69c..0f87c78f3d6 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-375-minimum-of-subsequences.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-375-minimum-of-subsequences.md @@ -1,6 +1,6 @@ --- id: 5900f4e41000cf542c50fff5 -title: 'Problem 375: Minimum of subsequences' +title: 'Problema 375: Mínimo das subsequências' challengeType: 1 forumTopicId: 302037 dashedName: problem-375-minimum-of-subsequences @@ -8,20 +8,20 @@ dashedName: problem-375-minimum-of-subsequences # --description-- -Let $S_n$ be an integer sequence produced with the following pseudo-random number generator: +Considere $S_n$ como uma sequência de números inteiros produzida com o seguinte gerador de números pseudoaleatórios: -$$\begin{align} S_0 & = 290\\,797 \\\\ - S_{n + 1} & = {S_n}^2\bmod 50\\,515\\,093 \end{align}$$ +$$\begin{align} S_0 & = 290.797 \\\\ + S_{n + 1} & = {S_n}^2\bmod 50.515.093 \end{align}$$ -Let $A(i, j)$ be the minimum of the numbers $S_i, S_{i + 1}, \ldots, S_j$ for $i ≤ j$. Let $M(N) = \sum A(i, j)$ for $1 ≤ i ≤ j ≤ N$. +Considere $A(i, j)$ como o mínimo dos números $S_i, S_{i + 1}, \ldots, S_j$ para $i ≤ j$. Considere $M(N) = \sum A(i, j)$ para $1 ≤ i ≤ j ≤ N$. -We can verify that $M(10) = 432\\,256\\,955$ and $M(10\\,000) = 3\\,264\\,567\\,774\\,119$. +Podemos verificar que $M(10) = 432.256.955$ e $M(10.000) = 3.264.567.774.119$. -Find $M(2\\,000\\,000\\,000)$. +Encontre $M(2.000.000.000)$. # --hints-- -`minimumOfSubsequences()` should return `7435327983715286000`. +`minimumOfSubsequences()` deve retornar `7435327983715286000`. ```js assert.strictEqual(minimumOfSubsequences(), 7435327983715286000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-376-nontransitive-sets-of-dice.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-376-nontransitive-sets-of-dice.md index 344a1e84e90..c9322b36226 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-376-nontransitive-sets-of-dice.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-376-nontransitive-sets-of-dice.md @@ -1,6 +1,6 @@ --- id: 5900f4e51000cf542c50fff7 -title: 'Problem 376: Nontransitive sets of dice' +title: 'Problema 376: Conjuntos de dados não transitivos' challengeType: 1 forumTopicId: 302038 dashedName: problem-376-nontransitive-sets-of-dice @@ -8,42 +8,42 @@ dashedName: problem-376-nontransitive-sets-of-dice # --description-- -Consider the following set of dice with nonstandard pips: +Considere o seguinte conjunto de dados com valores fora do padrão de 1 a 6: $$\begin{array}{} \text{Die A: } & 1 & 4 & 4 & 4 & 4 & 4 \\\\ \text{Die B: } & 2 & 2 & 2 & 5 & 5 & 5 \\\\ \text{Die C: } & 3 & 3 & 3 & 3 & 3 & 6 \\\\ \end{array}$$ -A game is played by two players picking a die in turn and rolling it. The player who rolls the highest value wins. +Um jogo é disputado por dois jogadores que escolhem um dado por vez e o rolam. O jogador que rolar nos dados o maior valor ganha. -If the first player picks die $A$ and the second player picks die $B$ we get +Se o primeiro jogador escolher o dado $A$ e o segundo jogador escolher o dado $B$, temos -$P(\text{second player wins}) = \frac{7}{12} > \frac{1}{2}$ +$P(\text{vitória do segundo jogador}) = \frac{7}{12} > \frac{1}{2}$ -If the first player picks die $B$ and the second player picks die $C$ we get +Se o primeiro jogador escolher o dado $B$ e o segundo jogador escolher o dado $C$, temos -$P(\text{second player wins}) = \frac{7}{12} > \frac{1}{2}$ +$P(\text{vitória do segundo jogador}) = \frac{7}{12} > \frac{1}{2}$ -If the first player picks die $C$ and the second player picks die $A$ we get +Se o primeiro jogador escolher o dado $C$ e o segundo jogador escolher o dado $A$, nós temos -$P(\text{second player wins}) = \frac{25}{36} > \frac{1}{2}$ +$P(\text{vitória do segundo jogador}) = \frac{25}{36} > \frac{1}{2}$ -So whatever die the first player picks, the second player can pick another die and have a larger than 50% chance of winning. A set of dice having this property is called a nontransitive set of dice. +Portanto, seja qual for o dado que o primeiro jogador escolher, o segundo jogador pode escolher outro dado e ter mais de 50% de chance de ganhar. Um conjunto de dados com esta propriedade é denominado conjunto de dados não transitivo. -We wish to investigate how many sets of nontransitive dice exist. We will assume the following conditions: +Queremos investigar quantos conjuntos de dados não transitivos existem. Assumiremos as seguintes condições: -- There are three six-sided dice with each side having between 1 and $N$ pips, inclusive. -- Dice with the same set of pips are equal, regardless of which side on the die the pips are located. -- The same pip value may appear on multiple dice; if both players roll the same value neither player wins. -- The sets of dice $\\{A, B, C\\}$, $\\{B, C, A\\}$ and $\\{C, A, B\\}$ are the same set. +- Existem três dados de seis lados com cada lado tendo entre 1 e $N$ pontos, inclusive. +- Dados com o mesmo conjunto de pontos são iguais, independentemente de qual lado no dado o ponto está localizado. +- O mesmo valor de pontos pode aparecer em vários dados. Se ambos os jogadores obtiverem o mesmo valor, nenhum deles ganhará. +- Os conjuntos de dados $\\{A, B, C\\}$, $\\{B, C, A\\}$ e $\\{C, A, B\\}$ são o mesmo conjunto. -For $N = 7$ we find there are 9780 such sets. +Para $N = 7$ encontramos 9780 desses conjuntos. -How many are there for $N = 30$? +Quantos são para $N = 30$? # --hints-- -`nontransitiveSetsOfDice()` should return `973059630185670`. +`nontransitiveSetsOfDice()` deve retornar `973059630185670`. ```js assert.strictEqual(nontransitiveSetsOfDice(), 973059630185670); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-377-sum-of-digits-experience-13.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-377-sum-of-digits-experience-13.md index ff149a27b28..9d09c52970e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-377-sum-of-digits-experience-13.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-377-sum-of-digits-experience-13.md @@ -1,6 +1,6 @@ --- id: 5900f4e51000cf542c50fff8 -title: 'Problem 377: Sum of digits, experience 13' +title: 'Problema 377: Soma dos algarismos, experiência nº 13' challengeType: 1 forumTopicId: 302039 dashedName: problem-377-sum-of-digits-experience-13 @@ -8,19 +8,19 @@ dashedName: problem-377-sum-of-digits-experience-13 # --description-- -There are 16 positive integers that do not have a zero in their digits and that have a digital sum equal to 5, namely: +Existem 16 números inteiros positivos que não têm zero nos seus algarismos e que têm uma soma de algarismos igual a 5. São eles: -5, 14, 23, 32, 41, 113, 122, 131, 212, 221, 311, 1112, 1121, 1211, 2111 and 11111. +5, 14, 23, 32, 41, 113, 122, 131, 212, 221, 311, 1112, 1121, 1211, 2111 e 11111. -Their sum is 17891. +A soma deles é de 17891. -Let $f(n)$ be the sum of all positive integers that do not have a zero in their digits and have a digital sum equal to $n$. +Considere $f(n)$ como a soma de todos os números inteiros positivos que não têm zero nos seus algarismos e que têm uma soma dos algarismos igual a $n$. -Find $\displaystyle\sum_{i=1}^{17} f(13^i)$. Give the last 9 digits as your answer. +Encontre $\displaystyle\sum_{i=1}^{17} f(13^i)$. Dê os últimos 9 algarismos da sua resposta. # --hints-- -`experience13()` should return `732385277`. +`experience13()` deve retornar `732385277`. ```js assert.strictEqual(experience13(), 732385277); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-378-triangle-triples.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-378-triangle-triples.md index e72ba4316c9..cc34317d802 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-378-triangle-triples.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-378-triangle-triples.md @@ -1,6 +1,6 @@ --- id: 5900f4e61000cf542c50fff9 -title: 'Problem 378: Triangle Triples' +title: 'Problema 378: Trios de triângulos' challengeType: 1 forumTopicId: 302040 dashedName: problem-378-triangle-triples @@ -8,17 +8,17 @@ dashedName: problem-378-triangle-triples # --description-- -Let $T(n)$ be the $n^{\text{th}}$ triangle number, so $T(n) = \frac{n(n + 1)}{2}$. +Considere $T(n)$ como o $n^{\text{º}}$ número triangular. Assim, $T(n) = \frac{n(n + 1)}{2}$. -Let $dT(n)$ be the number of divisors of $T(n)$. E.g.: $T(7) = 28$ and $dT(7) = 6$. +Considere $dT(n)$ como o número de divisores de $T(n)$. Ex.: $T(7) = 28$ e $dT(7) = 6$. -Let $Tr(n)$ be the number of triples ($i$, $j$, $k$) such that $1 ≤ i < j < k ≤ n$ and $dT(i) > dT(j) > dT(k)$. $Tr(20) = 14$, $Tr(100) = 5\\,772$ and $Tr(1000) = 11\\,174\\,776$. +Considere $Tr(n)$ como o número de trios ($i$, $j$, $k$), tal que $1 ≤ i < j < k ≤ n$ e $dT(i) > dT(j) > dT(k)$. $Tr(20) = 14$, $Tr(100) = 5.772$ e $Tr(1000) = 11.174.776$. -Find $Tr(60\\,000\\,000)$. Give the last 18 digits of your answer. +Encontre $Tr(60.000.000)$. Dê os últimos 18 algarismos da sua resposta. # --hints-- -`triangleTriples()` should return `147534623725724700`. +`triangleTriples()` deve retornar `147534623725724700`. ```js assert.strictEqual(triangleTriples(), 147534623725724700); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-379-least-common-multiple-count.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-379-least-common-multiple-count.md index 0f2fb896572..58f51fe9abe 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-379-least-common-multiple-count.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-379-least-common-multiple-count.md @@ -1,6 +1,6 @@ --- id: 5900f4e81000cf542c50fffa -title: 'Problem 379: Least common multiple count' +title: 'Problema 379: Contagem de mínimos múltiplos comuns' challengeType: 1 forumTopicId: 302041 dashedName: problem-379-least-common-multiple-count @@ -8,17 +8,17 @@ dashedName: problem-379-least-common-multiple-count # --description-- -Let $f(n)$ be the number of couples ($x$, $y$) with $x$ and $y$ positive integers, $x ≤ y$ and the least common multiple of $x$ and $y$ equal to $n$. +Considere $f(n)$ como o número de pares ($x$, $y$) com $x$ e $y$ sendo números inteiros positivos, $x ≤ y$ e o mínimo múltiplo comum de $x$ e $y$ sendo igual a $n$. -Let $g$ be the summatory function of $f$, i.e.: $g(n) = \sum f(i)$ for $1 ≤ i ≤ n$. +Considere $g$ como a função somatória de $f$, ou seja, $g(n) = \sum f(i)$ para $1 ≤ i ≤ n$. -You are given that $g({10}^6) = 37\\,429\\,395$. +Você é informado de que $g({10}^6) = 37.429.395$. -Find $g({10}^{12})$. +Encontre $g({10}^{12})$. # --hints-- -`leastCommonMultipleCount()` should return `132314136838185`. +`leastCommonMultipleCount()` deve retornar `132314136838185`. ```js assert.strictEqual(leastCommonMultipleCount(), 132314136838185); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-380-amazing-mazes.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-380-amazing-mazes.md index 15ae5170a74..05525f2e3a2 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-380-amazing-mazes.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-380-amazing-mazes.md @@ -1,6 +1,6 @@ --- id: 5900f4e81000cf542c50fffb -title: 'Problem 380: Amazing Mazes!' +title: 'Problema 380: Labirintos fantásticos!' challengeType: 1 forumTopicId: 302044 dashedName: problem-380-amazing-mazes @@ -8,27 +8,27 @@ dashedName: problem-380-amazing-mazes # --description-- -An $m×n$ maze is an $m×n$ rectangular grid with walls placed between grid cells such that there is exactly one path from the top-left square to any other square. The following are examples of a 9×12 maze and a 15×20 maze: +Um labirinto $m×n$ é uma grade retangular $m×n$ com paredes colocadas entre as células da malha de forma que haja exatamente um caminho do quadrado superior esquerdo para qualquer outro quadrado. Os exemplos a seguir são de um labirinto 9×12 e de um labirinto 15×20: -9x12 maze and 15x20 maze +labirinto 9x12 e labirinto 15x20 -Let $C(m, n)$ be the number of distinct $m×n$ mazes. Mazes which can be formed by rotation and reflection from another maze are considered distinct. +Considere $C(m, n)$ como o número de labirintos distintos $m×n$. Os labirintos que podem ser criados por rotação e reflexão de outro labirinto são considerados distintos. -It can be verified that $C(1, 1) = 1$, $C(2, 2) = 4$, $C(3, 4) = 2415$, and $C(9, 12) = 2.5720\mathrm{e}\\,46$ (in scientific notation rounded to 5 significant digits). +Pode-se verificar que $C(1, 1) = 1$, $C(2, 2) = 4$, $C(3, 4) = 2415$ e $C(9, 12) = 2.5720\mathrm{e}\\,46$ (na notação científica, arredondado para 5 algarismos significantes). -Find $C(100, 500)$ and write your answer as a string in scientific notation rounded to 5 significant digits. +Encontre $C(100, 500)$ e escreva sua resposta em uma string em notação científica arredondada para 5 algarismos significativos. -When giving your answer, use a lowercase e to separate mantissa and exponent. E.g. if the answer is 1234567891011 then the answer format would be the string `1.2346e12`. +Ao dar sua resposta, use letra minúscula para separar a mantissa e o expoente. Ex: se a resposta for 1234567891011, o formato da resposta deve ser a string `1.2346e12`. # --hints-- -`amazingMazes()` should return a string. +`amazingMazes()` deve retornar uma string. ```js assert(typeof amazingMazes() === 'string'); ``` -`amazingMazes()` should return the string `6.3202e25093`. +`amazingMazes()` deve retornar a string `6.3202e25093`. ```js assert.strictEqual(amazingMazes(), '6.3202e25093'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-381-prime-k-factorial.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-381-prime-k-factorial.md index 21d1936ca57..e36d1fdd95a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-381-prime-k-factorial.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-381-prime-k-factorial.md @@ -1,6 +1,6 @@ --- id: 5900f4ea1000cf542c50fffc -title: 'Problem 381: (prime-k) factorial' +title: 'Problema 381: Fatorial (k-primo)' challengeType: 1 forumTopicId: 302045 dashedName: problem-381-prime-k-factorial @@ -8,21 +8,21 @@ dashedName: problem-381-prime-k-factorial # --description-- -For a prime $p$ let $S(p) = (\sum (p - k)!)\bmod (p)$ for $1 ≤ k ≤ 5$. +Para um número primo $p$, considere $S(p) = (\sum (p - k)!)\bmod (p)$ para $1 ≤ k ≤ 5$. -For example, if $p = 7$, +Por exemplo, se $p = 7$, $$(7 - 1)! + (7 - 2)! + (7 - 3)! + (7 - 4)! + (7 - 5)! = 6! + 5! + 4! + 3! + 2! = 720 + 120 + 24 + 6 + 2 = 872$$ -As $872\bmod (7) = 4$, $S(7) = 4$. +Como $872\bmod (7) = 4$, $S(7) = 4$. -It can be verified that $\sum S(p) = 480$ for $5 ≤ p < 100$. +Pode-se verificar que $\sum S(p) = 480$ para $5 ≤ p < 100$. -Find $\sum S(p)$ for $5 ≤ p < {10}^8$. +Encontre a $\sum S(p)$ para $5 ≤ p < {10}^8$. # --hints-- -`primeKFactorial()` should return `139602943319822`. +`primeKFactorial()` deve retornar `139602943319822`. ```js assert.strictEqual(primeKFactorial(), 139602943319822); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-382-generating-polygons.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-382-generating-polygons.md index 605495d8fed..8287c9abd48 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-382-generating-polygons.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-382-generating-polygons.md @@ -1,6 +1,6 @@ --- id: 5900f4eb1000cf542c50fffd -title: 'Problem 382: Generating polygons' +title: 'Problema 382: Geração de polígonos' challengeType: 1 forumTopicId: 302046 dashedName: problem-382-generating-polygons @@ -8,38 +8,38 @@ dashedName: problem-382-generating-polygons # --description-- -A polygon is a flat shape consisting of straight line segments that are joined to form a closed chain or circuit. A polygon consists of at least three sides and does not self-intersect. +Um polígono é uma forma plana composta por segmentos de retas que são reunidos para formar uma cadeia ou circuito fechado. Um polígono consiste em, pelo menos, três lados que não se cruzam. -A set $S$ of positive numbers is said to generate a polygon $P$ if: +Dizem que um conjunto $S$ de números positivos gera um polígono $P$ se: -- no two sides of $P$ are the same length, -- the length of every side of $P$ is in $S$, and -- $S$ contains no other value. +- não há dois lados de $P$ que sejam do mesmo tamanho, +- o comprimento de cada lado de $P$ está em $S$, e +- $S$ não contém nenhum outro valor. -For example: +Por exemplo: -The set {3, 4, 5} generates a polygon with sides 3, 4, and 5 (a triangle). +O conjunto {3, 4, 5} gera um polígono com lados 3, 4 e 5 (um triângulo). -The set {6, 9, 11, 24} generates a polygon with sides 6, 9, 11, and 24 (a quadrilateral). +O conjunto {6, 9, 11, 24} gera um polígono com lados 6, 9, 11 e 24 (um quadrilátero). -The sets {1, 2, 3} and {2, 3, 4, 9} do not generate any polygon at all. +Os conjuntos {1, 2, 3} e {2, 3, 4, 9} não geram nenhum polígono. -Consider the sequence $s$, defined as follows: +Considere a sequência $s$, definida da seguinte forma: - $s_1 = 1$, $s_2 = 2$, $s_3 = 3$ -- $s_n = s_{n - 1} + s_{n - 3}$ for $n > 3$. +- $s_n = s_{n - 1} + s_{n - 3}$ para $n > 3$. -Let $U_n$ be the set $\\{s_1, s_2, \ldots, s_n\\}$. For example, $U_{10} = \\{1, 2, 3, 4, 6, 9, 13, 19, 28, 41\\}$. +Considere $U_n$ como o conjunto $\\{s_1, s_2, \ldots, s_n\\}$. Por exemplo, $U_{10} = \\{1, 2, 3, 4, 6, 9, 13, 19, 28, 41\\}$. -Let $f(n)$ be the number of subsets of $U_n$ which generate at least one polygon. +Considere $f(n)$ como o número de subconjuntos de $U_n$ que geram pelo menos um polígono. -For example, $f(5) = 7$, $f(10) = 501$ and $f(25) = 18\\,635\\,853$. +Por exemplo, $f(5) = 7$, $f(10) = 501$ e $f(25) = 18.635.853$. -Find the last 9 digits of $f({10}^{18})$. +Encontre os 9 últimos algarismos de $f({10}^{18})$. # --hints-- -`generatingPolygons()` should return `697003956`. +`generatingPolygons()` deve retornar `697003956`. ```js assert.strictEqual(generatingPolygons(), 697003956); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-383-divisibility-comparison-between-factorials.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-383-divisibility-comparison-between-factorials.md index 4a851985199..0eb8d3a2be9 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-383-divisibility-comparison-between-factorials.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-383-divisibility-comparison-between-factorials.md @@ -1,6 +1,6 @@ --- id: 5900f4ed1000cf542c50ffff -title: 'Problem 383: Divisibility comparison between factorials' +title: 'Problema 383: Comparação de divisibilidade entre fatoriais' challengeType: 1 forumTopicId: 302047 dashedName: problem-383-divisibility-comparison-between-factorials @@ -8,19 +8,19 @@ dashedName: problem-383-divisibility-comparison-between-factorials # --description-- -Let $f_5(n)$ be the largest integer $x$ for which $5^x$ divides $n$. +Considere $f_5(n)$ como o maior número inteiro $x$ para o qual $5^x$ divide $n$. -For example, $f_5(625\\,000) = 7$. +Por exemplo, $f_5(625.000) = 7$. -Let $T_5(n)$ be the number of integers $i$ which satisfy $f_5((2 \times i - 1)!) < 2 \times f_5(i!)$ and $1 ≤ i ≤ n$. +Considere $T_5(n)$ como a quantidade de números inteiros $i$ que satisfazem $f_5((2 \times i - 1)!) < 2 \times f_5(i!)$ e $1 ≤ i ≤ n$. -It can be verified that $T_5({10}^3) = 68$ and $T_5({10}^9) = 2\\,408\\,210$. +Pode-se verificar que $T_5({10}^3) = 68$ e que $T_5({10}^9) = 2.408.210$. -Find $T_5({10}^{18})$. +Encontre $T_5({10}^{18})$. # --hints-- -`factorialDivisibilityComparison()` should return `22173624649806`. +`factorialDivisibilityComparison()` deve retornar `22173624649806`. ```js assert.strictEqual(factorialDivisibilityComparison(), 22173624649806); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-384-rudin-shapiro-sequence.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-384-rudin-shapiro-sequence.md index 9f11652c82f..1ec94c652f0 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-384-rudin-shapiro-sequence.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-384-rudin-shapiro-sequence.md @@ -1,6 +1,6 @@ --- id: 5900f4ed1000cf542c50fffe -title: 'Problem 384: Rudin-Shapiro sequence' +title: 'Problema 384: Sequência de Rudin-Shapiro' challengeType: 1 forumTopicId: 302048 dashedName: problem-384-rudin-shapiro-sequence @@ -8,38 +8,38 @@ dashedName: problem-384-rudin-shapiro-sequence # --description-- -Define the sequence $a(n)$ as the number of adjacent pairs of ones in the binary expansion of $n$ (possibly overlapping). +Defina a sequência $a(n)$ como o número de pares adjacentes de uns na expansão binária de $n$ (possivelmente sobrepostos). -E.g.: $a(5) = a({101}_2) = 0$, $a(6) = a({110}_2) = 1$, $a(7) = a({111}_2) = 2$ +Por exemplo: $a(5) = a({101}_2) = 0$, $a(6) = a({110}_2) = 1$, $a(7) = a({111}_2) = 2$ -Define the sequence $b(n) = {(-1)}^{a(n)}$. This sequence is called the Rudin-Shapiro sequence. +Defina a sequência $b(n) = {(-1)}^{a(n)}$. Essa sequência é chamada de sequência de Rudin-Shapiro. -Also consider the summatory sequence of $b(n)$: $s(n) = \displaystyle\sum_{i = 0}^{n} b(i)$. +Além disso, considere a sequência somatória de $b(n)$: $s(n) = \displaystyle\sum_{i = 0}^{n} b(i)$. -The first couple of values of these sequences are: +Os primeiros valores destas sequências são: $$\begin{array}{lr} n & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 \\\\ a(n) & 0 & 0 & 0 & 1 & 0 & 0 & 1 & 2 \\\\ b(n) & 1 & 1 & 1 & -1 & 1 & 1 & -1 & 1 \\\\ s(n) & 1 & 2 & 3 & 2 & 3 & 4 & 3 & 4 \end{array}$$ -The sequence $s(n)$ has the remarkable property that all elements are positive and every positive integer $k$ occurs exactly $k$ times. +A sequência $s(n)$ tem a incrível propriedade de que todos os elementos são positivos e de que todo número inteiro positivo $k$ ocorre exatamente $k$ vezes. -Define $g(t, c)$, with $1 ≤ c ≤ t$, as the index in $s(n)$ for which $t$ occurs for the $c$'th time in $s(n)$. +Defina $g(t, c)$, com $1 ≤ c ≤ t$, como o índice em $s(n)$ para o qual $t$ ocorre pela $c$ª vez em $s(n)$. -E.g.: $g(3, 3) = 6$, $g(4, 2) = 7$ and $g(54321, 12345) = 1\\,220\\,847\\,710$. +Ex.: $g(3, 3) = 6$, $g(4, 2) = 7$ e $g(54321, 12345) = 1.220.847.710$. -Let $F(n)$ be the fibonacci sequence defined by: +Considere $F(n)$ como a sequência de Fibonacci definida por: -$$\begin{align} & F(0) = F(1) = 1 \text{ and} \\\\ - & F(n) = F(n - 1) + F(n - 2) \text{ for } n > 1. \end{align}$$ +$$\begin{align} & F(0) = F(1) = 1 \text{ e} \\\\ + & F(n) = F(n - 1) + F(n - 2) \text{ para } n > 1. \end{align}$$ -Define $GF(t) = g(F(t), F(t - 1))$. +Defina $GF(t) = g(F(t), F(t - 1))$. -Find $\sum GF(t)$ for$ 2 ≤ t ≤ 45$. +Encontre a $\sum GF(t)$ para $2 ≤ t ≤ 45$. # --hints-- -`rudinShapiroSequence()` should return `3354706415856333000`. +`rudinShapiroSequence()` deve retornar `3354706415856333000`. ```js assert.strictEqual(rudinShapiroSequence(), 3354706415856333000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-385-ellipses-inside-triangles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-385-ellipses-inside-triangles.md index 13dcc0e7c5c..57d9c8efe94 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-385-ellipses-inside-triangles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-385-ellipses-inside-triangles.md @@ -1,6 +1,6 @@ --- id: 5900f4ee1000cf542c510000 -title: 'Problem 385: Ellipses inside triangles' +title: 'Problema 385: Elipses dentro de triângulos' challengeType: 1 forumTopicId: 302049 dashedName: problem-385-ellipses-inside-triangles @@ -8,28 +8,28 @@ dashedName: problem-385-ellipses-inside-triangles # --description-- -For any triangle $T$ in the plane, it can be shown that there is a unique ellipse with largest area that is completely inside $T$. +Para qualquer triângulo $T$ no plano, pode-se mostrar que há uma elipse única com a maior área completamente dentro de $T$. -ellipse completely inside a triangle +elipse totalmente interna ao triângulo -For a given $n$, consider triangles $T$ such that: +Para um $n$ dado, considere os triângulos $T$, tal que: -- the vertices of $T$ have integer coordinates with absolute value $≤ n$, and -- the foci1 of the largest-area ellipse inside $T$ are $(\sqrt{13}, 0)$ and $(-\sqrt{13}, 0)$. +- os vértices de $T$ têm coordenadas em números inteiros, com valor absoluto $≤ n$, e +- os focos1 da elipse de maior área dentro de $T$ são $(\sqrt{13}, 0)$ e $(-\sqrt{13}, 0)$. -Let $A(n)$ be the sum of the areas of all such triangles. +Considere $A(n)$ como a soma das áreas de todos esses triângulos. -For example, if $n = 8$, there are two such triangles. Their vertices are (-4,-3), (-4,3), (8,0) and (4,3), (4,-3), (-8,0), and the area of each triangle is 36. Thus $A(8) = 36 + 36 = 72$. +Por exemplo, se $n = 8$, existem dois triângulos desse tipo. Seus vértices são (-4,-3), (-4,3), (8,0) e (4,3), (4,-3), (-8,0). A área de cada triângulo é 36. Portanto, $A(8) = 36 + 36 = 72$. -It can be verified that $A(10) = 252$, $A(100) = 34\\,632$ and $A(1000) = 3\\,529\\,008$. +Pode-se verificar que $A(10) = 252$, $A(100) = 34.632$ e $A(1000) = 3.529.008$. -Find $A(1\\,000\\,000\\,000)$. +Encontre $A(1.000.000.000)$. -1The foci (plural of focus) of an ellipse are two points $A$ and $B$ such that for every point $P$ on the boundary of the ellipse, $AP + PB$ is constant. +1Os focos de uma elipse são dois pontos $A$ e $B$, tal que, para qualquer ponto $P$ no limite da elipse, $AP + PB$ é constante. # --hints-- -`ellipsesInsideTriangles()` should return `3776957309612154000`. +`ellipsesInsideTriangles()` deve retornar `3776957309612154000`. ```js assert.strictEqual(ellipsesInsideTriangles(), 3776957309612154000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-386-maximum-length-of-an-antichain.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-386-maximum-length-of-an-antichain.md index de0614e4651..223e5a6ca24 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-386-maximum-length-of-an-antichain.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-386-maximum-length-of-an-antichain.md @@ -1,6 +1,6 @@ --- id: 5900f4ef1000cf542c510001 -title: 'Problem 386: Maximum length of an antichain' +title: 'Problema 386: Comprimento máximo de uma anticadeia' challengeType: 1 forumTopicId: 302050 dashedName: problem-386-maximum-length-of-an-antichain @@ -8,23 +8,23 @@ dashedName: problem-386-maximum-length-of-an-antichain # --description-- -Let $n$ be an integer and $S(n)$ be the set of factors of $n$. +Considere $n$ como um número inteiro e $S(n)$ como o conjunto de fatores de $n$. -A subset $A$ of $S(n)$ is called an antichain of $S(n)$ if $A$ contains only one element or if none of the elements of $A$ divides any of the other elements of $A$. +Um subconjunto $A$ de $S(n)$ é chamado de anticadeia de $S(n)$ se $A$ tiver apenas um elemento ou se nenhum dos elementos de $A$ divide qualquer um dos outros elementos de $A$. -For example: $S(30) = \\{1, 2, 3, 5, 6, 10, 15, 30\\}$ +Por exemplo: $S(30) = \\{1, 2, 3, 5, 6, 10, 15, 30\\}$ -$\\{2, 5, 6\\}$ is not an antichain of $S(30)$. +$\\{2, 5, 6\\}$ não é uma anticadeia de $S(30)$. -$\\{2, 3, 5\\}$ is an antichain of $S(30)$. +$\\{2, 3, 5\\}$ é uma anticadeia de $S(30)$. -Let $N(n)$ be the maximum length of an antichain of $S(n)$. +Considere $N(n)$ como o comprimento máximo de uma anticadeia de $S(n)$. -Find $\sum N(n)$ for $1 ≤ n ≤ {10}^8$ +Encontre a $\sum N(n)$ para $1 ≤ n ≤ {10}^8$ # --hints-- -`maximumLengthOfAntichain()` should return `528755790`. +`maximumLengthOfAntichain()` deve retornar `528755790`. ```js assert.strictEqual(maximumLengthOfAntichain(), 528755790); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-389-platonic-dice.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-389-platonic-dice.md index 081791ffe3b..a0a32cc196f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-389-platonic-dice.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-389-platonic-dice.md @@ -1,6 +1,6 @@ --- id: 5900f4f21000cf542c510004 -title: 'Problem 389: Platonic Dice' +title: 'Problema 389: Dados platônicos' challengeType: 1 forumTopicId: 302053 dashedName: problem-389-platonic-dice @@ -8,21 +8,21 @@ dashedName: problem-389-platonic-dice # --description-- -An unbiased single 4-sided die is thrown and its value, $T$, is noted. +Um único dado de 4 lados sem viés é lançado e seu valor, $T$, é registrado. -$T$ unbiased 6-sided dice are thrown and their scores are added together. The sum, $C$, is noted. +$T$ dados de 6 lados sem viés são lançados e sua pontuação é somada. A soma, $C$, é registrada. -$C$ unbiased 8-sided dice are thrown and their scores are added together. The sum, $O$, is noted. +$C$ dados de 8 lados sem viés são lançados e sua pontuação é somada. A soma, $O$, é registrada. -$O$ unbiased 12-sided dice are thrown and their scores are added together. The sum, $D$, is noted. +$O$ dados de 12 lados sem viés são lançados e sua pontuação é somada. A soma, $D$, é registrada. -$D$ unbiased 20-sided dice are thrown and their scores are added together. The sum, $I$, is noted. +$D$ dados de 20 lados sem viés são lançados e sua pontuação é somada. A soma, $I$, é registrada. -Find the variance of $I$, and give your answer rounded to 4 decimal places. +Encontre a variância de $I$ e dê sua resposta arredondada para 4 casas decimais. # --hints-- -`platonicDice()` should return `2406376.3623`. +`platonicDice()` deve retornar `2406376.3623`. ```js assert.strictEqual(platonicDice(), 2406376.3623); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-391-hopping-game.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-391-hopping-game.md index e94e14e527b..55c83048e2f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-391-hopping-game.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-391-hopping-game.md @@ -1,6 +1,6 @@ --- id: 5900f4f31000cf542c510006 -title: 'Problem 391: Hopping Game' +title: 'Problema 391: Jogo de saltos' challengeType: 1 forumTopicId: 302056 dashedName: problem-391-hopping-game @@ -8,32 +8,32 @@ dashedName: problem-391-hopping-game # --description-- -Let $s_k$ be the number of 1’s when writing the numbers from 0 to $k$ in binary. +Considere $s_k$ como o número de 1s ao escrever os números de 0 a $k$ em binário. -For example, writing 0 to 5 in binary, we have 0, 1, 10, 11, 100, 101. There are seven 1’s, so $s_5 = 7$. +Por exemplo, escrevendo de 0 a 5 em binário, temos 0, 1, 10, 11, 100 e 101. São sete números 1, portanto $s_5 = 7$. -The sequence $S = \\{s_k : k ≥ 0\\}$ starts $\\{0, 1, 2, 4, 5, 7, 9, 12, \ldots\\}$. +A sequência $S = \\{s_k : k ≥ 0\\}$ começa com $\\{0, 1, 2, 4, 5, 7, 9, 12, \ldots\\}$. -A game is played by two players. Before the game starts, a number $n$ is chosen. A counter $c$ starts at 0. At each turn, the player chooses a number from 1 to $n$ (inclusive) and increases $c$ by that number. The resulting value of $c$ must be a member of $S$. If there are no more valid moves, the player loses. +Dois jogadores jogam. Antes de o jogo começar, um número $n$ é selecionado. Um contador $c$ começa em 0. A cada turno, o jogador escolhe um número de 1 a $n$ (inclusive) e aumenta $c$ por aquele número. O valor resultante de $c$ deve pertencer a $S$. Se não houver mais movimentos válidos, o jogador perde. -For example, with $n = 5$ and starting with $c = 0$: +Por exemplo, com $n = 5$ e começando com $c = 0$: -- Player 1 chooses 4, so $c$ becomes $0 + 4 = 4$. -- Player 2 chooses 5, so $c$ becomes $4 + 5 = 9$. -- Player 1 chooses 3, so $c$ becomes $9 + 3 = 12$. +- O jogador 1 escolhe 4, então $c$ passa a ser $0 + 4 = 4$. +- O jogador 2 escolhe 5, então $c$ passa a ser $4 + 5 = 9$. +- O jogador 1 escolhe 3, então $c$ passa a ser $9 + 3 = 12$. - etc. -Note that $c$ must always belong to $S$, and each player can increase $c$ by at most $n$. +Observe que $c$ deve sempre pertencer a $S$ e que cada jogador pode aumentar $c$ em, no máximo, $n$. -Let $M(n)$ be the highest number the first player can choose at her first turn to force a win, and $M(n) = 0$ if there is no such move. For example, $M(2) = 2$, $M(7) = 1$ and $M(20) = 4$. +Considere $M(n)$ como o maior número que o primeiro jogador pode escolher em sua primeira jogada para forçar uma vitória, e que $M(n) = 0$ se esse movimento não existir. Por exemplo, $M(2) = 2$, $M(7) = 1$ e $M(20) = 4$. -It can be verified $\sum M{(n)}^3 = 8150$ for $1 ≤ n ≤ 20$. +Pode-se verificar que $\sum M{(n)}^3 = 8150$ para $1 ≤ n ≤ 20$. -Find $\sum M{(n)}^3$ for $1 ≤ n ≤ 1000$. +Encontre a $\sum M{(n)}^3$ para $1 ≤ n ≤ 1000$. # --hints-- -`hoppingGame()` should return `61029882288`. +`hoppingGame()` deve retornar `61029882288`. ```js assert.strictEqual(hoppingGame(), 61029882288); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-392-enmeshed-unit-circle.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-392-enmeshed-unit-circle.md index 7e40a574c29..517dad1b07b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-392-enmeshed-unit-circle.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-392-enmeshed-unit-circle.md @@ -1,6 +1,6 @@ --- id: 5900f4f41000cf542c510007 -title: 'Problem 392: Enmeshed unit circle' +title: 'Problema 392: Círculo unitário em malha' challengeType: 1 forumTopicId: 302057 dashedName: problem-392-enmeshed-unit-circle @@ -8,31 +8,31 @@ dashedName: problem-392-enmeshed-unit-circle # --description-- -A rectilinear grid is an orthogonal grid where the spacing between the gridlines does not have to be equidistant. +Uma grade retilinear é uma grade ortogonal onde o espaçamento entre as linhas da grade não precisa ser equidistante. -An example of such grid is logarithmic graph paper. +Um exemplo desse tipo de grade é o papel gráfico logarítmico. -Consider rectilinear grids in the Cartesian coordinate system with the following properties: +Considere as grades retilineares no sistema de coordenadas cartesiano com as seguintes propriedades: -- The gridlines are parallel to the axes of the Cartesian coordinate system. -- There are $N + 2$ vertical and $N + 2$ horizontal gridlines. Hence there are $(N + 1) \times (N + 1)$ rectangular cells. -- The equations of the two outer vertical gridlines are $x = -1$ and $x = 1$. -- The equations of the two outer horizontal gridlines are $y = -1$ and $y = 1$. -- The grid cells are colored red if they overlap with the unit circle, black otherwise. +- As linhas da grade são paralelas aos eixos do sistema de coordenadas cartesiano. +- Existem $N + 2$ linhas de grade verticais e $N + 2$ linhas de grade horizontais. Portanto, existem $(N + 1) \times (N + 1)$ células retangulares. +- As equações das duas linhas da grade verticais externas são $x = -1$ e $x = 1$. +- As equações das duas linhas da grade horizontais externas são $y = -1$ e $y = 1$. +- As células da grade são coloridas de vermelho se elas estiveres sobre o círculo unitário. Do contrário, elas serão pretas. -For this problem we would like you to find the positions of the remaining $N$ inner horizontal and $N$ inner vertical gridlines so that the area occupied by the red cells is minimized. +Para esse problema, gostaríamos que você encontrasse as posições das $N$ linhas de grade internas horizontais e das $N$ linhas de grade internas verticais restantes, de modo que a área ocupada pelas células vermelhas seja minimizada. -E.g. here is a picture of the solution for $N = 10$: +Ex: aqui vemos uma imagem da solução para $N = 10$: -solution for N = 10 +solução para N = 10 -The area occupied by the red cells for $N = 10$ rounded to 10 digits behind the decimal point is 3.3469640797. +A área ocupada pelas células vermelhas para $N = 10$, arredondada para 10 casas depois da vírgula, é de 3,3469640797. -Find the positions for $N = 400$. Give as your answer the area occupied by the red cells rounded to 10 digits behind the decimal point. +Encontre as posições para $N = 400$. Dê sua resposta como a área ocupada pelas células vermelhas arredondada para 10 casas depois da vírgula. # --hints-- -`enmeshedUnitCircle()` should return `3.1486734435`. +`enmeshedUnitCircle()` deve retornar `3.1486734435`. ```js assert.strictEqual(enmeshedUnitCircle(), 3.1486734435); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-393-migrating-ants.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-393-migrating-ants.md index 28a0b4d745c..c59fdbf538f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-393-migrating-ants.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-393-migrating-ants.md @@ -1,6 +1,6 @@ --- id: 5900f4f61000cf542c510008 -title: 'Problem 393: Migrating ants' +title: 'Problema 393: Formigas migratórias' challengeType: 1 forumTopicId: 302058 dashedName: problem-393-migrating-ants @@ -8,19 +8,19 @@ dashedName: problem-393-migrating-ants # --description-- -An $n × n$ grid of squares contains $n^2$ ants, one ant per square. +Uma grade de $n × n$ quadrados contém $n^2$ formigas, uma por quadrado. -All ants decide to move simultaneously to an adjacent square (usually 4 possibilities, except for ants on the edge of the grid or at the corners). +Todas as formigas decidem se mover simultaneamente para um quadrado adjacente (em geral, 4 possibilidades, exceto para as formigas nas arestas ou nos vértices da grade). -We define $f(n)$ to be the number of ways this can happen without any ants ending on the same square and without any two ants crossing the same edge between two squares. +Definimos $f(n)$ como o número de formas pelas quais isso pode acontecer sem que qualquer formiga acabe no mesmo quadrado em que estava e sem que duas formigas cruzem a mesma aresta entre dois quadrados. -You are given that $f(4) = 88$. +Você é informado de que $f(4) = 88$. -Find $f(10)$. +Encontre $f(10)$. # --hints-- -`migratingAnts()` should return `112398351350823100`. +`migratingAnts()` deve retornar `112398351350823100`. ```js assert.strictEqual(migratingAnts(), 112398351350823100); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-394-eating-pie.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-394-eating-pie.md index a6b40bf39bc..c9a55d72fda 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-394-eating-pie.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-394-eating-pie.md @@ -1,6 +1,6 @@ --- id: 5900f4f71000cf542c510009 -title: 'Problem 394: Eating pie' +title: 'Problema 394: Comendo tortas' challengeType: 1 forumTopicId: 302059 dashedName: problem-394-eating-pie @@ -8,26 +8,26 @@ dashedName: problem-394-eating-pie # --description-- -Jeff eats a pie in an unusual way. +Jeff come uma torta de maneira incomum. -The pie is circular. He starts with slicing an initial cut in the pie along a radius. +A torta é circular. Ele começa cortando uma fatia inicial da torta ao longo de seu raio. -While there is at least a given fraction $F$ of pie left, he performs the following procedure: +Enquanto houver ao menos uma fração $F$ determinada da torta restando, ele realiza o seguinte procedimento: -- He makes two slices from the pie centre to any point of what is remaining of the pie border, any point on the remaining pie border equally likely. This will divide the remaining pie into three pieces. -- Going counterclockwise from the initial cut, he takes the first two pie pieces and eats them. +- Ele faz duas fatias a partir do centro da torta até qualquer ponto do que resta da borda, qualquer ponto na borda restante da torta sendo igualmente provável. Isso dividirá o restante da torta em três pedaços. +- Indo no sentido anti-horário a partir do corte inicial, ele pega os dois primeiros pedaços da torta e os come. -When less than a fraction $F$ of pie remains, he does not repeat this procedure. Instead, he eats all of the remaining pie. +Quando menos que uma fração $F$ da torta restar, ele para de repetir esse procedimento. Em vez disso, ele come toda a torta que resta. -animation of pie slicing procedure +animação do procedimento do corte da torta em fatias -For $x ≥ 1$, let $E(x)$ be the expected number of times Jeff repeats the procedure above with $F = \frac{1}{x}$. It can be verified that $E(1) = 1$, $E(2) ≈ 1.2676536759$, and $E(7.5) ≈ 2.1215732071$. +Para $x ≥ 1$, considere $E(x)$ como o número esperado de vezes que Jeff repetirá o procedimento acima com $F = \frac{1}{x}$. Pode-se verificar que $E(1) = 1$, $E(2) ≈ 1,2676536759$, e $E(7,5) ≈ 2,1215732071$. -Find $E(40)$ rounded to 10 decimal places behind the decimal point. +Encontre $E(40)$ arredondado para 10 casas decimais depois da vírgula. # --hints-- -`eatingPie()` should return `3.2370342194`. +`eatingPie()` deve retornar `3.2370342194`. ```js assert.strictEqual(eatingPie(), 3.2370342194); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-395-pythagorean-tree.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-395-pythagorean-tree.md index cff705c06fb..f16a751070f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-395-pythagorean-tree.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-395-pythagorean-tree.md @@ -1,6 +1,6 @@ --- id: 5900f4f71000cf542c51000a -title: 'Problem 395: Pythagorean tree' +title: 'Problema 395: Árvore de Pitágoras' challengeType: 1 forumTopicId: 302060 dashedName: problem-395-pythagorean-tree @@ -8,25 +8,25 @@ dashedName: problem-395-pythagorean-tree # --description-- -The Pythagorean tree is a fractal generated by the following procedure: +A árvore de Pitágoras é um fractal gerado pelo seguinte procedimento: -Start with a unit square. Then, calling one of the sides its base (in the animation, the bottom side is the base): +Comece com um quadrado unitário. Em seguida, chamando um dos lados de sua base (na animação, o lado inferior é a base): -1. Attach a right triangle to the side opposite the base, with the hypotenuse coinciding with that side and with the sides in a 3-4-5 ratio. Note that the smaller side of the triangle must be on the 'right' side with respect to the base (see animation). -2. Attach a square to each leg of the right triangle, with one of its sides coinciding with that leg. -3. Repeat this procedure for both squares, considering as their bases the sides touching the triangle. +1. Conecte um triângulo retângulo ao lado oposto da base, com a hipotenusa coincidindo com aquele lado e com os lados em uma relação de 3-4-5. Observe que o lado menor do triângulo deve estar no lado direito em relação à base (ver animação). +2. Anexe um quadrado a cada cateto do triângulo reto, com um de seus lados coincidindo com aquele cateto. +3. Repita este procedimento para ambos os quadrados, considerando que as suas bases tocam o triângulo. -The resulting figure, after an infinite number of iterations, is the Pythagorean tree. +A figura resultante, após um número infinito de iterações, é a árvore de Pitágoras. -animation showing 8 iterations of the procedure +animação mostrando 8 iterações do procedimento -It can be shown that there exists at least one rectangle, whose sides are parallel to the largest square of the Pythagorean tree, which encloses the Pythagorean tree completely. +É possível mostrar que existe pelo menos um retângulo, cujos lados são paralelos ao quadrado maior da árvore de Pitágoras, e que envolve a árvore completamente. -Find the smallest area possible for such a bounding rectangle, and give your answer rounded to 10 decimal places. +Encontre a menor área possível para esse triângulo limitador, dando sua resposta arredondada para 10 casas decimais. # --hints-- -`pythagoreanTree()` should return `28.2453753155`. +`pythagoreanTree()` deve retornar `28.2453753155`. ```js assert.strictEqual(pythagoreanTree(), 28.2453753155); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-396-weak-goodstein-sequence.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-396-weak-goodstein-sequence.md index 33d738c128b..087b969f187 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-396-weak-goodstein-sequence.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-396-weak-goodstein-sequence.md @@ -1,6 +1,6 @@ --- id: 5900f4f81000cf542c51000b -title: 'Problem 396: Weak Goodstein sequence' +title: 'Problema 396: Sequência fraca de Goodstein' challengeType: 1 forumTopicId: 302061 dashedName: problem-396-weak-goodstein-sequence @@ -8,35 +8,35 @@ dashedName: problem-396-weak-goodstein-sequence # --description-- -For any positive integer $n$, the $n$th weak Goodstein sequence $\\{g1, g2, g3, \ldots\\}$ is defined as: +Para qualquer número inteiro positivo $n$, a $n$ª sequência fraca de Goodstein $\\{g1, g2, g3, \ldots\\}$ é definida como: - $g_1 = n$ -- for $k > 1$, $g_k$ is obtained by writing $g_{k - 1}$ in base $k$, interpreting it as a base $k + 1$ number, and subtracting 1. +- para $k > 1$, $g_k$ é obtido escrevendo $g_{k - 1}$ na base $k$, interpretando-a como uma base de número $k + 1$, e subtraindo 1. -The sequence terminates when $g_k$ becomes 0. +A sequência termina quando $g_k$ passa a ser 0. -For example, the $6$th weak Goodstein sequence is $\\{6, 11, 17, 25, \ldots\\}$: +Por exemplo, a $6$ª sequência fraca de Goodstein é $\\{6, 11, 17, 25, \ldots\\}$: - $g_1 = 6$. -- $g_2 = 11$ since $6 = 110_2$, $110_3 = 12$, and $12 - 1 = 11$. -- $g_3 = 17$ since $11 = 102_3$, $102_4 = 18$, and $18 - 1 = 17$. -- $g_4 = 25$ since $17 = 101_4$, $101_5 = 26$, and $26 - 1 = 25$. +- $g_2 = 11$, já que $6 = 110_2$, $110_3 = 12$ e $12 - 1 = 11$. +- $g_3 = 17$, já que $11 = 102_3$, $102_4 = 18$ e $18 - 1 = 17$. +- $g_4 = 25$, já que $17 = 101_4$, $101_5 = 26$ e $26 - 1 = 25$. -and so on. +e assim por diante. -It can be shown that every weak Goodstein sequence terminates. +Pode-se mostrar que toda a sequência fraca de Goodstein termina. -Let $G(n)$ be the number of nonzero elements in the $n$th weak Goodstein sequence. +Considere $G(n)$ como o número de elementos diferentes de zero na $n$ª sequência fraca de Goodstein. -It can be verified that $G(2) = 3$, $G(4) = 21$ and $G(6) = 381$. +Pode-se verificar que $G(2) = 3$, $G(4) = 21$ e $G(6) = 381$. -It can also be verified that $\sum G(n) = 2517$ for $1 ≤ n < 8$. +Também é possível verificar que $\sum G(n) = 2517$ para $1 ≤ n < 8$. -Find the last 9 digits of $\sum G(n)$ for $1 ≤ n < 16$. +Encontre os últimos 9 algarismos de $\sum G(n)$ para $1 ≤ n < 16$. # --hints-- -`weakGoodsteinSequence()` should return `173214653`. +`weakGoodsteinSequence()` deve retornar `173214653`. ```js assert.strictEqual(weakGoodsteinSequence(), 173214653); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-397-triangle-on-parabola.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-397-triangle-on-parabola.md index 2d9fc181db3..5042b883f22 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-397-triangle-on-parabola.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-397-triangle-on-parabola.md @@ -1,6 +1,6 @@ --- id: 5900f4f91000cf542c51000c -title: 'Problem 397: Triangle on parabola' +title: 'Problema 397: Triângulo na parábola' challengeType: 1 forumTopicId: 302062 dashedName: problem-397-triangle-on-parabola @@ -8,17 +8,17 @@ dashedName: problem-397-triangle-on-parabola # --description-- -On the parabola $y = \frac{x^2}{k}$, three points $A(a, \frac{a^2}{k})$, $B(b, \frac{b^2}{k})$ and $C(c, \frac{c^2}{k})$ are chosen. +Na parábola $y = \frac{x^2}{k}$, três pontos $A(a, \frac{a^2}{k})$, $B(b, \frac{b^2}{k})$ e $C(c, \frac{c^2}{k})$ são escolhidos. -Let $F(K, X)$ be the number of the integer quadruplets $(k, a, b, c)$ such that at least one angle of the triangle $ABC$ is 45°, with $1 ≤ k ≤ K$ and $-X ≤ a < b < c ≤ X$. +Considere que $F(K, X)$ é o número de quadras de inteiros $(k, a, b, c)$, de tal forma que pelo menos um ângulo do triângulo $ABC$ é 45°, com $1 ≤ k ≤ K$ e $-X ≤ a < b < c ≤ X$. -For example, $F(1, 10) = 41$ and $F(10, 100) = 12\\,492$. +Por exemplo, $F(1, 10) = 41$ e $F(10, 100) = 12.492$. -Find $F({10}^6, {10}^9)$. +Encontre $F({10}^6, {10}^9)$. # --hints-- -`triangleOnParabola()` should return `141630459461893730`. +`triangleOnParabola()` deve retornar `141630459461893730`. ```js assert.strictEqual(triangleOnParabola(), 141630459461893730); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-398-cutting-rope.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-398-cutting-rope.md index ade33707928..02b21a03344 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-398-cutting-rope.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-398-cutting-rope.md @@ -1,6 +1,6 @@ --- id: 5900f4fa1000cf542c51000d -title: 'Problem 398: Cutting rope' +title: 'Problema 398: Cortando cordas' challengeType: 1 forumTopicId: 302063 dashedName: problem-398-cutting-rope @@ -8,15 +8,15 @@ dashedName: problem-398-cutting-rope # --description-- -Inside a rope of length $n$, $n - 1$ points are placed with distance 1 from each other and from the endpoints. Among these points, we choose $m - 1$ points at random and cut the rope at these points to create $m$ segments. +Dentro de uma corda de comprimento $n$, $n - 1$ pontos são colocados com distância de 1 um do outro e das extremidades. Entre esses pontos, escolhemos $m - 1$ pontos aleatórios e cortamos as cordas nesses pontos para criar $m$ segmentos. -Let $E(n, m)$ be the expected length of the second-shortest segment. For example, $E(3, 2) = 2$ and $E(8, 3) = \frac{16}{7}$. Note that if multiple segments have the same shortest length the length of the second-shortest segment is defined as the same as the shortest length. +Considere $E(n, m)$ como o comprimento esperado do segundo segmento menor. Por exemplo, $E(3, 2) = 2$ e $E(8, 3) = \frac{16}{7}$. Observe que, se diversos segmentos tiverem o mesmo comprimento menor, o segundo segmento menor é definido como igual ao comprimento menor. -Find $E({10}^7, 100)$. Give your answer rounded to 5 decimal places behind the decimal point. +Encontre $E({10}^7, 100)$. Dê sua resposta arredondada para 5 casas depois da vírgula. # --hints-- -`cuttingRope()` should return `2010.59096`. +`cuttingRope()` deve retornar `2010.59096`. ```js assert.strictEqual(cuttingRope(), 2010.59096); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-399-squarefree-fibonacci-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-399-squarefree-fibonacci-numbers.md index 37a34ad1549..fb6e808f972 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-399-squarefree-fibonacci-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-399-squarefree-fibonacci-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f4fc1000cf542c51000e -title: 'Problem 399: Squarefree Fibonacci Numbers' +title: 'Problema 399: Números de Fibonacci livres de quadrados' challengeType: 1 forumTopicId: 302064 dashedName: problem-399-squarefree-fibonacci-numbers @@ -8,33 +8,33 @@ dashedName: problem-399-squarefree-fibonacci-numbers # --description-- -The first 15 fibonacci numbers are: +Os primeiros 15 números de Fibonacci são: $$1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.$$ -It can be seen that 8 and 144 are not squarefree: 8 is divisible by 4 and 144 is divisible by 4 and by 9. +É possível ver que 8 e 144 não são livres de quadrados: 8 é divisível por 4 e 144 é divisível por 4 e por 9. -So the first 13 squarefree fibonacci numbers are: +Assim, os 13 primeiros números de Fibonacci livres de quadrados são: -$$1,1,2,3,5,13,21,34,55,89,233,377 \text{ and } 610.$$ +$$1,1,2,3,5,13,21,34,55,89,233,377 \text{ e } 610.$$ -The $200$th squarefree fibonacci number is: 971183874599339129547649988289594072811608739584170445. The last sixteen digits of this number are: 1608739584170445 and in scientific notation this number can be written as `9.7e53`. +O $200$º número de Fibonacci livre de quadrados é: 971183874599339129547649988289594072811608739584170445. Os últimos dezesseis algarismos deste número são: 1608739584170445 e, em notação científica, este número pode ser escrito como `9.7e53`. -Find the $100\\,000\\,000$th squarefree fibonacci number. Give as your answer as a string with its last sixteen digits followed by a comma followed by the number in scientific notation (rounded to one digit after the decimal point). For the $200$th squarefree number the answer would have been: `1608739584170445,9.7e53` +Encontre o $100.000.000$º número de Fibonacci livre de quadrados. Dê sua resposta como uma string com os últimos dezesseis algarismos seguidos de uma vírgula e de um número em notação científica (arredondado para uma casa depois da vírgula). Para o $200$º número livre de quadrados, a resposta seria: `1608739584170445,9.7e53` -**Note:** For this problem, assume that for every prime $p$, the first fibonacci number divisible by $p$ is not divisible by $p^2$ (this is part of Wall's conjecture). This has been verified for primes $≤ 3 \times {10}^{15}$, but has not been proven in general. +**Observação:** para este problema, assumiremos que, para cada número primo $p$, o primeiro número de Fibonacci divisível por $p$ não é divisível por $p^2$ (isso é parte da conjectura de Wall). Isso já foi verificado para números primos $≤ 3 \times {10}^{15}$, mas ainda não foi comprovado em geral. -If it happens that the conjecture is false, then the accepted answer to this problem isn't guaranteed to be the $100\\,000\\,000$th squarefree fibonacci number, rather it represents only a lower bound for that number. +Se acontecer de a conjetura ser falsa, então a resposta aceita para este problema não é garantida para o $100.000.000$º número de Fibonacci livre de quadrados. Ao invés disso, representa apenas um limite menor para esse número. # --hints-- -`squarefreeFibonacciNumbers()` should return a string. +`squarefreeFibonacciNumbers()` deve retornar uma string. ```js assert(typeof squarefreeFibonacciNumbers() === 'string'); ``` -`squarefreeFibonacciNumbers()` should return the string `1508395636674243,6.5e27330467`. +`squarefreeFibonacciNumbers()` deve retornar a string `1508395636674243,6.5e27330467`. ```js assert.strictEqual(squarefreeFibonacciNumbers(), '1508395636674243,6.5e27330467'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-400-fibonacci-tree-game.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-400-fibonacci-tree-game.md index 2b2e220949c..dda7fd84c8d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-400-fibonacci-tree-game.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-301-to-400/problem-400-fibonacci-tree-game.md @@ -1,6 +1,6 @@ --- id: 5900f4fe1000cf542c510010 -title: 'Problem 400: Fibonacci tree game' +title: 'Problema 400: Jogo da árvore de Fibonacci' challengeType: 1 forumTopicId: 302067 dashedName: problem-400-fibonacci-tree-game @@ -8,27 +8,27 @@ dashedName: problem-400-fibonacci-tree-game # --description-- -A Fibonacci tree is a binary tree recursively defined as: +Uma árvore de Fibonacci é uma árvore binária recursivamente definida como: -- $T(0)$ is the empty tree. -- $T(1)$ is the binary tree with only one node. -- $T(k)$ consists of a root node that has $T(k - 1)$ and $T(k - 2)$ as children. +- $T(0)$ é a árvore vazia. +- $T(1)$ é a árvore binária com apenas um nó. +- $T(k)$ consiste em um nó raiz que tem $T(k - 1)$ e $T(k - 2)$ como filhos. -On such a tree two players play a take-away game. On each turn a player selects a node and removes that node along with the subtree rooted at that node. The player who is forced to take the root node of the entire tree loses. +Em uma árvore desse tipo, dois jogadores jogam um jogo de remoção de nós. Em cada turno, um jogador seleciona um nó e o remove, juntamente à subárvore que tem esse nó como raiz. O jogador que for forçado a pegar o nó raiz da árvore é o perdedor. -Here are the winning moves of the first player on the first turn for $T(k)$ from $k = 1$ to $k = 6$. +Aqui estão os movimentos vencedores para o primeiro jogador no primeiro movimento para $T(k)$ de $k = 1$ a $k = 6$. -winning moves of first player, on the first turn for k = 1 to k = 6 +movimentos vencedores do primeiro jogador, no primeiro movimento, para k = 1 a k = 6 -Let $f(k)$ be the number of winning moves of the first player (i.e. the moves for which the second player has no winning strategy) on the first turn of the game when this game is played on $T(k)$. +Considere $f(k)$ como o número de movimentos vencedores do primeiro jogador (ou seja, movimentos para os quais o segundo jogador não pode ter uma estratégia vencedora) no primeiro movimento desse jogo quando ele é jogado em $T(k)$. -For example, $f(5) = 1$ and $f(10) = 17$. +Por exemplo, $f(5) = 1$ e $f(10) = 17$. -Find $f(10000)$. Give the last 18 digits of your answer. +Encontre $f(10000)$. Dê os últimos 18 algarismos da sua resposta. # --hints-- -`fibonacciTreeGame()` should return `438505383468410600`. +`fibonacciTreeGame()` deve retornar `438505383468410600`. ```js assert.strictEqual(fibonacciTreeGame(), 438505383468410600); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-401-sum-of-squares-of-divisors.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-401-sum-of-squares-of-divisors.md index eb0c0459100..1fcb22c4d5e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-401-sum-of-squares-of-divisors.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-401-sum-of-squares-of-divisors.md @@ -1,6 +1,6 @@ --- id: 5900f4fd1000cf542c51000f -title: 'Problem 401: Sum of squares of divisors' +title: 'Problema 401: Soma dos quadrados dos divisores' challengeType: 1 forumTopicId: 302069 dashedName: problem-401-sum-of-squares-of-divisors @@ -8,19 +8,19 @@ dashedName: problem-401-sum-of-squares-of-divisors # --description-- -The divisors of 6 are 1, 2, 3 and 6. +Os divisores de 6 são: 1, 2, 3 e 6. -The sum of the squares of these numbers is $1 + 4 + 9 + 36 = 50$. +A soma dos quadrados desses números é $1 + 4 + 9 + 36 = 50$. -Let $\sigma_2(n)$ represent the sum of the squares of the divisors of $n$. Thus $\sigma_2(6) = 50$. +Considere $\sigma_2(n)$ como representante da soma dos quadrados dos divisores de $n$. Assim, $\sigma_2(6) = 50$. -Let $\Sigma_2$ represent the summatory function of $\sigma_2$, that is $\Sigma_2(n) = \sum \sigma_2(i)$ for $i=1$ to $n$. The first 6 values of $\Sigma_2$ are: 1, 6, 16, 37, 63 and 113. +Considere $\Sigma_2$ como representando a função somatória de $\sigma_2$, ou seja, $\Sigma_2(n) = \sum \sigma_2(i)$ para $i=1$ a $n$. Os primeiros 6 valores de $\Sigma_2$ são: 1, 6, 16, 37, 63 e 113. -Find $\Sigma_2({10}^{15})$ modulo ${10}^9$. +Encontre $\Sigma_2({10}^{15})$ modulo ${10}^9$. # --hints-- -`sumOfSquaresDivisors()` should return `281632621`. +`sumOfSquaresDivisors()` deve retornar `281632621`. ```js assert.strictEqual(sumOfSquaresDivisors(), 281632621); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-402-integer-valued-polynomials.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-402-integer-valued-polynomials.md index cdda26ea631..39ed3ec73b4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-402-integer-valued-polynomials.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-402-integer-valued-polynomials.md @@ -1,6 +1,6 @@ --- id: 5900f4ff1000cf542c510011 -title: 'Problem 402: Integer-valued polynomials' +title: 'Problema 402: Polinômios com valores inteiros' challengeType: 1 forumTopicId: 302070 dashedName: problem-402-integer-valued-polynomials @@ -8,24 +8,24 @@ dashedName: problem-402-integer-valued-polynomials # --description-- -It can be shown that the polynomial $n^4 + 4n^3 + 2n^2 + 5n$ is a multiple of 6 for every integer $n$. It can also be shown that 6 is the largest integer satisfying this property. +Pode-se demonstrar que o polinômio $n^4 + 4n^3 + 2n^2 + 5n$ é um múltiplo de 6 para qualquer número inteiro $n$. Também é possível demonstrar que 6 é o maior número inteiro que satisfaz esta propriedade. -Define $M(a, b, c)$ as the maximum $m$ such that $n^4 + an^3 + bn^2 + cn$ is a multiple of $m$ for all integers $n$. For example, $M(4, 2, 5) = 6$. +Defina $M(a, b, c)$ como o $m$ máximo, tal que $n^4 + an^3 + bn^2 + cn$ seja um múltiplo de $m$ para todos os números inteiros $n$. Por exemplo, $M(4, 2, 5) = 6$. -Also, define $S(N)$ as the sum of $M(a, b, c)$ for all $0 < a, b, c ≤ N$. +Além disso, defina $S(N)$ como a soma de $M(a, b, c)$ para todo $0 < a, b, c ≤ N$. -We can verify that $S(10) = 1\\,972$ and $S(10\\,000) = 2\\,024\\,258\\,331\\,114$. +Podemos verificar que $S(10) = 1.972$ e $S(10.000) = 2.024.258.331.114$. -Let $F_k$ be the Fibonacci sequence: +Considere $F_k$ como a sequência de Fibonacci: -- $F_0 = 0$, $F_1 = 1$ and -- $F_k = F_{k - 1} + F_{k - 2}$ for $k ≥ 2$. +- $F_0 = 0$, $F_1 = 1$ e +- $F_k = F_{k - 1} + F_{k - 2}$ para $k ≥ 2$. -Find the last 9 digits of $\sum S(F_k)$ for $2 ≤ k ≤ 1\\,234\\,567\\,890\\,123$. +Encontre os últimos 9 algarismos de $\sum S(F_k)$ para $2 ≤ k ≤ 1.234.567.890.123$. # --hints-- -`integerValuedPolynomials()` should return `356019862`. +`integerValuedPolynomials()` deve retornar `356019862`. ```js assert.strictEqual(integerValuedPolynomials(), 356019862); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-403-lattice-points-enclosed-by-parabola-and-line.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-403-lattice-points-enclosed-by-parabola-and-line.md index e3f8bfaae35..6fc279f0334 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-403-lattice-points-enclosed-by-parabola-and-line.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-403-lattice-points-enclosed-by-parabola-and-line.md @@ -1,6 +1,6 @@ --- id: 5900f5001000cf542c510013 -title: 'Problem 403: Lattice points enclosed by parabola and line' +title: 'Problema 403: Pontos da rede contidos por uma parábola e linha' challengeType: 1 forumTopicId: 302071 dashedName: problem-403-lattice-points-enclosed-by-parabola-and-line @@ -8,19 +8,19 @@ dashedName: problem-403-lattice-points-enclosed-by-parabola-and-line # --description-- -For integers $a$ and $b$, we define $D(a, b)$ as the domain enclosed by the parabola $y = x^2$ and the line $y = ax + b: D(a, b) = \\{ (x, y) | x^2 ≤ y ≤ ax + b \\}$. +Para os números inteiros $a$ e $b$, definimos $D(a, b)$ como o domínio cercado pela parábola $y = x^2$ e pela linha $y = ax + b: D(a, b) = \\{ (x, y) | x^2 ≤ y ≤ ax + b \\}$. -$L(a, b)$ is defined as the number of lattice points contained in $D(a, b)$. For example, $L(1, 2) = 8$ and $L(2, -1) = 1$. +$L(a, b)$ é definido como o número de pontos da rede contidos em $D(a, b)$. Por exemplo, $L(1, 2) = 8$ e $L(2, -1) = 1$. -We also define $S(N)$ as the sum of $L(a, b)$ for all the pairs ($a$, $b$) such that the area of $D(a, b)$ is a rational number and $|a|,|b| ≤ N$. +Também definimos $S(N)$ como a soma de $L(a, b)$ para todos os pares ($a$, $b$), tal que a área de $D(a, b)$ é um número racional e $|a|,|b| ≤ N$. -We can verify that $S(5) = 344$ and $S(100) = 26\\,709\\,528$. +Podemos verificar que $S(5) = 344$ e que $S(100) = 26.709.528$. -Find $S({10}^{12})$. Give your answer $\bmod {10}^8$. +Encontre $S({10}^{12})$. Dê sua resposta $\bmod {10}^8$. # --hints-- -`latticePoints()` should return `18224771`. +`latticePoints()` deve retornar `18224771`. ```js assert.strictEqual(latticePoints(), 18224771); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-405-a-rectangular-tiling.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-405-a-rectangular-tiling.md index 43ceb097a66..38eba7e44ce 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-405-a-rectangular-tiling.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-405-a-rectangular-tiling.md @@ -1,6 +1,6 @@ --- id: 5900f5021000cf542c510014 -title: 'Problem 405: A rectangular tiling' +title: 'Problema 405: Colocação retangular de ladrilhos' challengeType: 1 forumTopicId: 302073 dashedName: problem-405-a-rectangular-tiling @@ -8,25 +8,25 @@ dashedName: problem-405-a-rectangular-tiling # --description-- -We wish to tile a rectangle whose length is twice its width. +Queremos preencher com ladrilhos um retângulo cujo comprimento é o dobro de sua largura. -Let $T(0)$ be the tiling consisting of a single rectangle. +Considere $T(0)$ como a área a ser ladrilhada, consistindo em um único retângulo. -For $n > 0$, let $T(n)$ be obtained from $T( n- 1)$ by replacing all tiles in the following manner: +Para $n > 0$, considere $T(n)$ como tendo sido obtido a partir de $T( n- 1)$ substituindo todos os ladrilhos da seguinte maneira: -obtaining T(n) from T(n - 1) +obtendo T(n) a partir de T(n - 1) -The following animation demonstrates the tilings $T(n)$ for $n$ from 0 to 5: +A animação a seguir demonstra o preenchimento com ladrilhos de $T(n)$ para $n$ de 0 a 5: -animation with tilings T(n) for n from 0 to 5 +animação do ladrilhamento de T(n) para n de 0 a 5 -Let $f(n)$ be the number of points where four tiles meet in $T(n)$. For example, $f(1) = 0$, $f(4) = 82$ and $f({10}^9)\bmod {17}^7 = 126\\,897\\,180$. +Considere $f(n)$ como o número de pontos em que quatro ladrilhos se encontram em $T(n)$. Por exemplo, $f(1) = 0$, $f(4) = 82$ e $f({10}^9)\bmod {17}^7 = 126.897.180$. -Find $f({10}^k)$ for $k = {10}^{18}$, give your answer modulo ${17}^7$. +Encontre $f({10}^k)$ para $k = {10}^{18}$ e dê sua resposta modulo ${17}^7$. # --hints-- -`rectangularTiling()` should return `237696125`. +`rectangularTiling()` deve retornar `237696125`. ```js assert.strictEqual(rectangularTiling(), 237696125); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-406-guessing-game.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-406-guessing-game.md index 6907ad6dae2..50d3fc19686 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-406-guessing-game.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-406-guessing-game.md @@ -1,6 +1,6 @@ --- id: 5900f5021000cf542c510015 -title: 'Problem 406: Guessing Game' +title: 'Problema 406: Jogo de adivinhação' challengeType: 1 forumTopicId: 302074 dashedName: problem-406-guessing-game @@ -8,41 +8,41 @@ dashedName: problem-406-guessing-game # --description-- -We are trying to find a hidden number selected from the set of integers {1, 2, ..., $n$} by asking questions. Each number (question) we ask, we get one of three possible answers: +Estamos tentando encontrar um número oculto selecionado de um conjunto de números inteiros {1, 2, ..., $n$} fazendo perguntas. Cada número (pergunta) que perguntamos, recebemos uma das três possíveis respostas: -- "Your guess is lower than the hidden number" (and you incur a cost of a), or -- "Your guess is higher than the hidden number" (and you incur a cost of b), or -- "Yes, that's it!" (and the game ends). +- "Seu palpite é menor que o número oculto" (e você tem um custo de a) ou +- "Seu palpite é maior que o número oculto" (e você tem um custo de b), ou +- "Sim, é esse!" (e o jogo acaba). -Given the value of $n$, $a$, and $b$, an optimal strategy minimizes the total cost for the worst possible case. +Dado o valor de $n$, $a$, e $b$, uma estratégia ideal minimiza o custo total para o pior caso possível. -For example, if $n = 5$, $a = 2$, and $b = 3$, then we may begin by asking "2" as our first question. +Por exemplo, se $n = 5$, $a = 2$, e $b = 3$, podemos começar perguntando "2" como a nossa primeira pergunta. -If we are told that 2 is higher than the hidden number (for a cost of $b = 3$), then we are sure that "1" is the hidden number (for a total cost of 3). +Se nos disserem que 2 é maior que o número oculto (para um custo de $b = 3$), então temos certeza de que "1" é o número oculto (para um custo total de 3). -If we are told that 2 is lower than the hidden number (for a cost of $a = 2$), then our next question will be "4". +Se nos for dito que 2 é menor que o número oculto (para um custo de $a = 2$), então nossa próxima pergunta será "4". -If we are told that 4 is higher than the hidden number (for a cost of $b = 3$), then we are sure that "3" is the hidden number (for a total cost of $2 + 3 = \color{blue}{\mathbf{5}}$). +Se nos for dito que 4 é maior que o número oculto (para um custo de $b = 3$), então temos certeza de que "3" é o número oculto (para um custo total de $2 + 3 = \color{blue}{\mathbf{5}}$). -If we are told that 4 is lower than the hidden number (for a cost of $a = 2$), then we are sure that "5" is the hidden number (for a total cost of $2 + 2 = \color{blue}{\mathbf{4}}$). +Se nos for dito que 4 é menor que o número oculto (para um custo de $a = 2$), então temos a certeza de que "5" é o número oculto (para um custo total de $2 + 2 = \cor{blue}{\mathbf{4}}$). -Thus, the worst-case cost achieved by this strategy is 5. It can also be shown that this is the lowest worst-case cost that can be achieved. So, in fact, we have just described an optimal strategy for the given values of $n$, $a$, and $b$. +Assim, o pior custo de caso alcançado por esta estratégia é 5. Também se pode demonstrar que este é o pior custo possível que pode ser alcançado. Então, de fato, acabamos de descrever uma estratégia ideal para os valores indicados de $n$, $a$ e $b$. -Let $C(n, a, b)$ be the worst-case cost achieved by an optimal strategy for the given values of $n$, $a$, and $b$. +Considere $C(n, a, b)$ como o pior caso de custo obtido por uma estratégia ideal para os valores dados de $n$, $a$ e $b$. -Here are a few examples: +Aqui estão alguns exemplos: $$\begin{align} & C(5, 2, 3) = 5 \\\\ - & C(500, \sqrt{2}, \sqrt{3}) = 13.220\\,731\\,97\ldots \\\\ & C(20\\,000, 5, 7) = 82 \\\\ - & C(2\\,000\\,000, √5, √7) = 49.637\\,559\\,55\ldots \\\\ \end{align}$$ + & C(500, \sqrt{2}, \sqrt{3}) = 13.220\\,731\\,97\ldots \\\\ & C(20.000, 5, 7) = 82 \\\\ + & C(2.000.000, √5, √7) = 49.637\\,559\\,55\ldots \\\\ \end{align}$$ -Let $F_k$ be the Fibonacci numbers: $F_k = F_{k - 1} + F_{k - 2}$ with base cases $F_1 = F_2 = 1$. +Considere $F_k$ como sendo os números de Fibonacci: $F_k = F_{k - 1} + F_{k - 2}$ com casos base $F_1 = F_2 = 1$. -Find $\displaystyle\sum_{k = 1}^{30} C({10}^{12}, \sqrt{k}, \sqrt{F_k})$, and give your answer rounded to 8 decimal places behind the decimal point. +Encontre $\displaystyle\sum_{k = 1}^{30} C({10}^{12}, \sqrt{k}, \sqrt{F_k})$ e dê sua resposta arredondada para 8 casas decimais após o ponto decimal. # --hints-- -`guessingGame()` should return `36813.12757207`. +`guessingGame()` deve retornar `36813.12757207`. ```js assert.strictEqual(guessingGame(), 36813.12757207); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-407-idempotents.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-407-idempotents.md index f676b0c5b6e..cefb1c9d29d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-407-idempotents.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-407-idempotents.md @@ -1,6 +1,6 @@ --- id: 5900f5041000cf542c510016 -title: 'Problem 407: Idempotents' +title: 'Problema 407: Idempotentes' challengeType: 1 forumTopicId: 302075 dashedName: problem-407-idempotents @@ -8,17 +8,17 @@ dashedName: problem-407-idempotents # --description-- -If we calculate $a^2\bmod 6$ for $0 ≤ a ≤ 5$ we get: 0, 1, 4, 3, 4, 1. +Se calcularmos $a^2\bmod 6$ para $0 ≤ a ≤ 5$, obtemos: 0, 1, 4, 3, 4, 1. -The largest value of a such that $a^2 ≡ a\bmod 6$ is $4$. +O maior valor do tipo, tal que $a^2 ≡ a\bmod 6$ é $4$. -Let's call $M(n)$ the largest value of $a < n$ such that $a^2 ≡ a (\text{mod } n)$. So $M(6) = 4$. +Chamaremos $M(n)$ de o maior valor de $a < n$, tal que $a^2 ≡ a (\text{mod } n)$. Assim, $M(6) = 4$. -Find $\sum M(n)$ for $1 ≤ n ≤ {10}^7$. +Encontre $\sum M(n)$ para $1 ≤ n ≤ {10}^7$. # --hints-- -`idempotents()` should return `39782849136421`. +`idempotents()` deve retornar `39782849136421`. ```js assert.strictEqual(idempotents(), 39782849136421); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-408-admissible-paths-through-a-grid.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-408-admissible-paths-through-a-grid.md index 260a1917a56..b1943398f2d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-408-admissible-paths-through-a-grid.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-408-admissible-paths-through-a-grid.md @@ -1,6 +1,6 @@ --- id: 5900f5091000cf542c51001b -title: 'Problem 408: Admissible paths through a grid' +title: 'Problema 408: Caminhos admissíveis através de uma grade' challengeType: 1 forumTopicId: 302076 dashedName: problem-408-admissible-paths-through-a-grid @@ -8,19 +8,19 @@ dashedName: problem-408-admissible-paths-through-a-grid # --description-- -Let's call a lattice point ($x$, $y$) inadmissible if $x$, $y$ and $x + y$ are all positive perfect squares. +Vamos chamar um ponto da rede ($x$, $y$) de inadmissível se $x$, $y$ e $x + y$ forem todos quadrados positivos perfeitos. -For example, (9, 16) is inadmissible, while (0, 4), (3, 1) and (9, 4) are not. +Por exemplo, (9, 16) é inadmissível, mas (0, 4), (3, 1) e (9, 4) não são. -Consider a path from point ($x_1$, $y_1$) to point ($x_2$, $y_2$) using only unit steps north or east. Let's call such a path admissible if none of its intermediate points are inadmissible. +Considere um caminho do ponto ($x_1$, $y_1$) ao ponto ($x_2$, $y_2$) usando apenas movimentos unitários para o norte e para o leste. Chamaremos esse caminho de admissível se nenhum de seus pontos intermediários for inadmissível. -Let $P(n)$ be the number of admissible paths from (0, 0) to ($n$, $n$). It can be verified that $P(5) = 252$, $P(16) = 596\\,994\\,440$ and $P(1\\,000)\bmod 1\\,000\\,000\\,007 = 341\\,920\\,854$. +Considere $P(n)$ como o número de caminhos admissíveis de (0, 0) a ($n$, $n$). Pode-se verificar que $P(5) = 252$, $P(16) = 596.994.440$ e $P(1.000)\bmod 1.000.000.007 = 341.920.854$. -Find $P(10\\,000\\,000)\bmod 1\\,000\\,000\\,007$. +Encontre $P(10.000.000)\bmod 1.000.000.007$. # --hints-- -`admissiblePaths()` should return `299742733`. +`admissiblePaths()` deve retornar `299742733`. ```js assert.strictEqual(admissiblePaths(), 299742733); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-409-nim-extreme.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-409-nim-extreme.md index 735a1c77781..a0870890d11 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-409-nim-extreme.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-409-nim-extreme.md @@ -1,6 +1,6 @@ --- id: 5900f5061000cf542c510017 -title: 'Problem 409: Nim Extreme' +title: 'Problema 409: Nim extremos' challengeType: 1 forumTopicId: 302077 dashedName: problem-409-nim-extreme @@ -8,21 +8,21 @@ dashedName: problem-409-nim-extreme # --description-- -Let $n$ be a positive integer. Consider nim positions where: +Considere $n$ um inteiro positivo. Considere as posições nim onde: -- There are $n$ non-empty piles. -- Each pile has size less than $2^n$. -- No two piles have the same size. +- Não existam $n$ pilhas não vazias. +- Cada pilha tenha um tamanho inferior a $2^n$. +- Não haja duas pilhas com o mesmo tamanho. -Let $W(n)$ be the number of winning nim positions satisfying the above conditions (a position is winning if the first player has a winning strategy). +Considere $W(n)$ como o número de posições nim vencedoras que satisfazem as condições acima (uma posição é vencedora se o primeiro jogador tiver uma estratégia vencedora). -For example, $W(1) = 1$, $W(2) = 6$, $W(3) = 168$, $W(5) = 19\\,764\\,360$ and $W(100)\bmod 1\\,000\\,000\\,007 = 384\\,777\\,056$. +Por exemplo, $W(1) = 1$, $W(2) = 6$, $W(3) = 168$, $W(5) = 19.764.360$ e $W(100)\bmod 1.000.000.007 = 384.777.056$. -Find $W(10\\,000\\,000)\bmod 1\\,000\\,000\\,007$. +Encontre $W(10.000.000)\bmod 1.000.000.007$. # --hints-- -`nimExtreme()` should return `253223948`. +`nimExtreme()` deve retornar `253223948`. ```js assert.strictEqual(nimExtreme(), 253223948); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-410-circle-and-tangent-line.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-410-circle-and-tangent-line.md index fd9d28a1bab..9676b4dfc0e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-410-circle-and-tangent-line.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-410-circle-and-tangent-line.md @@ -1,6 +1,6 @@ --- id: 5900f5071000cf542c510018 -title: 'Problem 410: Circle and tangent line' +title: 'Problema 410: Círculo e linha tangente' challengeType: 1 forumTopicId: 302079 dashedName: problem-410-circle-and-tangent-line @@ -8,19 +8,19 @@ dashedName: problem-410-circle-and-tangent-line # --description-- -Let $C$ be the circle with radius $r$, $x^2 + y^2 = r^2$. We choose two points $P(a, b)$ and $Q(-a, c)$ so that the line passing through $P$ and $Q$ is tangent to $C$. +Considere $C$ como o círculo de raio $r$, $x^2 + y^2 = r^2$. Selecionamos dois pontos $P(a, b)$ e $Q(-a, c)$, tal que a linha passando por $P$ e $Q$ seja tangente a $C$. -For example, the quadruplet $(r, a, b, c) = (2, 6, 2, -7)$ satisfies this property. +Por exemplo, o quarteto $(r, a, b, c) = (2, 6, 2, -7)$ satisfaz essa propriedade. -Let $F(R, X)$ be the number of the integer quadruplets $(r, a, b, c)$ with this property, and with $0 < r ≤ R$ and $0 < a ≤ X$. +Considere $F(R, X)$ como o número de quartetos de números inteiros $(r, a, b, c)$ com essa propriedade e com $0 < r ≤ R$ e $0 < a ≤ X$. -We can verify that $F(1, 5) = 10$, $F(2, 10) = 52$ and $F(10, 100) = 3384$. +Podemos verificar que $F(1, 5) = 10$, $F(2, 10) = 52$ e $F(10, 100) = 3384$. -Find $F({10}^8, {10}^9) + F({10}^9, {10}^8)$. +Encontre $F({10}^8, {10}^9) + F({10}^9, {10}^8)$. # --hints-- -`circleAndTangentLine()` should return `799999783589946600`. +`circleAndTangentLine()` deve retornar `799999783589946600`. ```js assert.strictEqual(circleAndTangentLine(), 799999783589946600); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-411-uphill-paths.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-411-uphill-paths.md index 09ace26cdea..ca52b3e7317 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-411-uphill-paths.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-411-uphill-paths.md @@ -1,6 +1,6 @@ --- id: 5900f5081000cf542c510019 -title: 'Problem 411: Uphill paths' +title: 'Problema 411: Caminhos ladeira acima' challengeType: 1 forumTopicId: 302080 dashedName: problem-411-uphill-paths @@ -8,23 +8,23 @@ dashedName: problem-411-uphill-paths # --description-- -Let $n$ be a positive integer. Suppose there are stations at the coordinates $(x, y) = (2^i\bmod n, 3^i\bmod n)$ for $0 ≤ i ≤ 2n$. We will consider stations with the same coordinates as the same station. +Considere $n$ um inteiro positivo. Suponha que haja estações nas coordenadas $(x, y) = (2^i\bmod n, 3^i\bmod n)$ para $0 ≤ i ≤ 2n$. Consideraremos estações com as mesmas coordenadas que a mesma estação. -We wish to form a path from (0, 0) to ($n$, $n$) such that the $x$ and $y$ coordinates never decrease. +Queremos formar um caminho de (0, 0) a ($n$, $n$) de modo que as coordenadas $x$ e $y$ nunca diminuam. -Let $S(n)$ be the maximum number of stations such a path can pass through. +Considere $S(n)$ como o número máximo de estações pelas quais um caminho pode passar. -For example, if $n = 22$, there are 11 distinct stations, and a valid path can pass through at most 5 stations. Therefore, $S(22) = 5$. The case is illustrated below, with an example of an optimal path: +Por exemplo, se $n = 22$, existem 11 estações distintas. Um caminho válido pode passar por, no máximo, 5 estações. Portanto, $S(22) = 5$. O caso é ilustrado abaixo, com um exemplo de caminho ideal: -valid path passing through 5 stations, for n = 22, with 11 distinct stations +caminho válido passando por 5 estações, para n = 22, com 11 estações distintas -It can also be verified that $S(123) = 14$ and $S(10\\,000) = 48$. +Também pode ser verificado que $S(123) = 14$ e $S(10.000) = 48$. -Find $\sum S(k^5)$ for $1 ≤ k ≤ 30$. +Encontre a $\sum S(k^5)$ para $1 ≤ k ≤ 30$. # --hints-- -`uphillPaths()` should return `9936352`. +`uphillPaths()` deve retornar `9936352`. ```js assert.strictEqual(uphillPaths(), 9936352); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-412-gnomon-numbering.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-412-gnomon-numbering.md index ac00f985c10..1ee87a2baab 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-412-gnomon-numbering.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-412-gnomon-numbering.md @@ -1,6 +1,6 @@ --- id: 5900f5081000cf542c51001a -title: 'Problem 412: Gnomon numbering' +title: 'Problema 412: Númeração de Gnomon' challengeType: 1 forumTopicId: 302081 dashedName: problem-412-gnomon-numbering @@ -8,25 +8,25 @@ dashedName: problem-412-gnomon-numbering # --description-- -For integers $m$, $n$ ($0 ≤ n < m$), let $L(m, n)$ be an $m×m$ grid with the top-right $n×n$ grid removed. +Para números inteiros $m$, $n$ ($0 ≤ n < m$), considere $L(m, n)$ como uma grade $m×m$ com a parte superior direita $n×n$ da grade removida. -For example, $L(5, 3)$ looks like this: +Por exemplo, $L(5, 3)$ terá essa aparência: -5x5 grid, with removed 3x3 grid from the top-right +grade 5x5, com a grade 3x3 do canto superior direito removida -We want to number each cell of $L(m, n)$ with consecutive integers 1, 2, 3, ... such that the number in every cell is smaller than the number below it and to the left of it. +Queremos numerar cada célula de $L(m, n)$ com números inteiros consecutivos 1, 2, 3, ... tal que o número em cada célula seja menor que o número abaixo e à esquerda dele. -For example, here are two valid numberings of $L(5, 3)$: +Por exemplo, aqui temos duas numerações válidas de $L(5, 3)$: -two valid numberings of L(5, 3) +duas numerações válidas de L(5, 3) -Let $LC(m, n)$ be the number of valid numberings of $L(m, n)$. It can be verified that $LC(3, 0) = 42$, $LC(5, 3) = 250\\,250$, $LC(6, 3) = 406\\,029\\,023\\,400$ and $LC(10, 5)\bmod 76\\,543\\,217 = 61\\,251\\,715$. +Considere $LC(m, n)$ como a quantidade de numerações válidas de $L(m, n)$. Pode-se verificar que $LC(3, 0) = 42$, $LC(5, 3) = 250.250$, $LC(6, 3) = 406.029.023.400$ e $LC(10, 5)\bmod 76.543.217 = 61.251.715$. -Find $LC(10\\,000, 5\\,000)\bmod 76\\,543\\,217$. +Encontre $LC(10.000, 5.000)\bmod 76.543.217$. # --hints-- -`gnomonNumbering()` should return `38788800`. +`gnomonNumbering()` deve retornar `38788800`. ```js assert.strictEqual(gnomonNumbering(), 38788800); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-413-one-child-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-413-one-child-numbers.md index 0a50da9e14d..2ff7f78e5f4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-413-one-child-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-413-one-child-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f50a1000cf542c51001c -title: 'Problem 413: One-child Numbers' +title: 'Problema 413: Números com um filho' challengeType: 1 forumTopicId: 302082 dashedName: problem-413-one-child-numbers @@ -8,19 +8,19 @@ dashedName: problem-413-one-child-numbers # --description-- -We say that a $d$-digit positive number (no leading zeros) is a one-child number if exactly one of its sub-strings is divisible by $d$. +Dizemos que um número positivo de $d$ algarismos (sem zeros à esquerda) é um número com um filho se exatamente uma de suas substrings for divisível por $d$. -For example, 5671 is a 4-digit one-child number. Among all its sub-strings 5, 6, 7, 1, 56, 67, 71, 567, 671 and 5671, only 56 is divisible by 4. +Por exemplo, 5671 é um número com um filho de 4 algarismos. Entre todas as suas substrings 5, 6, 7, 1, 56, 67, 71, 567, 671 e 5671, apenas 56 é divisível por 4. -Similarly, 104 is a 3-digit one-child number because only 0 is divisible by 3. 1132451 is a 7-digit one-child number because only 245 is divisible by 7. +Da mesma forma, 104 é um número com um filho de 3 algarismos, pois apenas 0 é divisível por 3. 1132451 é um número com um filho de 7 algarismos, pois apenas 245 é divisível por 7. -Let $F(N)$ be the number of the one-child numbers less than $N$. We can verify that $F(10) = 9$, $F({10}^3) = 389$ and $F({10}^7) = 277\\,674$. +Considere $F(N)$ como a quantidade de números com um filho inferiores a $N$. Podemos verificar que $F(10) = 9$, $F({10}^3) = 389$ e $F({10}^7) = 277.674$. -Find $F({10}^{19})$. +Encontre $F({10}^{19})$. # --hints-- -`oneChildNumbers()` should return `3079418648040719`. +`oneChildNumbers()` deve retornar `3079418648040719`. ```js assert.strictEqual(oneChildNumbers(), 3079418648040719); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-414-kaprekar-constant.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-414-kaprekar-constant.md index e50ab2c9a7e..5e91f237f74 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-414-kaprekar-constant.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-414-kaprekar-constant.md @@ -1,6 +1,6 @@ --- id: 5900f50b1000cf542c51001d -title: 'Problem 414: Kaprekar constant' +title: 'Problema 414: Constante de Kaprekar' challengeType: 1 forumTopicId: 302083 dashedName: problem-414-kaprekar-constant @@ -8,37 +8,37 @@ dashedName: problem-414-kaprekar-constant # --description-- -6174 is a remarkable number; if we sort its digits in increasing order and subtract that number from the number you get when you sort the digits in decreasing order, we get $7641 - 1467 = 6174$. +6174 é um número incrível. Se ordenarmos seus algarismos em ordem crescente e subtrairmos esse número do número obtido ao ordenar os algarismos em ordem decrescente, temos $7641 - 1467 = 6174$. -Even more remarkable is that if we start from any 4 digit number and repeat this process of sorting and subtracting, we'll eventually end up with 6174 or immediately with 0 if all digits are equal. +Ainda mais incrível é o fato de que, se começarmos com qualquer número de 4 algarismos e repetirmos esse processo de ordenação e subtração, em algum momento chegaremos a 6174 ou imediatamente a 0 se todos os algarismos forem iguais. -This also works with numbers that have less than 4 digits if we pad the number with leading zeroes until we have 4 digits. +Isso também funciona com números que têm menos de 4 algarismos se colocarmos zeros à esquerda do número até chegarmos a 4 algarismos. -E.g. let's start with the number 0837: +Ex: vamos começar com o número 0837: $$\begin{align} & 8730 - 0378 = 8352 \\\\ & 8532 - 2358 = 6174 \end{align}$$ -6174 is called the Kaprekar constant. The process of sorting and subtracting and repeating this until either 0 or the Kaprekar constant is reached is called the Kaprekar routine. +6174 é chamado de constante de Kaprekar. O processo de ordenar e subtrair e repetir isso até chegar a 0 ou à constante de Kaprekar é chamado de rotina de Kaprekar. -We can consider the Kaprekar routine for other bases and number of digits. Unfortunately, it is not guaranteed a Kaprekar constant exists in all cases; either the routine can end up in a cycle for some input numbers or the constant the routine arrives at can be different for different input numbers. However, it can be shown that for 5 digits and a base $b = 6t + 3 ≠ 9$, a Kaprekar constant exists. +Podemos considerar a rotina de Kaprekar para outras bases e quantidades de algarismos. Infelizmente, não é garantido que uma constante de Kaprekar exista em todos os casos; ou a rotina pode terminar em um ciclo para alguns números de entrada ou a constante a qual a rotina chega pode diferir para números de entrada diversos. Podemos, no entanto, mostrar que, para 5 algarismos e uma base $b = 6t + 3 ≠ 9$, existe uma constante de Kaprekar. -E.g. base 15: ${(10, 4, 14, 9, 5)}\_{15}$ base 21: $(14, 6, 20, 13, 7)\_{21}$ +Ex: base 15: ${(10, 4, 14, 9, 5)}\_{15}$ base 21: $(14, 6, 20, 13, 7)\_{21}$ -Define $C_b$ to be the Kaprekar constant in base $b$ for 5 digits. Define the function $sb(i)$ to be: +Defina $C_b$ como a constante de Kaprekar na base $b$ para 5 algarismos. Defina a função $sb(i)$ como: -- 0 if $i = C_b$ or if $i$ written in base $b$ consists of 5 identical digits -- the number of iterations it takes the Kaprekar routine in base $b$ to arrive at $C_b$, otherwise +- 0 se $i = C_b$ ou se $i$ escrito na base $b$ consiste em 5 algarismos idênticos +- o número de iterações necessário para que a rotina de Kaprekar na base $b$ chegue a $C_b$, em outros casos -Note that we can define $sb(i)$ for all integers $i < b^5$. If $i$ written in base $b$ takes less than 5 digits, the number is padded with leading zero digits until we have 5 digits before applying the Kaprekar routine. +Observe que podemos definir $sb(i)$ para todos os números inteiros $i < b^5$. Se $i$ escrito na base $b$ tiver menos de 5 algarismos, o número recebe algarismos zero à esquerda até chegar a 5 algarismos antes de aplicar a rotina de Kaprekar. -Define $S(b)$ as the sum of $sb(i)$ for $0 < i < b^5$. E.g. $S(15) = 5\\,274\\,369$ $S(111) = 400\\,668\\,930\\,299$ +Defina $S(b)$ como a soma de $sb(i)$ para $0 < i < b^5$. Ex: $S(15) = 5.274.369$ $S(111) = 400.668.930.299$ -Find the sum of $S(6k + 3)$ for $2 ≤ k ≤ 300$. Give the last 18 digits as your answer. +Encontre a soma de $S(6k + 3)$ para $2 ≤ k ≤ 300$. Dê os últimos 18 algarismos da sua resposta. # --hints-- -`kaprekarConstant()` should return `552506775824935500`. +`kaprekarConstant()` deve retornar `552506775824935500`. ```js assert.strictEqual(kaprekarConstant(), 552506775824935500); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-416-a-frogs-trip.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-416-a-frogs-trip.md index 048adb254cd..80816256c10 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-416-a-frogs-trip.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-416-a-frogs-trip.md @@ -1,6 +1,6 @@ --- id: 5900f50e1000cf542c510020 -title: 'Problem 416: A frog''s trip' +title: 'Problema 416: A viagem de um sapo' challengeType: 1 forumTopicId: 302085 dashedName: problem-416-a-frogs-trip @@ -8,17 +8,17 @@ dashedName: problem-416-a-frogs-trip # --description-- -A row of $n$ squares contains a frog in the leftmost square. By successive jumps the frog goes to the rightmost square and then back to the leftmost square. On the outward trip he jumps one, two or three squares to the right, and on the homeward trip he jumps to the left in a similar manner. He cannot jump outside the squares. He repeats the round-trip travel $m$ times. +Uma fileira de $n$ quadrados contém um sapo no quadrado mais à esquerda. Em sucessivos pulos, o sapo vai para o quadrado mais à direita e depois volta para o quadrado mais à esquerda. Na viagem de ida, ele pula um, dois ou três quadrados para a direita. Na viagem de volta para casa, ele pula para a esquerda de uma maneira parecida. Ele não pode pular fora dos quadrados. Ele repete a viagem de ida e volta $m$ vezes. -Let $F(m, n)$ be the number of the ways the frog can travel so that at most one square remains unvisited. +Considere que $F(m, n)$ é o número de maneiras pelas quais o sapo pode viajar, sendo que, no máximo, um quadrado pode permanecer sem ser visitado. -For example, $F(1, 3) = 4$, $F(1, 4) = 15$, $F(1, 5) = 46$, $F(2, 3) = 16$ and $F(2, 100)\bmod {10}^9 = 429\\,619\\,151$. +Por exemplo, $F(1, 3) = 4$, $F(1, 4) = 15$, $F(1, 5) = 46$, $F(2, 3) = 16$ e $F(2, 100)\bmod {10}^9 = 429.619.151$. -Find the last 9 digits of $F(10, {10}^{12})$. +Encontre os últimos 9 algarismos de $F(10, {10}^{12})$. # --hints-- -`frogsTrip()` should return `898082747`. +`frogsTrip()` deve retornar `898082747`. ```js assert.strictEqual(frogsTrip(), 898082747); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-417-reciprocal-cycles-ii.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-417-reciprocal-cycles-ii.md index aa0880c13f4..60b74c8a663 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-417-reciprocal-cycles-ii.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-417-reciprocal-cycles-ii.md @@ -1,6 +1,6 @@ --- id: 5900f50d1000cf542c51001f -title: 'Problem 417: Reciprocal cycles II' +title: 'Problema 417: Dízimas periódicas' challengeType: 1 forumTopicId: 302086 dashedName: problem-417-reciprocal-cycles-ii @@ -8,7 +8,7 @@ dashedName: problem-417-reciprocal-cycles-ii # --description-- -A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given: +Em uma fração unitária, o numerador é 1. A representação decimal das frações unitárias com denominadores de 2 a 10 é a seguinte: $$\begin{align} & \frac{1}{2} = 0.5 \\\\ & \frac{1}{3} = 0.(3) \\\\ & \frac{1}{4} = 0.25 \\\\ @@ -17,17 +17,17 @@ $$\begin{align} & \frac{1}{2} = 0.5 \\\\ & \frac{1}{9} = 0.(1) \\\\ & \frac{1}{10} = 0.1 \\\\ \end{align}$$ -Where $0.1(6)$ means $0.166666\ldots$, and has a 1-digit recurring cycle. It can be seen that $\frac{1}{7}$ has a 6-digit recurring cycle. +A expressão $0.1(6)$ significa $0.16666666\dots$ e tem um ciclo recorrente de 1 algarismo. Pode ser visto que $\frac{1}{7}$ tem um ciclo recorrente de 6 algarismos. -Unit fractions whose denominator has no other prime factors than 2 and/or 5 are not considered to have a recurring cycle. We define the length of the recurring cycle of those unit fractions as 0. +Frações unitárias cujo denominador não tem outros fatores primos além de 2 e/ou 5 não são consideradas como tendo um ciclo recorrente. Definimos 0 como o comprimento do ciclo recorrente dessas frações unitárias. -Let $L(n)$ denote the length of the recurring cycle of $\frac{1}{n}$. You are given that $\sum L(n)$ for $3 ≤ n ≤ 1\\,000\\,000$ equals $55\\,535\\,191\\,115$. +Considere que $L(n)$ denota o comprimento do ciclo recorrente de $\frac{1}{n}$. Você recebe a informação de que $\sum L(n)$ por $3 ≤ n ≤ 1.000.000$ é igual a $55.535.191.115$. -Find $\sum L(n)$ for $3 ≤ n ≤ 100\\,000\\,000$. +Calcule $\sum L(n)$ por $3 ≤ n ≤ 100.000.000$. # --hints-- -`reciprocalCyclesTwo()` should return `446572970925740`. +`reciprocalCyclesTwo()` deve retornar `446572970925740`. ```js assert.strictEqual(reciprocalCyclesTwo(), 446572970925740); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-418-factorisation-triples.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-418-factorisation-triples.md index 0c376474a32..54fcbd806f5 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-418-factorisation-triples.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-418-factorisation-triples.md @@ -1,6 +1,6 @@ --- id: 5900f50f1000cf542c510021 -title: 'Problem 418: Factorisation triples' +title: 'Problema 418: Trios de fatoração' challengeType: 1 forumTopicId: 302087 dashedName: problem-418-factorisation-triples @@ -8,20 +8,20 @@ dashedName: problem-418-factorisation-triples # --description-- -Let $n$ be a positive integer. An integer triple ($a$, $b$, $c$) is called a factorisation triple of $n$ if: +Considere $n$ um inteiro positivo. Um trio de números inteiros ($a$, $b$, $c$) é chamado de trio de fatoração de $n$ se: - $1 ≤ a ≤ b ≤ c$ - $a \times b \times c = n$. -Define $f(n)$ to be $a + b + c$ for the factorisation triple ($a$, $b$, $c$) of $n$ which minimises $\frac{c}{a}$. One can show that this triple is unique. +Defina $f(n)$ como $a + b + c$ para o trio da fatoração ($a$, $b$, $c$) de $n$ que minimiza $\frac{c}{a}$. Podemos mostrar que esse trio é único. -For example, $f(165) = 19$, $f(100\\,100) = 142$ and $f(20!) = 4\\,034\\,872$. +Por exemplo, $f(165) = 19$, $f(100.100) = 142$ e $f(20!) = 4.034.872$. -Find $f(43!)$. +Encontre $f(43!)$. # --hints-- -`factorisationTriples()` should return `1177163565297340400`. +`factorisationTriples()` deve retornar `1177163565297340400`. ```js assert.strictEqual(factorisationTriples(), 1177163565297340400); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-419-look-and-say-sequence.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-419-look-and-say-sequence.md index 4143ab36ccb..67a498bafc7 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-419-look-and-say-sequence.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-419-look-and-say-sequence.md @@ -1,6 +1,6 @@ --- id: 5900f5101000cf542c510022 -title: 'Problem 419: Look and say sequence' +title: 'Problema 419: Sequência para olhar e dizer' challengeType: 1 forumTopicId: 302088 dashedName: problem-419-look-and-say-sequence @@ -8,38 +8,38 @@ dashedName: problem-419-look-and-say-sequence # --description-- -The look and say sequence goes 1, 11, 21, 1211, 111221, 312211, 13112221, 1113213211, ... +A sequência para olhar e dizer é 1, 11, 21, 1211, 111221, 312211, 13112221, 1113213211, ... -The sequence starts with 1 and all other members are obtained by describing the previous member in terms of consecutive digits. +A sequência começa com 1 e todos os outros membros são obtidos descrevendo o membro anterior em termos de algarismos consecutivos. -It helps to do this out loud: +Ajuda ler os algarismos em voz alta: -1 is 'one one' $→ 11$ +1 é 'um um' $→ 11$ -11 is 'two ones' $→ 21$ +11 é 'dois um' $→ 21$ -21 is 'one two and one one' $→ 1211$ +21 é 'um dois e um um' $→ 1211$ -1211 is 'one one, one two and two ones' $→ 111221$ +1211 é 'um um, um dois e dois um' $→ 111221$ -111221 is 'three ones, two twos and one one' $→ 312211$ +111221 is 'três um, dois dois e um um' $→ 312211$ ... -Define $A(n)$, $B(n)$ and $C(n)$ as the number of ones, twos and threes in the $n$'th element of the sequence respectively. One can verify that $A(40) = 31\\,254$, $B(40) = 20\\,259$ and $C(40) = 11\\,625$. +Defina $A(n)$, $B(n)$ e $C(n)$ como o número de uns, dois e três no $n$'ésimo elemento da sequência, respectivamente. Podemos verificar se $A(40) = 31.254$, $B(40) = 20.259$ e $C(40) = 11.625$. -Find $A(n)$, $B(n)$ and $C(n)$ for $n = {10}^{12}$. Give your answer modulo $2^{30}$ as a string and separate your values for $A$, $B$ and $C$ by a comma. E.g. for $n = 40$ the answer would be `31254,20259,11625`. +Calcule $A(n)$, $B(n)$ e $C(n)$ para $n = {10}^{12}$. Dê o modulo $2^{30}$ de sua resposta como uma string e separe seus valores para $A$, $B$ e $C$ por uma vírgula. Ex: para $n = 40$, a resposta seria `31254,20259,11625`. # --hints-- -`lookAndSaySequence()` should return a string. +`lookAndSaySequence()` deve retornar uma string. ```js assert(typeof lookAndSaySequence() === 'string'); ``` -`lookAndSaySequence()` should return the string `998567458,1046245404,43363922`. +`lookAndSaySequence()` deve retornar a string `998567458,1046245404,43363922`. ```js assert.strictEqual(lookAndSaySequence(), '998567458,1046245404,43363922'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-420-2x2-positive-integer-matrix.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-420-2x2-positive-integer-matrix.md index 50a7c676cb8..469943ebf1b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-420-2x2-positive-integer-matrix.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-420-2x2-positive-integer-matrix.md @@ -1,6 +1,6 @@ --- id: 5900f5111000cf542c510023 -title: 'Problem 420: 2x2 positive integer matrix' +title: 'Problema 420: Matriz de números inteiros positivos 2x2' challengeType: 1 forumTopicId: 302090 dashedName: problem-420-2x2-positive-integer-matrix @@ -8,9 +8,9 @@ dashedName: problem-420-2x2-positive-integer-matrix # --description-- -A positive integer matrix is a matrix whose elements are all positive integers. +Uma matriz de números inteiros positivos é uma matriz cujos elementos são todos números inteiros positivos. -Some positive integer matrices can be expressed as a square of a positive integer matrix in two different ways. Here is an example: +Algumas matrizes de números inteiros positivos podem ser expressas como um quadrado de uma matriz de números inteiros positivos de duas formas diferentes. Exemplo: $$\begin{pmatrix} 40 & 12 \\\\ 48 & 40 \end{pmatrix} = @@ -21,15 +21,15 @@ $$\begin{pmatrix} 40 & 12 \\\\ 6 & 1 \\\\ 4 & 6 \end{pmatrix}}^2$$ -We define $F(N)$ as the number of the 2x2 positive integer matrices which have a trace less than N and which can be expressed as a square of a positive integer matrix in two different ways. +Definimos $F(N)$ como a quantidade de matrizes de números inteiros positivos 2x2 que têm um traço inferior a N e que podem ser expressas como um quadrado de uma matriz de números inteiros positivos de duas formas diferentes. -We can verify that $F(50) = 7$ and $F(1000) = 1019$. +Podemos verificar que $F(50) = 7$ e $F(1000) = 1019$. -Find $F({10}^7)$. +Encontre $F({10}^7)$. # --hints-- -`positiveIntegerMatrix()` should return `145159332`. +`positiveIntegerMatrix()` deve retornar `145159332`. ```js assert.strictEqual(positiveIntegerMatrix(), 145159332); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-421-prime-factors-of-n151.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-421-prime-factors-of-n151.md index f94cb95bc48..9a88dea4757 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-421-prime-factors-of-n151.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-421-prime-factors-of-n151.md @@ -1,6 +1,6 @@ --- id: 5900f5131000cf542c510024 -title: 'Problem 421: Prime factors of n^15+1' +title: 'Problema 421: Fatores primos de n^15+1' challengeType: 1 forumTopicId: 302091 dashedName: problem-421-prime-factors-of-n151 @@ -8,23 +8,23 @@ dashedName: problem-421-prime-factors-of-n151 # --description-- -Numbers of the form $n^{15} + 1$ are composite for every integer $n > 1$. +Números no formato $n^{15} + 1$ são compostos para cada número inteiro $n > 1$. -For positive integers $n$ and $m$ let $s(n, m)$ be defined as the sum of the distinct prime factors of $n^{15} + 1$ not exceeding $m$. +Para números inteiros positivos $n$ e $m$, considere $s(n, m)$ como a soma dos fatores primos distintos de $n^{15} + 1$ não superior a $m$. -E.g. $2^{15} + 1 = 3 × 3 × 11 × 331$. +Ex: $2^{15} + 1 = 3 × 3 × 11 × 331$. -So $s(2, 10) = 3$ and $s(2, 1000) = 3 + 11 + 331 = 345$. +So $s(2, 10) = 3$ e $s(2, 1000) = 3 + 11 + 331 = 345$. -Also ${10}^{15} + 1 = 7 × 11 × 13 × 211 × 241 × 2161 × 9091$. +E também ${10}^{15} + 1 = 7 × 11 × 13 × 211 × 241 × 2161 × 9091$. -So $s(10, 100) = 31$ and $s(10, 1000) = 483$. +Assim, $s(10, 100) = 31$ e $s(10, 1000) = 483$. -Find $\sum s(n, {10}^8)$ for $1 ≤ n ≤ {10}^{11}$. +Encontre a $\sum s(n, {10}^8)$ para $1 ≤ n ≤ {10}^{11}$. # --hints-- -`primeFactorsOfN15Plus1()` should return `2304215802083466200`. +`primeFactorsOfN15Plus1()` deve retornar `2304215802083466200`. ```js assert.strictEqual(primeFactorsOfN15Plus1(), 2304215802083466200); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-422-sequence-of-points-on-a-hyperbola.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-422-sequence-of-points-on-a-hyperbola.md index 7ea875b71ab..293991253a9 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-422-sequence-of-points-on-a-hyperbola.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-422-sequence-of-points-on-a-hyperbola.md @@ -1,6 +1,6 @@ --- id: 5900f5131000cf542c510025 -title: 'Problem 422: Sequence of points on a hyperbola' +title: 'Problema 422: Sequência de pontos em uma hipérbole' challengeType: 1 forumTopicId: 302092 dashedName: problem-422-sequence-of-points-on-a-hyperbola @@ -8,27 +8,27 @@ dashedName: problem-422-sequence-of-points-on-a-hyperbola # --description-- -Let $H$ be the hyperbola defined by the equation $12x^2 + 7xy - 12y^2 = 625$. +Considere $H$ como a hipérbole definida pela equação $12x^2 + 7xy - 12y^2 = 625$. -Next, define $X$ as the point (7, 1). It can be seen that $X$ is in $H$. +Em seguida, defina $X$ como o ponto (7, 1). Pode-se ver que $X$ está em $H$. -Now we define a sequence of points in $H, \\{P_i : i ≥ 1\\}$, as: +Definiremos uma sequência de pontos em $H, \\{P_i : i ≥ 1\\}$, como: - $P_1 = (13, \frac{61}{4})$. - $P_2 = (\frac{-43}{6}, -4)$. -- For $i > 2$, $P_i$ is the unique point in $H$ that is different from $P_{i - 1}$ and such that line $P_iP_{i - 1}$ is parallel to line $P_{i - 2}X$. It can be shown that $P_i$ is well-defined, and that its coordinates are always rational. +- Para $i > 2$, $P_i$ é o único ponto $H$ que é diferente de $P_{i - 1}$ e tal que a linha $P_iP_{i - 1}$ é paralela à linha $P_{i - 2}X$. Pode-se ver que $P_i$ está corretamente definido e que suas coordenadas são sempre racionais. -animation showing defining points P_1 to P_6 +animação mostrando os pontos de definição de P_1 a P_6 -You are given that $P_3 = (\frac{-19}{2}, \frac{-229}{24})$, $P_4 = (\frac{1267}{144}, \frac{-37}{12})$ and $P_7 = (\frac{17\\,194\\,218\\,091}{143\\,327\\,232}, \frac{274\\,748\\,766\\,781}{1\\,719\\,926\\,784})$. +Você é informado de que $P_3 = (\frac{-19}{2}, \frac{-229}{24})$, $P_4 = (\frac{1267}{144}, \frac{-37}{12})$ and $P_7 = (\frac{17.194.218.091}{143.327.232}, \frac{274.748.766.781}{1.719.926.784})$. -Find $P_n$ for $n = {11}^{14}$ in the following format: If $P_n = (\frac{a}{b}, \frac{c}{d})$ where the fractions are in lowest terms and the denominators are positive, then the answer is $(a + b + c + d)\bmod 1\\,000\\,000\\,007$. +Encontre $P_n$ para $n = {11}^{14}$ no seguinte formato: se $P_n = (\frac{a}{b}, \frac{c}{d})$, onde as frações estão nos menores termos e os denominadores são positivos, então a resposta é $(a + b + c + d)\bmod 1.000.000.007$. -For $n = 7$, the answer would have been: $806\\,236\\,837$. +Para $n = 7$, a resposta seria: $806.236.837$. # --hints-- -`sequenceOfPointsOnHyperbola()` should return `92060460`. +`sequenceOfPointsOnHyperbola()` deve retornar `92060460`. ```js assert.strictEqual(sequenceOfPointsOnHyperbola(), 92060460); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-423-consecutive-die-throws.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-423-consecutive-die-throws.md index 9969311f0de..dd890b86fbb 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-423-consecutive-die-throws.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-423-consecutive-die-throws.md @@ -1,6 +1,6 @@ --- id: 5900f5141000cf542c510027 -title: 'Problem 423: Consecutive die throws' +title: 'Problema 423: Lançamentos consecutivos de dados' challengeType: 1 forumTopicId: 302093 dashedName: problem-423-consecutive-die-throws @@ -8,32 +8,32 @@ dashedName: problem-423-consecutive-die-throws # --description-- -Let $n$ be a positive integer. +Considere $n$ um inteiro positivo. -A 6-sided die is thrown $n$ times. Let $c$ be the number of pairs of consecutive throws that give the same value. +Um dado de 6 lados é lançado $n$ vezes. Considere $c$ como o número de pares de lançamentos consecutivos que dão o mesmo valor. -For example, if $n = 7$ and the values of the die throws are (1, 1, 5, 6, 6, 6, 3), then the following pairs of consecutive throws give the same value: +Por exemplo, se $n = 7$ e os valores dos lançamentos dos dados são (1, 1, 5, 6, 6, 6, 3), os seguintes pares de lançamentos consecutivos dão o mesmo valor: $$\begin{align} & (\underline{1}, \underline{1}, 5, 6, 6, 6, 3) \\\\ & (1, 1, 5, \underline{6}, \underline{6}, 6, 3) \\\\ & (1, 1, 5, 6, \underline{6}, \underline{6}, 3) \end{align}$$ -Therefore, $c = 3$ for (1, 1, 5, 6, 6, 6, 3). +Portanto, $c = 3$ para (1, 1, 5, 6, 6, 6, 3). -Define $C(n)$ as the number of outcomes of throwing a 6-sided die $n$ times such that $c$ does not exceed $π(n)$.1 +Defina $C(n)$ como o número de resultados de lançar um dado de 6 lados $n$ vezes, tal que $c$ não exceda $π(n)$.1 -For example, $C(3) = 216$, $C(4) = 1290$, $C(11) = 361\\,912\\,500$ and $C(24) = 4\\,727\\,547\\,363\\,281\\,250\\,000$. +Por exemplo, $C(3) = 216$, $C(4) = 1290$, $C(11) = 361.912.500$ e $C(24) = 4.727.547.363.281.250.000$. -Define $S(L)$ as $\sum C(n)$ for $1 ≤ n ≤ L$. +Defina $S(L)$ como $\sum C(n)$ para $1 ≤ n ≤ L$. -For example, $S(50)\bmod 1\\,000\\,000\\,007 = 832\\,833\\,871$. +Por exemplo, $S(50)\bmod 1.000.000.007 = 832.833.871$. -Find $S(50\\,000\\,000)\bmod 1\\,000\\,000\\,007$. +Encontre $S(50.000.000)\bmod 1.000.000.007$. -1 $π$ denotes the prime-counting function, i.e. $π(n)$ is the number of primes $≤ n$. +1 $π$ é a função de contagem de números primos, ou seja, $π(n)$ é a quantidade de números primos $≤ n$. # --hints-- -`consecutiveDieThrows()` should return `653972374`. +`consecutiveDieThrows()` deve retornar `653972374`. ```js assert.strictEqual(consecutiveDieThrows(), 653972374); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-425-prime-connection.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-425-prime-connection.md index dfba791e407..76528dd8977 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-425-prime-connection.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-425-prime-connection.md @@ -1,6 +1,6 @@ --- id: 5900f5151000cf542c510028 -title: 'Problem 425: Prime connection' +title: 'Problema 425: Conexão de números primos' challengeType: 1 forumTopicId: 302095 dashedName: problem-425-prime-connection @@ -8,26 +8,26 @@ dashedName: problem-425-prime-connection # --description-- -Two positive numbers $A$ and $B$ are said to be connected (denoted by "$A ↔ B$") if one of these conditions holds: +Dois números positivos $A$ e $B$ devem ser conectados (denotado por "$A ↔ B$") se uma destas condições se mantiver: -1. $A$ and $B$ have the same length and differ in exactly one digit; for example, $123 ↔ 173$. -2. Adding one digit to the left of $A$ (or $B$) makes $B$ (or $A$); for example, $23 ↔ 223$ and $123 ↔ 23$. +1. $A$ e $B$ têm o mesmo comprimento e diferem em exatamente um algarismo; por exemplo, $123 ↔ 173$. +2. Adicionar um algarismo à esquerda de $A$ (ou $B$) gera $B$ (ou $A$); por exemplo, $23 ↔ 223$ e $123 ↔ 23$. -We call a prime $P$ a 2's relative if there exists a chain of connected primes between 2 and $P$ and no prime in the chain exceeds $P$. +Chamamos um número primo $P$ um parente de 2 se existir uma cadeia de primos conectados entre 2 e $P$ e se nenhum primo na cadeia exceder $P$. -For example, 127 is a 2's relative. One of the possible chains is shown below: +Por exemplo, 127 é um parente de 2. Uma das cadeias possíveis é mostrada abaixo: $$2 ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127$$ -However, 11 and 103 are not 2's relatives. +No entanto, 11 e 103 não são parentes de 2. -Let $F(N)$ be the sum of the primes $≤ N$ which are not 2's relatives. We can verify that $F({10}^3) = 431$ and $F({10}^4) = 78\\,728$. +Considere $F(N)$ como a soma dos primos $≤ N$ que não são parentes de 2. Pode-se verificar que $F({10}^3) = 431$ e que $F({10}^4) = 78.728.$. -Find $F({10}^7)$. +Encontre $F({10}^7)$. # --hints-- -`primeConnection()` should return `46479497324`. +`primeConnection()` deve retornar `46479497324`. ```js assert.strictEqual(primeConnection(), 46479497324); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-426-box-ball-system.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-426-box-ball-system.md index 89314f8aa76..2247bced9b0 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-426-box-ball-system.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-426-box-ball-system.md @@ -1,6 +1,6 @@ --- id: 5900f5171000cf542c510029 -title: 'Problem 426: Box-ball system' +title: 'Problema 426: Sistema de esfera e caixa' challengeType: 1 forumTopicId: 302096 dashedName: problem-426-box-ball-system @@ -8,34 +8,34 @@ dashedName: problem-426-box-ball-system # --description-- -Consider an infinite row of boxes. Some of the boxes contain a ball. For example, an initial configuration of 2 consecutive occupied boxes followed by 2 empty boxes, 2 occupied boxes, 1 empty box, and 2 occupied boxes can be denoted by the sequence (2, 2, 2, 1, 2), in which the number of consecutive occupied and empty boxes appear alternately. +Considere uma linha infinita de caixas. Algumas das caixas têm uma esfera. Por exemplo, uma configuração inicial de 2 caixas ocupadas consecutivas seguidas por 2 caixas vazias, 2 caixas ocupadas, 1 caixa vazia e 2 caixas ocupadas pode ser indicada pela sequência (2, 2, 2, 1, 2), onde o número de caixas ocupadas e vazias consecutivas aparece alternadamente. -A turn consists of moving each ball exactly once according to the following rule: Transfer the leftmost ball which has not been moved to the nearest empty box to its right. +Um turno consiste em mover cada esfera exatamente uma vez, de acordo com a seguinte regra: transfira a esfera mais à esquerda, que não foi movida para a caixa vazia mais próxima à sua direita. -After one turn the sequence (2, 2, 2, 1, 2) becomes (2, 2, 1, 2, 3) as can be seen below; note that we begin the new sequence starting at the first occupied box. +Depois de um movimento, a sequência (2, 2, 2, 1, 2) torna-se (2, 2, 1, 2, 3) como pode ser visto abaixo. Note-se que começamos a nova sequência a partir da primeira caixa ocupada. -animation showing one complete turn from (2, 2, 2, 1, 2) to (2, 2, 1, 2, 3) +animação mostrando um movimento completo de (2, 2, 2, 1, 2) para (2, 2, 1, 2, 3) -A system like this is called a Box-Ball System or BBS for short. +Um sistema como esse se chama um sistema de esfera e caixa ou BBS (Box-Ball System) para abreviação. -It can be shown that after a sufficient number of turns, the system evolves to a state where the consecutive numbers of occupied boxes is invariant. In the example below, the consecutive numbers of occupied boxes evolves to [1, 2, 3]; we shall call this the final state. +Pode-se mostrar que após um número suficiente de movimentos, o sistema evolui para um estado onde o número consecutivo de caixas ocupadas é invariável. No exemplo abaixo, os números consecutivos de caixas ocupadas evoluem para [1, 2, 3]; chamaremos isso de estado final. -four turns from occupied boxes [2, 2, 2] to final state [1, 2, 3] +quatro movimentos de caixas ocupadas [2, 2, 2] para o estado final [1, 2, 3] -We define the sequence $\\{t_i\\}$: +Definimos a sequência $\\{t_i\\}$: -$$\begin{align} & s_0 = 290\\,797 \\\\ - & s_{k + 1} = {s_k}^2\bmod 50\\,515\\,093 \\\\ & t_k = (s_k\bmod 64) + 1 \end{align}$$ +$$\begin{align} & s_0 = 290.797 \\\\ + & s_{k + 1} = {s_k}^2\bmod 50.515.093 \\\\ & t_k = (s_k\bmod 64) + 1 \end{align}$$ -Starting from the initial configuration $(t_0, t_1, \ldots, t_{10})$, the final state becomes [1, 3, 10, 24, 51, 75]. +Começando da configuração inicial $(t_0, t_1, \ldots, t_{10})$, o estado final se torna [1, 3, 10, 24, 51, 75]. -Starting from the initial configuration $(t_0, t_1, \ldots, t_{10\\,000\\,000})$, find the final state. +Começando da configuração inicial $(t_0, t_1, \ldots, t_{10.000.000})$, encontre o estado final. -Give as your answer the sum of the squares of the elements of the final state. For example, if the final state is [1, 2, 3] then $14 (= 1^2 + 2^2 + 3^2)$ is your answer. +Dê como sua resposta a soma dos quadrados dos elementos do estado final. Por exemplo, se o estado final é [1, 2, 3], então $14 (= 1^2 + 2^2 + 3^2)$ é a sua resposta. # --hints-- -`boxBallSystem()` should return `31591886008`. +`boxBallSystem()` deve retornar `31591886008`. ```js assert.strictEqual(boxBallSystem(), 31591886008); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-427-n-sequences.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-427-n-sequences.md index 3f244f7937c..3048f2733cd 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-427-n-sequences.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-427-n-sequences.md @@ -1,6 +1,6 @@ --- id: 5900f5181000cf542c51002a -title: 'Problem 427: n-sequences' +title: 'Problema 427: Sequências n' challengeType: 1 forumTopicId: 302097 dashedName: problem-427-n-sequences @@ -8,21 +8,21 @@ dashedName: problem-427-n-sequences # --description-- -A sequence of integers $S = \\{s_i\\}$ is called an $n$-sequence if it has $n$ elements and each element $s_i$ satisfies $1 ≤ s_i ≤ n$. Thus there are $n^n$ distinct $n$-sequences in total. +Uma sequência de números inteiros $S = \\{s_i\\}$ é chamada de sequência $n$ se ela tem $n$ elementos e cada elemento $s_i$ satisfaz $1 ≤ s_i ≤ n$. Portanto, há $n^n$ sequências $n$ distintas no total. -For example, the sequence $S = \\{1, 5, 5, 10, 7, 7, 7, 2, 3, 7\\}$ is a 10-sequence. +Por exemplo, a sequência $S = \\{1, 5, 5, 10, 7, 7, 7, 2, 3, 7\\}$ é uma sequência de 10. -For any sequence $S$, let $L(S)$ be the length of the longest contiguous subsequence of $S$ with the same value. For example, for the given sequence $S$ above, $L(S) = 3$, because of the three consecutive 7's. +Para qualquer sequência $S$, considere $L(S)$ como o comprimento da subsequência contígua mais longa de $S$ com o mesmo valor. Por exemplo, para a sequência $S$ dada acima, $L(S) = 3$, por causa dos três 7 consecutivos. -Let $f(n) = \sum L(S)$ for all $n$-sequences $S$. +Considere $f(n) = \sum L(S)$ para todas as $S$ sequências $n$. -For example, $f(3) = 45$, $f(7) = 1\\,403\\,689$ and $f(11) = 481\\,496\\,895\\,121$. +Por exemplo, $f(3) = 45$, $f(7) = 1.403.689$ e $f(11) = 481.496.895.121$. -Find $f(7\\,500\\,000)\bmod 1\\,000\\,000\\,009$. +Encontre $f(7.500.000)\bmod 1.000.000.009$. # --hints-- -`nSequences()` should return `97138867`. +`nSequences()` deve retornar `97138867`. ```js assert.strictEqual(nSequences(), 97138867); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-428-necklace-of-circles.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-428-necklace-of-circles.md index bf6e6bdaa12..ac8e997733e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-428-necklace-of-circles.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-428-necklace-of-circles.md @@ -1,6 +1,6 @@ --- id: 5900f5191000cf542c51002b -title: 'Problem 428: Necklace of Circles' +title: 'Problema 428: Colar de círculos' challengeType: 1 forumTopicId: 302098 dashedName: problem-428-necklace-of-circles @@ -8,32 +8,32 @@ dashedName: problem-428-necklace-of-circles # --description-- -Let $a$, $b$ and $c$ be positive numbers. +Considere $a$, $b$ e $c$ números positivos. -Let $W$, $X$, $Y$, $Z$ be four collinear points where $|WX| = a$, $|XY| = b$, $|YZ| = c$ and $|WZ| = a + b + c$. +Considere $W$, $X$, $Y$, $Z$ como quatro pontos colineares, onde $|WX| = a$, $|XY| = b$, $|YZ| = c$ e $|WZ| = a + b + c$. -Let $C_{\text{in}}$ be the circle having the diameter $XY$. +Considere $C_{\text{in}}$ como o círculo com o diâmetro $XY$. -Let $C_{\text{out}}$ be the circle having the diameter $WZ$. +Considere $C_{\text{out}}$ como o círculo com o diâmetro $WZ$. -The triplet ($a$, $b$, $c$) is called a *necklace triplet* if you can place $k ≥ 3$ distinct circles $C_1, C_2, \ldots, C_k$ such that: +O trio ($a$, $b$, $c$) é chamado de *trio do colar* se você puder dispor $k ≥ 3$ círculos distintos $C_1, C_2, \ldots, C_k$, tais que: -- $C_i$ has no common interior points with any $C_j$ for $1 ≤ i$, $j ≤ k$ and $i ≠ j$, -- $C_i$ is tangent to both $C_{\text{in}}$ and $C_{\text{out}}$ for $1 ≤ i ≤ k$, -- $C_i$ is tangent to $C_{i + 1}$ for $1 ≤ i < k$, and -- $C_k$ is tangent to $C_1$. +- $C_i$ não tem pontos interiores em comum com qualquer $C_j$ para $1 ≤ i$, $j ≤ k$ e $i ≠ j$, +- $C_i$ é tangente tanto a $C_{\text{in}}$ quanto a $C_{\text{out}}$ para $1 ≤ i ≤ k$, +- $C_i$ é tangente a $C_{i + 1}$ para $1 ≤ i < k$, e +- $C_k$ é tangente a $C_1$. -For example, (5, 5, 5) and (4, 3, 21) are necklace triplets, while it can be shown that (2, 2, 5) is not. +Por exemplo, (5, 5, 5) e (4, 3, 21) são trios do colar, enquanto é possível mostrar que (2, 2, 5) não é. -a visual representation of a necklace triplet +uma representação visual de um trio de colar -Let $T(n)$ be the number of necklace triplets $(a, b, c)$ such that $a$, $b$ and $c$ are positive integers, and $b ≤ n$. For example, $T(1) = 9$, $T(20) = 732$ and $T(3\\,000) = 438\\,106$. +Considere $T(n)$ como o número de trios de colar $(a, b, c)$, tal que $a$, $b$ e $c$ sejam inteiros positivos e $b ≤ n$. Por exemplo, $T(1) = 9$, $T(20) = 732$ e $T(3.000) = 438.106$. -Find $T(1\\,000\\,000\\,000)$. +Encontre $T(1.000.000.000)$. # --hints-- -`necklace(1000000000)` should return `747215561862`. +`necklace(1000000000)` deve retornar `747215561862`. ```js assert.strictEqual(necklace(1000000000), 747215561862); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-429-sum-of-squares-of-unitary-divisors.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-429-sum-of-squares-of-unitary-divisors.md index 928c602299f..08e1cf22dae 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-429-sum-of-squares-of-unitary-divisors.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-429-sum-of-squares-of-unitary-divisors.md @@ -1,6 +1,6 @@ --- id: 5900f5191000cf542c51002c -title: 'Problem 429: Sum of squares of unitary divisors' +title: 'Problema 429: Soma dos quadrados dos divisores unitários' challengeType: 1 forumTopicId: 302099 dashedName: problem-429-sum-of-squares-of-unitary-divisors @@ -8,19 +8,19 @@ dashedName: problem-429-sum-of-squares-of-unitary-divisors # --description-- -A unitary divisor $d$ of a number $n$ is a divisor of $n$ that has the property $gcd(d, \frac{n}{d}) = 1$. +Um divisor unitário $d$ de um número $n$ é um divisor de $n$ que tem a propriedade $gcd(d, \frac{n}{d}) = 1$. -The unitary divisors of $4! = 24$ are 1, 3, 8 and 24. +Os divisores unitários de $4! = 24$ são 1, 3, 8 e 24. -The sum of their squares is $12 + 32 + 82 + 242 = 650$. +A soma de seus quadrados é $12 + 32 + 82 + 242 = 650$. -Let $S(n)$ represent the sum of the squares of the unitary divisors of $n$. Thus $S(4!) = 650$. +Considere $S(n)$ como representando a soma dos quadrados dos divisores unitários de $n$. Portanto, $S(4!) = 650$. -Find $S(100\\,000\\,000!)$ modulo $1\\,000\\,000\\,009$. +Encontre $S(100.000.000!)$ modulo $1.000.000.009$. # --hints-- -`sumSquaresOfUnitaryDivisors()` should return `98792821`. +`sumSquaresOfUnitaryDivisors()` deve retornar `98792821`. ```js assert.strictEqual(sumSquaresOfUnitaryDivisors(), 98792821); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-430-range-flips.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-430-range-flips.md index d8838dbe162..7039242d3ed 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-430-range-flips.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-430-range-flips.md @@ -1,6 +1,6 @@ --- id: 5900f51a1000cf542c51002d -title: 'Problem 430: Range flips' +title: 'Problema 430: Viradas em intervalo' challengeType: 1 forumTopicId: 302101 dashedName: problem-430-range-flips @@ -8,23 +8,23 @@ dashedName: problem-430-range-flips # --description-- -$N$ disks are placed in a row, indexed 1 to $N$ from left to right. +$N$ discos são colocados em uma linha, indexados de 1 a $N$, da esquerda para a direita. -Each disk has a black side and white side. Initially all disks show their white side. +Cada disco tem um lado preto e um lado branco. Inicialmente, todos os discos mostram seu lado branco. -At each turn, two, not necessarily distinct, integers $A$ and $B$ between 1 and $N$ (inclusive) are chosen uniformly at random. All disks with an index from $A$ to $B$ (inclusive) are flipped. +A cada movimento, dois, não necessariamente distintos, números inteiros $A$ e $B$ entre 1 e $N$ (inclusive) são escolhidos uniformemente e aleatoriamente. Todos os discos com um índice de $A$ a $B$ (inclusive) são virados. -The following example shows the case $N = 8$. At the first turn $A = 5$ and $B = 2$, and at the second turn $A = 4$ and $B = 6$. +O exemplo a seguir mostra o caso de $N = 8$. No primeiro movimento, $A = 5$ e $B = 2$. No segundo movimento, $A = 4$ e $B = 6$. -example for N = 8, with first turn A = 5 and B = 2, and second turn A = 4 and B = 6 +exemplo para N = 8, com o primeiro movimento A = 5 e B = 2 e o segundo movimento A = 4 e B = 6 -Let $E(N, M)$ be the expected number of disks that show their white side after $M$ turns. We can verify that $E(3, 1) = \frac{10}{9}$, $E(3, 2) = \frac{5}{3}$, $E(10, 4) ≈ 5.157$ and $E(100, 10) ≈ 51.893$. +Considere $E(N, M)$ como o número de discos esperado mostrando seu lado branco após $M$ movimentos. Podemos verificar que $E(3, 1) = \frac{10}{9}$, $E(3, 2) = \frac{5}{3}$, $E(10, 4) ≈ 5.157$ e $E(100, 10) ≈ 51.893$. -Find $E({10}^{10}, 4000)$. Give your answer rounded to 2 decimal places behind the decimal point. +Encontre $E({10}^{10}, 4000)$. Dê sua resposta arredondada para 2 casas depois da vírgula. # --hints-- -`rangeFlips()` should return `5000624921.38`. +`rangeFlips()` deve retornar `5000624921.38`. ```js assert.strictEqual(rangeFlips(), 5000624921.38); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-431-square-space-silo.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-431-square-space-silo.md index 4199819468b..36ac6c638f1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-431-square-space-silo.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-431-square-space-silo.md @@ -1,6 +1,6 @@ --- id: 5900f51b1000cf542c51002e -title: 'Problem 431: Square Space Silo' +title: 'Problema 431: Silo de espaço quadrado' challengeType: 1 forumTopicId: 302102 dashedName: problem-431-square-space-silo @@ -8,21 +8,21 @@ dashedName: problem-431-square-space-silo # --description-- -Fred the farmer arranges to have a new storage silo installed on his farm and having an obsession for all things square he is absolutely devastated when he discovers that it is circular. Quentin, the representative from the company that installed the silo, explains that they only manufacture cylindrical silos, but he points out that it is resting on a square base. Fred is not amused and insists that it is removed from his property. +Fred, o agricultor, organiza a instalação de um novo silo de armazenamento na sua fazenda e tem uma obsessão por tudo o que é quadrado. Ele fica absolutamente deprimido quando descobre que o silo é circular. Quentin, o representante da empresa que instalou o silo, explica que eles apenas fabricam silos cilíndricos, mas chama a atenção para o fato de que eles estão sobre uma base quadrada. Fred não fica feliz e insiste que seja removido da sua propriedade. -Quick thinking Quentin explains that when granular materials are delivered from above a conical slope is formed and the natural angle made with the horizontal is called the angle of repose. For example if the angle of repose, $\alpha = 30°$, and grain is delivered at the centre of the silo then a perfect cone will form towards the top of the cylinder. In the case of this silo, which has a diameter of 6m, the amount of space wasted would be approximately 32.648388556 m3. However, if grain is delivered at a point on the top which has a horizontal distance of $x$ metres from the centre then a cone with a strangely curved and sloping base is formed. He shows Fred a picture. +Pensando rápido, Quentin explica que, quando os materiais dos grãos são entregues por cima, uma inclinação cônica é formada. O ângulo natural feito com a horizontal é chamado de ângulo de repouso. Por exemplo, se o ângulo de repouso, $\alpha = 30°$, e se os grãos forem entregues no centro do silo, então um cone perfeito se formará em direção ao topo do cilindro. No caso deste silo, que tem um diâmetro de 6 m, a quantidade de espaço desperdiçado seria de aproximadamente 32,648388556 m3. No entanto, se o grão for entregue em um ponto na parte superior que tem uma distância horizontal de $x$ metros do centro, então um cone com uma base estranhamente curvada e inclinada é formado. Ele mostra uma foto para Fred. -image presenting forming of the perfect cone towards the top of the cylinder +imagem apresentando a formação do cone perfeito na direção do topo do cilindro -We shall let the amount of space wasted in cubic metres be given by $V(x)$. If $x = 1.114\\,785\\,284$, which happens to have three squared decimal places, then the amount of space wasted, $V(1.114\\,785\\,284) \approx 36$. Given the range of possible solutions to this problem there is exactly one other option: $V(2.511\\,167\\,869) \approx 49$. It would be like knowing that the square is king of the silo, sitting in splendid glory on top of your grain. +Vamos considerar a quantidade de espaço desperdiçada em metros cúbicos como $V(x)$. Se $x = 1.114.785.284$, que tem três casas decimais quadradas, a quantidade de espaço desperdiçada, $V(1.114.785.284) \approx 36$. Dada a amplitude de soluções possíveis para este problema, há exatamente uma outra opção: $V(2.511.167.869) \approx 49$. Seria como se soubéssemos que o quadrado é o rei do silo, sentado em glória esplêndida em cima de seus grãos. -Fred's eyes light up with delight at this elegant resolution, but on closer inspection of Quentin's drawings and calculations his happiness turns to despondency once more. Fred points out to Quentin that it's the radius of the silo that is 6 metres, not the diameter, and the angle of repose for his grain is 40­°. However, if Quentin can find a set of solutions for this particular silo then he will be more than happy to keep it. +Os olhos de Fred iluminam-se de prazer com esta resolução elegante, mas na inspeção mais atenta dos desenhos e cálculos de Quentin, sua felicidade virou desânimo mais uma vez. Fred aponta para Quentin que é o raio do silo que é 6 metros, não o diâmetro, e o ângulo de repouso para seus grãos é de 40°. No entanto, se Quentin conseguir encontrar uma série de soluções para este silo em particular, ele manterá o silo com prazer. -If Quick thinking Quentin is to satisfy frustratingly fussy Fred the farmer's appetite for all things square then determine the values of $x$ for all possible square space wastage options and calculate $\sum x$ correct to 9 decimal places. +Se Quentin pensar rápido e quiser satisfazer Fred, o fazendeiro frustrado com paixão por todas as coisas quadradas, ele precisa determinar os valores de $x$ para todas as opções de desperdício de espaço quadrado e calcular $\sum x$ corretamente para 9 casas decimais. # --hints-- -`squareSpaceSilo()` should return `23.386029052`. +`squareSpaceSilo()` deve retornar `23.386029052`. ```js assert.strictEqual(squareSpaceSilo(), 23.386029052); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-432-totient-sum.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-432-totient-sum.md index 2a3f5b744d9..9d6886aadac 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-432-totient-sum.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-432-totient-sum.md @@ -1,6 +1,6 @@ --- id: 5900f51e1000cf542c510030 -title: 'Problem 432: Totient sum' +title: 'Problema 432: Soma de totientes' challengeType: 1 forumTopicId: 302103 dashedName: problem-432-totient-sum @@ -8,15 +8,15 @@ dashedName: problem-432-totient-sum # --description-- -Let $S(n, m) = \sum φ(n × i)$ for $1 ≤ i ≤ m$. ($φ$ is Euler's totient function) +Considere $S(n, m) = \sum φ(n × i)$ para $1 ≤ i ≤ m$. ($φ$ é a função totiente de Euler) -You are given that $S(510\\,510, {10}^6) = 45\\,480\\,596\\,821\\,125\\,120$. +Você é informado de que $S(510.510,{10}^6) = 45.480.596.821.125.120$. -Find $S(510\\,510, {10}^{11})$. Give the last 9 digits of your answer. +Encontre $S(510.510, {10}^{11})$. Dê os últimos 9 algarismos da sua resposta. # --hints-- -`totientSum()` should return `754862080`. +`totientSum()` deve retornar `754862080`. ```js assert.strictEqual(totientSum(), 754862080); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-434-rigid-graphs.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-434-rigid-graphs.md index a570e51bccb..63a4fa9baa0 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-434-rigid-graphs.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-434-rigid-graphs.md @@ -1,6 +1,6 @@ --- id: 5900f51f1000cf542c510031 -title: 'Problem 434: Rigid graphs' +title: 'Problema 434: Grafos rígidos' challengeType: 1 forumTopicId: 302105 dashedName: problem-434-rigid-graphs @@ -8,39 +8,39 @@ dashedName: problem-434-rigid-graphs # --description-- -Recall that a graph is a collection of vertices and edges connecting the vertices, and that two vertices connected by an edge are called adjacent. +Lembre-se de que um grafo é uma coleção de vértices e bordas conectando os vértices, e que dois vértices conectados por uma aresta são chamados de adjacentes. -Graphs can be embedded in Euclidean space by associating each vertex with a point in the Euclidean space. +Grafos podem ser incorporados no espaço euclideano associando cada vértice com um ponto nesse espaço. -A flexible graph is an embedding of a graph where it is possible to move one or more vertices continuously so that the distance between at least two nonadjacent vertices is altered while the distances between each pair of adjacent vertices is kept constant. +Um grafo flexível é uma incorporação de um grafo no qual é possível mover um ou mais vértices continuamente para que a distância entre pelo menos dois vértices não adjacentes seja alterada enquanto as distâncias entre cada par de vértices adjacentes seja mantida constante. -A rigid graph is an embedding of a graph which is not flexible. +Um grafo rígido é uma incorporação de um grafo que não é flexível. -Informally, a graph is rigid if by replacing the vertices with fully rotating hinges and the edges with rods that are unbending and inelastic, no parts of the graph can be moved independently from the rest of the graph. +Informalmente, um grafo é rígido se, ao substituir os vértices por dobradiças de rotação completa e as arestas por hastes não elásticas e não curvas, nenhuma parte do grafo poderá se mover de modo independente do resto do grafo. -The grid graphs embedded in the Euclidean plane are not rigid, as the following animation demonstrates: +Os grafos de grade incorporados no plano euclideano não são rígidos, como demonstra a animação a seguir: -animation showing grid graphs are not rigid in Euclidean plane +animação mostrando que os grafos de grade não são rígidos no plano euclideano -However, one can make them rigid by adding diagonal edges to the cells. For example, for the 2x3 grid graph, there are 19 ways to make the graph rigid: +No entanto, é possível torná-los rígidos adicionando arestas diagonais às células. Por exemplo, para o grafo de grade 2x3, há 19 maneiras de tornar o grafo rígido: -19 ways to make 2x3 grid graph rigid +19 maneiras de tornar o grafo de grade 2x3 rígido -Note that for the purposes of this problem, we do not consider changing the orientation of a diagonal edge or adding both diagonal edges to a cell as a different way of making a grid graph rigid. +Observe que, para fins deste problema, não consideramos a troca da orientação de uma aresta diagonal nem adicionar arestas diagonais a uma célula como uma forma diferente de fazer um grafo de grade rígido. -Let $R(m, n)$ be the number of ways to make the $m × n$ grid graph rigid. +Considere $R(m, n)$ como o número de maneiras de tornar um grafo de grade $m × n$ rígido. -E.g. $R(2, 3) = 19$ and $R(5, 5) = 23\\,679\\,901$. +Ex: $R(2, 3) = 19$ e $R(5, 5) = 23.679.901$. -Define $S(N)$ as $\sum R(i, j)$ for $1 ≤ i$, $j ≤ N$. +Defina $S(N)$ como $\sum R(i, j)$ para $1 ≤ i$, $j ≤ N$. -E.g. $S(5) = 25\\,021\\,721$. +Ex: $S(5) = 25.021.721$. -Find $S(100)$, give your answer modulo $1\\,000\\,000\\,033$. +Encontre $S(100)$, dê sua resposta modulo $1.000.000.033$. # --hints-- -`rigidGraphs()` should return `863253606`. +`rigidGraphs()` deve retornar `863253606`. ```js assert.strictEqual(rigidGraphs(), 863253606); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-435-polynomials-of-fibonacci-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-435-polynomials-of-fibonacci-numbers.md index 9df767adcee..8450939e689 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-435-polynomials-of-fibonacci-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-435-polynomials-of-fibonacci-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f5201000cf542c510032 -title: 'Problem 435: Polynomials of Fibonacci numbers' +title: 'Problema 435: Polinômios dos números de Fibonacci' challengeType: 1 forumTopicId: 302106 dashedName: problem-435-polynomials-of-fibonacci-numbers @@ -8,17 +8,17 @@ dashedName: problem-435-polynomials-of-fibonacci-numbers # --description-- -The Fibonacci numbers $\\{f_n, n ≥ 0\\}$ are defined recursively as $f_n = f_{n - 1} + f_{n - 2}$ with base cases $f_0 = 0$ and $f_1 = 1$. +Os números de Fibonacci $\\{f_n, n ≥ 0\\}$ são definidos recursivamente como $f_n = f_{n - 1} + f_{n - 2}$ com casos de base $f_0 = 0$ e $f_1 = 1$. -Define the polynomials $\\{F_n, n ≥ 0\\}$ as $F_n(x) = \displaystyle\sum_{i = 0}^n f_ix^i$. +Defina os polinômios $\\{F_n, n ≥ 0\\}$ como $F_n(x) = \displaystyle\sum_{i = 0}^n f_ix^i$. -For example, $F_7(x) = x + x^2 + 2x^3 + 3x^4 + 5x^5 + 8x^6 + 13x^7$, and $F_7(11) = 268\\,357\\,683$. +Por exemplo, $F_7(x) = x + x^2 + 2x^3 + 3x^4 + 5x^5 + 8x^6 + 13x^7$ e $F_7(11) = 268.357.683$. -Let $n = {10}^{15}$. Find the sum $\displaystyle\sum_{x = 0}^{100} F_n(x)$ and give your answer modulo $1\\,307\\,674\\,368\\,000 \\, (= 15!)$. +Considere $n = {10}^{15}$. Encontre a soma $\displaystyle\sum_{x = 0}^{100} F_n(x)$ e dê sua resposta modulo $1.307.674.368.000 \\, (= 15!)$. # --hints-- -`polynomialsOfFibonacciNumbers()` should return `252541322550`. +`polynomialsOfFibonacciNumbers()` deve retornar `252541322550`. ```js assert.strictEqual(polynomialsOfFibonacciNumbers(), 252541322550); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-436-unfair-wager.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-436-unfair-wager.md index 444c6f95d1b..68057cc3d04 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-436-unfair-wager.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-436-unfair-wager.md @@ -1,6 +1,6 @@ --- id: 5900f5221000cf542c510033 -title: 'Problem 436: Unfair wager' +title: 'Problema 436: Aposta injusta' challengeType: 1 forumTopicId: 302107 dashedName: problem-436-unfair-wager @@ -8,29 +8,29 @@ dashedName: problem-436-unfair-wager # --description-- -Julie proposes the following wager to her sister Louise. +Julie propõe a seguinte aposta à sua irmã Louise. -She suggests they play a game of chance to determine who will wash the dishes. +Ela sugere que joguem um jogo de azar para determinar quem lavará a louça. -For this game, they shall use a generator of independent random numbers uniformly distributed between 0 and 1. +Para esse jogo, elas usarão um gerador de números aleatórios independentes distribuídos uniformemente entre 0 e 1. -The game starts with $S = 0$. +O jogo começa com $S = 0$. -The first player, Louise, adds to $S$ different random numbers from the generator until $S > 1$ and records her last random number '$x$'. +O primeiro jogador, Louise, adiciona a $S$ números aleatórios diferentes do gerador até $S > 1$ e registra seu último número aleatório '$x$'. -The second player, Julie, continues adding to $S$ different random numbers from the generator until $S > 2$ and records her last random number '$y$'. +O segundo jogador, Julie, continua a adicionar a $S$ números aleatórios diferentes do gerador até $S > 2$ e registra seu último número aleatório '$y$'. -The player with the highest number wins and the loser washes the dishes, i.e. if $y > x$ the second player wins. +O jogador com o maior número ganha e o perdedor lava a louça, ou seja, se $y > x$ o segundo jogador vence. -For example, if the first player draws 0.62 and 0.44, the first player turn ends since $0.62 + 0.44 > 1$ and $x = 0.44$. If the second players draws 0.1, 0.27 and 0.91, the second player turn ends since $0.62 + 0.44 + 0.1 + 0.27 + 0.91 > 2$ and $y = 0.91$. Since $y > x$, the second player wins. +Por exemplo, se o primeiro jogador tem 0,62 e 0,44, a vez do primeiro jogador termina, já que $0,62 + 0,44 > 1$ e $x = 0,44$. Se o segundo jogador tem 0,1, 0,27 e 0,91, a vez do segundo jogador termina, já que $0,62 + 0,44 + 0,1 + 0,27 + 0,91 > 2$ e $y = 0,91$. Como $y > x$, o segundo jogador vence. -Louise thinks about it for a second, and objects: "That's not fair". +Louise pensa por uns instantes e declara: "Isso não é justo". -What is the probability that the second player wins? Give your answer rounded to 10 places behind the decimal point in the form 0.abcdefghij +Qual é a probabilidade de o segundo jogador vencer? Arredonde sua resposta para até 10 casas decimais usando o formato 0.abcdefghij # --hints-- -`unfairWager()` should return `0.5276662759`. +`unfairWager()` deve retornar `0.5276662759`. ```js assert.strictEqual(unfairWager(), 0.5276662759); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-437-fibonacci-primitive-roots.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-437-fibonacci-primitive-roots.md index 47f1606285d..b0a4aa8532d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-437-fibonacci-primitive-roots.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-437-fibonacci-primitive-roots.md @@ -1,6 +1,6 @@ --- id: 5900f5241000cf542c510036 -title: 'Problem 437: Fibonacci primitive roots' +title: 'Problema 437: Raízes primitivas de Fibonacci' challengeType: 1 forumTopicId: 302108 dashedName: problem-437-fibonacci-primitive-roots @@ -8,13 +8,13 @@ dashedName: problem-437-fibonacci-primitive-roots # --description-- -When we calculate $8^n$ modulo 11 for $n = 0$ to 9 we get: 1, 8, 9, 6, 4, 10, 3, 2, 5, 7. +Quando calculamos $8^n$ modulo 11 para $n = 0$ a 9, obtemos: 1, 8, 9, 6, 4, 10, 3, 2, 5, 7. -As we see all possible values from 1 to 10 occur. So 8 is a primitive root of 11. +Como vemos todos os valores possíveis, de 1 a 10, ocorrem. Portanto, 8 é uma raiz primitiva de 11. -But there is more: +Mas há mais: -If we take a closer look we see: +Se olharmos mais de perto: $$\begin{align} & 1 + 8 = 9 \\\\ & 8 + 9 = 17 ≡ 6\bmod 11 \\\\ & 9 + 6 = 15 ≡ 4\bmod 11 \\\\ @@ -22,15 +22,15 @@ $$\begin{align} & 1 + 8 = 9 \\\\ & 10 + 3 = 13 ≡ 2\bmod 11 \\\\ & 3 + 2 = 5 \\\\ & 2 + 5 = 7 \\\\ & 5 + 7 = 12 ≡ 1\bmod 11. \end{align}$$ -So the powers of 8 mod 11 are cyclic with period 10, and $8^n + 8^{n + 1} ≡ 8^{n + 2} (\text{mod } 11)$. 8 is called a Fibonacci primitive root of 11. +Portanto, as potências de 8 mod 11 são cíclicas com o período de 10 e $8^n + 8^{n + 1} ≡ 8^{n + 2} (\text{mod } 11)$. 8 é chamado de raiz primitiva de Fibonacci de 11. -Not every prime has a Fibonacci primitive root. There are 323 primes less than 10000 with one or more Fibonacci primitive roots and the sum of these primes is 1480491. +Nem todo número primo tem uma raiz primitiva de Fibonacci. Há 323 números primos menores que 10000 com uma ou mais raízes primitivas de Fibonacci e a soma destes primos é 1480491. -Find the sum of the primes less than $100\\,000\\,000$ with at least one Fibonacci primitive root. +Calcule a soma dos números primos inferiores a $100.000.000$ com pelo menos uma raiz primitiva de Fibonacci. # --hints-- -`fibonacciPrimitiveRoots()` should return `74204709657207`. +`fibonacciPrimitiveRoots()` deve retornar `74204709657207`. ```js assert.strictEqual(fibonacciPrimitiveRoots(), 74204709657207); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-439-sum-of-sum-of-divisors.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-439-sum-of-sum-of-divisors.md index bb5669ed088..738f8d81fca 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-439-sum-of-sum-of-divisors.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-439-sum-of-sum-of-divisors.md @@ -1,6 +1,6 @@ --- id: 5900f5231000cf542c510035 -title: 'Problem 439: Sum of sum of divisors' +title: 'Problema 439: Soma da soma dos divisores' challengeType: 1 forumTopicId: 302110 dashedName: problem-439-sum-of-sum-of-divisors @@ -8,19 +8,19 @@ dashedName: problem-439-sum-of-sum-of-divisors # --description-- -Let $d(k)$ be the sum of all divisors of $k$. +Considere $d(k)$ como a soma de todos os divisores de $k$. -We define the function $S(N) = \sum_{i = 1}^N \sum_{j = 1}^N d(i \times j)$. +Definimos a função $S(N) = \sum_{i = 1}^N \sum_{j = 1}^N d(i \times j)$. -For example, $S(3) = d(1) + d(2) + d(3) + d(2) + d(4) + d(6) + d(3) + d(6) + d(9) = 59$. +Por exemplo, $S(3) = d(1) + d(2) + d(3) + d(2) + d(4) + d(6) + d(3) + d(6) + d(9) = 59$. -You are given that $S({10}^3) = 563\\,576\\,517\\,282$ and $S({10}^5)\bmod {10}^9 = 215\\,766\\,508$. +Você é informado de que $S({10}^3) = 563.576.517.282$ e $S({10}^5)\bmod {10}^9 = 215.766.508$. -Find $S({10}^{11})\bmod {10}^9$. +Encontre $S({10}^{11})\bmod {10}^9$. # --hints-- -`sumOfSumOfDivisors()` should return `968697378`. +`sumOfSumOfDivisors()` deve retornar `968697378`. ```js assert.strictEqual(sumOfSumOfDivisors(), 968697378); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-441-the-inverse-summation-of-coprime-couples.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-441-the-inverse-summation-of-coprime-couples.md index 9c310a1f18d..b2565478ab1 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-441-the-inverse-summation-of-coprime-couples.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-441-the-inverse-summation-of-coprime-couples.md @@ -1,6 +1,6 @@ --- id: 5900f5261000cf542c510038 -title: 'Problem 441: The inverse summation of coprime couples' +title: 'Problema 441: A soma inversa de pares de coprimos' challengeType: 1 forumTopicId: 302113 dashedName: problem-441-the-inverse-summation-of-coprime-couples @@ -8,21 +8,21 @@ dashedName: problem-441-the-inverse-summation-of-coprime-couples # --description-- -For an integer $M$, we define $R(M)$ as the sum of $\frac{1}{p·q}$ for all the integer pairs $p$ and $q$ which satisfy all of these conditions: +Para um número inteiro $M$, definimos $R(M)$ como a soma de $\frac{1}{p·q}$ para todos os pares de números inteiros $p$ e $q$ que satisfazem todas essas condições: - $1 ≤ p < q ≤ M$ - $p + q ≥ M$ -- $p$ and $q$ are coprime. +- $p$ e $q$ são números coprimos. -We also define $S(N)$ as the sum of $R(i)$ for $2 ≤ i ≤ N$. +Também definimos $S(N)$ como a soma de $R(i)$ para $2 ≤ i ≤ N$. -We can verify that $S(2) = R(2) = \frac{1}{2}$, $S(10) ≈ 6.9147$ and $S(100) ≈ 58.2962$. +Podemos verificar que $S(2) = R(2) = \frac{1}{2}$, $S(10) ≈ 6,9147$ e $S(100) ≈ 58,2962$. -Find $S({10}^7)$. Give your answer rounded to four decimal places. +Encontre $S({10}^7)$. Dê sua resposta arredondada para quatro casas decimais. # --hints-- -`inverseSummationCoprimeCouples()` should return `5000088.8395`. +`inverseSummationCoprimeCouples()` deve retornar `5000088.8395`. ```js assert.strictEqual(inverseSummationCoprimeCouples(), 5000088.8395); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-442-eleven-free-integers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-442-eleven-free-integers.md index 9e2e8d90986..6230649dcb8 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-442-eleven-free-integers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-442-eleven-free-integers.md @@ -1,6 +1,6 @@ --- id: 5900f5271000cf542c510039 -title: 'Problem 442: Eleven-free integers' +title: 'Problema 442: Inteiros sem onze' challengeType: 1 forumTopicId: 302114 dashedName: problem-442-eleven-free-integers @@ -8,17 +8,17 @@ dashedName: problem-442-eleven-free-integers # --description-- -An integer is called eleven-free if its decimal expansion does not contain any substring representing a power of 11 except 1. +Um número inteiro pode ser considerado sem onze se a sua expansão decimal não contém nenhuma substring representando uma potência de 11 exceto 1. -For example, 2404 and 13431 are eleven-free, while 911 and 4121331 are not. +Por exemplo, 2404 e 13431 são sem onze, enquanto 911 e 4121331 não são. -Let $E(n)$ be the $n$th positive eleven-free integer. For example, $E(3) = 3$, $E(200) = 213$ and $E(500\\,000) = 531\\,563$. +Considere $E(n)$ como o $n$º número inteiro positivo sem onze. Por exemplo, $E(3) = 3$, $E(200) = 213$ e $E(500.000) = 531.563$. -Find $E({10}^{18})$. +Encontre $E({10}^{18})$. # --hints-- -`elevenFreeIntegers()` should return `1295552661530920200`. +`elevenFreeIntegers()` deve retornar `1295552661530920200`. ```js assert.strictEqual(elevenFreeIntegers(), 1295552661530920200); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-443-gcd-sequence.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-443-gcd-sequence.md index 17fc8db1cb5..b178e13b54f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-443-gcd-sequence.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-443-gcd-sequence.md @@ -1,6 +1,6 @@ --- id: 5900f5271000cf542c51003a -title: 'Problem 443: GCD sequence' +title: 'Problema 443: Sequências de máximos divisores comuns' challengeType: 1 forumTopicId: 302115 dashedName: problem-443-gcd-sequence @@ -8,23 +8,23 @@ dashedName: problem-443-gcd-sequence # --description-- -Let $g(n)$ be a sequence defined as follows: +Considere $g(n)$ como uma sequência definida assim: $$\begin{align} & g(4) = 13, \\\\ - & g(n) = g(n-1) + gcd(n, g(n - 1)) \text{ for } n > 4. \end{align}$$ + & g(n) = g(n-1) + gcd(n, g(n - 1)) \text{ para } n > 4. \end{align}$$ -The first few values are: +Seus primeiros valores são: $$\begin{array}{l} n & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & \ldots \\\\ g(n) & 13 & 14 & 16 & 17 & 18 & 27 & 28 & 29 & 30 & 31 & 32 & 33 & 34 & 51 & 54 & 55 & 60 & \ldots \end{array}$$ -You are given that $g(1\\,000) = 2\\,524$ and $g(1\\,000\\,000) = 2\\,624\\,152$. +Você é informado de que $g(1.000) = 2.524$ e $g(1.000.000) = 2.624.152$. -Find $g({10}^{15})$. +Encontre $g({10}^{15})$. # --hints-- -`gcdSequence()` should return `2744233049300770`. +`gcdSequence()` deve retornar `2744233049300770`. ```js assert.strictEqual(gcdSequence(), 2744233049300770); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-445-retractions-a.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-445-retractions-a.md index 841d3796c7d..30efaaec4cc 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-445-retractions-a.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-445-retractions-a.md @@ -1,6 +1,6 @@ --- id: 5900f52a1000cf542c51003c -title: 'Problem 445: Retractions A' +title: 'Problema 445: Retrações A' challengeType: 1 forumTopicId: 302117 dashedName: problem-445-retractions-a @@ -8,23 +8,23 @@ dashedName: problem-445-retractions-a # --description-- -For every integer $n > 1$, the family of functions $f_{n, a, b}$ is defined by: +Para cada número inteiro $n > 1$, a família de funções $f_{n, a, b}$ é definida por: -$f_{n, a, b}(x) ≡ ax + b\bmod n$ for $a, b, x$ integer and $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$. +$f_{n, a, b}(x) ≡ ax + b\bmod n$ para $a, b, x$ sendo números inteiros e $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$. -We will call $f_{n, a, b}$ a retraction if $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ for every $0 \le x \lt n$. +Chamaremos $f_{n, a, b}$ de retração se $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ para cada $0 \le x \lt n$. -Let $R(n)$ be the number of retractions for $n$. +Considere $R(n)$ como o número de retrações para $n$. -You are given that +Você é informado de que -$$\sum_{k = 1}^{99\\,999} R(\displaystyle\binom{100\\,000}{k}) \equiv 628\\,701\\,600\bmod 1\\,000\\,000\\,007$$ +$$\sum_{k = 1}^{99.999} R(\displaystyle\binom{100.000}{k}) \equiv 628.701.600\bmod 1.000.000.007$$ -Find $$\sum_{k = 1}^{9\\,999\\,999} R(\displaystyle\binom{10\\,000\\,000}{k})$$ Give your answer modulo $1\\,000\\,000\\,007$. +Encontre $$\sum_{k = 1}^{9.999.999} R(\displaystyle\binom{10.000.000}{k})$$ Dê sua resposta modulo $1.000.000.007$. # --hints-- -`retractionsA()` should return `659104042`. +`retractionsA()` deve retornar `659104042`. ```js assert.strictEqual(retractionsA(), 659104042); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-446-retractions-b.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-446-retractions-b.md index f1919d426f5..621920848f5 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-446-retractions-b.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-446-retractions-b.md @@ -1,6 +1,6 @@ --- id: 5900f52c1000cf542c51003d -title: 'Problem 446: Retractions B' +title: 'Problema 446: Retrações B' challengeType: 1 forumTopicId: 302118 dashedName: problem-446-retractions-b @@ -8,23 +8,23 @@ dashedName: problem-446-retractions-b # --description-- -For every integer $n > 1$, the family of functions $f_{n, a, b}$ is defined by: +Para cada número inteiro $n > 1$, a família de funções $f_{n, a, b}$ é definida por: -$f_{n, a, b}(x) ≡ ax + b\bmod n$ for $a, b, x$ integer and $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$. +$f_{n, a, b}(x) ≡ ax + b\bmod n$ para $a, b, x$ sendo números inteiros e $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$. -We will call $f_{n, a, b}$ a retraction if $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ for every $0 \le x \lt n$. +Chamaremos $f_{n, a, b}$ de retração se $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ para cada $0 \le x \lt n$. -Let $R(n)$ be the number of retractions for $n$. +Considere $R(n)$ como o número de retrações para $n$. $F(N) = \displaystyle\sum_{n = 1}^N R(n^4 + 4)$. -$F(1024) = 77\\,532\\,377\\,300\\,600$. +$F(1024) = 77.532.377.300.600$. -Find $F({10}^7)$. Give your answer modulo $1\\,000\\,000\\,007$. +Encontre $F({10}^7)$. Dê a sua resposta modulo $1.000.000.007$. # --hints-- -`retractionsB()` should return `907803852`. +`retractionsB()` deve retornar `907803852`. ```js assert.strictEqual(retractionsB(), 907803852); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-447-retractions-c.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-447-retractions-c.md index 882f61f24d0..c2398421458 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-447-retractions-c.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-447-retractions-c.md @@ -1,6 +1,6 @@ --- id: 5900f52c1000cf542c51003e -title: 'Problem 447: Retractions C' +title: 'Problema 447: Retrações C' challengeType: 1 forumTopicId: 302119 dashedName: problem-447-retractions-c @@ -8,23 +8,23 @@ dashedName: problem-447-retractions-c # --description-- -For every integer $n > 1$, the family of functions $f_{n, a, b}$ is defined by: +Para cada número inteiro $n > 1$, a família de funções $f_{n, a, b}$ é definida por: -$f_{n, a, b}(x) ≡ ax + b\bmod n$ for $a, b, x$ integer and $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$. +$f_{n, a, b}(x) ≡ ax + b\bmod n$ para $a, b, x$ sendo números inteiros e $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$. -We will call $f_{n, a, b}$ a retraction if $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ for every $0 \le x \lt n$. +Chamaremos $f_{n, a, b}$ de retração se $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ para cada $0 \le x \lt n$. -Let $R(n)$ be the number of retractions for $n$. +Considere $R(n)$ como o número de retrações para $n$. $F(N) = \displaystyle\sum_{n = 2}^N R(n)$. -$F({10}^7) ≡ 638\\,042\\,271\bmod 1\\,000\\,000\\,007$. +$F({10}^7) ≡ 638.042.271\bmod 1.000.000.007$. -Find $F({10}^{14})$. Give your answer modulo $1\\,000\\,000\\,007$. +Encontre $F({10}^{14})$. Dê a sua resposta modulo $1.000.000.007$. # --hints-- -`retractionsC()` should return `530553372`. +`retractionsC()` deve retornar `530553372`. ```js assert.strictEqual(retractionsC(), 530553372); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-448-average-least-common-multiple.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-448-average-least-common-multiple.md index 26643961a3e..a20b2a324ac 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-448-average-least-common-multiple.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-448-average-least-common-multiple.md @@ -1,6 +1,6 @@ --- id: 5900f52c1000cf542c51003f -title: 'Problem 448: Average least common multiple' +title: 'Problema 448: Mínimo múltiplo comum médio' challengeType: 1 forumTopicId: 302120 dashedName: problem-448-average-least-common-multiple @@ -8,21 +8,21 @@ dashedName: problem-448-average-least-common-multiple # --description-- -The function $lcm(a, b)$ denotes the least common multiple of $a$ and $b$. +A função $lcm(a, b)$ denota o mínimo múltiplo comum de $a$ e $b$. -Let $A(n)$ be the average of the values of $lcm(n, i)$ for $1 ≤ i ≤ n$. +Considere $A(n)$ como a média dos valores de $lcm(n, i)$ para $1 ≤ i ≤ n$. -E.g: $A(2) = \frac{2 + 2}{2} = 2$ and $A(10) = \frac{10 + 10 + 30 + 20 + 10 + 30 + 70 + 40 + 90 + 10}{10} = 32$. +Por exemplo: $A(2) = \frac{2 + 2}{2} = 2$ e $A(10) = \frac{10 + 10 + 30 + 20 + 10 + 30 + 70 + 40 + 90 + 10}{10} = 32$. -Let $S(n) = \sum A(k)$ for $1 ≤ k ≤ n$. +Considere $S(n) = \sum A(k)$ para $1 ≤ k ≤ n$. -$S(100) = 122\\,726$. +$S(100) = 122.726$. -Find $S(99\\,999\\,999\\,019)\bmod 999\\,999\\,017$. +Encontre $S(99.999.999.019)\bmod 999.999.017$. # --hints-- -`averageLCM()` should return `106467648`. +`averageLCM()` deve retornar `106467648`. ```js assert.strictEqual(averageLCM(), 106467648); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-449-chocolate-covered-candy.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-449-chocolate-covered-candy.md index f312fd4ab49..b42cb457c0a 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-449-chocolate-covered-candy.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-449-chocolate-covered-candy.md @@ -1,6 +1,6 @@ --- id: 5900f52d1000cf542c510040 -title: 'Problem 449: Chocolate covered candy' +title: 'Problema 449: Doce coberto de chocolate' challengeType: 1 forumTopicId: 302121 dashedName: problem-449-chocolate-covered-candy @@ -8,19 +8,19 @@ dashedName: problem-449-chocolate-covered-candy # --description-- -Phil the confectioner is making a new batch of chocolate covered candy. Each candy centre is shaped like an ellipsoid of revolution defined by the equation: $b^2x^2 + b^2y^2 + a^2z^2 = a^2b^2$. +Phil, o doceiro, está fazendo um novo lote de doce coberto de chocolate. Cada centro dos doces tem o formato de um elipsoide de revolução definido pela equação: $b^2x^2 + b^2y^2 + a^2z^2 = a^2b^2$. -Phil wants to know how much chocolate is needed to cover one candy centre with a uniform coat of chocolate one millimeter thick. +Phil quer saber quanto chocolate é necessário para cobrir um centro de doces com uma cobertura uniforme de chocolate com um milímetro de espessura. -If $a = 1$ mm and $b = 1$ mm, the amount of chocolate required is $\frac{28}{3} \pi$ mm3 +Se $a = 1$ mm e $b = 1$ mm, a quantidade de chocolate necessária é $\frac{28}{3} \pi$ mm3 -If $a = 2$ mm and $b = 1$ mm, the amount of chocolate required is approximately 60.35475635 mm3. +Se $a = 2$ mm e $b = 1$ mm, a quantidade de chocolate necessária é de aproximadamente 60,35475635 mm3. -Find the amount of chocolate in mm3 required if $a = 3$ mm and $b = 1$ mm. Give your answer as the number rounded to 8 decimal places behind the decimal point. +Encontre a quantidade de chocolate em mm3 necessária se $a = 3$ mm e $b = 1$ mm. Dê sua resposta como o número arredondado para 8 casas depois da vírgula. # --hints-- -`chocolateCoveredCandy()` should return `103.37870096`. +`chocolateCoveredCandy()` deve retornar `103.37870096`. ```js assert.strictEqual(chocolateCoveredCandy(), 103.37870096); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-450-hypocycloid-and-lattice-points.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-450-hypocycloid-and-lattice-points.md index 9bfd7f5d15a..41d62dbe1ba 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-450-hypocycloid-and-lattice-points.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-450-hypocycloid-and-lattice-points.md @@ -1,6 +1,6 @@ --- id: 5900f52e1000cf542c510041 -title: 'Problem 450: Hypocycloid and Lattice points' +title: 'Problema 450: Pontos da rede e hipocicloide' challengeType: 1 forumTopicId: 302123 dashedName: problem-450-hypocycloid-and-lattice-points @@ -8,36 +8,36 @@ dashedName: problem-450-hypocycloid-and-lattice-points # --description-- -A hypocycloid is the curve drawn by a point on a small circle rolling inside a larger circle. The parametric equations of a hypocycloid centered at the origin, and starting at the right most point is given by: +Um hipocicloide é a curva desenhada por um ponto em um pequeno círculo girando dentro de um círculo maior. As equações paramétricas de um hipocicloide centrado na origem e começando no ponto mais à direita são dadas por: $$x(t) = (R - r) \cos(t) + r \cos(\frac{R - r}{r}t)$$ $$y(t) = (R - r) \sin(t) - r \sin(\frac{R - r}{r} t)$$ -Where $R$ is the radius of the large circle and $r$ the radius of the small circle. +Onde $R$ é o raio do círculo grande e $r$ o raio do círculo pequeno. -Let $C(R, r)$ be the set of distinct points with integer coordinates on the hypocycloid with radius $R$ and $r$ and for which there is a corresponding value of $t$ such that $\sin(t)$ and $\cos(t)$ are rational numbers. +Considere $C(R, r)$ como o conjunto de pontos distintos com coordenadas em números inteiros do hipocicloide com raio $R$ e $r$ e para o qual há um valor correspondente de $t$, tal que $\sin(t)$ e $\cos(t)$ são números racionais. -Let $S(R, r) = \sum\_{(x,y) \in C(R, r)} |x| + |y|$ be the sum of the absolute values of the $x$ and $y$ coordinates of the points in $C(R, r)$. +Considere $S(R, r) = \sum\_{(x,y) \in C(R, r)} |x| + |y|$ como a soma dos valores absolutos das coordenadas $x$ e $y$ dos pontos em $C(R, r)$. -Let $T(N) = \sum_{R = 3}^N \sum_{r=1}^{\left\lfloor \frac{R - 1}{2} \right\rfloor} S(R, r)$ be the sum of $S(R, r)$ for $R$ and $r$ positive integers, $R\leq N$ and $2r < R$. +Considere $T(N) = \sum_{R = 3}^N \sum_{r=1}^{\left\lfloor \frac{R - 1}{2} \right\rfloor} S(R, r)$ como a soma de $S(R, r)$ para $R$ e $r$ sendo números inteiros positivos, $R\leq N$ e $2r < R$. -You are given: +Você é informado de que: $$\begin{align} C(3, 1) = & \\{(3, 0), (-1, 2), (-1,0), (-1,-2)\\} \\\\ C(2500, 1000) = & \\{(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), \\\\ &(68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)\\} \end{align}$$ -**Note:** (-625, 0) is not an element of $C(2500, 1000)$ because $\sin(t)$ is not a rational number for the corresponding values of $t$. +**Observação:** (-625, 0) não é um elemento de $C(2500, 1000)$, pois $\sin(t)$ não é um número racional para os valores correspondentes de $t$. $S(3, 1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10$ -$T(3) = 10$; $T(10) = 524$; $T(100) = 580\\,442$; $T({10}^3) = 583\\,108\\,600$. +$T(3) = 10$; $T(10) = 524$; $T(100) = 580.442$; $T({10}^3) = 583.108.600$. -Find $T({10}^6)$. +Encontre $T({10}^6)$. # --hints-- -`hypocycloidAndLatticePoints()` should return `583333163984220900`. +`hypocycloidAndLatticePoints()` deve retornar `583333163984220900`. ```js assert.strictEqual(hypocycloidAndLatticePoints(), 583333163984220900); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-451-modular-inverses.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-451-modular-inverses.md index 39ebff17846..e4277fb1d99 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-451-modular-inverses.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-451-modular-inverses.md @@ -1,6 +1,6 @@ --- id: 5900f5311000cf542c510042 -title: 'Problem 451: Modular inverses' +title: 'Problema 451: Inversas modulares' challengeType: 1 forumTopicId: 302124 dashedName: problem-451-modular-inverses @@ -8,28 +8,28 @@ dashedName: problem-451-modular-inverses # --description-- -Consider the number 15. +Considere o número 15. -There are eight positive numbers less than 15 which are coprime to 15: 1, 2, 4, 7, 8, 11, 13, 14. +Há oito números positivos inferiores a 15 que são coprimos para 15: 1, 2, 4, 7, 8, 11, 13, 14. -The modular inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11, 7, 14 because +As inversas modulares desses números modulo 15 são: 1, 8, 4, 13, 2, 11, 7, 14, porque $$\begin{align} & 1 \times 1\bmod 15 = 1 \\\\ & 2 \times 8 = 16\bmod 15 = 1 \\\\ & 4 \times 4 = 16\bmod 15 = 1 \\\\ & 7 \times 13 = 91\bmod 15 = 1 \\\\ & 11 \times 11 = 121\bmod 15 = 1 \\\\ & 14 \times 14 = 196\bmod 15 = 1 \end{align}$$ -Let $I(n)$ be the largest positive number $m$ smaller than $n - 1$ such that the modular inverse of $m$ modulo $n$ equals $m$ itself. +Considere $I(n)$ como o maior número positivo $m$ menor que $n - 1$, tal que a inversa modular de $m$ modulo $n$ é igual ao próprio $m$. -So $I(15) = 11$. +Portanto, $I(15) = 11$. -Also $I(100) = 51$ and $I(7) = 1$. +Além disso, $I(100) = 51$ e $I(7) = 1$. -Find $\sum I(n)$ for $3 ≤ n ≤ 2 \times {10}^7$ +Encontre $\sum I(n)$ para $3 ≤ n ≤ 2 \times {10}^7$ # --hints-- -`modularInverses()` should return `153651073760956`. +`modularInverses()` deve retornar `153651073760956`. ```js assert.strictEqual(modularInverses(), 153651073760956); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-452-long-products.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-452-long-products.md index abb043bcebe..7df31fc1746 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-452-long-products.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-452-long-products.md @@ -1,6 +1,6 @@ --- id: 5900f5311000cf542c510043 -title: 'Problem 452: Long Products' +title: 'Problema 452: Produtos longos' challengeType: 1 forumTopicId: 302125 dashedName: problem-452-long-products @@ -8,17 +8,17 @@ dashedName: problem-452-long-products # --description-- -Define $F(m, n)$ as the number of $n$-tuples of positive integers for which the product of the elements doesn't exceed $m$. +Defina $F(m, n)$ como o número de tuplas $n$ de números inteiros positivos para os quais o produto dos elementos não excede $m$. $F(10, 10) = 571$. -$F({10}^6, {10}^6)\bmod 1\\,234\\,567\\,891 = 252\\,903\\,833$. +$F({10}^6, {10}^6)\bmod 1.234.567.891 = 252.903.833$. -Find $F({10}^9, {10}^9)\bmod 1\\,234\\,567\\,891$. +Encontre $F({10}^9, {10}^9)\bmod 1.234.567.891$. # --hints-- -`longProducts()` should return `345558983`. +`longProducts()` deve retornar `345558983`. ```js assert.strictEqual(longProducts(), 345558983); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-453-lattice-quadrilaterals.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-453-lattice-quadrilaterals.md index f809ebc60a5..4f3b72d5a73 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-453-lattice-quadrilaterals.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-453-lattice-quadrilaterals.md @@ -1,6 +1,6 @@ --- id: 5900f5311000cf542c510044 -title: 'Problem 453: Lattice Quadrilaterals' +title: 'Problema 453: Quadriláteros da rede' challengeType: 1 forumTopicId: 302126 dashedName: problem-453-lattice-quadrilaterals @@ -8,21 +8,21 @@ dashedName: problem-453-lattice-quadrilaterals # --description-- -A simple quadrilateral is a polygon that has four distinct vertices, has no straight angles and does not self-intersect. +Um quadrilátero simples é um polígono que tem quatro vértices distintos, não tem ângulos retos e não cruza a si mesmo. -Let $Q(m, n)$ be the number of simple quadrilaterals whose vertices are lattice points with coordinates ($x$, $y$) satisfying $0 ≤ x ≤ m$ and $0 ≤ y ≤ n$. +Considere $Q(m, n)$ como o número de quadriláteros simples cujos vértices são pontos da rede com coordenadas ($x$, $y$) satisfazendo $0 ≤ x ≤ m$ e $0 ≤ y ≤ n$. -For example, $Q(2, 2) = 94$ as can be seen below: +Por exemplo, $Q(2, 2) = 94$ pode ser visto abaixo: -94 quadrilaterals whose vertices are lattice points with coordinates (x, y) satiffying 0 ≤ x ≤ m and 0 ≤ y ≤ n +94 quadriláteros cujos vértices são pontos da rede com coordenadas (x, y) satisfazendo 0 ≤ x ≤ m e 0 ≤ y ≤ n -It can also be verified that $Q(3, 7) = 39\\,590$, $Q(12, 3) = 309\\,000$ and $Q(123, 45) = 70\\,542\\,215\\,894\\,646$. +Também é possível verificar que $Q(3, 7) = 39.590$, $Q(12, 3) = 309.000$ e $Q(123, 45) = 70.542.215.894.646$. -Find $Q(12\\,345, 6\\,789)\bmod 135\\,707\\,531$. +Encontre $Q(12.345, 6.789)\bmod 135.707.531$. # --hints-- -`latticeQuadrilaterals()` should return `104354107`. +`latticeQuadrilaterals()` deve retornar `104354107`. ```js assert.strictEqual(latticeQuadrilaterals(), 104354107); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-454-diophantine-reciprocals-iii.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-454-diophantine-reciprocals-iii.md index b2fca3b4a6b..906cf13e08d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-454-diophantine-reciprocals-iii.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-454-diophantine-reciprocals-iii.md @@ -1,6 +1,6 @@ --- id: 5900f5331000cf542c510045 -title: 'Problem 454: Diophantine reciprocals III' +title: 'Problema 454: Diofantinos recíprocos III' challengeType: 1 forumTopicId: 302127 dashedName: problem-454-diophantine-reciprocals-iii @@ -8,19 +8,19 @@ dashedName: problem-454-diophantine-reciprocals-iii # --description-- -In the following equation $x$, $y$, and $n$ are positive integers. +Na equação a seguir, $x$, $y$ e $n$ são números inteiros positivos. $$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$ -For a limit $L$ we define $F(L)$ as the number of solutions which satisfy $x < y ≤ L$. +Para um limite $L$, definimos $F(L)$ como o número de soluções que satisfazem $x < y ≤ L$. -We can verify that $F(15) = 4$ and $F(1000) = 1069$. +Podemos verificar que $F(15) = 4$ e $F(1000) = 1069$. -Find $F({10}^{12})$. +Encontre $F({10}^{12})$. # --hints-- -`diophantineReciprocalsThree()` should return `5435004633092`. +`diophantineReciprocalsThree()` deve retornar `5435004633092`. ```js assert.strictEqual(diophantineReciprocalsThree(), 5435004633092); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-455-powers-with-trailing-digits.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-455-powers-with-trailing-digits.md index 8e453a983c2..d717157bf89 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-455-powers-with-trailing-digits.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-455-powers-with-trailing-digits.md @@ -1,6 +1,6 @@ --- id: 5900f5331000cf542c510046 -title: 'Problem 455: Powers With Trailing Digits' +title: 'Problema 455: Potências com algarismos à direita' challengeType: 1 forumTopicId: 302129 dashedName: problem-455-powers-with-trailing-digits @@ -8,19 +8,19 @@ dashedName: problem-455-powers-with-trailing-digits # --description-- -Let $f(n)$ be the largest positive integer $x$ less than ${10}^9$ such that the last 9 digits of $n^x$ form the number $x$ (including leading zeros), or zero if no such integer exists. +Considere $f(n)$ como o maior número inteiro positivo $x$ inferior a ${10}^9$, tal que os últimos 9 algarismos de $n^x$ formam o número $x$ (incluindo zeros à esquerda) ou zero, se nenhum número inteiro desse tipo existir. -For example: +Por exemplo: -$$\begin{align} & f(4) = 411\\,728\\,896 (4^{411\\,728\\,896} = ...490\underline{411728896}) \\\\ - & f(10) = 0 \\\\ & f(157) = 743\\,757 (157^{743\\,757} = ...567\underline{000743757}) \\\\ - & Σf(n), 2 ≤ n ≤ 103 = 442\\,530\\,011\\,399 \end{align}$$ +$$\begin{align} & f(4) = 411.728.896 (4^{411.728.896} = ...490\underline{411728896}) \\\\ + & f(10) = 0 \\\\ & f(157) = 743.757 (157^{743.757} = ...567\underline{000743757}) \\\\ + & Σf(n), 2 ≤ n ≤ 103 = 442.530.011.399 \end{align}$$ -Find $\sum f(n)$, $2 ≤ n ≤ {10}^6$. +Encontre $\sum f(n)$, $2 ≤ n ≤ {10}^6$. # --hints-- -`powersWithTrailingDigits()` should return `450186511399999`. +`powersWithTrailingDigits()` deve retornar `450186511399999`. ```js assert.strictEqual(powersWithTrailingDigits(), 450186511399999); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-456-triangles-containing-the-origin-ii.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-456-triangles-containing-the-origin-ii.md index b622b8ac411..4d0029e2641 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-456-triangles-containing-the-origin-ii.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-456-triangles-containing-the-origin-ii.md @@ -1,6 +1,6 @@ --- id: 5900f5351000cf542c510047 -title: 'Problem 456: Triangles containing the origin II' +title: 'Problema 456: Triângulos contendo a origem II' challengeType: 1 forumTopicId: 302130 dashedName: problem-456-triangles-containing-the-origin-ii @@ -8,25 +8,25 @@ dashedName: problem-456-triangles-containing-the-origin-ii # --description-- -Define: +Definição: -$$\begin{align} & x_n = ({1248}^n\bmod 32323) - 16161 \\\\ +$$\start{align} & x_n = ({1248}^n\bmod 32323) - 16161 \\\\ & y_n = ({8421}^n\bmod 30103) - 15051 \\\\ & P_n = \\{(x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n)\\} \end{align}$$ -For example, $$P_8 = \\{(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)\\}$$ +Por exemplo, $$P_8 = \\{(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)\\}$$ -Let $C(n)$ be the number of triangles whose vertices are in $P_n$ which contain the origin in the interior. +Considere $C(n)$ o número de triângulos cujos vértices estão em $P_n$ e que contêm a origem em seu interior. -Examples: +Exemplos: -$$\begin{align} & C(8) = 20 \\\\ - & C(600) = 8\\,950\\,634 \\\\ & C(40\\,000) = 2\\,666\\,610\\,948\\,988 \end{align}$$ +$$\start{align} & C(8) = 20 \\\\ + & C(600) = 8.950.634 \\\\ & C(40.000) = 266.610.948.988 \end{align}$$ -Find $C(2\\,000\\,000)$. +Encontre $C(2.000.000)$. # --hints-- -`trianglesContainingOriginTwo()` should return `333333208685971500`. +`trianglesContainingOriginTwo()` deve retornar `333333208685971500`. ```js assert.strictEqual(trianglesContainingOriginTwo(), 333333208685971500); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-457-a-polynomial-modulo-the-square-of-a-prime.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-457-a-polynomial-modulo-the-square-of-a-prime.md index b187b6c488a..009e9f0b669 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-457-a-polynomial-modulo-the-square-of-a-prime.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-457-a-polynomial-modulo-the-square-of-a-prime.md @@ -1,6 +1,6 @@ --- id: 5900f5361000cf542c510048 -title: 'Problem 457: A polynomial modulo the square of a prime' +title: 'Problema 457: Um módulo polinomial, o quadrado de um primo' challengeType: 1 forumTopicId: 302131 dashedName: problem-457-a-polynomial-modulo-the-square-of-a-prime @@ -8,19 +8,19 @@ dashedName: problem-457-a-polynomial-modulo-the-square-of-a-prime # --description-- -Let $f(n) = n^2 - 3n - 1$. +Considere $f(n) = n^2 - 3n - 1$. -Let $p$ be a prime. +Considere que $p$ é um número primo. -Let $R(p)$ be the smallest positive integer $n$ such that $f(n)\bmod p^2 = 0$ if such an integer $n$ exists, otherwise $R(p) = 0$. +Considere $R(p)$ o menor número inteiro positivo $n$, tal que $f(n)\bmod p^2 = 0$, se um número inteiro $n$ existir. Do contrário, considere que $R(p) = 0$. -Let $SR(L)$ be $\sum R(p)$ for all primes not exceeding $L$. +Considere $SR(L)$ como a $\sum R(p)$ de todos os números primos que não exceda $L$. -Find $SR({10}^7)$. +Encontre $SR({10}^7)$. # --hints-- -`polynomialModuloSquareOfPrime()` should return `2647787126797397000`. +`polynomialModuloSquareOfPrime()` deve retornar `2647787126797397000`. ```js assert.strictEqual(polynomialModuloSquareOfPrime(), 2647787126797397000); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-458-permutations-of-project.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-458-permutations-of-project.md index c368503124d..b7a42ccb091 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-458-permutations-of-project.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-458-permutations-of-project.md @@ -1,6 +1,6 @@ --- id: 5900f5361000cf542c510049 -title: 'Problem 458: Permutations of Project' +title: 'Problema 458: Permutações do projeto' challengeType: 1 forumTopicId: 302132 dashedName: problem-458-permutations-of-project @@ -8,17 +8,17 @@ dashedName: problem-458-permutations-of-project # --description-- -Consider the alphabet $A$ made out of the letters of the word `project`: $A = \\{c, e, j, o, p, r, t\\}$. +Considere o alfabeto $A$ feito das letras da palavra `project`: $A = \\{c, e, j, o, p, r, t\\}$. -Let $T(n)$ be the number of strings of length $n$ consisting of letters from $A$ that do not have a substring that is one of the 5040 permutations of `project`. +Considere $T(n)$ como o número de strings de tamanho $n$ consistindo em letras de $A$ que não têm uma substring que seja uma das 5040 permutações de `project`. -$T(7) = 7^7 - 7! = 818\\,503$. +$T(7) = 7^7 - 7! = 818.503$. -Find $T({10}^{12})$. Give the last 9 digits of your answer. +Encontre $T({10}^{12})$. Dê os últimos 9 algarismos da sua resposta. # --hints-- -`permutationsOfProject()` should return `423341841`. +`permutationsOfProject()` deve retornar `423341841`. ```js assert.strictEqual(permutationsOfProject(), 423341841); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-459-flipping-game.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-459-flipping-game.md index 13473d922bf..b54ea0f3882 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-459-flipping-game.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-459-flipping-game.md @@ -1,6 +1,6 @@ --- id: 5900f5371000cf542c51004a -title: 'Problem 459: Flipping game' +title: 'Problema 459: Jogo de viradas' challengeType: 1 forumTopicId: 302133 dashedName: problem-459-flipping-game @@ -8,35 +8,35 @@ dashedName: problem-459-flipping-game # --description-- -The flipping game is a two player game played on a $N$ by $N$ square board. +O jogo de viradas é um jogo de dois jogadores jogado em um tabuleiro quadrado de $N$ por $N$. -Each square contains a disk with one side white and one side black. +Cada quadrado contém um disco com um lado branco e um lado preto. -The game starts with all disks showing their white side. +O jogo termina quando todos os discos mostrarem seu lado branco. -A turn consists of flipping all disks in a rectangle with the following properties: +Um movimento consiste em virar todos os discos em um retângulo com as seguintes propriedades: -- the upper right corner of the rectangle contains a white disk -- the rectangle width is a perfect square (1, 4, 9, 16, ...) -- the rectangle height is a triangular number (1, 3, 6, 10, ...) +- o canto superior direito do retângulo consiste em um disco branco +- a largura do retângulo é um quadrado perfeito (1, 4, 9, 16, ...) +- a altura do retângulo é um número triangular (1, 3, 6, 10, ...) -flipping all disks in a 4x3 rectangle on a 5x5 board +virando todos os discos em um retângulo de 4x3 em um tabuleiro de 5x5 -Players alternate turns. A player wins by turning the grid all black. +Os jogadores alternam a vez. Um jogador ganha ao tornar a grade toda preta. -Let $W(N)$ be the number of winning moves for the first player on a $N$ by $N$ board with all disks white, assuming perfect play. +Considere $W(N)$ como o número de movimentos vencedores para o primeiro jogador em um tabuleiro $N$ por $N$ com todos os discos brancos, assumindo uma jogada perfeita. -$W(1) = 1$, $W(2) = 0$, $W(5) = 8$ and $W({10}^2) = 31\\,395$. +$W(1) = 1$, $W(2) = 0$, $W(5) = 8$ e $W({10}^2) = 31.395$. -For $N = 5$, the first player's eight winning first moves are: +Para $N = 5$, os oito primeiros movimentos vencedores do primeiro jogador são: -eight winning first moves for N = 5 +oito primeiros movimentos vencedores para N = 5 -Find $W({10}^6)$. +Encontre $W({10}^6)$. # --hints-- -`flippingGame()` should return `3996390106631`. +`flippingGame()` deve retornar `3996390106631`. ```js assert.strictEqual(flippingGame(), 3996390106631); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-461-almost-pi.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-461-almost-pi.md index 1ff7e49ee6b..bf9b786c5b2 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-461-almost-pi.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-461-almost-pi.md @@ -1,6 +1,6 @@ --- id: 5900f53a1000cf542c51004c -title: 'Problem 461: Almost Pi' +title: 'Problema 461: Quase pi' challengeType: 1 forumTopicId: 302136 dashedName: problem-461-almost-pi @@ -8,43 +8,43 @@ dashedName: problem-461-almost-pi # --description-- -Let `f(k, n)` = $e^\frac{k}{n} - 1$, for all non-negative integers `k`. +Considere `f(k, n)` = $e^\frac{k}{n} - 1$, para todos os números inteiros não negativos `k`. -Remarkably, `f(6, 200) + f(75, 200) + f(89, 200) + f(226, 200)` = 3.1415926… ≈ π. +Notadamente, `f(6, 200) + f(75, 200) + f(89, 200) + f(226, 200)` = 3.1415926… ≈ π. -In fact, it is the best approximation of π of the form `f(a, 200) + f(b, 200) + f(c, 200) + f(d, 200)`. +De fato, essa é a melhor aproximação de π da forma `f(a, 200) + f(b, 200) + f(c, 200) + f(d, 200)`. -Let `almostPi(n)` = a2 + b2 + c2 + d2 for a, b, c, d that minimize the error: $\lvert f(a,n) + f(b,n) + f(c,n) + f(d,n) - \Pi\rvert$ +Considere `almostPi(n)` = a2 + b2 + c2 + d2 para a, b, c, d que minimiza o erro: $\lvert f(a,n) + f(b,n) + f(c,n) + f(d,n) - \Pi\rvert$ -You are given `almostPi(200)` = 62 + 752 + 892 + 2262 = 64658. +Você é informado de que `almostPi(200)` = 62 + 752 + 892 + 2262 = 64658. # --hints-- -`almostPi` should be a function. +`almostPi` deve ser uma função. ```js assert(typeof almostPi === 'function') ``` -`almostPi` should return a number. +`almostPi` deve retornar um número. ```js assert.strictEqual(typeof almostPi(10), 'number'); ``` -`almostPi(29)` should return `1208`. +`almostPi(29)` deve retornar `1208`. ```js assert.strictEqual(almostPi(29), 1208); ``` -`almostPi(50)` should return `4152`. +`almostPi(50)` deve retornar `4152`. ```js assert.strictEqual(almostPi(50), 4152); ``` -`almostPi(200)` should return `64658`. +`almostPi(200)` deve retornar `64658`. ```js assert.strictEqual(almostPi(200), 64658); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-462-permutation-of-3-smooth-numbers.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-462-permutation-of-3-smooth-numbers.md index b17dc1befcd..5b1b41da08e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-462-permutation-of-3-smooth-numbers.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-462-permutation-of-3-smooth-numbers.md @@ -1,6 +1,6 @@ --- id: 5900f53b1000cf542c51004d -title: 'Problem 462: Permutation of 3-smooth numbers' +title: 'Problema 462: Permutação de números três harmoniosos' challengeType: 1 forumTopicId: 302137 dashedName: problem-462-permutation-of-3-smooth-numbers @@ -8,31 +8,31 @@ dashedName: problem-462-permutation-of-3-smooth-numbers # --description-- -A 3-smooth number is an integer which has no prime factor larger than 3. For an integer $N$, we define $S(N)$ as the set of 3-smooth numbers less than or equal to $N$. For example, $S(20) = \\{1, 2, 3, 4, 6, 8, 9, 12, 16, 18\\}$. +Um número 3 harmonioso é um número inteiro que não tem fatores primos maiores que 3. Para um número inteiro $N$, definimos $S(N)$ como o conjunto de números 3 harmoniosos menores ou iguais a $N$. Por exemplo, $S(20) = \\{1, 2, 3, 4, 6, 8, 9, 12, 16, 18\\}$. -We define $F(N)$ as the number of permutations of $S(N)$ in which each element comes after all of its proper divisors. +Definimos $F(N)$ como o número de permutações de $S(N)$ em que cada elemento vem depois de todos os seus divisores apropriados. -This is one of the possible permutations for $N = 20$. +Esta é uma das permutações possíveis para $N = 20$. - 1, 2, 4, 3, 9, 8, 16, 6, 18, 12. -This is not a valid permutation because 12 comes before its divisor 6. +Esta não é uma permutação válida porque 12 vem antes do seu divisor 6. - 1, 2, 4, 3, 9, 8, 12, 16, 6, 18. -We can verify that $F(6) = 5$, $F(8) = 9$, $F(20) = 450$ and $F(1000) ≈ 8.8521816557e\\,21$. +Podemos verificar que $F(6) = 5$, $F(8) = 9$, $F(20) = 450$ e $F(1000) ≈ 8.8521816557e.21$. -Find $F({10}^{18})$. Give as your answer as a string in its scientific notation rounded to ten digits after the decimal point. When giving your answer, use a lowercase `e` to separate mantissa and exponent. E.g. if the answer is $112\\,233\\,445\\,566\\,778\\,899$ then the answer format would be `1.1223344557e17`. +Encontre $F({10}^{18})$. Dê sua resposta como uma string em notação científica arredondada para dez algarismos depois da vírgula. Ao dar sua resposta, use letra minúscula `e` para separar a mantissa e o expoente. Ex: se a resposta é $112.233.445.566.778.899$, o formato da resposta seria `1.1223344557e17`. # --hints-- -`permutationOf3SmoothNumbers()` should return a string. +`permutationOf3SmoothNumbers()` deve retornar uma string. ```js assert.strictEqual(typeof permutationOf3SmoothNumbers() === 'string'); ``` -`permutationOf3SmoothNumbers()` should return the string `5.5350769703e1512`. +`permutationOf3SmoothNumbers()` deve retornar a string `5.5350769703e1512`. ```js assert.strictEqual(permutationOf3SmoothNumbers(), '5.5350769703e1512'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-463-a-weird-recurrence-relation.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-463-a-weird-recurrence-relation.md index a8e3607195e..4769a71226f 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-463-a-weird-recurrence-relation.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-463-a-weird-recurrence-relation.md @@ -1,6 +1,6 @@ --- id: 5900f53c1000cf542c51004e -title: 'Problem 463: A weird recurrence relation' +title: 'Problema 463: Uma relação de recorrência estranha' challengeType: 1 forumTopicId: 302138 dashedName: problem-463-a-weird-recurrence-relation @@ -8,21 +8,21 @@ dashedName: problem-463-a-weird-recurrence-relation # --description-- -The function $f$ is defined for all positive integers as follows: +A função $f$ é definida para todos os números inteiros positivos da seguinte forma: $$\begin{align} & f(1) = 1 \\\\ & f(3) = 3 \\\\ & f(2n) = f(n) \\\\ & f(4n + 1) = 2f(2n + 1) - f(n) \\\\ & f(4n + 3) = 3f(2n + 1) - 2f(n) \end{align}$$ -The function $S(n)$ is defined as $\sum_{i=1}^{n} f(i)$. +A função $S(n)$ é definida como $\sum_{i=1}^{n} f(i)$. -$S(8) = 22$ and $S(100) = 3604$. +$S(8) = 22$ e $S(100) = 3604$. -Find $S(3^{37})$. Give the last 9 digits of your answer. +Encontre $S(3^{37})$. Dê os últimos 9 algarismos da sua resposta. # --hints-- -`weirdRecurrenceRelation()` should return `808981553`. +`weirdRecurrenceRelation()` deve retornar `808981553`. ```js assert.strictEqual(weirdRecurrenceRelation(), 808981553); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-465-polar-polygons.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-465-polar-polygons.md index 57ad5b291d6..3b9db813bac 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-465-polar-polygons.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-465-polar-polygons.md @@ -1,6 +1,6 @@ --- id: 5900f53d1000cf542c510050 -title: 'Problem 465: Polar polygons' +title: 'Problema 465: Polígonos polares' challengeType: 1 forumTopicId: 302140 dashedName: problem-465-polar-polygons @@ -8,27 +8,27 @@ dashedName: problem-465-polar-polygons # --description-- -The kernel of a polygon is defined by the set of points from which the entire polygon's boundary is visible. We define a polar polygon as a polygon for which the origin is strictly contained inside its kernel. +O núcleo de um polígono é definido pelo conjunto de pontos a partir dos quais todo o limite do polígono é visível. Definimos um polígono polar como um polígono para o qual a origem está estritamente contida no seu núcleo. -For this problem, a polygon can have collinear consecutive vertices. However, a polygon still cannot have self-intersection and cannot have zero area. +Para este problema, um polígono pode ter vértices consecutivos colineares. No entanto, um polígono ainda não pode ter autointerseções e não pode ter uma área igual a zero. -For example, only the first of the following is a polar polygon (the kernels of the second, third, and fourth do not strictly contain the origin, and the fifth does not have a kernel at all): +Por exemplo, apenas o primeiro dos polígonos a seguir é um polígono polar (os núcleos do segundo, terceiro e quarto não contêm estritamente a origem e o quinto nem sequer tem um núcleo): -five example polygons +cinco exemplos de polígonos -Notice that the first polygon has three consecutive collinear vertices. +Observe que o primeiro polígono tem três vértices colineares consecutivos. -Let $P(n)$ be the number of polar polygons such that the vertices $(x, y)$ have integer coordinates whose absolute values are not greater than $n$. +Considere $P(n)$ como o número de polígonos polares, tal que os vértices $(x, y)$ têm coordenadas em números inteiros, cujos valores absolutos não são maiores do que $n$. -Note that polygons should be counted as different if they have different set of edges, even if they enclose the same area. For example, the polygon with vertices [(0,0), (0,3), (1,1), (3,0)] is distinct from the polygon with vertices [(0,0), (0,3), (1,1), (3,0), (1,0)]. +Observe que os polígonos devem ser contados como diferentes se tiverem um grupo de arestas diferentes, mesmo que envolvam a mesma área. Por exemplo, o polígono com vértices [(0,0), (0,3), (1,1), (3,0)] é diferente do polígono com vértices [(0,0), (0,3), (1,1), (3,0), (1,0)]. -For example, $P(1) = 131$, $P(2) = 1\\,648\\,531$, $P(3) = 1\\,099\\,461\\,296\\,175$ and $P(343)\bmod 1\\,000\\,000\\,007 = 937\\,293\\,740$. +Por exemplo, $P(1) = 131$, $P(2) = 1.648.531$, $P(3) = 1.099.461.296.175$ e $P(343)\bmod 1.000.000.007 = 937.293.740$. -Find $P(7^{13})\bmod 1\\,000\\,000\\,007$. +Encontre $P(7^{13})\bmod 1.000.000.007$. # --hints-- -`polarPolygons()` should return `585965659`. +`polarPolygons()` deve retornar `585965659`. ```js assert.strictEqual(polarPolygons(), 585965659); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-466-distinct-terms-in-a-multiplication-table.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-466-distinct-terms-in-a-multiplication-table.md index cfefe6e7b9f..83130419a39 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-466-distinct-terms-in-a-multiplication-table.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-466-distinct-terms-in-a-multiplication-table.md @@ -1,6 +1,6 @@ --- id: 5900f53e1000cf542c510051 -title: 'Problem 466: Distinct terms in a multiplication table' +title: 'Problema 466: Termos distintos em uma tabela de multiplicação' challengeType: 1 forumTopicId: 302141 dashedName: problem-466-distinct-terms-in-a-multiplication-table @@ -8,27 +8,27 @@ dashedName: problem-466-distinct-terms-in-a-multiplication-table # --description-- -Let $P(m,n)$ be the number of distinct terms in an $m×n$ multiplication table. +Considere $P(m,n)$ como o número de termos distintos em uma tabela de multiplicação de $m×n$. -For example, a 3×4 multiplication table looks like this: +Por exemplo, uma tabela de multiplicação 3×4 fica assim: $$\begin{array}{c} × & \mathbf{1} & \mathbf{2} & \mathbf{3} & \mathbf{4} \\\\ \mathbf{1} & 1 & 2 & 3 & 4 \\\\ \mathbf{2} & 2 & 4 & 6 & 8 \\\\ \mathbf{3} & 3 & 6 & 9 & 12 \end{array}$$ -There are 8 distinct terms {1, 2, 3, 4, 6, 8, 9, 12}, therefore $P(3, 4) = 8$. +Existem 8 termos distintos {1, 2, 3, 4, 6, 8, 9, 12}, portanto $P(3, 4) = 8$. -You are given that: +Você é informado de que: -$$\begin{align} & P(64, 64) = 1\\,263, \\\\ - & P(12, 345) = 1\\,998, \text{ and} \\\\ & P(32, {10}^{15}) = 13\\,826\\,382\\,602\\,124\\,302. \\\\ +$$\begin{align} & P(64, 64) = 1.263, \\\\ + & P(12, 345) = 1.998, \text{ e} \\\\ & P(32, {10}^{15}) = 13.826.382.602.124.302. \\\\ \end{align}$$ -Find $P(64, {10}^{16})$. +Encontre $P(64, {10}^{16})$. # --hints-- -`multiplicationTable()` should return `258381958195474750`. +`multiplicationTable()` deve retornar `258381958195474750`. ```js assert.strictEqual(multiplicationTable(), 258381958195474750); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-467-superinteger.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-467-superinteger.md index 9b0caad1704..98dac2e4862 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-467-superinteger.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-467-superinteger.md @@ -1,6 +1,6 @@ --- id: 5900f5411000cf542c510052 -title: 'Problem 467: Superinteger' +title: 'Problema 467: Superinteiro' challengeType: 1 forumTopicId: 302142 dashedName: problem-467-superinteger @@ -8,32 +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$. +Um inteiro $s$ é chamado de superinteiro de outro inteiro $n$ se os algarismos de $n$ formarem uma subsequência dos algarismos de $s$. -For example, 2718281828 is a superinteger of 18828, while 314159 is not a superinteger of 151. +Por exemplo, 2718281828 é um superinteiro de 18828, enquanto 314159 não é um superinteiro de 151. -Let $p(n)$ be the $n$th prime number, and let $c(n)$ be the $n$th composite number. For example, $p(1) = 2$, $p(10) = 29$, $c(1) = 4$ and $c(10) = 18$. +Considere $p(n)$ como o número primo $n$ e $c(n)$ como o $n$º número composto. Por exemplo, $p(1) = 2$, $p(10) = 29$, $c(1) = 4$ e $c(10) = 18$. $$\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 $P^D$ the sequence of the digital roots of $\\{p(i)\\}$ ($C^D$ is defined similarly for $\\{c(i)\\}$): +Considere $P^D$ como a sequência de raízes dos algarismos de $\\{p(i)\\}$ ($C^D$ é definido da mesma forma para $\\{c(i)\\}$): $$\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}$$ -Let $P_n$ be the integer formed by concatenating the first $n$ elements of $P^D$ ($C_n$ is defined similarly for $C^D$). +Considere $P_n$ como o número inteiro formado concatenando os primeiros $n$ elementos de $P^D$ ($C_n$ é definido de modo semelhante para $C^D$). -$$\begin{align} & P_{10} = 2\\,357\\,248\\,152 \\\\ - & C_{10} = 4\\,689\\,135\\,679 \end{align}$$ +$$\begin{align} & P_{10} = 2.357.248.152 \\\\ + & C_{10} = 4.689.135.679 \end{align}$$ -Let $f(n)$ be the smallest positive integer that is a common superinteger of $P_n$ and $C_n$. For example, $f(10) = 2\\,357\\,246\\,891\\,352\\,679$, and $f(100)\bmod 1\\,000\\,000\\,007 = 771\\,661\\,825$. +Considere $f(n)$ como o menor número inteiro positivo que seja um superinteiro comum de $P_n$ e $C_n$. Por exemplo, $f(10) = 2.357.246.891.352.679$ e $f(100)\bmod 1.000.000.007 = 771.661.825$. -Find $f(10\\,000)\bmod 1\\,000\\,000\\,007$. +Encontre $f(10.000)\bmod 1.000.000.007$. # --hints-- -`superinteger()` should return `775181359`. +`superinteger()` deve retornar `775181359`. ```js assert.strictEqual(superinteger(), 775181359); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-469-empty-chairs.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-469-empty-chairs.md index 3dce49fdd9a..ac091bdea0c 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-469-empty-chairs.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-469-empty-chairs.md @@ -1,6 +1,6 @@ --- id: 5900f5411000cf542c510053 -title: 'Problem 469: Empty chairs' +title: 'Problema 469: Cadeiras vazias' challengeType: 1 forumTopicId: 302144 dashedName: problem-469-empty-chairs @@ -8,21 +8,21 @@ dashedName: problem-469-empty-chairs # --description-- -In a room $N$ chairs are placed around a round table. +Em uma sala, $N$ cadeiras são colocadas ao redor de uma mesa redonda. -Knights enter the room one by one and choose at random an available empty chair. +Cavaleiros entram na sala um por um e escolhem aleatoriamente uma cadeira vazia disponível. -To have enough elbow room the knights always leave at least one empty chair between each other. +Para ter espaço suficiente, os cavaleiros sempre deixam pelo menos uma cadeira vazia entre eles. -When there aren't any suitable chairs left, the fraction $C$ of empty chairs is determined. We also define $E(N)$ as the expected value of $C$. +Quando não sobrar nenhuma cadeira apropriada, a fração $C$ de cadeiras vazias é determinada. Também definimos $E(N)$ como o valor esperado de $C$. -We can verify that $E(4) = \frac{1}{2}$ and $E(6) = \frac{5}{9}$. +Podemos verificar que $E(4) = \frac{1}{2}$ e $E(6) = \frac{5}{9}$. -Find $E({10}^{18})$. Give your answer rounded to fourteen decimal places in the form 0.abcdefghijklmn. +Encontre $E({10}^{18})$. Arredonde sua resposta para até catorze casas decimais usando o formato 0.abcdefghijklmn. # --hints-- -`emptyChairs()` should return `0.56766764161831`. +`emptyChairs()` deve retornar `0.56766764161831`. ```js assert.strictEqual(emptyChairs(), 0.56766764161831); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-470-super-ramvok.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-470-super-ramvok.md index 7d0f1aad0ee..451d65200f4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-470-super-ramvok.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-470-super-ramvok.md @@ -1,6 +1,6 @@ --- id: 5900f5431000cf542c510055 -title: 'Problem 470: Super Ramvok' +title: 'Problema 470: Super Ramvok' challengeType: 1 forumTopicId: 302146 dashedName: problem-470-super-ramvok @@ -8,23 +8,23 @@ dashedName: problem-470-super-ramvok # --description-- -Consider a single game of Ramvok: +Considere um único jogo de Ramvok: -Let $t$ represent the maximum number of turns the game lasts. If $t = 0$, then the game ends immediately. Otherwise, on each turn $i$, the player rolls a die. After rolling, if $i < t$ the player can either stop the game and receive a prize equal to the value of the current roll, or discard the roll and try again next turn. If $i = t$, then the roll cannot be discarded and the prize must be accepted. Before the game begins, $t$ is chosen by the player, who must then pay an up-front cost $ct$ for some constant $c$. For $c = 0$, $t$ can be chosen to be infinite (with an up-front cost of 0). Let $R(d, c)$ be the expected profit (i.e. net gain) that the player receives from a single game of optimally-played Ramvok, given a fair $d$-sided die and cost constant $c$. For example, $R(4, 0.2) = 2.65$. Assume that the player has sufficient funds for paying any/all up-front costs. +$t$ representa o número máximo de turnos que o jogo dura. Se $t = 0$, então o jogo termina imediatamente. Caso contrário, em cada turno $i$, o jogador rola um dado. Depois de rolar, se $i < t$, o jogador pode parar o jogo e receber um prêmio igual ao valor da rolada de dados atual, ou descartar a rolada e tentar novamente no próximo turno. Se $i = t$, a rolada não pode ser descartada e o prêmio deve ser aceito. Antes de o jogo começar, $t$ é escolhido pelo jogador, que deve pagar um custo inicial $ct$ para algum $c$ constante. Para $c = 0$, $t$ pode ser escolhido como infinito (com um custo adiantado de 0). Considere $R(d, c)$ como o lucro esperado (ou seja, ganho líquido) que o jogador recebe de uma única partida de Ramvok jogado de maneira ideal, dado que o dado de $d$ lados é justo e com custo constante de $c$. Por exemplo, $R(4, 0,2) = 2,65$. Suponha que o jogador tem fundos suficientes para pagar todo e qualquer custo inicial. -Now consider a game of Super Ramvok: +Agora considere um jogo de Super Ramvok: -In Super Ramvok, the game of Ramvok is played repeatedly, but with a slight modification. After each game, the die is altered. The alteration process is as follows: The die is rolled once, and if the resulting face has its pips visible, then that face is altered to be blank instead. If the face is already blank, then it is changed back to its original value. After the alteration is made, another game of Ramvok can begin (and during such a game, at each turn, the die is rolled until a face with a value on it appears). The player knows which faces are blank and which are not at all times. The game of Super Ramvok ends once all faces of the die are blank. +No Super Ramvok, o jogo de Ramvok é jogado repetidamente, mas com uma pequena modificação. Após cada jogo, o dado é alterado. O processo de alteração é o seguinte: o dado é rolado uma vez. Se a face resultante tem seus pontos visíveis, então essa face é alterada para ficar em branco. Se a face já for branca, então ela é alterada de volta para seu valor original. Após a alteração ser feita, outro jogo de Ramvok pode começar (e durante esse jogo, a cada turno, o dado é rolado até que uma face com valor apareça). O jogador sabe quais faces estão em branco e quais não estão em todas as ocasiões. O jogo do Super Ramvok termina uma vez que todas as faces do dado estejam em branco. -Let $S(d, c)$ be the expected profit that the player receives from an optimally-played game of Super Ramvok, given a fair $d$-sided die to start (with all sides visible), and cost constant $c$. For example, $S(6, 1) = 208.3$. +Considere $S(d, c)$ como o lucro esperado que o jogador recebe de um jogo ideal de Super Ramvok, levando em conta um dado de $d$ lados justo para começar (com todos os lados visíveis) e custo $c$ constante. Por exemplo, $S(6, 1) = 208,3$. -Let $F(n) = \sum_{4 ≤ d ≤ n} \sum_{0 ≤ c ≤ n} S(d, c)$. +Considere $F(n) = \sum_{4 ≤ d ≤ n} \sum_{0 ≤ c ≤ n} S(d, c)$. -Calculate $F(20)$, rounded to the nearest integer. +Calcule $F(20)$, arredondado para o número inteiro mais próximo. # --hints-- -`superRamvok()` should return `147668794`. +`superRamvok()` deve retornar `147668794`. ```js assert.strictEqual(superRamvok(), 147668794); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-471-triangle-inscribed-in-ellipse.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-471-triangle-inscribed-in-ellipse.md index 87fba0ff50a..01f8250510b 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-471-triangle-inscribed-in-ellipse.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-471-triangle-inscribed-in-ellipse.md @@ -1,6 +1,6 @@ --- id: 5900f5431000cf542c510056 -title: 'Problem 471: Triangle inscribed in ellipse' +title: 'Problema 471: Triângulo inscrito na elipse' challengeType: 1 forumTopicId: 302148 dashedName: problem-471-triangle-inscribed-in-ellipse @@ -8,33 +8,33 @@ dashedName: problem-471-triangle-inscribed-in-ellipse # --description-- -The triangle $ΔABC$ is inscribed in an ellipse with equation $\frac{x^2}{a^2} + \frac{y^2}{b^2} = 1$, $0 < 2b < a$, $a$ and $b$ integers. +O triângulo $ΔABC$ está inscrito em uma elipse com equação $\frac{x^2}{a^2} + \frac{y^2}{b^2} = 1$, $0 < 2b < a$, $a$ e $b$ sendo números inteiros. -Let $r(a, b)$ be the radius of the incircle of $ΔABC$ when the incircle has center $(2b, 0)$ and $A$ has coordinates $\left(\frac{a}{2}, \frac{\sqrt{3}}{2}b\right)$. +Considere $r(a, b)$ como o raio do círculo interno de $ΔABC$ quando este tem o centro $(2b, 0)$ e $A$ tem coordenadas $\left(\frac{a}{2}, \frac{\sqrt{3}}{2}b\right)$. -For example, $r(3, 1) = \frac{1}{2}, r(6, 2) = 1, r(12, 3) = 2$. +Por exemplo, $r(3, 1) = \frac{1}{2}, r(6, 2) = 1, r(12, 3) = 2$. -triangle ΔABC inscribed in an ellipse, radius of the incircle of ΔABC r(6, 2) = 1 +triângulo ΔABC inscrito em uma elipse, raio do círculo interno de ΔABC r(6, 2) = 1 -triangle ΔABC inscribed in an ellipse, radius of the incircle of ΔABC r(12, 3) = 2 +triângulo ΔABC inscrito em uma elipse, raio do círculo interno de ΔABC r(12, 3) = 2 -Let $G(n) = \sum_{a = 3}^n \sum_{b = 1}^{\left\lfloor\frac{a - 1}{2} \right\rfloor} r(a, b)$ +Considere $G(n) = \sum_{a = 3}^n \sum_{b = 1}^{\left\lfloor\frac{a - 1}{2} \right\rfloor} r(a, b)$ -You are given $G(10) = 20.59722222$, $G(100) = 19223.60980$ (rounded to 10 significant digits). +Você é informado de que $G(10) = 20,59722222$, $G(100) = 19223,60980$ (arredondado para 10 dígitos significativos). -Find $G({10}^{11})$. Give your answer as a string in scientific notation rounded to 10 significant digits. Use a lowercase `e` to separate mantissa and exponent. +Encontre $G({10}^{11})$. Dê sua resposta como uma string em notação científica arredondada para 10 algarismos significativos. Use `e` em letra minúscula para separar a mantissa do expoente. -For $G(10)$ the answer would have been `2.059722222e1` +Para $G(10)$, a resposta seria `2.059722222e1` # --hints-- -`triangleInscribedInEllipse()` should return a string. +`triangleInscribedInEllipse()` deve retornar uma string. ```js assert(typeof triangleInscribedInEllipse() === 'string'); ``` -`triangleInscribedInEllipse()` should return the string `1.895093981e31`. +`triangleInscribedInEllipse()` deve retornar a string `1.895093981e31`. ```js assert.strictEqual(triangleInscribedInEllipse(), '1.895093981e31'); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-472-comfortable-distance-ii.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-472-comfortable-distance-ii.md index 25c9c601cf6..a694ef54c0d 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-472-comfortable-distance-ii.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-472-comfortable-distance-ii.md @@ -1,6 +1,6 @@ --- id: 5900f5451000cf542c510057 -title: 'Problem 472: Comfortable Distance II' +title: 'Problema 472: Distância confortável II' challengeType: 1 forumTopicId: 302149 dashedName: problem-472-comfortable-distance-ii @@ -8,29 +8,29 @@ dashedName: problem-472-comfortable-distance-ii # --description-- -There are $N$ seats in a row. $N$ people come one after another to fill the seats according to the following rules: +Existem $N$ assentos em uma fila. $N$ pessoas vêm umas atrás das outras para preencher os lugares de acordo com as seguintes regras: -1. No person sits beside another. -1. The first person chooses any seat. -1. Each subsequent person chooses the seat furthest from anyone else already seated, as long as it does not violate rule 1. If there is more than one choice satisfying this condition, then the person chooses the leftmost choice. +1. Nenhuma pessoa se senta ao lado de outra. +1. A primeira pessoa escolhe qualquer assento. +1. Cada pessoa subsequente escolhe o assento mais distante de qualquer outra pessoa já sentada, desde que não viole a regra 1. Se houver mais de uma escolha satisfazendo esta condição, então a pessoa escolhe a mais à esquerda. -Note that due to rule 1, some seats will surely be left unoccupied, and the maximum number of people that can be seated is less than $N$ (for $N > 1$). +Observe que, devido à regra 1, alguns lugares certamente ficarão sem ocupação, e que o número máximo de pessoas que podem estar sentadas é menor que $N$ (para $N > 1$). -Here are the possible seating arrangements for $N = 15$: +Aqui estão os possíveis arranjos para $N = 15$: -seating arrangements for N = 15 +arranjo de assentos para N = 15 -We see that if the first person chooses correctly, the 15 seats can seat up to 7 people. We can also see that the first person has 9 choices to maximize the number of people that may be seated. +Vemos que, se a primeira pessoa escolher corretamente, os 15 assentos podem acomodar até 7 pessoas. Vemos também que a primeira pessoa tem 9 opções para maximizar o número de pessoas que podem se sentar. -Let $f(N)$ be the number of choices the first person has to maximize the number of occupants for $N$ seats in a row. Thus, $f(1) = 1$, $f(15) = 9$, $f(20) = 6$, and $f(500) = 16$. +Considere $f(N)$ como o número de escolhas que a primeira pessoa tem de maximizar o número de ocupantes para $N$ assentos em uma fila. Assim, $f(1) = 1$, $f(15) = 9$, $f(20) = 6$, e $f(500) = 16$. -Also, $\sum f(N) = 83$ for $1 ≤ N ≤ 20$ and $\sum f(N) = 13\\,343$ for $1 ≤ N ≤ 500$. +Além disso, $\sum f(N) = 83$ para $1 ≤ N ≤ 20$ e $\sum f(N) = 13.343$ para $1 ≤ N ≤ 500$. -Find $\sum f(N)$ for $1 ≤ N ≤ {10}^{12}$. Give the last 8 digits of your answer. +Encontre $\sum f(N)$ para $1 ≤ N ≤ {10}^{12}$. Dê os últimos 8 algarismos da sua resposta. # --hints-- -`comfortableDistanceTwo()` should return `73811586`. +`comfortableDistanceTwo()` deve retornar `73811586`. ```js assert.strictEqual(comfortableDistanceTwo(), 73811586); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-474-last-digits-of-divisors.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-474-last-digits-of-divisors.md index e63a971d336..48e35275817 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-474-last-digits-of-divisors.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-474-last-digits-of-divisors.md @@ -1,6 +1,6 @@ --- id: 5900f5471000cf542c510059 -title: 'Problem 474: Last digits of divisors' +title: 'Problema 474: Últimos algarismos dos divisores' challengeType: 1 forumTopicId: 302151 dashedName: problem-474-last-digits-of-divisors @@ -8,17 +8,17 @@ dashedName: problem-474-last-digits-of-divisors # --description-- -For a positive integer $n$ and digits $d$, we define $F(n, d)$ as the number of the divisors of $n$ whose last digits equal $d$. +Para um número inteiro positivo $n$ e algarismos $d$, definimos $F(n, d)$ como o número de divisores de $n$ cujos últimos algarismos são iguais a $d$. -For example, $F(84, 4) = 3$. Among the divisors of 84 (1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84), three of them (4, 14, 84) have the last digit 4. +Por exemplo, $F(84, 4) = 3$. Entre os divisores de 84 (1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84), três deles (4, 14, 84) têm o último algarismo 4. -We can also verify that $F(12!, 12) = 11$ and $F(50!, 123) = 17\\,888$. +Também podemos verificar que $F(12!, 12) = 11$ e $F(50!, 123) = 17.888$. -Find $F({10}^6!, 65\\,432) \text{ modulo } ({10}^{16} + 61)$. +Encontre $F({10}^6!, 65\\,432) \text{ modulo } ({10}^{16} + 61)$. # --hints-- -`lastDigitsOfDivisors()` should return `9690646731515010`. +`lastDigitsOfDivisors()` deve retornar `9690646731515010`. ```js assert.strictEqual(lastDigitsOfDivisors(), 9690646731515010); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-475-music-festival.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-475-music-festival.md index 9f019e969d0..e81ca5ceeff 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-475-music-festival.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-475-music-festival.md @@ -1,6 +1,6 @@ --- id: 5900f5481000cf542c51005a -title: 'Problem 475: Music festival' +title: 'Problema 475: Festival de música' challengeType: 1 forumTopicId: 302152 dashedName: problem-475-music-festival @@ -8,21 +8,21 @@ dashedName: problem-475-music-festival # --description-- -$12n$ musicians participate at a music festival. On the first day, they form $3n$ quartets and practice all day. +$12n$ músicos participam de um festival de música. No primeiro dia, eles formam $3n$ quartetos e praticam o dia todo. -It is a disaster. At the end of the day, all musicians decide they will never again agree to play with any member of their quartet. +É um desastre. No final do dia, todos os músicos decidem que nunca mais aceitarão tocar com qualquer membro do seu quarteto. -On the second day, they form $4n$ trios, each musician avoiding his previous quartet partners. +No segundo dia, eles formam $4n$ trios, com cada músico evitando seus parceiros de quarteto anteriores. -Let $f(12n)$ be the number of ways to organize the trios amongst the $12n$ musicians. +Considere $f(12n)$ como o número de maneiras de organizar os trios entre os $12n$ músicos. -You are given $f(12) = 576$ and $f(24)\bmod 1\\,000\\,000\\,007 = 509\\,089\\,824$. +Você é informado de que $f(12) = 576$ e que $f(24)\bmod 1.000.000.007 = 509.089.824$. -Find $f(600)\bmod 1\\,000\\,000\\,007$. +Encontre $f(600)\bmod 1.000.000.007$. # --hints-- -`musicFestival()` should return `75780067`. +`musicFestival()` deve retornar `75780067`. ```js assert.strictEqual(musicFestival(), 75780067); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-476-circle-packing-ii.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-476-circle-packing-ii.md index c6f88e38013..1597133e0ba 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-476-circle-packing-ii.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-476-circle-packing-ii.md @@ -1,6 +1,6 @@ --- id: 5900f5481000cf542c51005b -title: 'Problem 476: Circle Packing II' +title: 'Problema 476: Embalagem de círculos II' challengeType: 1 forumTopicId: 302153 dashedName: problem-476-circle-packing-ii @@ -8,17 +8,17 @@ dashedName: problem-476-circle-packing-ii # --description-- -Let $R(a, b, c)$ be the maximum area covered by three non-overlapping circles inside a triangle with edge lengths $a$, $b$ and $c$. +Considere $R(a, b, c)$ como a área máxima coberta por três círculos não sobrepostos dentro de um triângulo com comprimentos de arestas $a$, $b$ e $c$. -Let $S(n)$ be the average value of $R(a, b, c)$ over all integer triplets $(a, b, c)$ such that $1 ≤ a ≤ b ≤ c < a + b ≤ n$. +Considere $S(n)$ como o valor médio de $R(a, b, c)$ de todos os trios de números inteiros $(a, b, c)$, tal que $1 ≤ a ≤ b ≤ c < a + b ≤ n$. -You are given $S(2) = R(1, 1, 1) ≈ 0.31998$, $S(5) ≈ 1.25899$. +Você é informado de que $S(2) = R(1, 1, 1) ≈ 0.31998$, $S(5) ≈ 1.25899$. -Find $S(1803)$ rounded to 5 decimal places behind the decimal point. +Encontre $S(1803)$ arredondado para 5 casas decimais depois da vírgula. # --hints-- -`circlePackingTwo()` should return `110242.87794`. +`circlePackingTwo()` deve retornar `110242.87794`. ```js assert.strictEqual(circlePackingTwo(), 110242.87794); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-477-number-sequence-game.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-477-number-sequence-game.md index 18bcc8e538b..08381a8a5f4 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-477-number-sequence-game.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-477-number-sequence-game.md @@ -1,6 +1,6 @@ --- id: 5900f54a1000cf542c51005c -title: 'Problem 477: Number Sequence Game' +title: 'Problema 477: Jogo de sequência de números' challengeType: 1 forumTopicId: 302154 dashedName: problem-477-number-sequence-game @@ -8,35 +8,35 @@ dashedName: problem-477-number-sequence-game # --description-- -The number sequence game starts with a sequence $S$ of $N$ numbers written on a line. +O jogo de sequência de números começa com uma sequência $S$ de $N$ números escritos em uma linha. -Two players alternate turns. At his turn, a player must select and remove either the first or the last number remaining in the sequence. +Dois jogadores alternam sua vez. Na sua vez, um jogador deve selecionar e remover o primeiro ou o último número restante na sequência. -The player score is the sum of all the numbers he has taken. Each player attempts to maximize his own sum. +A pontuação do jogador é a soma de todos os números que ele recebeu. Cada jogador tenta maximizar sua própria soma. -If $N = 4$ and $S = \\{1, 2, 10, 3\\}$, then each player maximizes his score as follows: +Se $N = 4$ e $S = \\{1, 2, 10, 3\\}$, então cada jogador maximiza sua pontuação da seguinte forma: -- Player 1: removes the first number (1) -- Player 2: removes the last number from the remaining sequence (3) -- Player 1: removes the last number from the remaining sequence (10) -- Player 2: removes the remaining number (2) +- Jogador 1: remove o primeiro número (1) +- Jogador 2: remove o último número da sequência restante (3) +- Jogador 1: remove o último número da sequência restante (10) +- Jogador 2: remove o número restante (2) -Player 1 score is $1 + 10 = 11$. +A pontuação do jogador 1 é $1 + 10 = 11$. -Let $F(N)$ be the score of player 1 if both players follow the optimal strategy for the sequence $S = \\{s_1, s_2, \ldots, s_N\\}$ defined as: +Considere $F(N)$ como a pontuação do jogador 1 se ambos os jogadores seguirem a estratégia ideal para a sequência $S = \\{s_1, s_2, \ldots, s_N\\}$, definida como: - $s_1 = 0$ -- $s_{i + 1} = ({s_i}^2 + 45)$ modulo $1\\,000\\,000\\,007$ +- $s_{i + 1} = ({s_i}^2 + 45)$ modulo $1.000.000.007$ -The sequence begins with $S = \\{0, 45, 2\\,070, 4\\,284\\,945, 753\\,524\\,550, 478\\,107\\,844, 894\\,218\\,625, \ldots\\}$. +A sequência começa com $S = \\{0, 45, 2.070, 4.284.945, 753.524.550, 478.107.844, 894.218.625, \ldots\\}$. -You are given $F(2) = 45$, $F(4) = 4\\,284\\,990$, $F(100) = 26\\,365\\,463\\,243$, $F(104) = 2\\,495\\,838\\,522\\,951$. +Você é informado de que $F(2) = 45$, $F(4) = 4.284.990$, $F(100) = 26.365.463.243$, $F(104) = 2.495.838.522.951$. -Find $F({10}^8)$. +Encontre $F({10}^8)$. # --hints-- -`numberSequenceGame()` should return `25044905874565164`. +`numberSequenceGame()` deve retornar `25044905874565164`. ```js assert.strictEqual(numberSequenceGame(), 25044905874565164); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-478-mixtures.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-478-mixtures.md index d2f0dbd2054..b1a162a6a67 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-478-mixtures.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-478-mixtures.md @@ -1,6 +1,6 @@ --- id: 5900f54c1000cf542c51005e -title: 'Problem 478: Mixtures' +title: 'Problema 478: Misturas' challengeType: 1 forumTopicId: 302155 dashedName: problem-478-mixtures @@ -8,29 +8,29 @@ dashedName: problem-478-mixtures # --description-- -Let us consider mixtures of three substances: $A$, $B$ and $C$. A mixture can be described by a ratio of the amounts of $A$, $B$, and $C$ in it, i.e., $(a : b : c)$. For example, a mixture described by the ratio (2 : 3 : 5) contains 20% $A$, 30% $B$ and 50% $C$. +Considere as misturas de três substâncias: $A$, $B$ e $C$. Uma mistura pode ser descrita pela proporção da quantidade de $A$, $B$ e $C$ nela, ou seja, $(a : b : c)$. Por exemplo, uma mistura descrita pela proporção (2 : 3 : 5) contém 20% de $A$, 30% de $B$ e 50% de $C$. -For the purposes of this problem, we cannot separate the individual components from a mixture. However, we can combine different amounts of different mixtures to form mixtures with new ratios. +Para efeitos deste problema, não podemos separar os componentes individuais de uma mistura. No entanto, podemos combinar diferentes quantidades de diferentes misturas para formar misturas com novas proporções. -For example, say we have three mixtures with ratios (3 : 0 : 2), (3 : 6 : 11) and (3 : 3 : 4). By mixing 10 units of the first, 20 units of the second and 30 units of the third, we get a new mixture with ratio (6 : 5 : 9), since: ($10 \times \frac{3}{5} + 20 \times \frac{3}{20} + 30 \times \frac{3}{10}$ : $10 \times \frac{0}{5} + 20 \times \frac{6}{20} + 30 \times \frac{3}{10}$ : $10 \times \frac{2}{5} + 20 \times \frac{11}{20} + 30 \times \frac{4}{10}$) = (18 : 15 : 27) = (6 : 5 : 9) +Por exemplo, digamos que temos três misturas com proporções (3 : 0 : 2), (3 : 6 : 11) e (3 : 3 : 4). Ao misturar 10 unidades da primeira, 20 unidades da segunda e 30 unidades da terceira, temos uma nova mistura com proporção (6 : 5 : 9), pois: ($10 \times \frac{3}{5} + 20 \times \frac{3}{20} + 30 \times \frac{3}{10}$ : $10 \times \frac{0}{5} + 20 \times \frac{6}{20} + 30 \times \frac{3}{10}$ : $10 \times \frac{2}{5} + 20 \times \frac{11}{20} + 30 \times \frac{4}{10}$) = (18 : 15 : 27) = (6 : 5 : 9) -However, with the same three mixtures, it is impossible to form the ratio (3 : 2 : 1), since the amount of $B$ is always less than the amount of $C$. +No entanto, com as mesmas três misturas, é impossível formar a proporção (3 : 2 : 1), já que o valor de $B$ é sempre menor que o valor de $C$. -Let $n$ be a positive integer. Suppose that for every triple of integers $(a, b, c)$ with $0 ≤ a, b, c ≤ n$ and $gcd(a, b, c) = 1$, we have a mixture with ratio $(a : b : c)$. Let $M(n)$ be the set of all such mixtures. +Considere $n$ um inteiro positivo. Suponha que para cada trio de números inteiros $(a, b, c)$ com $0 ≤ a, b, c ≤ n$ e $gcd(a, b, c) = 1$ (máximo divisor comum), temos uma mistura com proporção $(a : b : c)$. Considere $M(n)$ como o conjunto dessas misturas. -For example, $M(2)$ contains the 19 mixtures with the following ratios: +Por exemplo, $M(2)$ contém as 19 misturas com as seguintes proporções: {(0 : 0 : 1), (0 : 1 : 0), (0 : 1 : 1), (0 : 1 : 2), (0 : 2 : 1), (1 : 0 : 0), (1 : 0 : 1), (1 : 0 : 2), (1 : 1 : 0), (1 : 1 : 1), (1 : 1 : 2), (1 : 2 : 0), (1 : 2 : 1), (1 : 2 : 2), (2 : 0 : 1), (2 : 1 : 0), (2 : 1 : 1), (2 : 1 : 2), (2 : 2 : 1)}. -Let $E(n)$ be the number of subsets of $M(n)$ which can produce the mixture with ratio (1 : 1 : 1), i.e., the mixture with equal parts $A$, $B$ and $C$. +Considere $E(n)$ como o número de subconjuntos de $M(n)$ que podem produzir a mistura com proporção (1 : 1 : 1), ou seja, a mistura com partes iguais de $A$, $B$ e $C$. -We can verify that $E(1) = 103$, $E(2) = 520\\,447$, $E(10)\bmod {11}^8 = 82\\,608\\,406$ and $E(500)\bmod {11}^8 = 13\\,801\\,403$. +Podemos verificar que $E(1) = 103$, $E(2) = 520.447$, $E(10)\bmod {11}^8 = 82.608.406$ e $E(500)\bmod {11}^8 = 13.801.403$. -Find $E(10\\,000\\,000)\bmod {11}^8$. +Encontre $E(10.000.000)\bmod {11}^8$. # --hints-- -`mixtures()` should return `59510340`. +`mixtures()` deve retornar `59510340`. ```js assert.strictEqual(mixtures(), 59510340); diff --git a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-479-roots-on-the-rise.md b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-479-roots-on-the-rise.md index b905a648468..d9fe51cd78e 100644 --- a/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-479-roots-on-the-rise.md +++ b/curriculum/challenges/portuguese/18-project-euler/project-euler-problems-401-to-480/problem-479-roots-on-the-rise.md @@ -1,6 +1,6 @@ --- id: 5900f54b1000cf542c51005d -title: 'Problem 479: Roots on the Rise' +title: 'Problema 479: Raízes em ascensão' challengeType: 1 forumTopicId: 302156 dashedName: problem-479-roots-on-the-rise @@ -8,19 +8,19 @@ dashedName: problem-479-roots-on-the-rise # --description-- -Let $a_k$, $b_k$, and $c_k$ represent the three solutions (real or complex numbers) to the expression $\frac{1}{x} = {\left(\frac{k}{x} \right)}^2 (k + x^2) - kx$. +Considere $a_k$, $b_k$ e $c_k$ como representando as três soluções (números reais ou complexos) para a expressão $\frac{1}{x} = {\left(\frac{k}{x} \right)}^2 (k + x^2) - kx$. -For instance, for $k = 5$, we see that $\\{a_5, b_5, c_5\\}$ is approximately $\\{5.727244, -0.363622 + 2.057397i, -0.363622 - 2.057397i\\}$. +Por exemplo, no caso de $k = 5$, vemos que $\\{a_5, b_5, c_5\\}$ é aproximadamente $\\{5,727244, -0,363622 + 2,057397i, -0,363622 e - 2,057397i\\}$. -Let $S(n) = \displaystyle\sum_{p = 1}^n \sum_{k = 1}^n {(a_k + b_k)}^p {(b_k + c_k)}^p {(c_k + a_k)}^p$ for all integers $p$, $k$ such that $1 ≤ p, k ≤ n$. +Considere $S(n) = \displaystyle\sum_{p = 1}^n \sum_{k = 1}^n {(a_k + b_k)}^p {(b_k + c_k)}^p {(c_k + a_k)}^p$ para todos os números inteiros $p$, $k$, tal que $1 ≤ p, k ≤ n$. -Interestingly, $S(n)$ is always an integer. For example, $S(4) = 51\\,160$. +Curiosamente, $S(n)$ é sempre um número inteiro. Por exemplo, $S(4) = 51.160.$. -Find $S({10}^6) \text{ modulo } 1\\,000\\,000\\,007$. +Encontre $S({10}^6) \text{ modulo } 1.000.000.007$. # --hints-- -`rootsOnTheRise()` should return `191541795`. +`rootsOnTheRise()` deve retornar `191541795`. ```js assert.strictEqual(rootsOnTheRise(), 191541795); diff --git a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-a.md b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-a.md index f8587e80b09..8afbd3864d5 100644 --- a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-a.md +++ b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-a.md @@ -1,31 +1,31 @@ --- id: 63ee3f71381756f9716727ef -title: CSS Foundations Exercise A +title: Основи CSS. Вправа A challengeType: 14 dashedName: css-foundations-exercise-a --- # --description-- -**Objective:** In this exercise, you're going to practice adding CSS to an HTML file using all three methods: external CSS, internal CSS, and inline CSS. You should only be using type selectors for this exercise when adding styles via the external and internal methods. You should also use keywords for colors (e.g. "blue") instead of using `RGB` or `HEX` values. +**Мета:** у цій вправі ви практикуватиметесь додавати CSS до файлу HTML, використовуючи всі три методи: зовнішній CSS, внутрішній CSS та вбудований CSS. У цій вправі ви повинні використовувати селектори типу лише під час додавання стилів зовнішнім та внутрішнім методами. Ви також повинні використовувати ключові слова для кольорів (наприклад, «blue»), а не значення `RGB` чи `HEX`. -## User Stories +## Історія користувача -1. You should see a `div` element with a `red` background, `white` text, a font size of `32px`, center aligned, and `bold`. +1. Ви повинні бачити елемент `div` із фоном `red`, текстом `white`, розміром шрифту `32px`, вирівняним за центром та `bold`. -1. The CSS of the `div` element should be added externally by using a type selector. +1. Використайте селектор типу, щоб зовнішньо додати CSS елемента `div`. -1. You should see a `p` element with a `green` background, `white` text, and a font size of `18px`. +1. Ви повинні бачити елемент `p` із фоном `green`, текстом `white` та розміром шрифту `18px`. -1. The CSS of the `p` element should be added internally by using a type selector. +1. Використайте селектор типу, щоб внутрішньо додати CSS елемента `p`. -1. You should see a `button` element with an orange background and a font size of `18px`. +1. Ви повинні бачити елемент `button` із фоном `orange` та розміром шрифту `18px`. -1. The CSS of the `button` element should have an inline style. +1. CSS елемента `button` повинен мати вбудований стиль. # --hints-- -There should be one `div` element and should contains some text and be aligned in the center. +Ви повинні мати один елемент `div`, який містить текст та вирівняний за центром. ```js const aligned = new __helpers.CSSHelp(document).getStyle('div')?.getPropertyValue('text-align'); @@ -35,7 +35,7 @@ assert(document.getElementsByTagName('DIV')?.length == 1); assert(document.getElementsByTagName('DIV')?.[0]?.innerText.length > 0) ``` -The `div` element should have a `background-color` of `red` and a text color of `white`. +Елемент `div` повинен мати `background-color` зі значенням `red` та колір тексту зі значенням `white`. ```js @@ -47,7 +47,7 @@ assert(bgc === 'red'); assert(color === 'white'); ``` -The `div` element should have a `font-weight` of bold and a `font-size` of `32px`. +Елемент `div` повинен мати `font-weight` зі значенням `bold` та `font-size` зі значенням `32px`. ```js const fontSize = new __helpers.CSSHelp(document).getStyle('div')?.getPropertyValue('font-size'); @@ -57,21 +57,21 @@ assert(fontSize === '32px'); assert(fontWeight === 'bold'); ``` -The `div` element should have its CSS added externally. +CSS елемента `div` потрібно додати зовнішньо. ```js assert(!document.getElementsByTagName('style')?.[0]?.innerText.includes('div')); assert(!document.getElementsByTagName('div')?.[0]?.hasAttribute('style')); ``` -There should be one `p` element and it should contain some text. +Ви повинні мати один елемент `p`, який містить текст. ```js assert(document.getElementsByTagName('P')?.length == 1); assert(document.getElementsByTagName('P')?.[0]?.innerText.length > 0) ``` -The `p` element should have its `color` set to `white`. +Елемент `p` повинен мати `color` зі значенням `white`. ```js const color = new __helpers.CSSHelp(document).getStyle('div')?.getPropertyValue('color'); @@ -79,7 +79,7 @@ const color = new __helpers.CSSHelp(document).getStyle('div')?.getPropertyValue( assert(color == 'white'); ``` -The `p` element should have a `font-size` of `18px`. +Елемент `p` повинен мати `font-size` зі значенням `18px`. ```js const styleTag = document.getElementsByTagName('style')?.[0]; @@ -99,7 +99,7 @@ if (rules) { assert(pHasFontSize18); ``` -The `p` element should have its style added internally. +Стиль елемента `p` потрібно додати внутрішньо. ```js @@ -121,19 +121,19 @@ if (rules) { assert(pIsStyled); ``` -The `button` element should have its `background-color` set to `orange`. +Елемент `button` повинен мати `background-color` зі значенням `orange`. ```js assert(document.getElementsByTagName('button')?.[0]?.style.backgroundColor === 'orange') ``` -The `button` element should have its `font-size` set to `18px`. +Елемент `button` повинен мати `font-size` зі значенням `18px`. ```js assert(document.getElementsByTagName('button')?.[0]?.style.fontSize === '18px') ``` -The `button` element should have an inline style. +Елемент `button` повинен мати вбудований стиль. ```js assert(document.getElementsByTagName('button')?.[0]?.hasAttribute('style')); diff --git a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-b.md b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-b.md index cd1a07e15f5..476f031809e 100644 --- a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-b.md +++ b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-b.md @@ -1,35 +1,35 @@ --- id: 63ee3fe4381756f9716727f0 -title: CSS Foundations Exercise B +title: Основи CSS. Вправа B challengeType: 14 dashedName: css-foundations-exercise-b --- # --description-- -**Objective:** There are several elements in the HTML file provided, which you will have to add either class or ID attributes to. You will then have to add rules in the CSS file provided using the correct selector syntax. +**Мета:** у файлі HTML надано декілька елементів, до яких потрібно додати атрибути класу чи ID. Потім вам потрібно додати правила до наданого файлу CSS, використовуючи правильний синтаксис селектора. -## User Stories +## Історія користувача -1. You should see a `yellow` background for all odd numbered elements in the list. +1. Ви повинні бачити фон `yellow` для всіх непарних елементів у списку. -1. You should have a `class` selector used for all odd numbered elements in the list. +1. Ви повинні мати селектор `class`, який використовується для всіх непарних елементів у списку. -1. You should see that the second element in the list has `blue` text and a `font-size` of `36px`. +1. Ви повинні бачити другий елемент списку із текстом `blue` та `font-size` зі значенням `36px`. -1. The `font-size` and text color on the second element should be set by using an `id` attribute. +1. Використайте атрибут `id`, щоб налаштувати `font-size` та колір тексту другого елемента. -1. You should see that the third element in the list has a `font-size` of `24px`. +1. Ви повинні бачити третій елемент списку із `font-size` зі значенням `24px`. -1. The `font-size` on the third element should be set by using a `class` attribute. +1. Використайте атрибут `class`, щоб налаштувати `font-size` третього елемента. -1. You should see that the fourth element in the list has a `red` background, a `font-size` of `24px`, and a `font-weight` of `bold`. +1. Ви повинні бачити четвертий елемент списку із фоном `red`, `font-size` зі значенням `24px` та `font-weight` зі значенням `bold`. -1. The `font-size` of the fourth element should be set with a `class` attribute the `font-weight` and the color should be set with an `id` attribute. +1. Використайте атрибут `class`, щоб налаштувати `font-size` четвертого елемента. Використайте атрибут `id`, щоб налаштувати `font-weight` та колір четвертого елемента. # --hints-- -Every odd element should have a `class` attribute. +Кожен непарний елемент повинен мати атрибут `class`. ```js const p = Array.from(document.querySelectorAll('P')); @@ -39,7 +39,7 @@ const everyPHasClass = p?.every((paragraph) => paragraph.classList.length > 0); assert(everyPHasClass); ``` -Your odd elements should have a `background-color` of `yellow`. +Непарні елементи повинні мати `background-color` зі значенням `yellow`. ```js const p = Array.from(document.querySelectorAll('P')); @@ -52,7 +52,7 @@ const everyPhasBackgroundColor = p?.every((paragraph) => { }) ``` -Your second element should have blue text and a `font-size` of `36px`. +Другий елемент повинен мати синій текст та `font-size` зі значенням `36px`. ```js const secondElementId = document.querySelectorAll('div')?.[0]?.id; @@ -63,14 +63,14 @@ assert.equal(style?.color, 'rgb(0, 0, 255)') assert.equal(style?.fontSize, '36px'); ``` -Your third element should have text and a `font-size` of `24px`. +Третій елемент повинен мати текст та `font-size` зі значенням `24px`. ```js const thirdElement = document.querySelectorAll('p')?.[1]?.classList; ``` -The fourth element should have a `font-size` of `24px`. +Четвертий елемент повинен мати `font-size` зі значенням `24px`. ```js const fourthElementClass = document.querySelectorAll('div')?.[1]?.classList[0]; @@ -80,7 +80,7 @@ const style = new __helpers.CSSHelp(document).getStyle(`.${fourthElementClass}`) assert(style?.fontSize === '24px'); ``` -The fourth element should have a red `background-color`. +Четвертий елемент повинен мати `background-color` зі значенням `red`. ```js const fourthElement = document.querySelectorAll('div')?.[1]?.id; @@ -90,7 +90,7 @@ const style = new __helpers.CSSHelp(document).getStyle(`#${fourthElement}`); assert(style?.backgroundColor === 'red'); ``` -The fourth element should have a `font-weight` of `bold`. +Четвертий елемент повинен мати `font-weight` зі значенням `bold`. ```js const fourthElement = document.querySelectorAll('div')?.[1]?.id; diff --git a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-c.md b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-c.md index bbb3741d76d..177040c29b6 100644 --- a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-c.md +++ b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-c.md @@ -1,29 +1,29 @@ --- id: 63ee3fe9381756f9716727f1 -title: CSS Foundations Exercise C +title: Основи CSS. Вправа C challengeType: 14 dashedName: css-foundations-exercise-c --- # --description-- -description +опис # --hints-- -Test 1 +Тест 1 ```js ``` -Test 2 +Тест 2 ```js ``` -Test 3 +Тест 3 ```js diff --git a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-d.md b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-d.md index 9ee58af2023..de724905411 100644 --- a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-d.md +++ b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-d.md @@ -1,29 +1,29 @@ --- id: 63ee3ff1381756f9716727f2 -title: CSS Foundations Exercise D +title: Основи CSS. Вправа D challengeType: 14 dashedName: css-foundations-exercise-d --- # --description-- -description +опис # --hints-- -Test 1 +Тест 1 ```js ``` -Test 2 +Тест 2 ```js ``` -Test 3 +Тест 3 ```js diff --git a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-e.md b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-e.md index a8647c318f4..031b1be04cc 100644 --- a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-e.md +++ b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-e.md @@ -1,29 +1,29 @@ --- id: 63ee3ff8381756f9716727f3 -title: CSS Foundations Exercise E +title: Основи CSS. Вправа E challengeType: 14 dashedName: css-foundations-exercise-e --- # --description-- -description +опис # --hints-- -Test 1 +Тест 1 ```js ``` -Test 2 +Тест 2 ```js ``` -Test 3 +Тест 3 ```js diff --git a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-a.md b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-a.md index 425d54224f6..9545e22c892 100644 --- a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-a.md +++ b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-a.md @@ -1,14 +1,14 @@ --- id: 63ee351d0d8d4841c3a7091a videoId: LGQuIIv2RVA -title: CSS Foundations Question A +title: Основи CSS. Запитання A challengeType: 15 dashedName: css-foundations-question-a --- # --description-- -A type selector (or element selector) will select all elements of the given element type, and the syntax is just the name of the element: +Селектор типу (або селектор елемента) обирає всі елементи наданого типу, а синтаксисом є назва елемента: ```html @@ -27,25 +27,25 @@ div { } ``` -Here, all three `
` elements would be selected, while the `

` element wouldn’t be. +У цьому прикладі всі три елементи `

` будуть обрані, а елемент `

` — ні. # --question-- ## --text-- -Which of the following best describes the CSS code given above? +Що з переліченого найкраще описує код CSS, поданий вище? ## --answers-- -The code applies a `white` color to all elements in the HTML file. +Код надає колір зі значенням `white` всім елементам у файлі HTML. --- -The code applies a `white` color to all `div` elements in the HTML file. +Код надає колір зі значенням `white` всім елементам `div` у файлі HTML. --- -The code applies a `white` color to all `p` elements in the HTML file. +Код надає колір зі значенням `white` всім елементам `p` у файлі HTML. ## --video-solution-- diff --git a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-b.md b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-b.md index aad3818d270..8f02161fe35 100644 --- a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-b.md +++ b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-b.md @@ -1,14 +1,14 @@ --- id: 63ee35240d8d4841c3a7091b videoId: LGQuIIv2RVA -title: CSS Foundations Question B +title: Основи CSS. Запитання B challengeType: 15 dashedName: css-foundations-question-b --- # --description-- -Class selectors will select all elements with the given `class`, which is just an attribute you place on an HTML element. Here’s how you add a class to an HTML tag and select it in CSS: +Селектори класу обирають всі елементи з наданим `class`, що є звичайним атрибутом, розміщеним в елементі HTML. Ось так ви додаєте клас до тегу HTML та обираєте його в CSS: ```html @@ -26,12 +26,12 @@ Class selectors will select all elements with the given `class`, which is just a } ``` -Note the syntax for `class` selectors: a period immediately followed by the case-sensitive value of the class attribute. Classes aren’t required to be unique, so you can use the same `class` on as many elements as you want. +Примітка щодо синтаксису для селекторів `class`: після крапки пишеться значення атрибуту класу, яке чутливе до регістру. Класи не повинні бути унікальними, тому ви можете використовувати однаковий `class` для декількох елементів. -Another thing you can do with the `class` attribute is to add multiple classes to a single element as a space-separated list, such as `class="alert-text severe-alert"`. Since whitespace is used to separate `class` names like this, you should never use spaces for multi-worded names and should use a hyphen instead. +Завдяки атрибуту `class` також можна додати декілька класів до одного елемента, розділивши їх пробілом, як-от `class="alert-text severe-alert"`. Оскільки пробіл використовують, щоб розділити назви `class`, не використовуйте пробіли у назвах з декількома словами (натомість використовуйте дефіси). -## ID Selectors -ID selectors are similar to `class` selectors. They select an element with the given `id`, which is another attribute you place on an HTML element: +## Селектори ID +Селектори ID схожі до селекторів `class`. Вони обирають елемент з наданим `id`, що є ще одним атрибутом елемента HTML: ```html @@ -47,27 +47,27 @@ ID selectors are similar to `class` selectors. They select an element with the g } ``` -Instead of a period, you use a hashtag immediately followed by the case-sensitive value of the `id` attribute. A common pitfall is people overusing the `id` attribute when they don’t necessarily need to, and when classes will suffice. While there are cases where using an `id` makes sense or is needed, such as taking advantage of specificity or having links redirect to a section on the current page, you should use `id`s sparingly (if at all). +Замість коми потрібно використовувати знак решітки, після якого пишеться значення атрибута `id`, чутливе до регістру. Загальною помилкою є те, що люди часто використовують атрибут `id` там, де немає потреби і можна було використати класи. Хоча є випадки, коли логічніше використовувати `id` (наприклад, щоб використати переваги специфічності чи перенаправити до розділу поточної сторінки). -The major difference between classes and IDs is that an element can only have one `id`. An `id` cannot be repeated on a single page, and the `id` attribute should not contain any whitespace at all. +Головною відмінністю між класами та ID є те, що елемент може мати лише один `id`. `id` не може повторюватись на сторінці, а атрибут `id` не повинен містити пробілів. # --question-- ## --text-- -What is the syntax for class and ID selectors? +Який синтаксис для селекторів класу та ID? ## --answers-- -To select a `class` you use `$` and to select an `id` you use `#` +Щоб обрати `class`, використовуйте `$`; щоб обрати `id`, використовуйте `#` --- -To select a `class` you use `.` and to select an `id` you use `*` +Щоб обрати `class`, використовуйте `.`; щоб обрати `id`, використовуйте `*` --- -To select a `class` you use `.` and to select an `id` you use `#` +Щоб обрати `class`, використовуйте `.`; щоб обрати `id`, використовуйте `#` ## --video-solution-- diff --git a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-c.md b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-c.md index eb36575f5e7..270542af68b 100644 --- a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-c.md +++ b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-c.md @@ -1,14 +1,14 @@ --- id: 63ee352b0d8d4841c3a7091c videoId: LGQuIIv2RVA -title: CSS Foundations Question C +title: Основи CSS. Запитання C challengeType: 15 dashedName: css-foundations-question-c --- # --description-- -What if you have two groups of elements that share some of their style declarations? +Що робити, якщо у вас є дві групи елементів, які мають спільні оголошення стилів? ```css .read { @@ -24,7 +24,7 @@ What if you have two groups of elements that share some of their style declarati } ``` -Both our `.read` and `.unread` selectors share the `color: white;` and `background-color: black;` declarations, but otherwise have several of their own unique declarations. To cut down on the repetition, you can group these two selectors together as a comma-separated list: +Обидва селектори (`.read` та `.unread`) мають спільні оголошення `color: white;` та `background-color: black;`, але окрім них вони мають декілька власних унікальних оголошень. Щоб зменшити повторення, ви можете згрупувати ці два селектори разом у вигляді списку, розділеного комами: ```css .read, @@ -42,13 +42,13 @@ Both our `.read` and `.unread` selectors share the `color: white;` and `backgrou } ``` -Both of the examples above (with and without grouping) will have the same result, but the second example reduces the repetition of declarations and makes it easier to edit either the `color` or `background-color` for both classes at once. +Обидва наведені вище приклади (з групуванням і без нього) матимуть однаковий результат, але другий приклад зменшує повтори оголошень та полегшує одночасне редагування `color` чи `background-color` для обох класів. # --question-- ## --text-- -How would you apply a single rule to two different selectors, `.red-box` and `.yellow-box`? +Як би ви застосували одне правило до двох різних селекторів: `.red-box` та `.yellow-box`? ## --answers-- diff --git a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-d.md b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-d.md index 4cfe1014093..80ab0f05e86 100644 --- a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-d.md +++ b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-d.md @@ -1,14 +1,14 @@ --- id: 63ee35300d8d4841c3a7091d videoId: LGQuIIv2RVA -title: CSS Foundations Question D +title: Основи CSS. Запитання D challengeType: 15 dashedName: css-foundations-question-d --- # --description-- -Another way to use selectors is to chain them as a list without any separation. Let’s say you had the following HTML: +Ще один спосіб використовувати селектори — об’єднати їх у списку без відокремлень. Скажімо, ви маєте такий HTML: ```html

@@ -17,7 +17,7 @@ Another way to use selectors is to chain them as a list without any separation.
``` -You have two elements with the `subsection` class that have some sort of unique styles, but what if you only want to apply a separate rule to the element that also has `header` as a second class? Well, you could chain both the `class` selectors together in your CSS like so: +У вас є два елементи з класом `subsection`, які мають відносно унікальні стилі. Вам потрібно застосувати окреме правило до елемента, який також має `header` як другий клас. Що робитимете? Ви можете об’єднати селектори `class` у CSS: ```css .subsection.header { @@ -25,9 +25,9 @@ You have two elements with the `subsection` class that have some sort of unique } ``` -What `.subsection.header` does is it selects any element that has both the `subsection` and `header` classes. Notice how there isn’t any space between the `.subsection` and `.header` `class` selectors. This syntax basically works for chaining any combination of selectors, except for chaining more than one type selector. +`.subsection.header` обирає будь-який елемент, який має класи `subsection` та `header`. Зверніть увагу, що між селекторами `class` `.subsection` та `.header` немає пробілу. Цей синтаксис в основному працює для об’єднання будь-якої комбінації селекторів, за винятком об’єднання декількох селекторів типу. -This can also be used to chain a class and an ID, as shown below: +Його можна використовувати, щоб об’єднати клас та ID: ```html
@@ -36,7 +36,7 @@ This can also be used to chain a class and an ID, as shown below:
``` -You can take the two elements above and combine them with the following: +Ви можете взяти два елементи вище та поєднати їх: ```css .subsection.header { @@ -48,13 +48,13 @@ You can take the two elements above and combine them with the following: } ``` -In general, you can’t chain more than one type selector since an element can’t be two different types at once. For example, chaining two type selectors like `div` and `p` would give us the selector `divp`, which wouldn’t work since the selector would try to find a literal `` element, which doesn’t exist. +Ви не зможете об’єднати декілька селекторів типу, оскільки елемент може мати лише один тип. Наприклад, якщо об’єднати два селектори (`div` та `p`), ми отримаємо селектор `divp`, який не працюватиме, оскільки шукатиме літеральний елемент ``, якого не існує. # --question-- ## --text-- -Given an element that has an `id` of `title` and a `class` of `primary`, how would you use both attributes for a single rule? +Вам надано елемент, який має `id` зі значенням `title` та `class` зі значенням `primary`. Як ви б використали обидва атрибути для одного правила? ## --answers-- diff --git a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-e.md b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-e.md index b6038767181..7be74b8b027 100644 --- a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-e.md +++ b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-e.md @@ -1,16 +1,16 @@ --- id: 63ee35370d8d4841c3a7091e videoId: LGQuIIv2RVA -title: CSS Foundations Question E +title: Основи CSS. Запитання E challengeType: 15 dashedName: css-foundations-question-e --- # --description-- -Combinators allow us to combine multiple selectors differently than either grouping or chaining them, as they show a relationship between the selectors. There are four types of combinators in total, but for right now we’re going to only show you the descendant combinator, which is represented in CSS by a single space between selectors. A descendant combinator will only cause elements that match the last selector to be selected if they also have an ancestor (parent, grandparent, etc) that matches the previous selector. +Комбінатори дозволяють комбінувати декілька селекторів по-іншому, а не групуючи чи об’єднуючи, оскільки вони показують зв’язок між селекторами. Загалом існує чотири типи комбінаторів, але ми зупинимося на нащадку, який представлений у CSS пробілом між селекторами. Нащадок дозволить обирати лише ті елементи, які відповідають останньому селектору за умови, що вони також мають предка (батька, прабатька тощо), який відповідає попередньому селектору. -So something like `.ancestor .child` would select an element with the class `child` if it has an ancestor with the class `ancestor`. Another way to think of it is child will only be selected if it is nested inside of `ancestor`, no matter how deep. Take a quick look at the example below and see if you can tell which elements would be selected based on the CSS rule provided: +`.ancestor .child` обрав би елемент з класом `child`, якщо він має предка із класом `ancestor`. Також можна вважати, що дочірній елемент буде обрано лише тоді, якщо він розміщений всередині `ancestor`. Перегляньте наведений нижче приклад та подумайте, чи ви можете сказати, які елементи буде обрано на основі наданого правила CSS: ```html @@ -33,27 +33,27 @@ So something like `.ancestor .child` would select an element with the class `chi } ``` -In the above example, the first two elements with the `contents` class (`B` and `C`) would be selected, but that last element (`D`) won’t be. Was your guess correct? +Перші два елементи з класом `contents` (`B` та `C`) будуть вибрані, а останній елемент (`D`) — ні. Ваша відповідь була правильною? -There’s really no limit to how many combinators you can add to a rule, so `.one .two .three .four` would be totally valid. This would just select an element that has a class of `four` if it has an ancestor with a class of `three`, and if that ancestor has its own ancestor with a class of `two`, and so on. You generally want to avoid trying to select elements that need this level of nesting, though, as it can get pretty confusing and long, and it can cause issues when it comes to specificity. +До правила можна додати необмежену кількість комбінаторів, тому `.one .two .three .four` будуть дійсними. Буде обрано елемент з класом `four`, якщо він має предка з класом `three`, та якщо предок має власного предка з класом `two`, і так далі. Старайтесь уникати вибирати елементи, які вимагають такого рівня вкладення, оскільки це може бути заплутано та довго, а також може призвести до проблем щодо специфічності. # --question-- ## --text-- -What does the descendant combinator do? +Що робить нащадок? ## --answers-- -It groups certain classes together which share the same declarations. +Групує певні класи, які мають однакові оголошення. --- -It gives the ability to select an element that shares the same `class` and `id`. +Дозволяє вибирати елемент з однаковими `class` та `id`. --- -It allows you to select an element based on its relationship with its ancestor (parent, grandparent, and so on). +Дозволяє вибирати елемент, базуючись на його зв’язку з предком (батьком, прабатьком і т. д.). ## --video-solution-- diff --git a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-f.md b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-f.md index 5a18ff3b1a4..71eaac1581b 100644 --- a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-f.md +++ b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-f.md @@ -1,45 +1,45 @@ --- id: 63ee353e0d8d4841c3a7091f videoId: LGQuIIv2RVA -title: CSS Foundations Question F +title: Основи CSS. Запитання F challengeType: 15 dashedName: css-foundations-question-f --- # --description-- -Okay, you went over quite a bit so far. The only thing left for now is to go over how to add all this CSS to your HTML. There are three methods to do so. +Ви вже багато чого навчились. Лишилось дізнатись, як додати CSS до HTML. Для цього існує три методи. -External CSS is the most common method you will come across, and it involves creating a separate file for the CSS and linking it inside of an HTML’s opening and closing `` tags with a self-closing `` element: +Зовнішній CSS — найпопулярніший метод, який передбачає створення окремого файлу для CSS, який розміщується всередині початкового та кінцевого тегів `` із самозакривним елементом ``: -First, you add a self-closing `` element inside of the opening and closing `` tags of the HTML file. The `href` attribute is the location of the CSS file, either an absolute URL or, what you’ll be utilizing, a URL relative to the location of the HTML file. In the example above, you are assuming both files are located in the same directory. The `rel` attribute is required, and it specifies the relationship between the HTML file and the linked file. +Спочатку додайте самозакривний елемент `` всередині початкового та кінцевого тегів `` файлу HTML. Атрибут `href` — це розташування файлу CSS: абсолютна URL-адреса або URL-адреса відносно розташування файлу HTML (залежно від того, що ви використовуєте). У прикладі вище ми припускаємо, що обидва файли розміщені в одному каталозі. Атрибут `rel` є обов’язковим, оскільки він вказує зв’язок між файлом HTML та пов’язаним файлом. -Then inside of the newly created `styles.css` file, you have the selector (the `div` and `p`), followed by a pair of opening and closing curly braces, which create a “declaration block”. Finally, you place any declarations inside of the declaration block. `color: white;` is one declaration, with `color` being the property and `white` being the value, and `background-color: black;` is another declaration. +Всередині щойно створеного файлу `styles.css` наявний селектор (`div` та `p`), після якого розташовані початкові та кінцеві фігурні дужки, що створює «блок оголошення». Будь-які оголошення потрібно розміщувати всередині блоку оголошень. Першим оголошенням є `color: white;` (властивість `color` та значення `white`), а іншим оголошенням є `background-color: black;`. -A note on file names: `styles.css` is just what you went with as the file name here. You can name the file whatever you want as long as the file type is `.css`, though “style” or “styles” is most commonly used. +Примітка щодо назви файлів: для цього файлу ви обрали звичайну назву `styles.css`. Ви можете називати файл по-різному, але його розширенням має бути `.css`, хоча найчастіше використовують «style» чи «styles». -A couple of the pros to this method are: +Декілька переваг цього методу: -1. It keeps your HTML and CSS separated, which results in the HTML file being smaller and making things look cleaner. -2. You only need to edit the CSS in one place, which is especially handy for websites with many pages that all share similar styles. +1. HTML та CSS зберігаються окремо, тому файл HTML стає меншим і все виглядає акуратніше. +2. Вам потрібно редагувати CSS в одному місці, що особливо зручно для вебсайтів, де багато сторінок мають подібні стилі. # --question-- ## --text-- -Which of the following best describes the purpose of the `rel` attribute in the `` element when linking an external CSS file to an HTML file? +Що з переліченого найкраще описує суть атрибута `rel` в елементі `` при з’єднанні зовнішнього файлу CSS до файлу HTML? ## --answers-- -It specifies the location of the CSS file relative to the location of the HTML file. +Він вказує розташування файлу CSS відносно розташування файлу HTML. --- -It specifies the relationship between the HTML file and the linked file. +Він вказує зв’язок між файлом HTML та пов’язаним файлом. --- -It specifies the type of file being linked (e.g. "stylesheet"). +Він вказує тип пов’язаного файлу (наприклад, «stylesheet»). ## --video-solution-- diff --git a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-g.md b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-g.md index 7da4a22a122..8e1cb160204 100644 --- a/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-g.md +++ b/curriculum/challenges/ukrainian/16-the-odin-project/top-learn-css-foundations/css-foundations-question-g.md @@ -1,16 +1,16 @@ --- id: 63ee35450d8d4841c3a70920 videoId: LGQuIIv2RVA -title: CSS Foundations Question G +title: Основи CSS. Запитання G challengeType: 15 dashedName: css-foundations-question-g --- # --description-- -Internal CSS (or embedded CSS) involves adding the CSS within the HTML file itself instead of creating a completely separate file. With the internal method, you place all the rules inside of a pair of opening and closing `