Zumkeller numbers: Difference between revisions

{{trans|D}}

 

V divs = [1, n]

V i = 2

=={{header|AArch64 Assembly}}==

{{works with|as|Raspberry Pi 3B version Buster 64 bits}}

/* ARM assembly AARCH64 Raspberry PI 3B */

/* program zumkellex641.s */

On my machine, this takes about 0.28 seconds to perform the two main searches and a further 107 to do the stretch task. However, the latter time can be dramatically reduced to 1.7 seconds with the cheat of knowing beforehand that the first 200 or so odd Zumkellers not ending with 5 are divisible by 63. The "abundant number" optimisation's now used with odd numbers, but the cheat-free running time was only two to three seconds longer without it.

 

on aliquotSum(n)

if (n < 2) then return 0

 

{{output}}

6 12 20 24 28 30 40 42 48 54 56 60 66 70 78 80 84 88 90 96

102 104 108 112 114 120 126 132 138 140 150 156 160 168 174 176 180 186 192 198

=={{header|ARM Assembly}}==

{{works with|as|Raspberry Pi}}

/* ARM assembly Raspberry PI */

/* program zumkeller4.s */

=={{header|C sharp|C#}}==

{{trans|Go}}

using System.Collections.Generic;

using System.Linq;

 

=={{header|C++}}==

#include <cmath>

#include <vector>

=={{header|D}}==

{{trans|C#}}

import std.stdio;

 

=={{header|F_Sharp|F#}}==

This task uses [https://rosettacode.org/wiki/Sum_of_divisors#F.23]

// Zumkeller numbers: Nigel Galloway. May 16th., 2021

let rec fG n g=match g with h::_ when h>=n->h=n |h::t->fG n t || fG(n-h) t |_->false

=={{header|Factor}}==

{{works with|Factor|0.99 2019-10-06}}

math.primes.factors memoize prettyprint sequences ;

 

 

=={{header|Go}}==

 

import "fmt"

=={{header|Haskell}}==

{{Trans|Python}}

import Data.List.Split (chunksOf)

import Data.Numbers.Primes (primeFactors)

 

=={{header|J}}==

zum=: {{

if. 2|s=. +/divs=. divisors y do. 0

}}@></lang>

 

6 12 20 24 28 30 40 42 48 54 56 60 66 70 78 80 84 88 90 96 102 104

108 112 114 120 126 132 138 140 150 156 160 168 174 176 180 186 192 198 204 208 210 216

1095633 1108107 1145529 1162161 1198197 1224531 1270269 1307691 1324323 1378377</lang>

=={{header|Java}}==

import java.util.ArrayList;

import java.util.Collections;

generates a stream of partitions is easily transformed into a

specialized function that prunes irrelevant partitions efficiently.

def factors:

. as $num

end

| true)

 

"First 220:", limit(220; range(2; infinite) | select(is_zumkeller)),

 

=={{header|Julia}}==

 

function factorize(n)

=={{header|Kotlin}}==

{{trans|Java}}

import kotlin.math.sqrt

 

 

=={{header|Lobster}}==

 

// Derived from Julia and Python versions

 

=={{header|Mathematica}} / {{header|Wolfram Language}}==

ZumkellerQ[n_] := Module[{d = Divisors[n], t, ds, x},

ds = Total[d];

=={{header|Nim}}==

{{trans|Go}}

 

template isEven(n: int): bool = (n and 1) == 0

Now using the trick, that one partition sum must include n and improved recursive search.<BR>

Limit is ~1.2e11

//https://oeis.org/A083206/a083206.txt

{$IFDEF FPC}

=={{header|Perl}}==

{{libheader|ntheory}}

use warnings;

use feature 'say';

=={{header|Phix}}==

{{trans|Go}}

<span style="color: #008080;">function</span> <span style="color: #000000;">isPartSum</span><span style="color: #0000FF;">(</span><span style="color: #004080;">sequence</span> <span style="color: #000000;">f</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">integer</span> <span style="color: #000000;">l</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">t</span><span style="color: #0000FF;">)</span>

<span style="color: #008080;">if</span> <span style="color: #000000;">t</span><span style="color: #0000FF;">=</span><span style="color: #000000;">0</span> <span style="color: #008080;">then</span> <span style="color: #008080;">return</span> <span style="color: #004600;">true</span> <span style="color: #008080;">end</span> <span style="color: #008080;">if</span>

 

=={{header|PicoLisp}}==

(make

(for I N

===Procedural===

Modified from a footnote at OEIS A083207 (see reference in problem text) by Charles R Greathouse IV.

 

from sympy.combinatorics.subsets import Subset

Relying on the standard Python libraries, as an alternative to importing SymPy:

 

 

from itertools import (

{{trans|Zkl}}

 

 

(require math/number-theory)

(formerly Perl 6)

{{libheader|ntheory}}

 

sub zumkeller ($range) {

=={{header|REXX}}==

The construction of the partitions were created in the order in which the most likely partitions would match.

parse arg n m v . /*obtain optional arguments from the CL*/

if n=='' | n=="," then n= 220 /*Not specified? Then use the default.*/

 

=={{header|Ring}}==

load "stdlib.ring"

 

 

=={{header|Ruby}}==

def divisors

 

=={{header|Rust}}==

use std::convert::TryInto;

 

 

=={{header|Sidef}}==

 

return false if n.is_prime

 

=={{header|Standard ML}}==

exception Found of string ;

 

</lang>

call loop and output - interpreter

- val Zumkellerlist = fn step => fn no5 =>

let

{{trans|Go}}

 

 

extension BinaryInteger {

=={{header|Visual Basic .NET}}==

{{trans|C#}}

Function GetDivisors(n As Integer) As List(Of Integer)

Dim divs As New List(Of Integer) From {

=={{header|Vlang}}==

{{trans|Go}}

mut divs := [1, n]

for i := 2; i*i <= n; i++ {

{{libheader|Wren-fmt}}

I've reversed the order of the recursive calls in the last line of the ''isPartSum'' function which, as noted in the Phix entry, seems to make little difference to Go but (as one might have expected) speeds up this Wren script enormously. The first part is now near instant but was taking several minutes previously. Overall it's now only about 5.5 times slower than Go itself which is a good result for the Wren interpreter.

import "/fmt" for Fmt

import "io" for Stdout

=={{header|zkl}}==

{{trans|Julia}} {{trans|Go}}

// if(n==1) return(T); // we con't care about this case

( pd:=[1..(n).toFloat().sqrt()].filter('wrap(x){ n%x==0 }) )

canSum(sum/2,ds) and n or Void.Skip // sum is even

}</lang>

zw:=[2..].tweak(isZumkellerW);

do(11){ zw.walk(20).pump(String,"%4d ".fmt).println() }