Rhonda numbers: Difference between revisions

 

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

#include <cassert>

#include <iomanip>

std::cout << "\n\n";

}

 

{{out}}

=={{header|Factor}}==

{{works with|Factor|0.99 2022-04-03}}

math.parser math.primes math.primes.factors prettyprint ranges

sequences sequences.extras ;

base "In base %d: " printf r base list. ;

 

{{out}}

<pre style="height:40ex">

{{trans|Wren}}

{{libheader|Go-rcu}}

 

import (

}

}

 

{{out}}

=={{header|J}}==

 

isrhonda=: (*/@:(#.inv) = (* +/@q:))"0

 

 

task''

{{out}}

<pre style="height:40ex;overflow:scroll;">

 

=={{header|Java}}==

public static void main(String[] args) {

final int limit = 15;

return digitProduct(base, n) == base * primeFactorSum(n);

}

 

{{out}}

 

=={{header|Julia}}==

 

isRhonda(n, b) = prod(digits(n, base=b)) == b * sum([prod(pair) for pair in factor(n).pe])

 

displayrhondas(2, 16, 15)

<pre style="height:40ex;overflow:scroll;">

First 15 Rhondas in base 4:

 

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

RhondaNumberQ[b_Integer][n_Integer] := Module[{l, r},

l = Times @@ IntegerDigits[n, b];

,

{b, bases}

{{out}}

<pre>base 4:{10206,11935,12150,16031,45030,94185,113022,114415,191149,244713,259753,374782,392121,503773,649902}

=={{header|Perl}}==

{{libheader|ntheory}}

use warnings;

use feature 'say';

EOT

}

{{out}}

<pre style="height:20ex">First 15 Rhonda numbers to base 4:

 

=={{header|Phix}}==

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">constant</span> <span style="color: #000000;">fmt</span> <span style="color: #0000FF;">=</span> <span style="color: #008000;">"""

<span style="color: #008080;">end</span> <span style="color: #008080;">if</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

{{out}}

<pre style="height:40ex;overflow:scroll;">

=={{header|Raku}}==

Find and show the first 15 so as to display the namesake Rhonda number 25662.

 

my @factor-sum;

put "In base 10: " ~ @rhonda».fmt("%{$ch}s").join: ', ';

put $b.fmt("In base %2d: ") ~ @rhonda».base($b)».fmt("%{$ch}s").join: ', ';

{{out}}

<pre style="height:40ex;overflow:scroll;">First 15 Rhonda numbers to base 4:

 

=={{header|Rust}}==

// radix_fmt = "1.0"

 

print!("\n\n");

}

 

{{out}}

 

=={{header|Sidef}}==

base.is_composite || return false

n > 0 || return false

say ("First 10 Rhonda numbers to base #{b}: ",

10.by { is_rhonda_number(_, b) })

{{out}}

<pre>

 

=={{header|Swift}}==

var product = 1

var n = num

}

print("\n")

 

{{out}}

{{libheader|Wren-math}}

{{libheader|Wren-fmt}}

import "./fmt" for Fmt, Conv

 

Fmt.print("In base $-2d: $*s", b, maxLen, rhonda3)

}

 

{{out}}