Added README

Fixed command line arguments

3 files changed, 13 insertions, 5 deletions

diff --git a/challenge-023/ruben-westerberg/README b/challenge-023/ruben-westerberg/README
index 26a2690833..fa2d20850a 100644
--- a/challenge-023/ruben-westerberg/README
+++ b/challenge-023/ruben-westerberg/README
@@ -2,9 +2,17 @@ Solution by Ruben Westerberg
 
 ch-1.pl and ch-1.p6
 ===
-Run the program to calculate the first ten sexy prime pairs
+Run the program to calculate the forward difference of a number sequence entered on the command line.
+If no order is specified an order of 1 is used and if no sequence is specified a example sequence is used
+
+	ch-1.pl usage:
+		./ch-1.pl -o 2 -- 1 3 6 9
+	ch-2.p6 usage:
+		./ch-1.p6 --order=2 1 3 6 9
 
 ch-2.pl and ch-2.p6
 ===
-Run the program with a command line argument to demonstrate the LZW encoding. With no argument, a demonstration string is used
+Run the program to display the prime decomposition of the number intered on the command line.
+If no number is specifed the demo value of 228 is decomposed.
+
 
diff --git a/challenge-023/ruben-westerberg/perl5/ch-2.pl b/challenge-023/ruben-westerberg/perl5/ch-2.pl
index 977635f409..50e9cc2d98 100755
--- a/challenge-023/ruben-westerberg/perl5/ch-2.pl
+++ b/challenge-023/ruben-westerberg/perl5/ch-2.pl
@@ -6,7 +6,7 @@ use v5.26;
 my $i=0;
 my @primes;
 my @factors;
-my $value=my $number=$ARGV[0];
+my $value=my $number=$ARGV[0]//228;
 while (1) {	
 	push(@primes, nextPrime()) if $i >= @primes;
 	last if $primes[$i]>$value;
diff --git a/challenge-023/ruben-westerberg/perl6/ch-2.p6 b/challenge-023/ruben-westerberg/perl6/ch-2.p6
index 08a94c9ec1..3753c92e07 100755
--- a/challenge-023/ruben-westerberg/perl6/ch-2.p6
+++ b/challenge-023/ruben-westerberg/perl6/ch-2.p6
@@ -1,11 +1,11 @@
 #!/usr/bin/env perl6
 
 
-sub MAIN($number) {
+sub MAIN(*@a) {
 	my $primes=(0..*).grep({.is-prime}).cache;
 	my @factors;
 	my $i=0;
-	my $value=$number;
+	my $value=my $number=@a[0]//228;
 	loop {
 		if $value%%$primes[$i] {
 			$value/=$primes[$i];