Searches , social queries for EULER PSEUDOPRIME
Search references for EULER PSEUDOPRIME. Phrases containing EULER PSEUDOPRIME
See searches and references containing EULER PSEUDOPRIME!
Search references for EULER PSEUDOPRIME. Phrases containing EULER PSEUDOPRIME
See searches and references containing EULER PSEUDOPRIME!EULER PSEUDOPRIME
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
Probable prime that is composite
Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius pseudoprime Lucas pseudoprime Perrin pseudoprime Somer–Lucas
Pseudoprime
Odd composite number which passes the given congruence
the above congruence, then n is called an Euler–Jacobi pseudoprime (or, more commonly, an Euler pseudoprime) to base a. As long as a is not a multiple
Euler–Jacobi_pseudoprime
Composite number which passes Miller–Rabin primality test
strong pseudoprime to base a is always an Euler–Jacobi pseudoprime, an Euler pseudoprime and a Fermat pseudoprime to that base, but not all Euler and Fermat
Strong_pseudoprime
Composite number that passes Fermat's probable primality test
In number theory, the Fermat pseudoprimes make up the most important class of pseudoprimes that come from Fermat's little theorem. Fermat's little theorem
Fermat_pseudoprime
prime numbers of a Dirichlet series Euler pseudoprime Euler–Jacobi pseudoprime Euler's totient function (or Euler phi (φ) function) in number theory,
List of topics named after Leonhard Euler
List_of_topics_named_after_Leonhard_Euler
Composite number in number theory
number is either an Euler–Jacobi pseudoprime or a strong pseudoprime to every base relatively prime to it so, in theory, either an Euler or a strong probable
Carmichael_number
Number divisible only by 1 and itself
certainly composite. A composite number that passes such a test is called a pseudoprime. In contrast, some other algorithms guarantee that their answer will
Prime_number
Probabilistic test for the primality of an integer
Lucas pseudoprimes and Fibonacci pseudoprimes are composite integers that pass certain tests which all primes and very few composite numbers pass: in
Lucas_pseudoprime
Numbers obtained by adding the two previous ones
If n is composite and satisfies the formula, then n is a Fibonacci pseudoprime. When m is large – say a 500-bit number – then we can calculate Fm (mod
Fibonacci_sequence
Positive integer that is an integer power of another positive integer
the Möbius function and ζ(k) is the Riemann zeta function. According to Euler, Goldbach showed (in a now-lost letter) that the sum of 1/p − 1 over the
Perfect_power
Type of Poulet number
In number theory, a super-Poulet number is a Poulet number, or pseudoprime to base 2, whose every divisor d {\displaystyle d} divides 2 d − 2 {\displaystyle
Super-Poulet_number
Numeral ambigram
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Strobogrammatic_number
Probabilistic primality testing algorithm
Ondřej Krčma (2021), Baillie-PSW pseudoprimes. Guy, R. (1994). "Pseudoprimes. Euler Pseudoprimes. Strong Pseudoprimes." §A12 in Unsolved Problems in Number
Baillie–PSW_primality_test
Numbers in a type of Lucas sequence
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Jacobsthal_number
Centered figurate number
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Star_number
Type of pseudoprime
In number theory, a Frobenius pseudoprime is a pseudoprime, whose definition was inspired by the quadratic Frobenius test described by Jon Grantham in
Frobenius_pseudoprime
Mathematical concept
Euler's "lucky" numbers are positive integers n such that for all integers k with 1 ≤ k < n, the polynomial k2 − k + n produces a prime number. When k
Lucky_numbers_of_Euler
Product of two prime numbers
{\displaystyle n=pq} (with p ≠ q {\displaystyle p\neq q} ) the value of Euler's totient function φ ( n ) {\displaystyle \varphi (n)} (the number of positive
Semiprime
Polynomial sequence
previous element (permutations with k {\textstyle k} "ascents"). Leonhard Euler investigated them and associated polynomials in his 1755 book Institutiones
Eulerian_number
Natural number
number, and a centered cube number. It is also the smallest absolute Euler pseudoprime. It is palindromic in bases 12, 32, and 36. 1729 is the dimension
1729_(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
Number of paths between grid corners, allowing diagonal steps
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Delannoy_number
Type of composite number
where B is a Bernoulli number and φ ( n ) {\displaystyle \varphi (n)} is Euler's totient function. An equivalent formulation due to Giuseppe Giuga is: a
Giuga_number
Arithmetic operation
should not be confused with its more common meaning. In 1748, Leonhard Euler introduced variable exponents, and, implicitly, non-integer exponents by
Exponentiation
Number sequence 3,0,2,3,2,5,5,7,10,...
restricted Perrin pseudoprimes. There are only nine such numbers below 109. While Perrin pseudoprimes are rare, they overlap with Fermat pseudoprimes. Of the above
Perrin_number
Numbers whose sum of divisors is twice the number plus 1
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Quasiperfect_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
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_number
Ten raised to an integer power
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Power_of_10
Set of composite numbers
In mathematics, a Catalan pseudoprime is an odd composite number n satisfying the congruence ( − 1 ) n − 1 2 ⋅ C n − 1 2 ≡ 2 ( mod n ) , {\displaystyle
Catalan_pseudoprime
Power of a prime number
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Prime_power
Class of binary number
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Evil_number
Number, product of consecutive integers
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Pronic_number
Number that remains the same when its digits are reversed
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Palindromic_number
Number of unique ways to draw non-intersecting chords in a circle
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Motzkin_number
Integer filtered out using a sieve similar to that of Eratosthenes
conjectured that there are infinitely many lucky primes. Lucky numbers of Euler Fortunate number Happy number Harshad number Josephus problem Gambling Lottery
Lucky_number
Triangular array of natural numbers
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Narayana_number
Number that when multiplied by another number moves its last digit to its front
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Parasitic_number
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
Integer whose multiples are digit rotations
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Cyclic_number
Number that represents a hexagon with a dot in the center
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Centered_hexagonal_number
Figurate number
Design. doi:10.1201/9780429430701. ISBN 978-0-429-43070-1. S2CID 198342061. Euler, Leonhard; Lagrange, Joseph Louis (1810), Elements of Algebra, vol. 1 (2nd ed
Triangular_number
Sequence of rational numbers
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Göbel's_sequence
Type of composite number with an even number of digits
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Vampire_number
Product of an integer with itself
squares as a sum of squares Cubic number – Number raised to the third power Euler's four-square identity – Product of sums of four squares expressed as a sum
Square_number
Result of multiplying six instances of a number
as the sum of k other k-th powers, and some of which (in violation of Euler's sum of powers conjecture) can be expressed as a sum of even fewer k-th
Sixth_power
Class of numbers not containing a particular letter in English
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Ban_number
Result of multiplying eight instances of a number together
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Eighth_power
Integer named after Reo Fortune
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Fortunate_number
Integer describing itself
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Self-descriptive_number
Three raised to an integer power
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Power_of_three
Sequence of integers
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Padovan_sequence
Prime such that p^2 divides 2^(p-1)-1
numbers and primes, such as Mersenne and Fermat numbers, specific types of pseudoprimes and some types of numbers generalized from the original definition of
Wieferich_prime
Counts pieces of a disk cut by lines
Solutions. Vol. 1. New York: Dover Publications. Moore, T. L. (1991), "Using Euler's formula to solve plane separation problems", The College Mathematics Journal
Lazy_caterer's_sequence
Type of pseudoprime
In number theory, a pseudoprime is called an elliptic pseudoprime for (E, P), where E is an elliptic curve defined over the field of rational numbers
Elliptic_pseudoprime
Type of number introduced by Mike Keith
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Keith_number
Count of permutations by cycles
Hasse's series by setting k=1). The next estimate given in terms of the Euler gamma constant applies: [ n + 1 k + 1 ] ∼ n → ∞ n ! k ! ( γ + ln n ) k
Stirling numbers of the first kind
Stirling_numbers_of_the_first_kind
Combinatorial sequence of numbers
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Dedekind_number
Sum of a number's digits
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Digit_sum
Class of natural numbers with many divisors
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Superior highly composite number
Superior_highly_composite_number
Figurate number representing a decagon
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Decagonal_number
Positive integer of the form 4n + 1
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Hilbert_number
Number that can be used to count certain kinds of binary trees
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Wedderburn–Etherington_number
Number used for counting
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Natural_number
Type of composite integer
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Smith_number
Two raised to an integer power
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Power_of_two
Mathematical concept
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Cullen_number
Positive integer that is the product of three distinct prime numbers
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Sphenic_number
Type of figurate number
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Hexagonal_number
Mathematical formula
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Multiplicative_digital_root
Odd number with specific properties
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Sierpiński_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 sequence
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Ulam_number
Numbers with a certain property involving recursive summation
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Happy_number
Integer sequence in number theory
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Descartes_number
Figurate number
A001318 in the OEIS). Generalized pentagonal numbers are important to Euler's theory of integer partitions, as expressed in his pentagonal number theorem
Pentagonal_number
Number in combinatorics
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Schröder–Hipparchus_number
Number that cannot be written as an aliquot sum
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Untouchable_number
Integer having only small prime factors
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Smooth_number
Concatenation of the first n prime numbers
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Smarandache–Wellin_number
Number that has a perfect number of factors adding up to another perfect number
all add up to 2126(2127-1), the 12th even perfect number (by the Euclid–Euler theorem, since 2127-1 is the 12th Mersenne prime). MathPages article, "Sublime
Sublime_number
Positive integer of the form (2^(2^n))+1
Fermat number is a strong pseudoprime to base 2. This is because all strong pseudoprimes to base 2 are also Fermat pseudoprimes – i.e., 2 F n − 1 ≡ 1 (
Fermat_number
Integer of the form 3 × 2^n – 1 for non-negative n
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Thabit_number
Algorithm for determining whether a number is prime
Solovay–Strassen test does not. This is because 1905 is an Euler pseudoprime base 2 but not a strong pseudoprime base 2 (this is illustrated in Figure 1 of PSW)
Primality_test
Natural number whose divisor sum is greater than that of any smaller number
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Highly_abundant_number
Repeated sum of a number's digits
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Digital_root
Special type of prime number
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Wolstenholme_prime
Concept in combinatorics
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Cake_number
Number of close-packed spheres in an octahedron
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Octahedral_number
Number whose sums of distinct divisors represent all smaller numbers
(n)+1}\left(1-{\frac {1}{p}}\right),} where γ {\displaystyle \gamma } is the Euler–Mascheroni constant and p {\displaystyle p} runs over primes. As with prime
Practical_number
Type of number
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Primary_pseudoperfect_number
Number in the 5th cell of any row of Pascal's triangle
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Pentatope_number
Number of ways to pair up n objects
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Telephone number (mathematics)
Telephone_number_(mathematics)
Numbers whose prime factors all divide the number more than once
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Powerful_number
Number that is less than the sum of its proper divisors
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Abundant_number
Iterative algorithm on numbers
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Kaprekar's_routine
Integer whose representation contains every digit in its number base
(each used exactly once) and the mathematical symbols + − × / ( ) . and ^, Euler's number e can be approximated as ( 1 + 9 − 4 7 × 6 ) 3 2 85 {\displaystyle
Pandigital_number
Set of numbers used in the smoothsort algorithm
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Leonardo_number
Polyhedral number representing a tetrahedron
Wilson Pseudoprimes Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius
Tetrahedral_number
travel, tourism, insurance
EULER PSEUDOPRIME
EULER PSEUDOPRIME
Boy/Male
German
Powerful Ruler; Army Ruler
Boy/Male
British, English
Wheel Ruler; Circle Ruler
Boy/Male
Christian, German, Norse, Polish, Scandinavian, Swedish
Peaceful Ruler; Forever; Alone; Ruler; All-ruler
Boy/Male
Danish, German, Swedish
Island Ruler; Ever Ruler
Boy/Male
Indian
Ruler
Boy/Male
American, Czech, Danish, French, German, Scandinavian, Swedish
Honourable Ruler; Peaceful Ruler; All Ruler; Ever Ruler
Boy/Male
American, Australian, Danish, German
Powerful Ruler; Dominant Ruler
Boy/Male
Christian, German, Teutonic
Hard Working Ruler; Industrious Ruler; Home Ruler
Boy/Male
Indian
Ruler
Boy/Male
Muslim
Ruler
Boy/Male
German, Teutonic
Hardworking Ruler; Home Ruler
Boy/Male
French, German
Wise Ruler; Old Ruler; Long Term Ruler
Boy/Male
Australian, Dutch, French, German, Italian, Latin, Swiss
Powerful Ruler; Dominant Ruler
Boy/Male
Muslim
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
French, German, Irish
Dominant Ruler; Powerful Ruler
Boy/Male
American, British, English
Royal Ruler; King's Ruler
Boy/Male
American, Anglo, British, Christian, English, German
Wealthy Ruler; Rich Ruler
Boy/Male
Indian
Ruler
Boy/Male
German, Swedish
Ever Ruler; Island Ruler
EULER PSEUDOPRIME
EULER PSEUDOPRIME
EULER PSEUDOPRIME
EULER PSEUDOPRIME
EULER PSEUDOPRIME
EULER PSEUDOPRIME
EULER PSEUDOPRIME
a.
A suffix meaning a ruler, as in monarch (a sole ruler).
n.
A chief or ruler of a deme or district in Greece.
n.
One who pules; one who whines or complains; a weak person.
n.
A sole or supreme ruler; a sovereign; the highest ruler; an emperor, king, queen, prince, or chief.
n.
A joint regent or ruler.
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 long, flexble piece of wood sometimes used as a ruler.
n.
A ruler; a governor; a prince.
n.
A chief ruler; a potentate. [Obs.] Wyclif.
n.
A ruler or governor.
n.
A petty king; a ruler of little power or consequence.
a.
The office of ruler; rule; authority; government.
n.
One who rules; one who exercises sway or authority; a governor.
n.
The mother and ruler of a family or of her descendants; a ruler by maternal right.
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.
a.
One who rules or reigns; a governor; a ruler.
n.
A ruler of one division of a heptarchy.
n.
A Mohammedan title for a ruler; a judge.
travel, tourism, insurance