Module:No-1s limits: Difference between revisions
Dummy index (talk | contribs) mNo edit summary |
Dummy index (talk | contribs) mNo edit summary |
||
| Line 211: | Line 211: | ||
local previ = 1 | local previ = 1 | ||
for i = 1, #primes do | for i = 1, #primes do | ||
local | local ip = primes[i] | ||
if | if ip > limit then break end | ||
if | if ip == et.equave then | ||
val[i] = patent_val[i] | val[i] = patent_val[i] | ||
elseif | elseif ip == minprime then | ||
val[i] = patent_val[i] | val[i] = patent_val[i] | ||
previ = i | previ = i | ||
else | else | ||
val[i] = val[previ] + ET.approximate(et, | val[i] = val[previ] + ET.approximate(et, ip / primes[previ]) | ||
previ = i | previ = i | ||
end | end | ||
| Line 227: | Line 227: | ||
local bias = 0 | local bias = 0 | ||
for i = 1, #val do | for i = 1, #val do | ||
local | local ip = primes[i] | ||
if | if ip == et.equave then | ||
elseif | elseif ip == minprime then | ||
bias = wart_dir[i] | bias = wart_dir[i] | ||
else | else | ||
| Line 237: | Line 237: | ||
rets[1] = '' | rets[1] = '' | ||
if et.equave ~= 2 then | if et.equave ~= 2 then | ||
local | local i = table.find(primes, et.equave) | ||
if | if i then | ||
rets[1] = rets[i] .. string.sub(wart, i, i) | rets[1] = rets[i] .. string.sub(wart, i, i) | ||
else | else | ||
| Line 248: | Line 248: | ||
rets[2] = '' .. rets[1] | rets[2] = '' .. rets[1] | ||
for i = 1, #val do | for i = 1, #val do | ||
local | local ip = primes[i] | ||
local difference = (val[i] - patent_val[i]) * wart_dir[i] | local difference = (val[i] - patent_val[i]) * wart_dir[i] | ||
if difference > 0 then | if difference > 0 then | ||
| Line 257: | Line 257: | ||
end | end | ||
for i = 1, #val do | for i = 1, #val do | ||
local | local ip = primes[i] | ||
if | if ip ~= et.equave then val[i] = val[i] - bias end | ||
local difference = (val[i] - patent_val[i]) * wart_dir[i] | local difference = (val[i] - patent_val[i]) * wart_dir[i] | ||
if difference > 0 then | if difference > 0 then | ||