Anonymous user
Smallest multiple: Difference between revisions
added pascal version
Thundergnat (talk | contribs) (→{{header|Raku}}: Add a Raku example) |
(added pascal version) |
||
Line 6:
<br>2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
<br>What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
=={{header|Pascal}}==
Here the simplest way, like Raku, check the highest exponent of every prime in range<BR>
Using harded coded primes.
<lang pascal>{$IFDEF FPC}
{$MODE DELPHI}
{$ELSE}
{$APPTAYPE CONSOLE}
{$ENDIF}
const
smallprimes : array[0..10] of Uint32 = (2,3,5,7,11,13,17,19,23,29,31);
MAX = 20;
function getmaxfac(pr: Uint32): Uint32;
//get the pr^highest exponent of prime used in 2 .. MAX
var
i,fac : integer;
Begin
result := pr;
while pr*result <= MAX do
result *= pr;
end;
var
n,pr,prIdx : Uint32;
BEGIN
n := 1;
prIdx := 0;
pr := smallprimes[prIdx];
repeat
pr := smallprimes[prIdx];
n *= getmaxfac(pr);
inc(prIdx);
pr := smallprimes[prIdx];
until pr>MAX;
writeln(n);
{$IFDEF WINDOWS}
READLN;
{$ENDIF}
END.
</lang>
{{out}}
<pre>
232792560
</pre>
=={{header|Raku}}==
Exercise with some larger values as well.
| |||