-
1 square
square [skwεər]1. nouna. ( = shape) carré m ; [of chessboard, graph paper] case f ; [of cake] part f (carrée) ; ( = window pane) carreau mc. (Mathematics) carré m2. adjectivea. (in shape) carréc. ( = in order) en ordre• to get square with sb (financially) régler ses comptes avec qn ; ( = get even with) rendre la pareille à qne. ( = honest) [dealings] honnête3. adverba. ( = squarely) to hit sb square on the forehead/on the jaw atteindre qn en plein front/en pleine mâchoirea. ( = settle) [+ accounts] équilibrer ; [+ debts] réglerb. (Mathematics) [+ number] élever au carré6. compounds[+ account, debts] régler* * *[skweə(r)] 1.1) ( in town) place f; ( in barracks) cour f2) ( four-sided shape) carré m; (in board game, crossword) case f; (of glass, linoleum) carreau m3) Mathematics ( self-multiplied) carré m4) Mathematics, Technology ( instrument) équerre f5) (colloq) ( old-fashioned person) ringard/-e (colloq) m/f2.1) ( right-angled) [shape, box, jaw, shoulders] carré; ( correctly aligned) bien droit2) Mathematics [metre, mile] carré3) fig (level, quits)to be (all) square — [accounts] être équilibré; [people] être quitte; [teams] être à égalité
4) ( honest) honnête5) (colloq) ( boring) ringard (colloq)3. 4.transitive verb1) lit équarrir [stone, timber]; couper [quelque chose] au carré or à angle droit [corner, end, section]2) ( settle) régler [account, debt]3) Sport égaliser [score, series]5.go home early; I'll square it with the boss — pars avant l'heure, j'arrangerai ça avec le patron
squared past participle adjective1) [paper] quadrillé2) Mathematics [number] au carré•Phrasal Verbs:••
См. также в других словарях:
Order dimension — A partial order of dimension 4 (shown as a Hasse diagram) and four total orderings that form a realizer for this partial order. In mathematics, the dimension of a partially ordered set (poset) is the smallest number of total orders the… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Order (mathematics) — Contents 1 In algebra 2 In arithmetic 3 In analysis 4 … Wikipedia
Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… … Wikipedia
Order theory — For a topical guide to this subject, see Outline of order theory. Order theory is a branch of mathematics which investigates our intuitive notion of order using binary relations. It provides a formal framework for describing statements such as… … Wikipedia
Graph of desire — The graph of desire is a conceptual tool from the psychoanalytic theory of Jacques Lacan.HistoryLacan devised numerous quasi mathematical diagrams to represent the structure of the unconscious and its points of contact with empirical and mental… … Wikipedia
Graph property — In graph theory a graph property is any inherently graph theoretical property of graphs (formal definitions follow), distinguished from properties of graphs described in terms of various graph representations: graph drawings, data structures for… … Wikipedia
Graph labeling — In the mathematical discipline of graph theory, a graph labeling is the assignment of labels traditionally represented with integers to the edges or vertices, or both, of a graph. The labeling strategy depends on the category of the labeling.… … Wikipedia
Graph embedding — In topological graph theory, an embedding of a graph G on a surface Sigma; is a representation of G on Sigma; in which points of Sigma; are associated to vertices and simple arcs (homeomorphic images of [0,1] ) are associated to edges in such a… … Wikipedia
Graph reduction — In computer science, graph reduction implements an efficient version of non strict evaluation, an evaluation strategy where the arguments to a function are not immediately evaluated. This form of non strict evaluation is also known as lazy… … Wikipedia