About: Persistence of a number     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FPersistence_of_a_number&invfp=IFP_OFF&sas=SAME_AS_OFF

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.

AttributesValues
rdfs:label
  • Persistance d'un nombre (fr)
  • Persistenza di un numero (it)
  • Persistence of a number (en)
  • 数的韧性 (zh)
rdfs:comment
  • 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. (fr)
  • 数的韧性是針對正整數的特性,是指此整數需連續進行幾次特定的處理才能到達不動點,數字不再變動。 数的韧性一般可分為加法韧性及乘法韧性,前者是反覆針對數字的各位數字求和(即數字和),後者則是反覆計算各位數字的乘積,當數字為1位數時即為不動點,數字不會再變動。因為結果會依各位數字的有所不同,数的韧性也和進制有關,以下只考慮十進制的情形求和。 當反覆計算數字和時,最後的不動點即為該數字的數字根。因此一數字的加法韧性也可以定義為一數字需計算幾次數字和才能得到其數字根。 (zh)
  • 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. (en)
  • 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. (it)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • 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. (en)
  • 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. (fr)
  • 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. (it)
  • 数的韧性是針對正整數的特性,是指此整數需連續進行幾次特定的處理才能到達不動點,數字不再變動。 数的韧性一般可分為加法韧性及乘法韧性,前者是反覆針對數字的各位數字求和(即數字和),後者則是反覆計算各位數字的乘積,當數字為1位數時即為不動點,數字不會再變動。因為結果會依各位數字的有所不同,数的韧性也和進制有關,以下只考慮十進制的情形求和。 當反覆計算數字和時,最後的不動點即為該數字的數字根。因此一數字的加法韧性也可以定義為一數字需計算幾次數字和才能得到其數字根。 (zh)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is Wikipage disambiguates of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software