A High–Low search game on the unit interval

1985 ◽  
Vol 97 (2) ◽  
pp. 345-348 ◽  
Author(s):  
V. J. Baston ◽  
F. A. Bostock
Keyword(s):  
Real Number ◽  
Closed Interval ◽  
Unit Interval ◽  
Real Numbers ◽  
Search Game ◽  
Zero Sum

We consider the following two-person zero-sum game on the closed interval [0,1]. The hider chooses any real number h in [0,1]. The searcher successively chooses real numbers ξ1ξ2… in [0,1], where at each choice ξi he is told whether h = ξih < ξ1 or h > ξi and he may choose ξi+1 in the light of this information. The payoff (to the hider) is the sum of the distances of the searcher from the hider at each of the moves, that is .

Further results on infinite valued predicate logic

1964 ◽  
Vol 29 (2) ◽  
pp. 69-78 ◽  
Author(s):  
L. P. Belluce
Keyword(s):  
Real Number ◽  
Present Author ◽  
Closed Interval ◽  
Abelian Groups ◽  
Predicate Logic ◽  
Real Numbers ◽  
The Real ◽  
Truth Values ◽  
Recursively Enumerable ◽  
Weakened Form

In a previous paper [1] Chang and the present author presented a system of infinite valued predicate logic, the truth values being the closed interval [0, 1] of real numbers. That paper was the result of an investigation attempting to establish the completeness of the system using the real number 1 as the sole designated value. In fact, we fell short of our mark and proved a weakened form of completeness utilizing positive segments, [0, a], of linearly ordered abelian groups as admissible truth values. A result of Scarpellini [8], however, showing that the set of well-formed formulas of infinite valued logic valid (with respect to the sole designated real number 1) is not recursively enumerable indicates the above mentioned result is the best possible.

scholarly journals Finding of principle square root of a real number by using interpolation method

2018 ◽  
Vol 7 (1) ◽  
pp. 77-83
Author(s):  
Rajendra Prasad Regmi
Keyword(s):  
Real Number ◽  
Positive Real Number ◽  
Interpolation Method ◽  
Square Root ◽  
Real Numbers ◽  
Positive Real ◽  
Unknown Quantity ◽  
Square Roots

There are various methods of finding the square roots of positive real number. This paper deals with finding the principle square root of positive real numbers by using Lagrange’s and Newton’s interpolation method. The interpolation method is the process of finding the values of unknown quantity (y) between two known quantities.

scholarly journals ON INTEGER SEQUENCES GENERATED BY LINEAR MAPS

2009 ◽  
Vol 51 (2) ◽  
pp. 243-252
Author(s):  
ARTŪRAS DUBICKAS
Keyword(s):  
Lower Bound ◽  
Positive Integer ◽  
Real Number ◽  
Constant Independent ◽  
Integer Sequences ◽  
Real Numbers ◽  
Complexity Function ◽  
Linear Maps ◽  
Coprime Integers ◽  
Positive Integers

AbstractLetx0<x1<x2< ⋅⋅⋅ be an increasing sequence of positive integers given by the formulaxn=⌊βxn−1+ γ⌋ forn=1, 2, 3, . . ., where β > 1 and γ are real numbers andx0is a positive integer. We describe the conditions on integersbd, . . .,b0, not all zero, and on a real number β > 1 under which the sequence of integerswn=bdxn+d+ ⋅⋅⋅ +b0xn,n=0, 1, 2, . . ., is bounded by a constant independent ofn. The conditions under which this sequence can be ultimately periodic are also described. Finally, we prove a lower bound on the complexity function of the sequenceqxn+1−pxn∈ {0, 1, . . .,q−1},n=0, 1, 2, . . ., wherex0is a positive integer,p>q> 1 are coprime integers andxn=⌈pxn−1/q⌉ forn=1, 2, 3, . . . A similar speculative result concerning the complexity of the sequence of alternatives (F:x↦x/2 orS:x↦(3x+1)/2) in the 3x+1 problem is also given.

scholarly journals The Linearity of Riemann Integral on Functions from ℝ into Real Banach Space

2013 ◽  
Vol 21 (3) ◽  
pp. 185-191
Author(s):  
Keiko Narita ◽  
Noboru Endou ◽  
Yasunari Shidama
Keyword(s):  
Banach Space ◽  
Integral Operator ◽  
Real Banach Space ◽  
Closed Interval ◽  
Continuous Functions ◽  
Real Numbers ◽  
Riemann Integral ◽  
Basic Properties ◽  
Bounded Functions ◽  
Definition Of

Summary In this article, we described basic properties of Riemann integral on functions from R into Real Banach Space. We proved mainly the linearity of integral operator about the integral of continuous functions on closed interval of the set of real numbers. These theorems were based on the article [10] and we referred to the former articles about Riemann integral. We applied definitions and theorems introduced in the article [9] and the article [11] to the proof. Using the definition of the article [10], we also proved some theorems on bounded functions.

scholarly journals ON THE SPECTRA OF PISOT NUMBERS

2011 ◽  
Vol 54 (1) ◽  
pp. 127-132 ◽  
Author(s):  
TOUFIK ZAIMI
Keyword(s):  
Real Number ◽  
Fractional Part ◽  
Pisot Number ◽  
Real Numbers ◽  
Pisot Numbers

AbstractLet θ be a real number greater than 1, and let (()) be the fractional part function. Then, θ is said to be a Z-number if there is a non-zero real number λ such that ((λθn)) < for all n ∈ ℕ. Dubickas (A. Dubickas, Even and odd integral parts of powers of a real number, Glasg. Math. J., 48 (2006), 331–336) showed that strong Pisot numbers are Z-numbers. Here it is proved that θ is a strong Pisot number if and only if there exists λ ≠ 0 such that ((λα)) < for all$\alpha \in \{ \theta ^{n}\mid n\in \mathbb{N}\} \cup \{ \sum\nolimits_{n=0}^{N}\theta ^{n}\mid \mathit{\}N\in \mathbb{N}\}$. Also, the following characterisation of Pisot numbers among real numbers greater than 1 is shown: θ is a Pisot number ⇔ ∃ λ ≠ 0 such that$\Vert \lambda \alpha \Vert <\frac{1}{% 3}$for all$\alpha \in \{ \sum\nolimits_{n=0}^{N}a_{n}\theta ^{n}\mid$an ∈ {0,1}, N ∈ ℕ}, where ‖λα‖ = min{((λα)), 1 − ((λα))}.

Encircling Graphs

2017 ◽  
Author(s):  
Arthur Benjamin ◽  
Gary Chartrand ◽  
Ping Zhang
Keyword(s):  
Nineteenth Century ◽  
Real Number ◽  
Traveling Salesman Problem ◽  
Complex Number ◽  
Traveling Salesman ◽  
Complex Numbers ◽  
Real Numbers ◽  
Hamiltonian Graphs ◽  
The World ◽  
The Traveling Salesman Problem

This chapter considers Hamiltonian graphs, a class of graphs named for nineteenth-century physicist and mathematician Sir William Rowan Hamilton. In 1835 Hamilton discovered that complex numbers could be represented as ordered pairs of real numbers. That is, a complex number a + b i (where a and b are real numbers) could be treated as the ordered pair (a, b). Here the number i has the property that i² = -1. Consequently, while the equation x² = -1 has no real number solutions, this equation has two solutions that are complex numbers, namely i and -i. The chapter first examines Hamilton's icosian calculus and Icosian Game, which has a version called Traveller's Dodecahedron or Voyage Round the World, before concluding with an analysis of the Knight's Tour Puzzle, the conditions that make a given graph Hamiltonian, and the Traveling Salesman Problem.

scholarly journals SOME GROUP THEORETIC ASPECTS OF t-NORMS

2000 ◽  
Vol 08 (01) ◽  
pp. 1-6 ◽  
Author(s):  
FRED RICHMAN ◽  
ELBERT WALKER
Keyword(s):  
Automorphism Group ◽  
Multiplicative Group ◽  
Order Relation ◽  
Unit Interval ◽  
Real Numbers ◽  
Positive Real ◽  
Explicit Formulas ◽  
One To One ◽  
The Right ◽  
Usual Order

Let A be the automorphism group of the unit interval with its usual order relation, and let ℝ+ be the embedding of the multiplicative group of positive real numbers into A given by exponentiation. Strict t-norms are in one-to-one correspondence with the right cosets of ℝ+ in A. Here, we identify the normalizer of ℝ+ in A and give explicit formulas for the corresponding set of t-norms.

scholarly journals Diophantine approximation with mixed powers of primes

2018 ◽  
Vol 14 (07) ◽  
pp. 1903-1918
Author(s):  
Wenxu Ge ◽  
Huake Liu
Keyword(s):  
Real Number ◽  
Diophantine Approximation ◽  
Infinitely Many Solutions ◽  
Real Numbers

Let [Formula: see text] be an integer with [Formula: see text], and [Formula: see text] be any real number. Suppose that [Formula: see text] are nonzero real numbers, not all the same sign and [Formula: see text] is irrational. It is proved that the inequality [Formula: see text] has infinitely many solutions in primes [Formula: see text], where [Formula: see text], and [Formula: see text] for [Formula: see text]. This generalizes earlier results. As application, we get that the integer parts of [Formula: see text] are prime infinitely often for primes [Formula: see text].

The Term and Stochastic Ranks of a Matrix

1959 ◽  
Vol 11 ◽  
pp. 269-279 ◽  
Author(s):  
N. S. Mendelsohn ◽  
A. L. Dulmage
Keyword(s):  
Real Number ◽  
Stochastic Matrix ◽  
Real Numbers ◽  
Doubly Stochastic Matrix ◽  
Doubly Stochastic ◽  
The Matrix ◽  
Term Rank ◽  
Square Matrix

The term rank p of a matrix is the order of the largest minor which has a non-zero term in the expansion of its determinant. In a recent paper (1), the authors made the following conjecture. If S is the sum of all the entries in a square matrix of non-negative real numbers and if M is the maximum row or column sum, then the term rank p of the matrix is greater than or equal to the least integer which is greater than or equal to S/M. A generalization of this conjecture is proved in § 2.The term doubly stochastic has been used to describe a matrix of nonnegative entries in which the row and column sums are all equal to one. In this paper, by a doubly stochastic matrix, the, authors mean a matrix of non-negative entries in which the row and column sums are all equal to the same real number T.

Towards a consistent set-theory

1951 ◽  
Vol 16 (2) ◽  
pp. 130-136 ◽  
Author(s):  
John Myhill
Keyword(s):  
Number Theory ◽  
Real Number ◽  
Set Theory ◽  
Mathematical Practice ◽  
Axiom Of Choice ◽  
Small Fragment ◽  
Real Numbers ◽  
The Real ◽  
Classical Construction

In a previous paper, I proved the consistency of a non-finitary system of logic based on the theory of types, which was shown to contain the axiom of reducibility in a form which seemed not to interfere with the classical construction of real numbers. A form of the system containing a strong axiom of choice was also proved consistent.It seems to me now that the real-number approach used in that paper, though valid, was not the most fruitful one. We can, on the lines therein suggested, prove the consistency of axioms closely resembling Tarski's twenty axioms for the real numbers; but this, from the standpoint of mathematical practice, is a pitifully small fragment of analysis. The consistency of a fairly strong set-theory can be proved, using the results of my previous paper, with little more difficulty than that of the Tarski axioms; this being the case, it would seem a saving in effort to derive the consistency of such a theory first, then to strengthen that theory (if possible) in such ways as can be shown to preserve consistency; and finally to derive from the system thus strengthened, if need be, a more usable real-number theory. The present paper is meant to achieve the first part of this program. The paragraphs of this paper are numbered consecutively with those of my previous paper, of which it is to be regarded as a continuation.

Sign in / Sign up

Export Citation Format

Share Document