Is there a way to implement an algorithm for calculating (**b**^**n**) % **k**, without overflowing? **b** is a double and **n** and **k** are integers.\nUsing modulo operator inside the for loop while multiplying doesn\'t produce the correct result\n\n```\ndouble res = 1.0;\ndouble b = Math.Sqrt(13);\nint n = 2000;\nint k = 1000000007;\nfor (int i = 0; i < n; i++)\n{\n\tres = (res * b) % k;\n}\n```\n\nAny ideas?

Is there a way to implement an algorithm for calculating (b^n) % k, without overflowing? b is a double and n and k are integers.\nUsing modulo operator inside t