AI & ChatGPT searches , social queriess for EULER SEQUENCE
Search references for EULER SEQUENCE. Phrases containing EULER SEQUENCE
See searches and references containing EULER SEQUENCE!
Search references for EULER SEQUENCE. Phrases containing EULER SEQUENCE
See searches and references containing EULER SEQUENCE!EULER SEQUENCE
Short exact sequence of sheaves on projective space
In mathematics, the Euler sequence is a particular exact sequence of sheaves on n-dimensional projective space over a ring. It shows that the sheaf of
Euler_sequence
Integers occurring in the coefficients of the Taylor series of 1/cosh t
In mathematics, the Euler numbers are a sequence En of integers (sequence A122045 in the OEIS) defined by the Taylor series expansion 1 cosh t = 2 e
Euler_numbers
(single or sequence), or other mathematical entity. Many of these entities have been given simple yet ambiguous names such as Euler's function, Euler's equation
List of topics named after Leonhard Euler
List_of_topics_named_after_Leonhard_Euler
Mathematical concept
503, 547, 593, 641, 691, 743, 797, 853, 911, 971, ... (sequence A005846 in the OEIS). Euler's lucky numbers are unrelated to the "lucky numbers" defined
Lucky_numbers_of_Euler
Description of the orientation of a rigid body
kinds of sequences are called "Euler angles". In that case, the sequences of the first group are called proper or classic Euler angles. The Euler angles
Euler_angles
Mathematical strategy
Spatial rotations in three dimensions can be parametrized using both Euler angles and unit quaternions. This article explains how to convert between the
Conversion between quaternions and Euler angles
Conversion_between_quaternions_and_Euler_angles
Topological invariant in mathematics
algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic) is a topological invariant
Euler_characteristic
Number of integers coprime to and less than n
\ln(x)} or log e ( x ) {\displaystyle \log _{e}(x)} . In number theory, Euler's totient function counts the positive integers up to a given integer n {\displaystyle
Euler's_totient_function
Numbers obtained by adding the two previous ones
Fibonacci sequence is a sequence in which each element is the sum of the two elements that precede it. Numbers that are part of the Fibonacci sequence are known
Fibonacci_sequence
Numerical method for ordinary differential equations
numerical analysis and scientific computing, the backward Euler method (or implicit Euler method) is one of the most basic numerical methods for the
Backward_Euler_method
2.71828…, base of natural logarithms
sometimes called Euler's number, after the Swiss mathematician Leonhard Euler, though this can invite confusion with Euler numbers, or with Euler's constant,
E_(mathematical_constant)
Transformation of a mathematical sequence
transform is a sequence transformation (i.e., a transform of a sequence) that computes its forward differences. It is closely related to the Euler transform
Binomial_transform
Summation formula
In mathematics, the Euler–Maclaurin formula is a formula for the difference between an integral and a closely related sum. It can be used to approximate
Euler–Maclaurin_formula
Extension of the factorial function
(ed.). "Sequence A245886 (Decimal expansion of Gamma(-3/2), where Gamma is Euler's gamma function)". The On-Line Encyclopedia of Integer Sequences. OEIS
Gamma_function
Graphical set representation involving overlapping shapes
An Euler diagram (/ˈɔɪlər/, OY-lər) is a diagrammatic means of representing sets and their relationships. They are particularly useful for explaining
Euler_diagram
Pair of integers related by their divisors
the case m = n − 1. Euler's rule creates additional amicable pairs for (m,n) = (1,8), (29,40) with no others being known. Euler (1747 & 1750) overall
Amicable_numbers
Difference between logarithm and harmonic series
\ln(x)} or log e ( x ) {\displaystyle \log _{e}(x)} . Euler's constant (sometimes called the Euler–Mascheroni constant) is a mathematical constant, usually
Euler's_constant
Visualization of the prime numbers formed by arranging the integers into a spiral
certain vertical and diagonal lines, and amongst these the so-called Euler sequences with high concentrations of primes are discovered." Diagonal, horizontal
Ulam_spiral
Trail in a graph that visits each edge once
posthumously in 1873 by Carl Hierholzer. This is known as Euler's Theorem: A connected graph has an Euler cycle if and only if every vertex has an even number
Eulerian_path
Characteristic classes of vector bundles
from Milnor−Stasheff, but seems more natural. The sequence is sometimes called the Euler sequence. Hartshorne, Ch. II. Theorem 8.13. In a ring-theoretic
Chern_class
Analytic function in mathematics
The Riemann zeta function or Euler–Riemann zeta function, denoted by the lowercase Greek letter ζ (zeta), is a mathematical function of a complex variable
Riemann_zeta_function
Odd composite number which passes the given congruence
In number theory, an odd integer n is called an Euler–Jacobi probable prime (or, more commonly, an Euler probable prime) to base a, if a and n are coprime
Euler–Jacobi_pseudoprime
Long exact sequence
space of a sphere bundle. The Gysin sequence is a useful tool for calculating the cohomology rings given the Euler class of the sphere bundle and vice
Gysin_homomorphism
Prime number of the form 2^n – 1
antiquity because of their close connection to perfect numbers: the Euclid–Euler theorem asserts a one-to-one correspondence between even perfect numbers
Mersenne_prime
Polynomial sequence
coefficients. They are used for series expansion of functions, and with the Euler–MacLaurin formula. These polynomials occur in the study of many special
Bernoulli_polynomials
T_{\mathbb {P} (E)/X}\to 0} , which is the relative version of the Euler sequence. Fulton 1998, Appendix B.5.8 Eisenbud, David; Joe, Harris (2016), 3264
Grassmann_bundle
Sequence of homomorphisms such that each kernel equals the preceding image
In mathematics, an exact sequence is a sequence of morphisms between objects (for example, groups, rings, modules, and, more generally, objects of an abelian
Exact_sequence
Even integers as sums of two primes
the Prussian mathematician Christian Goldbach wrote a letter to Leonhard Euler (letter XLIII), in which he proposed the following conjecture: Every integer
Goldbach's_conjecture
Recursive integer sequence
2&429&1430\end{bmatrix}}=5} et cetera. The Catalan sequence was described in 1751 by Leonhard Euler, who was interested in the number of different ways
Catalan_number
Number equal to the sum of its proper divisors
Two millennia later, Leonhard Euler proved that all even perfect numbers are of this form. This is known as the Euclid–Euler theorem. It is not known whether
Perfect_number
Mathematical function
In mathematics, the Euler function is given by ϕ ( q ) = ∏ k = 1 ∞ ( 1 − q k ) , | q | < 1. {\displaystyle \phi (q)=\prod _{k=1}^{\infty }(1-q^{k}),\quad
Euler_function
Infinite series with alternating signs
its sequence of partial sums, (1, −1, 2, −2, 3, ...), does not tend towards any finite limit. Nonetheless, in the mid-18th century, Leonhard Euler wrote
1_−_2_+_3_−_4_+_⋯
Ordinary differential equation
In mathematics, an Euler–Cauchy equation, also known as a Cauchy–Euler equation, equidimensional equation, or Euler's equation, is a linear ordinary differential
Cauchy–Euler_equation
Mathematical concept
{\displaystyle \vartheta ^{1}} denotes the trivial line bundle, from the Euler sequence. From this, the Chern classes and characteristic numbers can be calculated
Complex_projective_space
is nowadays one of the cornerstones of algebraic geometry. Euler sequence The exact sequence of sheaves: 0 → O P n → O P n ( 1 ) ⊕ ( n + 1 ) → T P n →
Glossary of algebraic geometry
Glossary_of_algebraic_geometry
Chained intrinsic rotations about body-fixed specific axes
rotations are three chained intrinsic rotations about body-fixed specific axes. Euler rotations and Tait–Bryan rotations are particular cases of the Davenport
Davenport_chained_rotations
Infinite integer series where the next number is the sum of the two preceding it
Lucas sequence is an integer sequence named after the mathematician François Édouard Anatole Lucas (1842–1891), who studied both that sequence and the
Lucas_number
Ordered list of whole numbers
numbers Baum–Sweet sequence Bell numbers Binomial coefficients Carmichael numbers Catalan numbers Composite numbers Deficient numbers Euler numbers Even and
Integer_sequence
derives from a fundamental geometric statement on projective spaces: the Euler sequence. The negativity of the canonical line bundle makes projective spaces
Algebraic geometry of projective spaces
Algebraic_geometry_of_projective_spaces
Classic problem in graph theory
Euler first pointed out that the choice of route inside each land mass is irrelevant and that the only important feature of a route is the sequence of
Seven_Bridges_of_Königsberg
Mathematical concept in prime numbers
In mathematics, Euler's idoneal numbers (also called suitable numbers or convenient numbers) are the positive integers D such that any integer expressible
Idoneal_number
Numbers k where x - phi(x) = k has many solutions
below k {\displaystyle k} and above 1. Here, ϕ {\displaystyle \phi } is Euler's totient function. There are infinitely many solutions to the equation for
Highly_cototient_number
Iterative algorithm on numbers
-\beta } to produce the next number of the sequence. Repeat step 2. The sequence is called a Kaprekar sequence and the function K b ( n ) = α − β {\displaystyle
Kaprekar's_routine
Special constant related to the exponential integral
} is about δ = 0.596347362323194074341078499369... (sequence A073003 in the OEIS). When Euler studied divergent infinite series, he encountered δ {\displaystyle
Gompertz_constant
Mathematical technique for improving convergence
Cohen et al. A basic example of a linear sequence transformation, offering improved convergence, is Euler's transform. It is intended to be applied to
Series_acceleration
Generalizations of codimension-1 subvarieties of algebraic varieties
(\omega )]=-(n+1)[H]} where [H] = [Zi], i = 0, ..., n. (See also the Euler sequence.) Let X be an integral Noetherian scheme. Then X has a sheaf of rational
Divisor_(algebraic_geometry)
Square array with symbols that each occur once per row and column
Leonhard Euler (1707–1783), who used Latin characters as symbols, but any set of symbols can be used: in the above example, the alphabetic sequence A, B, C
Latin_square
is a list of notable integer sequences with links to their entries in the On-Line Encyclopedia of Integer Sequences. OEIS core sequences Index to OEIS
List_of_integer_sequences
Rational number sequence
}{\frac {e^{\pi t}st^{s}}{1-e^{2\pi t}}}{\frac {dt}{t}}.} The Euler numbers are a sequence of integers intimately connected with the Bernoulli numbers.
Bernoulli_number
Generalization of vector bundles
{\displaystyle {\mathcal {O}}(1)} . Namely, there is a short exact sequence, the Euler sequence: 0 → O P n → O ( 1 ) ⊕ n + 1 → T P n → 0. {\displaystyle 0\to
Coherent_sheaf
Number divisible only by 1 and itself
the sum of two primes, in a 1742 letter to Euler. Euler proved Alhazen's conjecture (now the Euclid–Euler theorem) that all even perfect numbers can be
Prime_number
Tensoring the Euler sequence of P 1 {\displaystyle \mathbb {P} ^{1}} by O ( 1 ) {\displaystyle {\mathcal {O}}(1)} gives a non-split exact sequence 0 → O ( −
Stable_vector_bundle
Natural number
). "Sequence A000010 (Euler totient function)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Sloane, N. J. A. (ed.). "Sequence A005835
100
Vector bundle existing over a Grassmannian
the generator of negative degree. Hopf bundle Stiefel-Whitney class Euler sequence Chern class (Chern classes of tautological bundles is the algebraically
Tautological_bundle
Disproved conjecture in number theory
In number theory, Euler's conjecture is a disproved conjecture related to Fermat's Last Theorem. It was proposed by Leonhard Euler in 1769. It states that
Euler's sum of powers conjecture
Euler's_sum_of_powers_conjecture
Position of something in relation to its surroundings
to move the object from a reference placement to its current placement. Euler's rotation theorem shows that in three dimensions any orientation can be
Orientation_(geometry)
Odd composite number which passes the given congruence
In mathematics, an odd composite integer n is called an Euler pseudoprime to base a, if a and n are coprime, and a ( n − 1 ) / 2 ≡ ± 1 ( mod n ) {\displaystyle
Euler_pseudoprime
Polynomial sequence
Euler triangle or Euler's triangle. It shares some common characteristics with Pascal's triangle. Values of A ( n , k ) {\textstyle A(n,k)} (sequence
Eulerian_number
Natural number
OEIS Foundation. Retrieved 2024-06-02. Sloane, N. J. A. (ed.). "Sequence A000010 (Euler totient function phi(n): count numbers less than and equal to n
34_(number)
Infinite products of functions indexed by primes
In number theory, an Euler product is an expansion of a Dirichlet series into an infinite product indexed by prime numbers. The original such product
Euler_product
Ancient algorithm for generating prime numbers
Wheel Factorized basic sieve of Eratosthenes for practical sieving ranges. Euler's proof of the zeta product formula contains a version of the sieve of Eratosthenes
Sieve_of_Eratosthenes
Number used to approximate the square root of 2
with Pell's equation, the name of the Pell numbers stems from Leonhard Euler's mistaken attribution of the equation and the numbers derived from it to
Pell_number
Positive integer of the form (2^(2^n))+1
are easily shown to be prime. Fermat's conjecture was refuted by Leonhard Euler in 1732 when he showed, by dividing by 641 that F 5 = 2 2 5 + 1 = 2 32 +
Fermat_number
Numbers with a certain property involving recursive summation
1^{2}+0^{2}=1} . On the other hand, 4 is not a happy number because the sequence starting with 4 2 = 16 {\displaystyle 4^{2}=16} and 1 2 + 6 2 = 37 {\displaystyle
Happy_number
Integer having a non-trivial divisor
15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, 34, 35, 36. (sequence A002808 in the OEIS) Every composite number can be written as the product
Composite_number
Figurate number
The triangular numbers or triangle numbers are the sequence of positive integers that can be represented as a lattice of points arranged in an equilateral
Triangular_number
Integer filtered out using a sieve similar to that of Eratosthenes
991, 997, ... (sequence A031157 in the OEIS). It has been conjectured that there are infinitely many lucky primes. Lucky numbers of Euler Fortunate number
Lucky_number
Result of multiplying four instances of a number together
4 case of Fermat's Last Theorem; see Fermat's right triangle theorem). Euler conjectured that a fourth power cannot be written as the sum of three fourth
Fourth_power
Concept in algebraic topology
the Euler characteristic of the total space is given by: χ ( E ) = χ ( B ) χ ( F ) . {\displaystyle \chi (E)=\chi (B)\chi (F).} Here the Euler characteristics
Fibration
Programming paradigm
EulerCalc← cos + 0j1 × sin ⍝ 0j1 is what's usually written as i EulerDirect← *0J1×⊢ ⍝ Same as ¯12○⊢ ⍝ Do the 2 methods produce the same result? EulerCheck←
Tacit_programming
Type of permutation
are 1, 2, 16, 272, 7936, ... (sequence A000182 in the OEIS). The relationships of Euler zigzag numbers with the Euler numbers, and the Bernoulli numbers
Alternating_permutation
Two raised to an integer power
non-negative values of n are: 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, ... (sequence A000079 in the OEIS) By comparison, powers of two with negative exponents
Power_of_two
Methods used to find numerical solutions of ordinary differential equations
Euler method (or forward Euler method, in contrast with the backward Euler method, to be described below). The method is named after Leonhard Euler who
Numerical methods for ordinary differential equations
Numerical_methods_for_ordinary_differential_equations
Type of prime number
433, 461, 463, 491, 509, 541, 563, 571, 577, 587, ... (sequence A120337 in the OEIS). The Euler irregular pairs are (61, 6), (277, 8), (19, 10), (2659
Regular_prime
211, 2311, 200560490131 (OEIS: A018239) Euler irregular primes are primes p {\displaystyle p} that divide an Euler number E 2 n , {\displaystyle E_{2n},}
List_of_prime_numbers
Result of multiplying five instances of a number together
expressed as the sum of k − 1 other k-th powers, providing counterexamples to Euler's sum of powers conjecture. Specifically, 275 + 845 + 1105 + 1335 = 1445
Fifth_power_(algebra)
Fractal named after mathematician Benoit Mandelbrot
cardioid called period-q bulbs (where ϕ {\displaystyle \phi } denotes the Euler phi function), which consist of parameters c {\displaystyle c} for which
Mandelbrot_set
Infinite series that is not convergent
widely used by Leonhard Euler and others, but often led to confusing and contradictory results. A major problem was Euler's idea that any divergent series
Divergent_series
Integer that occurs often as a totient
equation phi(x) = k than any preceding k (where phi is Euler's totient function, A000010))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
Highly_totient_number
Classifies holomorphic vector bundles over the complex projective line
classification of coherent sheaves. Algebraic geometry of projective spaces Euler sequence Splitting principle K-theory Jumping line Grothendieck, Alexander (1957)
Birkhoff–Grothendieck_theorem
Type of Poulet number
and a super-Poulet number. The super-Poulet numbers below 10,000 are (sequence A050217 in the OEIS): It is relatively easy to get super-Poulet numbers
Super-Poulet_number
German mathematician (1690–1764)
and ideas in letters to Euler directly influenced some of Euler's work. In 1729, Euler solved two problems pertaining to sequences which had stumped Goldbach
Christian_Goldbach
Ten raised to an integer power
ten are: 1, 10, 100, 1,000, 10,000, 100,000, 1,000,000, 10,000,000... (sequence A011557 in the OEIS) In decimal notation the nth power of ten is written
Power_of_10
Natural number, composite number
the standard form. 40 is an abundant number. Swiss mathematician Leonhard Euler noted 40 prime numbers generated by the quadratic polynomial n 2 + n + 41
40_(number)
Mathematical sequence
integer sequence devised by and named after Stanisław Ulam, who introduced it in 1964. The standard Ulam sequence (the (1, 2)-Ulam sequence) starts with
Ulam_number
Value to which tends an infinite sequence
In mathematics, the limit of a sequence is the value that the terms of a sequence "tend to", and is often denoted using the lim {\displaystyle \lim } symbol
Limit_of_a_sequence
Mathematics study in geometry
categorical structure. Recall that the Euler sequence of P 1 {\displaystyle \mathbb {P} ^{1}} is the short exact sequence 0 → O ( − 2 ) → O ( − 1 ) ⊕ 2 → O
Derived noncommutative algebraic geometry
Derived_noncommutative_algebraic_geometry
Number sequence 3,0,2,3,2,5,5,7,10,...
mathematics, the Perrin numbers are a doubly infinite constant-recursive integer sequence with characteristic equation x3 = x + 1. The Perrin numbers, named after
Perrin_number
Number whose sums of distinct divisors represent all smaller numbers
2, 9 = 6 + 3, 10 = 6 + 3 + 1, and 11 = 6 + 3 + 2. The sequence of practical numbers (sequence A005153 in the OEIS) begins 1, 2, 4, 6, 8, 12, 16, 18,
Practical_number
Numbers with special prime factorization
powerful but imperfect. Strong Achilles numbers are Achilles numbers whose Euler totients are also Achilles numbers; the smallest are 500 and 864. A number
Achilles_number
distribution Log-Cauchy distribution Wrapped Cauchy distribution Cauchy–Euler equation Cauchy's functional equation Cauchy filter Cauchy formula for repeated
List of things named after Augustin-Louis Cauchy
List_of_things_named_after_Augustin-Louis_Cauchy
sheaf cohomology computation. Recall the Euler sequence relates the tangent space through a short exact sequence 0 → O → O ( 1 ) ⊕ ( n + 1 ) → T P n → 0
Convexity (algebraic geometry)
Convexity_(algebraic_geometry)
Natural number
number. The next Granville number is 126, the previous being 24. the sum of Euler's totient function φ(x) over the first seventeen integers. strobogrammatic
96_(number)
Infinite series that diverges
that 1 − 2 + 4 − 8 + ... is Euler-summable and that its Euler sum is 1/3. The Euler transform begins with the sequence of positive terms: a0 = 1, a1
1_−_2_+_4_−_8_+_⋯
Type of number introduced by Mike Keith
True sequence = [] y = x while y > 0: sequence.append(y % b) y = y // b digit_count = len(sequence) sequence.reverse() while sequence[len(sequence) - 1]
Keith_number
Type of polynomial sequence
Appell sequences besides the trivial example { x n } {\displaystyle \{x^{n}\}} are the Hermite polynomials, the Bernoulli polynomials, and the Euler polynomials
Appell_sequence
Number of partitions of an integer
The multiplicative inverse of its generating function is the Euler function; by Euler's pentagonal number theorem, this function is an alternating sum
Partition function (number theory)
Partition_function_(number_theory)
Mathematical expression
1748 Euler published a theorem showing that a particular kind of continued fraction is equivalent to a certain very general infinite series. Euler's continued
Continued_fraction
Problem in algebraic geometry
Y} is T Y | X / T X {\displaystyle T_{Y}|_{X}/T_{X}} as well as the Euler sequence, we get that the total Chern class of the normal bundle to Z ↪ P 5 {\displaystyle
Residual_intersection
Number that is the result of operation on its own digits
2502, 2503, 2504, 2505, 2506, 2507, 2508, 2509, 2592, 2737, 2916, ... (sequence A036057 in the OEIS). Friedman numbers are named after Erich Friedman,
Friedman_number
EULER SEQUENCE
EULER SEQUENCE
Boy/Male
Danish, German, Swedish
Island Ruler; Ever Ruler
Boy/Male
American, Czech, Danish, French, German, Scandinavian, Swedish
Honourable Ruler; Peaceful Ruler; All Ruler; Ever Ruler
Boy/Male
Indian
Ruler
Boy/Male
American, Chinese, Christian, Danish, French, German, Norse, Scandinavian, Swedish
Ruler; Ruler of the People; Peaceful Ruler; All-ruler; Forever; Alone; Ever Ruler
Boy/Male
Muslim
Ruler
Boy/Male
Christian, German, Teutonic
Hard Working Ruler; Industrious Ruler; Home Ruler
Boy/Male
Indian
Ruler
Boy/Male
German, Teutonic
Hardworking Ruler; Home Ruler
Boy/Male
German
Powerful Ruler; Army Ruler
Boy/Male
Indian
Ruler
Boy/Male
American, Anglo, British, Christian, English, German
Wealthy Ruler; Rich Ruler
Boy/Male
American, Australian, Danish, German
Powerful Ruler; Dominant Ruler
Boy/Male
Christian, German, Norse, Polish, Scandinavian, Swedish
Peaceful Ruler; Forever; Alone; Ruler; All-ruler
Boy/Male
British, English
Wheel Ruler; Circle Ruler
Boy/Male
American, British, English
Royal Ruler; King's Ruler
Boy/Male
French, German, Irish
Dominant Ruler; Powerful Ruler
Boy/Male
German, Swedish
Ever Ruler; Island Ruler
Boy/Male
Australian, Dutch, French, German, Italian, Latin, Swiss
Powerful Ruler; Dominant Ruler
Boy/Male
French, German
Wise Ruler; Old Ruler; Long Term Ruler
Boy/Male
Muslim
Ruler
EULER SEQUENCE
EULER SEQUENCE
Boy/Male
Tamil
Air circulating in the body
Female
Spanish
Perhaps a pet form of Portuguese/Spanish Eulália, OLALLA means "well-spoken."
Boy/Male
American, Australian, Biblical, British, Christian, English, Hebrew
The Lord is Good; Goodness of God; God is Good
Boy/Male
Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Telugu
Lord Shiva
Boy/Male
American, Australian, Chinese, French
Destiny
Boy/Male
Latin Biblical
A hero who saved Rome.
Boy/Male
British, English
Guardian of the Deer
Girl/Female
Tamil
Victory
Surname or Lastname
English
English : from a pet form of Batt 1 or 2.
Boy/Male
British, Christian, English, German
Famous; A Diminutive of Robert or Robin
EULER SEQUENCE
EULER SEQUENCE
EULER SEQUENCE
EULER SEQUENCE
EULER SEQUENCE
n.
A ruler of one division of a heptarchy.
a.
The office of ruler; rule; authority; government.
n.
A ruler or governor.
n.
One who pules; one who whines or complains; a weak person.
a.
One who rules or reigns; a governor; a ruler.
n.
A chief or ruler of a deme or district in Greece.
n.
A ruler, or sovereign, of a Mohammedan state; specifically, the ruler of the Turks; the Padishah, or Grand Seignior; -- officially so called.
n.
A sole or supreme ruler; a sovereign; the highest ruler; an emperor, king, queen, prince, or chief.
n.
A petty king; a ruler of little power or consequence.
n.
A straight or curved strip of wood, metal, etc., with a smooth edge, used for guiding a pen or pencil in drawing lines. Cf. Rule, n., 7 (a).
n.
A ruler or ruling power.
a.
Pertaining to Euler, a German mathematician of the 18th century.
n.
A chief ruler; a potentate. [Obs.] Wyclif.
n.
The mother and ruler of a family or of her descendants; a ruler by maternal right.
n.
A joint regent or ruler.
a.
A suffix meaning a ruler, as in monarch (a sole ruler).
n.
A long, flexble piece of wood sometimes used as a ruler.
n.
A ruler; a governor; a prince.
n.
One who rules; one who exercises sway or authority; a governor.
n.
A Mohammedan title for a ruler; a judge.