Boolean Decision Functions Steven Finch April 22, 2015 Let  : {0 1} → {0 1} be the Boolean function that decides whether a given ( 1)-bit odd integer is square-free. More precisely, ½ - Irreducible polynomial - Document - PDFSEARCH.IO

First Page	Meta Content
	Boolean Decision Functions Steven Finch April 22, 2015 Let  : {0 1} → {0 1} be the Boolean function that decides whether a given ( + 1)-bit odd integer is square-free. More precisely, ½ Add to Reading List Document Date: 2015-04-21 10:31:24 Open Document File Size: 90,42 KB Share Result on Facebook City Tokyo / / Company Aegean Park Press / Saks / / IndustryTerm infinite product / / Organization Cambridge Univ. / / Person Steven Finch April / Steven R. Finch / / SocialTag Integer sequences Algebra Polynomials FO Computational complexity theory Prime number Primality test Square-free integer Irreducible polynomial Mathematics

Boolean Decision Functions Steven Finch April 22, 2015 Let  : {0 1} → {0 1} be the Boolean function that decides whether a given ( + 1)-bit odd integer is square-free. More precisely, ½Add to Reading List