Module:No-1s limits - Revision history

Dummy index at 01:29, 2 November 2025

2025-11-02T01:29:37Z

← Older revision		Revision as of 01:29, 2 November 2025
Line 3:		Line 3:
	local ET = require('Module:ET')		local ET = require('Module:ET')
	local rat = require('Module:Rational')		local rat = require('Module:Rational')
			local yesno = require("Module:Yesno")

	-- compute all positive ratios n/m with n and m <= q modulo powers of equave		-- compute all positive ratios n/m with n and m <= q modulo powers of equave

ArrowHead294 at 13:00, 1 June 2025

2025-06-01T13:00:33Z

← Older revision		Revision as of 13:00, 1 June 2025
Line 294:		Line 294:
	end		end

	function p.for_small_edos (frame)		function p.for_small_edos(frame)
	local ~~lines~~ = tonumber (frame.args['lines'])		local liners = tonumber(frame.args['lines'])
			local debugg = yesno(frame.args['debug'])
	local t_body = {}		local t_body = {}
	local val = {}		local val = {}
	for i = 1, ~~lines~~ do
			for i = 1, liners do
	local et = ET.parse('' .. i .. 'edo')		local et = ET.parse('' .. i .. 'edo')
	local limit = p.consistency_limit(et, false, 43)		local limit = p.consistency_limit(et, false, 43)
	local vals = p.vals(et, limit)		local vals = p.vals(et, limit)
	t_body[i] = string.format ("\|-\n\| %s\n\| %s\n\| %s", i, limit, vals)		t_body[i] = string.format("\|-\n\| %s\n\| %s\n\| %s", i, limit, vals)
	end		end

	~~return~~ "{\| class=\"wikitable center-all mw-collapsible mw-collapsed\"\n" ..		local result = "{\| class=\"wikitable center-all mw-collapsible mw-collapsed\"\n" ..
	"\|-\n" ..		"\|-\n" ..
	"! EDO\n" ..		"! EDO\n" ..
	"! No-1s consistency limit\n" ..		"! No-1s consistency limit\n" ..
	"! Associated vals\n" ..		"! Associated vals\n" ..
	table.concat (t_body, "\n") ..		table.concat(t_body, "\n") ..
	"\n\|}"		"\n\|}"

			if debugg == true then
			result = "<syntaxhighlight lang=\"wikitext\">" .. result .. "</syntaxhighlight>"
			end

			return frame:preprocess(result)
	end		end

	return p		return p

ArrowHead294: Sort dependencies

2025-05-19T13:48:15Z

Sort dependencies

← Older revision		Revision as of 13:48, 19 May 2025
Line 1:		Line 1:
			local p = {}

			local ET = require('Module:ET')
	local rat = require('Module:Rational')		local rat = require('Module:Rational')
	~~local ET = require('Module:ET')~~
	~~local p = {}~~

	-- compute all positive ratios n/m with n and m <= q modulo powers of equave		-- compute all positive ratios n/m with n and m <= q modulo powers of equave

Dummy index: vals in ascending order

2023-06-14T14:39:01Z

vals in ascending order

← Older revision		Revision as of 14:39, 14 June 2023
Line 272:		Line 272:
	end		end
	end		end
			if bias > 0 then rets = {rets[2], rets[1]} end
	end		end
	else		else

Dummy index: show two vals in more cases

2023-06-14T14:13:31Z

show two vals in more cases

← Older revision		Revision as of 14:13, 14 June 2023
Line 236:		Line 236:
	if limit < minprime * minprime then		if limit < minprime * minprime then
	local nonpatent = false		local nonpatent = false
			local binded = false
	local bias = 0		local bias = 0
	for i = 1, #val do		for i = 1, #val do
Line 243:		Line 244:
	bias = wart_dir[i]		bias = wart_dir[i]
	else		else
	if val[i] ~= patent_val[i] then nonpatent = true end		if val[i] ~= patent_val[i] then
			nonpatent = true
			elseif wart_dir[i] ~= bias then
			binded = true
			end
	end		end
	end		end
	if nonpatent then		if nonpatent or not binded then
	rets[2] = '' .. rets[1]		rets[2] = '' .. rets[1]
	for i = 1, #val do		for i = 1, #val do

Dummy index: 9-odd-limit or over case

2023-06-11T12:52:36Z

9-odd-limit or over case

@@ Line 223: / Line 223: @@
 		end
 	end
 	if limit < minprime * minprime then
 		local nonpatent = false
@@ Line 235: / Line 246: @@
 			end
 		end
 		if nonpatent then
 			rets[2] = '' .. rets[1]
@@ Line 268: / Line 269: @@
 		end
 	else
 	end
 	return table.concat (rets, ", ")

Dummy index at 12:40, 11 June 2023

2023-06-11T12:40:30Z

← Older revision		Revision as of 12:40, 11 June 2023
Line 239:		Line 239:
	local i = table.find(primes, et.equave)		local i = table.find(primes, et.equave)
	if i then		if i then
	rets[1] = rets[i] .. string.sub(wart, i, i)		rets[1] = rets[1] .. string.sub(wart, i, i)
	else		else
	rets[1] = rets[i] .. 'q'		rets[1] = rets[1] .. 'q'
	end		end
	end		end
Line 253:		Line 253:
	rets[1] = rets[1] .. string.rep(string.sub(wart, i, i), difference * 2)		rets[1] = rets[1] .. string.rep(string.sub(wart, i, i), difference * 2)
	elseif difference < 0 then		elseif difference < 0 then
	rets[1] = rets[1] .. string.rep(string.sub(wart, i, i), difference * 2 - 1)		rets[1] = rets[1] .. string.rep(string.sub(wart, i, i), -difference * 2 - 1)
	end		end
	end		end
Line 263:		Line 263:
	rets[2] = rets[2] .. string.rep(string.sub(wart, i, i), difference * 2)		rets[2] = rets[2] .. string.rep(string.sub(wart, i, i), difference * 2)
	elseif difference < 0 then		elseif difference < 0 then
	rets[2] = rets[2] .. string.rep(string.sub(wart, i, i), difference * 2 - 1)		rets[2] = rets[2] .. string.rep(string.sub(wart, i, i), -difference * 2 - 1)
	end		end
	end		end

Dummy index at 12:32, 11 June 2023

2023-06-11T12:32:20Z

← Older revision		Revision as of 12:32, 11 June 2023
Line 211:		Line 211:
	local previ = 1		local previ = 1
	for i = 1, #primes do		for i = 1, #primes do
	local p = primes[i]		local ip = primes[i]
	if p > limit then break end		if ip > limit then break end
	if p == et.equave then		if ip == et.equave then
	val[i] = patent_val[i]		val[i] = patent_val[i]
	elseif p == minprime then		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, p / primes[previ])		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 p = primes[i]		local ip = primes[i]
	if p == et.equave then		if ip == et.equave then
	elseif p == minprime then		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 p = table.find(primes, et.equave)		local i = table.find(primes, et.equave)
	if p then		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 p = primes[i]		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 p = primes[i]		local ip = primes[i]
	if p ~= et.equave then val[i] = val[i] - bias end		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

Dummy index at 12:21, 11 June 2023

2023-06-11T12:21:14Z

← Older revision		Revision as of 12:21, 11 June 2023
Line 239:		Line 239:
	local p = table.find(primes, et.equave)		local p = table.find(primes, et.equave)
	if p then		if p then
	rets[1] = rets[i] .. wart[i]		rets[1] = rets[i] .. string.sub(wart, i, i)
	else		else
	rets[1] = rets[i] .. 'q'		rets[1] = rets[i] .. 'q'
Line 258:		Line 258:
	for i = 1, #val do		for i = 1, #val do
	local p = primes[i]		local p = primes[i]
	if p ~= equave then val[i] = val[i] - bias end		if p ~= 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

Dummy index at 12:13, 11 June 2023

2023-06-11T12:13:32Z

← Older revision		Revision as of 12:13, 11 June 2023
Line 251:		Line 251:
	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
	rets[1] = rets[1] .. wart[i~~] * (~~difference * 2)		rets[1] = rets[1] .. string.rep(string.sub(wart, i, i), difference * 2)
	elseif difference < 0 then		elseif difference < 0 then
	rets[1] = rets[1] .. wart[i~~] * (~~difference * 2 - 1)		rets[1] = rets[1] .. string.rep(string.sub(wart, i, i), difference * 2 - 1)
	end		end
	end		end
Line 261:		Line 261:
	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
	rets[2] = rets[2] .. wart[i~~] * (~~difference * 2)		rets[2] = rets[2] .. string.rep(string.sub(wart, i, i), difference * 2)
	elseif difference < 0 then		elseif difference < 0 then
	rets[2] = rets[2] .. wart[i~~] * (~~difference * 2 - 1)		rets[2] = rets[2] .. string.rep(string.sub(wart, i, i), difference * 2 - 1)
	end		end
	end		end