Polydivisible number: Difference between revisions

Revision as of 17:23, 4 June 2022

Latest revision as of 19:36, 13 February 2025

(8 intermediate revisions by 4 users not shown)

Line 50:

|}

===Estimate for ''F<mathsub>F_bb</sub>''(''n'')</math> and <math>\&Sigma;(''b'')</math>===

[[File:Graph of polydivisible number vectorial.svg|right|thumb|400px|Graph of number of <math>n</math>-digit polydivisible numbers in base 10 <math>F_{10}(n)</math> vs estimate of <math>F_{10}(n)</math>]]

Line 311:

==Programming example==

The example below searches for polydivisible numbers in [[Python (programming language)|Python]].

<syntaxhighlight lang="python">

def find_polydivisible(base: int) -> Listlist[int]:

"""Find polydivisible number."""

numbers = []

Line 321:

while not previous == []:

numbers.append(previous)

for in in range(0, len(previous)):

for j in range(0, base):

number = previous[i]n * base + j

if number % digits == 0:

new.append(number)

Line 362:

{{Divisor classes}}

[[Category:Articles with example Python (programming language) code]]

[[Category:Base-dependent integer sequences]]

[[Category:Modular arithmetic]]