 
 	static func fib(_ n:Int) -> BInt
 	{
-		var a: Limbs = [0]
-		var b: Limbs = [1]
-		var t: Limbs
+		var a: Limbs = [0], b: Limbs = [1], t: Limbs
 
 		for _ in 2...n
 		{

		}
		else
		{
			let den = ["1"] + [Character](repeating: "0", count: afterPoint.characters.count)
			self.init(beforePoint + afterPoint, over: String(den))
		}
	}


	fileprivate static func euclid(_ a: Limbs, _ b: Limbs) -> Limbs
	{
		var (a, b) = (a, b)
		while !b.equalTo(0)
		{
			(a, b) = (b, a.divMod(b).remainder)
		}
		return a
	}

