The expression "f(n) ≥ c * g(n)" is used in computer science and mathematics to describe the relationship between two functions, f(n) and g(n). Here, c is a constant that represents a scaling factor. This inequality indicates that the function f(n) grows at least as fast as g(n) when multiplied by the constant c for sufficiently large values of n. This concept is important in analyzing algorithms, particularly in Big O notation, where it helps to establish lower bounds on the performance of an algorithm. Understanding this relationship allows researchers and developers to compare the efficiency of different algorithms and make informed decisions about which to use.