Tiger Algebra/core — Italian @ Weblate: Join a community with 26,970,008 solved equations

Translation

Key JoinCommunityHeadline

English

Italian

Needs editing

Skip

Key	English	Italian
VideoSolution	Video Solution Not being used	Soluzione video non utilizzata
StepByStepSolution	Step-by-step explanation	Spiegazione passo passo
LatestSolved	Latest Solved	Ultimi risolti
LatestRelatedDrillsSolved	Latest Related Drills Solved	Ultimi esercizi correlati risolti
TigerAlgebraTitle	Tiger Algebra - A Free, Online Algebra Solver and Calculator	Tiger Algebra - Un risolutore e una calcolatrice algebrici online gratuiti
TigerAlgebraSolver	Tiger Algebra Solver	Risolutore Tiger Algebra
TigerAlgebraSolverGa	Tiger Algebra	Tiger Algebra
AlgebraCalculator	Tiger Algebra Calculator	Calcolatrice Tiger Algebra
EnterAnEquation	Enter an equation or problem	Digita un'equazione o un problema
WhyLearnThisLabel	Why learn this	Perché imparare questo
WhyNeedHeadline	Why should I know this?	Perché dovrei saperlo?
Solve	Solve	Risolvi
Clear	Clear	Cancella
SignUp	Sign Up	Registrati
CameraInputError	Camera input is not recognized!	L'input della fotocamera non viene riconosciuto!
JoinCommunityHeadline	Join a community with 26,970,008 solved equations	Join a community with 26,970,008 solved equations
JoinBenefit1	Live Help	Live Help
JoinBenefit2	Earn rewards and prizes	Guadagna ricompense e premi
JoinBenefit3	Customize everything	Personalizza tutto
SignInWithGoogle	Sign in with Google	Accedi con Google
Or	Or	Oppure
CreateAccount	Create Account	Crea un account
EnterAProblem	Enter a problem or formula	Digita un problema o una formula
LoadingHandWriting	Loading Hand writing screen...	Schermata di scrittura a mano in caricamento...
SelectLanguage	Select Language	Seleziona la lingua
SelectInputMode	Select Input	Seleziona l'input
CalculatorInputMode	Calculator	Calcolatrice
KeyboardInputMode	Keyboard	Tastiera
ContinueInputMode	Continue	Continua
GoBackInputMode	Go Back	Indietro
WarningInputMode	This action will erase your current inputs. Are you sure you want to continue?	Questa azione cancellerà le tue immissioni attuali. Sei sicuro di voler continuare?

Key	English	Italian
HowDidWeDo	How did we do?	Come ci siamo comportati?
HowToSolve	Let’s solve it step by step	Risolviamola procedendo per singoli passaggi
IdentifyingPerfectCubes	Identifying perfect cubes	Identificazione di cubi perfetti
IdentifyingPerfectCubesContent	<div style="white-space: normal;"> <p>In general, a perfect cube is represented as <math>n^3</math>, where <math>n</math> is an integer.</p> <p>There are several techniques to identify perfect cubes:</p> <ul> <li><strong>Examine the last digit:</strong> Perfect cubes have specific patterns in their last digit. By examining the last digit of a number, you can often determine if it's a perfect cube.</li> <li><strong>Prime factorization:</strong> Another method is to perform prime factorization of the number and check if each prime factor appears in groups of three.</li> <li><strong>Use a table of cubes:</strong> Memorizing the cubes of numbers from 1 to 10 can help quickly identify perfect cubes.</li> </ul> <h2>Examples</h2> <p>Let's consider a few examples to illustrate the identification of perfect cubes:</p> <h3>Example 1:</h3> <p>Identify whether 64 is a perfect cube.</p> <p>Using the examination of the last digit method, we find that the last digit of 64 is 4. The last digits of perfect cubes cycle in a specific pattern (0, 1, 8, 7, 4, 5, 6, 3, 2, 9), and 4 is in this cycle. Hence, 64 is a perfect cube.</p> <h3>Example 2:</h3> <p>Identify whether 1000 is a perfect cube.</p> <p>By performing prime factorization, we find that <math>1000 = 2^3 \times 5^3</math>. Since both 2 and 5 appear in groups of three, 1000 is a perfect cube.</p> <h2>Conclusion</h2> <p>Identifying perfect cubes is an important skill in mathematics that finds applications in various fields. By understanding the basic concepts and techniques, one can easily recognize perfect cubes and utilize them in problem-solving.</p> </div>	Un cubo perfetto è il cubo di un altro polinomio. Il risolutore Tiger Algebra trova i cubi perfetti e ti mostra le soluzioni nei singoli passaggi.
IntegerToRomanNumeral	Integer to Roman numeral	Risolutore Tiger Algebra
IntegerToRomanNumeral.plugin	integer to roman numeral	Risolutore Tiger Algebra
IntegerToRomanNumeralStep1TextUnit1	Extract and normalize the integer input: <math>{originalInput}</math> → <math>{integerValue}</math>.	Interpreta l'input come intero valido: <math>{originalInput}->{integerValue}</math>.
IntegerToRomanNumeralStep1Title1	Identify integer	Normalizza e leggi l'intero
IntegerToRomanNumeralStep2TextUnit1	Split the number into place values: <math>{placeValues}</math>, then map each part to Roman symbols: <math>{romanPieces}</math>.	Scomponi il numero per ordini di grandezza: <math>{placeValues}</math>; simboli romani corrispondenti: <math>{romanPieces}</math>.
IntegerToRomanNumeralStep2Title1	Decompose place values	Scomponi per valori posizionali
IntegerToRomanNumeralStep3TextUnit1	Combine the mapped symbols to get the canonical Roman numeral: <math>{integerValue}</math> → <math>{romanResult}</math>.	Combina i simboli ottenuti: <math>{integerValue}->{romanResult}</math>.
IntegerToRomanNumeralStep3Title1	Build Roman numeral	Combina i simboli romani
JoinBenefit1	Live Help	Live Help
JoinBenefit2	Earn rewards and prizes	Guadagna ricompense e premi
JoinBenefit3	Customize everything	Personalizza tutto
JoinCommunityHeadline	Join a community with 26,970,008 solved equations	Join a community with 26,970,008 solved equations
KeyboardInputMode	Keyboard	Tastiera
LatestRelatedDrillsSolved	Latest Related Drills Solved	Ultimi esercizi correlati risolti
LatestSolved	Latest Solved	Ultimi risolti
LatestTopics	Topics	Argomenti
LatestVideoSectionTitle	Latest Videos	Ultimi Video
LCMCalculator	Least common multiple (LCM)	Calcolatrice mcm
LCMCalculatorContent	The least common multiple (LCM), sometimes called the lowest common multiple or least common divisor (LCD), is the smallest number that two or more selected numbers can divide evenly into without a remainder. For example, <math>21</math> is the LCM of <math>3</math> and <math>7</math> because it is the lowest number that they both divide evenly into.<br><br> There are several ways to find the LCM: listing the multiples of each number, prime factorization, the cake or ladder method, the division method, or using the greatest common factor.<br><br> The Tiger Algebra LCM calculator not only finds the LCM but also shows the individual steps involved in doing so, helping you better understand and remember the process!	Il minimo comune multiplo (mcm), talvolta chiamato anche minimo comune denominatore (LCD) è il più piccolo numero equamente divisibile per due o più numeri selezionati senza dare un resto. Per esempio, <math>21</math> è il minimo comune multiplo di <math>3</math> e di <math>7</math> dal momento che è il più piccolo numero equamente divisibile per entrambi senza dare un resto. <br><br> Ci sono vari metodi per calcolare il mcm: fare un elenco dei multipli di ciascun numero, scomposizione in fattori primi, il metodo della torta o della scala, il metodo della divisione o l'impiego del massimo comune divisore.<br><br> La calcolatrice di mcm di Tiger Algebra non solo trova il mcm ma mostra anche i singoli passaggi dell'operazione, aiutandoti a capire meglio e a memorizzare il processo!
LCMCalculatorFormattingGuide	<p>The least common multiple is the smallest number that is divisible by all other numbers in a sequence.</p> <p>For example, if you have a sequence 1, 2, 3, the Least Common Multiple is 6.</p> <p>lcm(1, 2, 3) = 6</p> <br> <h4>Common issues:</h4> <p>Don’t forget to write “lcm,” “least common multiple” or “LCM.”</p> <br> <h3>Examples</h3> <ul> <li><a href=/en/solution/least-common-multiple/lcm%20(24,20,36)/">lcm(24, 20, 36)</a></li> <li><a href="/en/solution/least-common-multiple/LCM%20of%2040%2048%2035/">LCM of 40 48 35</a></li> <li><a href="/en/solution/least-common-multiple/14,22,66LCM/">14,22,66LCM</a></li> <li><a href="/en/solution/least-common-multiple/least%20common%20multiple%201,2,3/">least common multiple 1,2,3</a></li> <li><a href="/en/solution/least-common-multiple/Lcm(21,35,20)/">Lcm(21,35,20)</a></li> </ul>	<p>The least common multiple is the smallest number that is divisible by all other numbers in a sequence.</p> <p>For example, if you have a sequence 1, 2, 3, the Least Common Multiple is 6.</p> <p>lcm(1, 2, 3) = 6</p> <br> <h4>Common issues:</h4> <p>Don’t forget to write “lcm,” “least common multiple” or “LCM.”</p> <br> <h3>Examples</h3> <ul> <li><a href=/en/solution/least-common-multiple/lcm%20(24,20,36)/">lcm(24, 20, 36)</a></li> <li><a href="/en/solution/least-common-multiple/LCM%20of%2040%2048%2035/">LCM of 40 48 35</a></li> <li><a href="/en/solution/least-common-multiple/14,22,66LCM/">14,22,66LCM</a></li> <li><a href="/en/solution/least-common-multiple/least%20common%20multiple%201,2,3/">least common multiple 1,2,3</a></li> <li><a href="/en/solution/least-common-multiple/Lcm(21,35,20)/">Lcm(21,35,20)</a></li> </ul>
LearnMoreWithTiger	Learn more with Tiger	Impara di più con Tiger
LeastCommonMultipleSolver	Least common multiple (LCM) by prime factorization	Minimo comune multiplo (mcm) mediante la scomposizione in fattori primi
LeastCommonMultipleSolver.plugin	the least common multiple (LCM) by prime factorization	il minimo comune multiplo (mcm) mediante la scomposizione in fattori primi
LeastCommonMultipleSolverSolverSpokenDescription	You entered an least common multiple problem!	Hai inserito un problema con minimo comune multiplo!
LeastCommonMultipleSolverStep1SingleNumber	The LCM (Least Common Multiple) of a single number is the number itself. Therefore, the LCM is {StepFinalResult}. <br><br> To find the LCM (Least Common Multiple) of a number, we need at least two numbers to compare. Could you please provide another number?	Il MCM (Minimo Comune Multiplo) di un singolo numero è il numero stesso. Pertanto, il MCM è {StepFinalResult}. <br><br> Per trovare il MCM (Minimo Comune Multiplo) di un numero, abbiamo bisogno di almeno due numeri da confrontare. Potresti fornire un altro numero?
LeastCommonMultipleSolverStep2Spoken	We continue, by counting how often each prime factor appears.	Continuiamo, contando il numero di volte in cui è presente ogni fattore primo.

Loading…

None

String added in the repository

English

Italian 49 characters edited Current translation Translated

9 hours ago

Browse all string changes

Things to check

Unchanged translation

Source and translation are identical

Reset

Glossary

English	Italian
No related strings found in the glossary.

String information

Key

JoinCommunityHeadline

String age

9 hours ago

Last updated

9 hours ago

Source string age

10 hours ago

Translation file

core/TigerAlgebra.Localization/Resources/TigerSharedResource.it.resx, string 28