Quantum-dot cellular automata (QCA) are a promising nanoscale computing technology that exploits the quantum mechanical tunneling of electrons between quantum dots in a cell and electrostatic interaction between dots, in neighboring cells. QCA can achieve higher speed, lower power, and smaller areas than conventional complementary metal–oxide–semiconductor (CMOS) technology. Developing QCA circuits in a logically and physically reversible manner can provide exceptional reductions in energy dissipation. The main challenge of reversible QCA design is to maintain reversibility down to the physical level. The arithmetic logic unit (ALU) is an essential component of the central processing unit (CPU) of a computer. It performs various arithmetic and logical operations on the data that the CPU processes. Current QCA ALU designs are either irreversible or logically reversible; however, they lack physical reversibility, a crucial requirement to increase energy efficiency. In this paper, we present a novel multilayer design for a logically and physically reversible QCA ALU based on majority gates as the key components, which can perform 16 different operations. We use QCADesigner-E software to simulate and evaluate energy dissipation. The proposed logically and physically reversible QCA ALU offers an improvement of 88.8% in energy efficiency. Compared to the next most efficient 16-operation QCA ALU, this ALU uses 51% fewer QCA cells and 47% less area.

Gravitation is interpreted to be an “ontomathematical” force or interaction rather than an only physical one. That approach restores Newton’s original design of universal gravitation in the framework of “The Mathematical Principles of Natural Philosophy”, which allows for Einstein’s special and general relativity to be also reinterpreted ontomathematically. The entanglement theory of quantum gravitation is inherently involved also ontomathematically by virtue of the consideration of the qubit Hilbert space after entanglement as the Fourier counterpart of pseudo-Riemannian space. Gravitation can be also interpreted as purely mathematical or logical “force” or “interaction” as a corollary from its ontomathematical (rather than physical) realization. The ontomathematical approach to gravitation is implicit in general relativity equating it to operators in pseudo-Riemannian space obeying the Einstein field equation and also well-known by the “geometrization of physics”. Quantum mechanics shares the same by the separable complex Hilbert space and defining “physical quantity” by the Hermitian operators.

The paper is a continuation of another paper (https://philpapers.org/rec/PENFLT-2) published as Part I. Now, the case of “n=3” is inferred as a corollary from the Kochen and Specker theorem (1967): the eventual solutions of Fermat’s equation for “n=3” would correspond to an admissible disjunctive division of qubit into two absolutely independent parts therefore versus the contextuality of any qubit, implied by the Kochen – Specker theorem. Incommensurability (implied by the absence of hidden variables) is considered as dual to quantum contextuality. The relevant mathematical structure is Hilbert arithmetic in a wide sense (https://dx.doi.org/10.2139/ssrn.3656179), in the framework of which Hilbert arithmetic in a narrow sense and the qubit Hilbert space are dual to each other. A few cases involving set theory are possible: (1) only within the case “n=3” and implicitly, within any next level of “n” in Fermat’s equation; (2) the identification of the case “n=3” and the general case utilizing the axiom of choice rather than the axiom of induction. If the former is the case, the application of set theory and arithmetic can remain disjunctively divided: set theory, “locally”, within any level; and arithmetic, “globally”, to all levels. If the latter is the case, the proof is thoroughly within set theory. Thus, the relevance of Yablo’s paradox to the statement of Fermat’s last theorem is avoided in both cases. The idea of “arithmetic mechanics” is sketched: it might deduce the basic physical dimensions of mechanics (mass, time, distance) from the axioms of arithmetic after a relevant generalization, Furthermore, a future Part III of the paper is suggested: FLT by mediation of Hilbert arithmetic in a wide sense can be considered as another expression of Gleason’s theorem in quantum mechanics: the exclusions about (n = 1, 2) in both theorems as well as the validity for all the rest values of “n” can be unified after the theory of quantum information. The availability (respectively, non-availability) of solutions of Fermat’s equation can be proved as equivalent to the non-availability (respectively, availability) of a single probabilistic measure as to Gleason’s theorem.

The generation of arithmetic sequences involves arithmetic operations. However, is it possible to generate such sequences without being subject to any arithmetic or related operations, all by just hand? The answer may be negative, as the very rule defining these sequences itself relies on arithmetic operations. Nonetheless, this paper presents a few results demonstrating that the exact sequences of $an$, where, $a \in \{ 2,3,\cdots,9,10\}$ and $n \in \mathbb N \cup \{0\}$, can indeed be generated up to any desired number of terms without relying on any arithmetic operations and others derived from such. This is done by the formation of a specialized table that leverages numerical patterns and the notion of concatenation.

This study examines the contribution of early executive functions (EFs) in the association between fluency in reading and arithmetic. Kindergarten children (N = 1,185) were assessed on Executive Functions skills and on reading and arithmetic fluency in Grade 1 and Grade 3. The analysis revealed that beyond the connection within each domain there is a unidirectional effect between fluency measures, with Grade 1 reading fluency significantly influencing the development of arithmetic fluency in Grade 3. Furthermore, the findings indicate that kindergarten EFs significantly contribute to arithmetic fluency at both time points and to reading fluency in the first grade. Early EF skills also emerged as a mediator of associations between fluency performance in reading and arithmetic, suggesting that the influence of EFs extends beyond individual academic domains. These findings have implications for understanding the cognitive mechanisms that underlie the relations between these academic skills.

Since 1742, the year in which the Prussian Christian Goldbach wrote a letter to Leonhard Euler with his Conjecture in the weak version, mathematicians have been working on the problem. The tools in number theory become the most sophisticated thanks to the resolution solutions. Euler himself said he was unable to prove it. The weak guess in the modern version states the following: any odd number greater than 5 can be written as the sum of 3 primes. In response to Goldbach's letter, Euler reminded him of a conversation in which he proposed what is now known as Goldbach's strong conjecture: any even number greater than 2 can be written as a sum of 2 prime numbers. The most interesting result came in 2013, with proof of weak version by the Peruvian Mathematician Harald Helfgott, however the strong version remained without a definitive proof. The weak version can be demonstrated without major difficulties and will not be described in this article, as it becomes a corollary of the strong version. Despite the enormous intellectual baggage that great mathematicians have had over the centuries, the Conjecture in question has not been validated or refuted until today.

In a previous paper (https://dx.doi.org/10.2139/ssrn.3648127 ), an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for “n = 3” has been known for a long time. It needs “Hilbert mathematics”, which is inherently complete unlike the usual “Gödel mathematics”, and based on “Hilbert arithmetic” to generalize Peano arithmetic in a way to unify it with the qubit Hilbert space of quantum information. An “epoché to infinity” (similar to Husserl’s “epoché to reality”) is necessary to map Hilbert arithmetic into Peano arithmetic in order to be relevant to Fermat’s age. Furthermore, the two linked semigroups originating from addition and multiplication and from the Peano axioms in the final analysis can be postulated algebraically as independent of each other in a “Hamilton” modification of arithmetic supposedly equivalent to Peano arithmetic. The inductive proof of FLT can be deduced absolutely precisely in that Hamilton arithmetic and the pransfered as a corollary in the standard Peano arithmetic furthermore in a way accessible in Fermat’s epoch and thus, to himself in principle. A future, second part of the paper is outlined, getting directed to an eventual proof of the case “n=3” based on the qubit Hilbert space and the Kochen-Specker theorem inferable from it.

In this paper, we derive a formula for sum of powers of integers from Abel’s Summation Formula. This formula enables us to generate the formula for the sum of k-th power of integers, denoted by Sk(n), given the formulas of S1(n), S2(n), ..., Sk−1(n). Furthermore, we shall extend this formula to compute the sum of powers of an arithmetic progression. Moreover, we can combine the formula with the result of Bernoulli to derive another result which enables us to find Bernoulli Numbers recursively.

In my paper, a divisibility rule named the Queen function is de- scribed, which has been generalized for every integer and encompasses all pre- viously established divisibility rules. Subsequently, the paper discusses other areas where this function is instrumental. These include simplifying ratios, generating prime numbers, and more. Towards the end of the paper, a set of hypotheses is also presented. Among these, the most significant is the novel approach involving the application of the Queen function for prime number generation.

In recent years, the advent of Single Electron Transistor (SET) technology has opened new avenues for low power and high density circuit design. This paper presents an optimized design of an Arithmetic Logic Unit utilizing Single Electron Transistor MOSFET (SET-MOSFET) technology. The proposed design leverages the unique properties of SETs such as Coulomb blockade and quantum tunneling to achieve significant reductions in power consumption and increased speed. Through comprehensive simulations and analysis the performance metrics of the SET-MOSFET based ALU architecture includes optimized arithmetic and logical units are compared with conventional MOSFET based designs demonstrating the superiority of the proposed approach in terms of energy efficiency and operational speed. Comprehensive simulations demonstrate that the SET-MOSFET based ALU achieves a 99.97 % to 99.99 % reduction in power consumption, a 5 to 50 times increase in speed compared to conventional MOSFET based designs.

We make use of generalized iterations of the Sacks forcing to define cardinal-preserving generic extensions of the constructible universe L in which the axioms of ZF hold and in addition either 1) the parameter-free countable axiom of choice AC* fails, or 2) AC* holds but the full countable axiom of choice AC fails in the domain of reals. In another generic extension of L, we define a set X⊆P(ω), which is a model of the parameter-free part PA2* of the 2nd order Peano arithmetic PA2, in which CA(Σ21) (Comprehension for Σ21 formulas with parameters) holds, yet an instance of Comprehension CA for a more complex formula fails. Treating the iterated Sacks forcing as a class forcing over $L_{\omega_1}$, we infer the following consistency results as corollaries. If the 2nd order Peano arithmetic PA2 is formally consistent then so are the theories: 1) PA2 + negation of AC*, 2) PA2 + AC* + negation of AC, 3) PA2* + CA(Σ21) + negation of CA.

The previous two parts of the paper (correspondingly, https://philpapers.org/rec/PENFLT-2 and https://philpapers.org/rec/PENFLT-3) demonstrate that the interpretation of Fermat’s last theorem (FLT) in Hilbert arithmetic meant both in a narrow sense and in a wide sense can suggest a proof by induction in Part I and by means of the Kochen - Specker theorem in Part II. The same interpretation can serve also for a proof FLT based on Gleason’s theorem and partly similar to that in Part II. The concept of (probabilistic) measure of a subspace of Hilbert space and especially its uniqueness can be unambiguously linked to that of partial algebra or incommensurability, or interpreted as a relation of the two dual branches of Hilbert arithmetic in a wide sense. The investigation of the last relation allows for FLT and Gleason’s theorem to be equated in a sense, as two dual counterparts, and the former to be inferred from the latter, as well as vice versa under an additional condition relevant to the Gödel incompleteness of arithmetic to set theory. The qubit Hilbert space itself in turn can be interpreted by the unity of FLT and Gleason’s theorem. The proof of such a fundamental result in number theory as FLT by means of Hilbert arithmetic in a wide sense can be generalized to an idea about “quantum number theory”. It is able to research mathematically the origin of Peano arithmetic from Hilbert arithmetic by mediation of the “nonstandard bijection” and its two dual branches inherently linking it to information theory. Then, infinitesimal analysis and its revolutionary application to physics can be also re-realized in that wider context, for example, as an exploration of the way for physical quantity of time (respectively, for time derivative in any temporal process considered in physics) to appear at all. Finally, the result admits a philosophical reflection of how any hierarchy arises or changes itself only thanks to its dual and idempotent counterpart.

The paper proposes a new implementation of the PID algorithm in digital hardware. The proposed circuit implements an advanced PID formula, containing a non ideal derivative component, and weighting coefficients, which enable reducing influence of setpoint changes in the proportional and derivative components. The implementation operates on standard single precision (32 bit) floating-point numbers. The proposed circuit structure is optimized for cost. It uses just one arithmetic block, performing the multiply-and-add operation. The calculations are carried out in a sequential manner. The circuit was implemented in a Cyclone V FPGA device from Intel, using the Quartus Prime software. Proper operation of the circuit was verified by simulation. The proposed solution is comparable in terms of speed with other hardware implementations of the PID algorithm operating on standard single precision floating-point numbers, while being significantly cheaper. However, it outperforms by several orders of magnitude the speed of any software-based implementation, including solutions using PLCs, and CPU/MCUs. The proposed circuit structure, together with the overall regulator device concept, suit well the SoC (System on Chip), or SoPC (System on Programmable Chip) idea, i. e. a device, that contains a CPU core immersed in “FPGA fabric” - logic resources characteristic for FPGA devices.

This paper presents a novel algorithm, the multi-objective nonlinear interval PageRank (MONIPR) Algorithm. This algorithm extends the conventional PageRank (PR) algorithm, integrating nonlinear interval computation and multi-objective considerations into the computation process. The MONIPR algorithm bridges a research gap in integrating nonlinear interval approaches and multi-objective problems into the PR algorithm, which were traditionally treated separately. In addition, this research adopts the constrained interval arithmetic proposed to address the limitations of the conventional PR algorithm, which tends to overlook uncertainties and results in deterministic outcomes. In addition, we use a numerical example to demonstrate the proposed algorithm, contrasting it with the conventional approaches. A numerical example demonstrates the algorithm's performance by comparing the rank intervals obtained with the traditional crisp Markov chain and PR algorithm. The results highlight the ability of the proposed algorithm to provide a range of possible rank intervals, considering both uncertainty and multi-objectives. The findings suggest potential applications in decision-making, uncertainty quantification, and systems analysis.

A symbolic analysis of Archimedes’ periodical number system is developed, from which a natural link emerges with the modern positional number systems with zero. After the publication of Fibonacci’s Liber Abaci, the decimal Indo-Arabic positional system was the basis of the algorithmic and algebraic trend of modern mathematics, but even if zero plays a crucial role in algebra and mathematical analysis, zeroless positional systems show the same capability of producing efficient arithmetical algorithms based on operation tables over digits. The crucial role of digits is assessed, by considering a representation of numbers based on strings in lexicographic order. A new algorithm for the determination of decimal periods is presented,, by remarking the cruciality of this topic in number theory. Periods of ordinal numbers, and enumerations of recursive enumerability are shortly recalled. Concluding remarks are formulated about the deep relationship among numbers and information, which shed new light on a red line passing through the whole history of mathematics

This work introduces an innovative approach that unites a PIDND2N2 controller and the balanced arithmetic optimization algorithm (b-AOA) to enhance the stability of an automatic voltage regulator (AVR) system. The PIDND2N2 controller, tailored for precision, stability, and responsiveness, mitigates the limitations of conventional methods. The b-AOA optimizer is obtained through integration of pattern search and elite opposition-based learning strategies into the arithmetic optimization algorithm. This integration optimizes the controller parameters and the AVR system's response, harmonizing exploration and exploitation. Extensive assessments, including evaluations on 23 classical benchmark functions, demonstrate the efficacy of the b-AOA. It consistently achieves accurate solutions, exhibits robustness in addressing a wide range of optimization problems, and stands out as a promising choice for various applications. In terms of AVR system, comparative analyses highlight the superiority of the proposed approach in transient response characteristics, with the shortest rise and settling times and zero overshoot. Additionally, the b-AOA approach excels in frequency response, ensuring robust stability and a broader bandwidth. Furthermore, the proposed approach is compared with various state-of-the-art control methods for the AVR system, showcasing impressive performance. These important results underscore the significance of this work, setting a new benchmark for AVR control by advancing stability, responsiveness, and reliability in power systems.

A construction for the systems of natural and real numbers is presented in Zermelo-Fraenkel Set Thoery, that allows for simple proofs of the properties of these systems, and practical and mathematical applications. A practical application is discussed, in the form of a Simple and Linear Fast Adder (Patent Pending). Applications to finite group theory and analysis are also presented. A method is illustrated for finding the automorphisms of any finite group $G$, which consists of defining a canonical block form for finite groups. Examples are given, to illustrate the procedure for finding all groups of $n$ elements along with their automorphisms. The canonical block form of the symmetry group $\Delta_4$ is provided along with its automorphisms. The construction of natural numbers is naturally generalized to provide a simple and sound construction of the continuum with order and addition properties, and where a real number is an infinite set of natural numbers. A basic outline of analysis is proposed with a fast derivative algorithm. Under this representation, a countable sequence of real numbers is represented by a single real number. Furthermore, an infinite $\infty\times\infty$ real-valued matrix is represented with a single real number. A real function is represented by a set of real numbers, and a countable sequence of real functions is also represented by a set of real numbers. In general, mathematical objects can be represented using the smallest possible data type and these representations are calculable. In the last section, mathematical objects of all types are well assigned to tree structures in a proposed type hierarchy.

Hilbert arithmetic in a wide sense, including Hilbert arithmetic in a narrow sense consisting by two dual and anti-isometric Peano arithmetics, on the one hand, and the qubit Hilbert space (originating for the standard separable complex Hilbert space of quantum mechanics), on the other hand, allows for an arithmetic version of Gentzen’s cut elimination and quantum measurement to be described uniformy as two processes occurring accordingly in those two branches. A philosophical reflection also justifying that unity by quantum neo-Pythagoreanism links it to the opposition of propositional logic, to which Gentzen’s cut rule refers immediately, on the one hand, and the linguistic and mathematical theory of metaphor therefore sharing the same structure borrowed from Hilbert arithmetic in a wide sense. An example by hermeneutical circle modeled as a dual pair of a syllogism (accomplishable also by a Turing machine) and a relevant metaphor (being a formal and logical mistake and thus fundamentally inaccessible to any Turing machine) visualizes human understanding corresponding also to Gentzen’s cut elimination and the Gödel dichotomy about the relation of arithmetic to set theory: either incompleteness or contradiction. The metaphor as the complementing “half” of any understanding of hermeneutical circle is what allows for that Gödel-like incompleteness to be overcome in human thought.

In this paper defines the consecutive sum of the digits of a natural number, so far as it becomes less than ten, as an arithmetic function called and then introduces some important properties of this function by proving a few theorems in a way that they can be used as a powerful tool in many cases. As an instance, by introducing a test called test, it has been shown that we are able to examine many algebraic equalities in the form of in which and are arithmetic functions and to easily study many of the algebraic and diophantine equations in the domain of whole numbers. The importance of test for algebraic equalities can be considered equivalent to dimensional equation in physics relations and formulas. Additionally, this arithmetic function can also be useful in factorizing the composite odd numbers.

The brain, rather than being homogeneous, displays an almost infinite topological genus, because is punctured with a very high number of topological vortexes, i.e., .e., nesting, non-concentric brain signal cycles resulting from inhibitory neurons devoid of excitatory oscillations. Starting from this observation, we show that the occurrence of topological vortexes is constrained by random walks taking place during self-organized brain activity. We introduce a visual model, based on the Pascal’s triangle and linear and nonlinear arithmetic octahedrons, that describes three-dimensional random walks of excitatory spike activity propagating throughout the brain tissue. In case of nonlinear 3D paths, the trajectories in brains crossed by spiking oscillations can be depicted as the operation of filling the numbers of the octahedrons in the form of “islands of numbers”: this leads to excitatory neuronal assemblies, spaced out by empty area of inhibitory neuronal assemblies. These procedures allow us to describe the topology of a brain of infinite genus, to assess inhibitory neurons in terms of Betti numbers, and to highlight how non-linear random walks cause spike diffusion in neural tissues when tiny groups of excitatory neurons start to fire.

We present an improved algorithm for fast calculation of the inverse square root for single-precision floating-point numbers. The algorithm is much more accurate than the famous fast inverse square root algorithm and has a similar computational cost. The presented modification concern Newton-Raphson corrections and can be applied when the distribution of these corrections is not symmetric (for instance, in our case they are always negative).

The Universe, rather than being homogeneous, displays an almost infinite topological genus, because it is punctured with a countless number of gravitational vortexes, i.e., black holes. Starting from this view, we aim to show that the occurrence of black holes is constrained by geometric random walks taking place during cosmic inflationary expansion. At first, we introduce a visual model, based on the Pascal’s triangle and linear and nonlinear arithmetic octahedrons, which describes three-dimensional cosmic random walks. In case of nonlinear 3D paths, trajectories in an expanding Universe can be depicted as the operation of filling the numbers of the octahedrons in the form of “islands of numbers”: this leads to separate cosmic structures (standing for matter/energy), spaced out by empty areas (constituted by black holes and dark matter). These procedures allow us to describe the topology of an universe of infinite genus, to assess black hole formation in terms of infinite Betti numbers, to highlight how non-linear random walks might provoke gravitational effects also in absence of mass/energy, and to propose a novel interpretation of Beckenstein-Hawking entropy: it is proportional to the surface, rather than the volume, of a black hole, because the latter does not contain information.

The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) + R(x) \end{align*} $P$, $Q$ and $R$ are arbitrarily chosen polynomials and $\pi(x)$ denotes the \textit{Prime Counting Function}. The proofs require specific order estimates involving $\pi(x)$ and the \textit{Second Chebyshev Function} $\psi(x)$, as well as the famous \textit{Prime Number Theorem} in addition to certain meromorphic properties of the \textit{Riemann Zeta Function} $\zeta(s)$ and results regarding its non-trivial zeros. A few generalizations of these concepts have also been discussed in detail towards the later stages of the paper, along with citing some important applications.

Deep Neural Network (DNN) inference demands substantial computing power, resulting in significant energy consumption. A large number of negative output activations in convolution layers are rendered zero due to the invocation of the ReLU activation function. This results in a substantial number of unnecessary computations that consume significant amounts of energy. This paper presents ECHO: Energy-efficient Computation Harnessing Onilne Arithmetic - A MSDF-based accelerator for DNN inference, designed for computation pruning, utilizing an unconventional arithmetic paradigm known as online/ most-significant digit first (MSDF) arithmetic which performs computations in a digit-serial manner. The MSDF digital serial computation of online arithmetic enables overlapped computation of successive operations leading to substantial performance improvements. The online arithmetic, coupled with a negative output detection scheme, facilitates early and precise recognition of negative outputs. This, in turn, allows for the timely termination of unnecessary computations, resulting in a reduction of energy consumption. The implemented design has been realized on the Xilinx Virtex-7 VU3P FPGA and subjected to a comprehensive evaluation through a rigorous comparative analysis involving widely used performance metrics. Experimental results demonstrate promising power and throughput improvements compared to contemporary methods. In particular, the proposed design achieved an average improvement in power consumption of up to 81%, 82.9%, and 40.6% for VGG-16, ResNet-18, and ResNet-50 workloads compared to the conventional bit-serial design, respectively. Furthermore, significant average speedups of 2.39×, 2.6×, and 2.42 were observed when comparing the proposed design to conventional bit-serial designs for VGG-16, ResNet-18, and ResNet-50 models respectively.

Lewis Carroll, both logician and writer, suggested a logical paradox containing furthermore two connotations (connotations or metaphors are inherent in literature rather than in mathematics or logics). The paradox itself refers to implication demonstrating that an intermediate implication can be always inserted in an implication therefore postponing its ultimate conclusion for the next step and those insertions can be iteratively and indefinitely added ad lib, as if ad infinitum. Both connotations clear up links due to the shared formal structure with other well-known mathematical observations: (1) the paradox of Achilles and the Turtle; (2) the transitivity of the relation of equality. Analogically to (1), one can juxtapose the paradox of the Liar (for Lewis Carroll’s paradox) and that of the arrow (for “Achilles and the Turtle”), i.e. a logical paradox, on the one hand, and an aporia of motion, on the other hand, suggesting a shared formal structure of both, which can be called “ontological”, on which basis “motion” studied by physics and “conclusion” studied by logic can be unified being able to bridge logic and physics philosophically in a Hegelian manner: even more, the bridge can be continued to mathematics in virtue of (2), which forces the equality (for its property of transitivity) of any two quantities to be postponed analogically ad lib and ad infinitum. The paper shows that Hilbert arithmetic underlies naturally Lewis Carroll’s paradox admitting at least three interpretations linked to each other by it: mathematical, physical and logical. Thus, it can be considered as both generalization and solution of his paradox therefore naturally unifying the completeness of quantum mechanics (i.e. the absence of hidden variables) and eventual completeness of mathematics as the same and isomorphic to the completeness of propositional logic in relation to set theory as a first-order logic (in the sense of Gödel (1930)’s completeness theorems).

Secure Secret Sharing Single-Source Shortest Distance (SSSD) protocols, built on the Secure Multi-Party Computation (SMC) foundation, have emerged as a promising solution to address the secure distribution and management of sensitive secrets among multiple parties. This paper focuses on the crucial aspect of security proof within SSSD protocols based on SMC, aiming to provide a scientifically rigorous understanding of the formal verification process and the robust guarantees they offer. Through a comprehensive examination of the fundamental principles underpinning SMC and the specific design considerations unique to SSSD protocols, this paper meticulously explores the key components and intricate steps involved in constructing a rigorous security proof. Furthermore, it discusses the adversarial model, precise security definitions, cryptographic assumptions utilized within the proof, and sophisticated techniques and reductions to establish its validity. By means of a meticulous analysis of the security proof for SSSD protocols, this paper critically evaluates both the strengths and limitations of the proposed approach, offering valuable insights to inform future research and development within this significant domain of study.

The primary purpose of this article is to provide a brief overview about the notion of the \textit{Mertens Function} $M(n)$ and \textit{Redheffer Matrices} $\mathbb{A}_{n}$ and, to derive specific order estimates for $M(n)$, in order to analyze the location of the non-trivial zeros of the \textit{Riemann Zeta function} $\zeta(s)$. A priori using the above concepts, the article aims at establishing a necessary and sufficient condition for the \textit{Riemann Hypothesis} to hold true.

Probabilistic inference problems have very broad practical applications. To solve this kind of problems under conditions of certainty, an effective mathematical apparatus has been developed. In real situations, obtaining deterministic estimates of relevant probabilities is often difficult; therefore, problems with handling uncertain estimates of probabilities appear. This paper examines the problem of probabilistic inference with probability trees provided that the initial probabilities are given in the form of intervals of their possible values.

This research article provides an unconditional proof of an inequality proposed by \textit{Srinivasa Ramanujan} involving the Prime Counting Function $\pi(x)$, \begin{align*} (\pi(x))^{2}<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right) \end{align*} for every real $x\geq \exp(547)$, using specific order estimates of the \textit{Mertens Function}, $M(x)$. The proof primarily hinges upon investigating the underlying relation between $M(x)$ and the \textit{Second Chebyshev Function}, $\psi(x)$, in addition to applying the meromorphic properties of the \textit{Riemann Zeta Function}, $\zeta(s)$ with an intention of deriving an improved approximation for $\pi(x)$.