A ceramic is any of the various hard, brittle, heat-resistant, and corrosion-resistant materials made by shaping and then firing an inorganic, nonmetallic material, such as clay, at a high temperature. Common examples are earthenware, porcelain, and brick. The earliest ceramics made by humans were pottery objects (pots, vessels, or vases) or figurines made from clay, either by itself or mixed with other materials like silica, hardened and sintered in fire.
In materials science, ceramic matrix composites (CMCs) are a subgroup of composite materials and a subgroup of ceramics. They consist of ceramic fibers embedded in a ceramic matrix. The fibers and the matrix both can consist of any ceramic material, whereby carbon and carbon fibers can also be regarded as a ceramic material. The motivation to develop CMCs was to overcome the problems associated with the conventional technical ceramics like alumina, silicon carbide, aluminum nitride, silicon nitride or zirconia – they fracture easily under mechanical or thermo-mechanical loads because of cracks initiated by small defects or scratches.
Ceramic engineering is the science and technology of creating objects from inorganic, non-metallic materials. This is done either by the action of heat, or at lower temperatures using precipitation reactions from high-purity chemical solutions. The term includes the purification of raw materials, the study and production of the chemical compounds concerned, their formation into components and the study of their structure, composition and properties. Ceramic materials may have a crystalline or partly crystalline structure, with long-range order on atomic scale.
In mathematics, the sieve of Atkin is a modern algorithm for finding all prime numbers up to a specified integer. Compared with the ancient sieve of Eratosthenes, which marks off multiples of primes, the sieve of Atkin does some preliminary work and then marks off multiples of squares of primes, thus achieving a better theoretical asymptotic complexity. It was created in 2003 by A. O. L. Atkin and Daniel J. Bernstein. In the algorithm: All remainders are modulo-sixty remainders (divide the number by 60 and return the remainder).
In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking as composite (i.e., not prime) the multiples of each prime, starting with the first prime number, 2. The multiples of a given prime are generated as a sequence of numbers starting from that prime, with constant difference between them that is equal to that prime. This is the sieve's key distinction from using trial division to sequentially test each candidate number for divisibility by each prime.
