Multiplicative order: Difference between revisions

→‎{{header|Ruby}}: corrected require (deprecated 'mathn'), add output
(Added EchoLisp)
(→‎{{header|Ruby}}: corrected require (deprecated 'mathn'), add output)
Line 858:
=={{header|Ruby}}==
 
<lang ruby>require 'rationalprime' # for lcm
require 'mathn' # for prime_division
 
def powerMod(b, p, m)
p.to_s(2).each_char.inject(1) do |result, bit|
result = 1
bits = p.to_s(2)
for bit in bits.split('')
result = (result * result) % m
if bit == '1' ? (result * b) % m : result
result = (result * b) % m
end
end
result
end
 
Line 878 ⟶ 872:
r = 1
for q, e in t.prime_division
x = powerMod(a, t / q ** e, pk)
while x != 1
r *= q
Line 888 ⟶ 882:
 
def multOrder(a, m)
m.prime_division.inject(1) {do |result, f|
result.lcm(multOrder_(a, *f))
}end
end
 
puts multOrder(37, 1000) # 100
b = 10**20-1
puts multOrder(2, b) # 3748806900
puts multOrder(17,b) # 1499522760
b = 100001
puts multOrder(54,b)
Line 905 ⟶ 899:
puts 'Everything checks.'
end</lang>
 
{{out}}
<pre>
100
3748806900
1499522760
9090
1
Everything checks.
</pre>
 
=={{header|Seed7}}==
Anonymous user