5 research outputs found
Counting arithmetic formulas
Anarithmeticformulaisanexpressioninvolvingonlytheconstant1, and the binary operations of addition and multiplication, withmultiplicationby1notallowed.Weobtainanasymptoticformulaforthenumberofarithmeticformulasevaluatingtonasngoestoinfinity, solving a conjecture of E.K. Gnang and D. Zeilberger. Wegivealsoanasymptoticformulaforthenumberofarithmeticfor-mulas evaluating tonand using exactlykmultiplications. Finallyweanalyzethreespecificencodingsforproducingarithmeticfor-mulas. For almost all integersn, we compare the lengths of thearithmetic formulas fornthat each encoding produces with thelength of the shortest formula forn(which we estimate from be-low).Webrieflydiscussthetime-spacetradeoffofferedbyeac
Матеріали 1-го симпозіуму з передових освітніх технологій - Том 1: AET
Матеріали 1-го симпозіуму з передових освітніх технологій.Proceedings of the 1st Symposium on Advances in Educational Technology