This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n15https://www.academia.edu/
n20https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n16https://www.academia.edu/11654065/
owlhttp://www.w3.org/2002/07/owl#
dbpedia-ithttp://it.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbpedia-frhttp://fr.dbpedia.org/resource/
dbpedia-zhhttp://zh.dbpedia.org/resource/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Persistence_of_a_number
rdfs:label
数的韧性 Persistence of a number Persistance d'un nombre Persistenza di un numero
rdfs:comment
数的韧性是針對正整數的特性，是指此整數需連續進行幾次特定的處理才能到達不動點，數字不再變動。 数的韧性一般可分為加法韧性及乘法韧性，前者是反覆針對數字的各位數字求和（即數字和），後者則是反覆計算各位數字的乘積，當數字為1位數時即為不動點，數字不會再變動。因為結果會依各位數字的有所不同，数的韧性也和進制有關，以下只考慮十進制的情形求和。 當反覆計算數字和時，最後的不動點即為該數字的數字根。因此一數字的加法韧性也可以定義為一數字需計算幾次數字和才能得到其數字根。 In matematica, la persistenza di un numero è il termine usato per descrivere il numero di operazioni che si devono applicare ad un intero per raggiungere un punto fisso, ad esempio fino a quando successive operazioni non cambieranno più il numero. La persistance d'un nombre est, en mathématiques, le nombre d'étapes nécessaires pour atteindre un point fixe, lorsqu'on effectue par itérations successives une série d'opérations à ce nombre. In mathematics, the persistence of a number is the number of times one must apply a given operation to an integer before reaching a fixed point at which the operation no longer alters the number. Usually, this involves additive or multiplicative persistence of a non-negative integer, which is how often one has to replace the number by the sum or product of its digits until one reaches a single digit. Because the numbers are broken down into their digits, the additive or multiplicative persistence depends on the radix. In the remainder of this article, base ten is assumed.
dcterms:subject
dbc:Number_theory
dbo:wikiPageID
624708
dbo:wikiPageRevisionID
1124183370
dbo:wikiPageWikiLink
dbc:Number_theory dbr:Digit_sum dbr:Logarithm dbr:Iterated_logarithm dbr:Springer-Verlag dbr:Mathematics dbr:Digital_root dbr:Fixed_point_(mathematics) dbr:Radix
dbo:wikiPageExternalLink
n15:11654065 n16:On_the_additive_persistence_of_a_number_in_base_p
owl:sameAs
wikidata:Q22675078 dbpedia-zh:数的韧性 dbpedia-it:Persistenza_di_un_numero freebase:m.02xy_q dbpedia-fr:Persistance_d'un_nombre n20:29BvW
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Classes_of_natural_numbers dbt:OEIS dbt:Cite_book dbt:Short_description
dbo:abstract
In matematica, la persistenza di un numero è il termine usato per descrivere il numero di operazioni che si devono applicare ad un intero per raggiungere un punto fisso, ad esempio fino a quando successive operazioni non cambieranno più il numero. Generalmente, questo termine viene riferito alla persistenza additiva o moltiplicativa di un intero, che indica quante volte bisogna sostituire un numero con la somma o con la moltiplicazione delle sue cifre fino a quando si raggiunge un numero con una sola cifra.La persistenza additiva o moltiplicativa dipende dalla base di numerazione in cui si sta operando. In quest'articolo si considerano solamente i casi in base 10. La persistance d'un nombre est, en mathématiques, le nombre d'étapes nécessaires pour atteindre un point fixe, lorsqu'on effectue par itérations successives une série d'opérations à ce nombre. In mathematics, the persistence of a number is the number of times one must apply a given operation to an integer before reaching a fixed point at which the operation no longer alters the number. Usually, this involves additive or multiplicative persistence of a non-negative integer, which is how often one has to replace the number by the sum or product of its digits until one reaches a single digit. Because the numbers are broken down into their digits, the additive or multiplicative persistence depends on the radix. In the remainder of this article, base ten is assumed. The single-digit final state reached in the process of calculating an integer's additive persistence is its digital root. Put another way, a number's additive persistence counts how many times we must sum its digits to arrive at its digital root. 数的韧性是針對正整數的特性，是指此整數需連續進行幾次特定的處理才能到達不動點，數字不再變動。 数的韧性一般可分為加法韧性及乘法韧性，前者是反覆針對數字的各位數字求和（即數字和），後者則是反覆計算各位數字的乘積，當數字為1位數時即為不動點，數字不會再變動。因為結果會依各位數字的有所不同，数的韧性也和進制有關，以下只考慮十進制的情形求和。 當反覆計算數字和時，最後的不動點即為該數字的數字根。因此一數字的加法韧性也可以定義為一數字需計算幾次數字和才能得到其數字根。
gold:hypernym
dbr:Number
prov:wasDerivedFrom
wikipedia-en:Persistence_of_a_number?oldid=1124183370&ns=0
dbo:wikiPageLength
4752
foaf:isPrimaryTopicOf
wikipedia-en:Persistence_of_a_number