scholarly journals Anniversary of Notation for Number π

2020 ◽  
Vol 42 (4) ◽  
pp. 70-70
Author(s):  
Isaac Elishakoff
Keyword(s):  
1952 ◽  
Vol 45 (5) ◽  
pp. 340-348
Author(s):  
H. von Baravalle

Two outstanding constants of mathematics have been dealt with in previous articles in The Mathematics Teacher, the number e, the base of the natural logarithms1 and the number G, the ratio of the Golden Section.2 To complete this series, the present article takes up the third and best known constant, the number π.


2001 ◽  
Vol 6 (8) ◽  
pp. 452-457
Author(s):  
Margaret W. Tent

When i first started teaching middle school students about circles and the number π, my task as I understood it was straightforward: Teach them that π = 3.14 or 22/7, and teach them the formulas for finding the area and circumference of a circle. I poured in the information, but a lot of it spilled out and was lost. Here are two examples of my “wisdom” as it came out at the other end of the spout: (1) “π = 3.14, since nobody likes fractions anyway” and (2) “There are two formulas that you have to use, πr 2 and πd. Sometimes you use one formula and sometimes the other. If you are lucky, you will guess right.”


2011 ◽  
Vol 61 (2) ◽  
Author(s):  
Marian Genčev

AbstractThis paper develops the approach to the evaluation of a class of infinite series that involve special products of binomial type, generalized harmonic numbers of order 1 and rational functions. We give new summation results for certain infinite series of non-hypergeometric type. New formulas for the number π are included.


Entropy ◽  
2021 ◽  
Vol 23 (3) ◽  
pp. 327
Author(s):  
Aditi Kathpalia ◽  
Nithin Nagaraj

Detection of the temporal reversibility of a given process is an interesting time series analysis scheme that enables the useful characterisation of processes and offers an insight into the underlying processes generating the time series. Reversibility detection measures have been widely employed in the study of ecological, epidemiological and physiological time series. Further, the time reversal of given data provides a promising tool for analysis of causality measures as well as studying the causal properties of processes. In this work, the recently proposed Compression-Complexity Causality (CCC) measure (by the authors) is shown to be free of the assumption that the "cause precedes the effect", making it a promising tool for causal analysis of reversible processes. CCC is a data-driven interventional measure of causality (second rung on the Ladder of Causation) that is based on Effort-to-Compress (ETC), a well-established robust method to characterize the complexity of time series for analysis and classification. For the detection of the temporal reversibility of processes, we propose a novel measure called the Compressive Potential based Asymmetry Measure. This asymmetry measure compares the probability of the occurrence of patterns at different scales between the forward-time and time-reversed process using ETC. We test the performance of the measure on a number of simulated processes and demonstrate its effectiveness in determining the asymmetry of real-world time series of sunspot numbers, digits of the transcedental number π and heart interbeat interval variability.


2013 ◽  
Vol 54 ◽  
Author(s):  
Juozas Juvencijus Mačys
Keyword(s):  

Two hypotheses on the derivation of Madhava’s corrections of the series for number π are considered.


2017 ◽  
Vol 17 (3&4) ◽  
pp. 251-261
Author(s):  
Srinivasan Arunachalam ◽  
Ronald de Wolf

In its usual form, Grover’s quantum search algorithm uses O( √ N) queries and O( √ N log N) other elementary gates to find a solution in an N-bit database. Grover in 2002 showed how to reduce the number of other gates to O( √ N log log N) for the special case where the database has a unique solution, without significantly increasing the number of queries. We show how to reduce this further to O( √ N log(r) N) gates for every constant r, and sufficiently large N. This means that, on average, the circuits between two queries barely touch more than a constant number of the log N qubits on which the algorithm acts. For a very large N that is a power of 2, we can choose r such that the algorithm uses essentially the minimal number π 4 √ N of queries, and only O( √ N log(log? N)) other gates.


2019 ◽  
Vol 11 (1) ◽  
pp. 24-40
Author(s):  
Jomon K. Sebastian ◽  
Joseph Varghese Kureethara ◽  
Sudev Naduvath ◽  
Charles Dominic

Abstract A path decomposition of a graph is a collection of its edge disjoint paths whose union is G. The pendant number Πp is the minimum number of end vertices of paths in a path decomposition of G. In this paper, we determine the pendant number of corona products and rooted products of paths and cycles and obtain some bounds for the pendant number for some specific derived graphs. Further, for any natural number n, the existence of a connected graph with pendant number n has also been established.


2011 ◽  
pp. 95-135
Author(s):  
Rinaldo B. Schinazi
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document