Results 1 to 10 of about 8,879 (118)
Several generalizations on Wolstenholme Theorem [PDF]
This paper generalizes Wolstenholme theorem on two aspects. The first generalization is a parameterized form: let p > k + 2, k ≥ 1, ∀t ∈ ℤ, then ${{(pt + p - 1)!} \over {(pt)!}}\mathop \sum \limits_{m = 0}^{k - 1} {( - 1)^m}\mathop \sum \limits_{1 \le {
Zhu Yuyang +3 more
doaj +1 more source
This work presents a methodology for the hydrological characterization of natural and urban landscapes, focusing on accurate estimations of infiltration capacity and runoff characteristics.
Chloe Campo +2 more
doaj +1 more source
On the Number of False Witnesses for a Composite Number [PDF]
If a is not a multiple of n and a
Erdős, Paul, Pomerance, Carl
openaire +1 more source
The initial thickness ratio and number of layers of dissimilar metal components greatly influence the impact performance of laminated metal composites. In this paper, positive and lateral impact tests of 5-layer composite sheets with thickness ratios of ...
Zejun Chen +4 more
doaj +1 more source
Assessment of Cytotoxic and Genotoxic Effect of Modern Dental Materials in vivo
Objectives: The aim of the study was to assess the biocompatibility of modern composite and amalgam dental fillings. Material and Methods: The research was conducted on 150 healthy patients between the ages of 10 and 20 who had amalgam and composite ...
Milena Trutina Gavran +8 more
doaj +1 more source
Relation between Prime and Composite Number
This article was not peer-reviewed. No abstract available.
Raju Ram Thapa
doaj +3 more sources
Pembuatan dan Karakterisasi Sifat Fisis Komposit Multilayer Serat Rami
The use of composites as an innovative new material is increasing. Composites are made from two or more materials that have different properties. This research was conducted to make multilayer composites and determine the effect of variations in the ...
Naila Hilmiyana Syifa +2 more
doaj +1 more source
On Highly Composite and Similar Numbers [PDF]
A (positive whole) number is called highly composite if it has more divisors than any smaller number, highly abundant if the sum of its divisors is greater than that for any smaller number, and superabundant if the sum of the reciprocals of its divisors is greater than that for any smaller number. The author uses \textit{A. E.
Alaoglu, Leon, Erdős, Pál
openaire +1 more source
A Composition Theorem for Parity Kill Number [PDF]
In this work, we study the parity complexity measures ${\mathsf{C}^{\oplus}_{\min}}[f]$ and ${\mathsf{DT^{\oplus}}}[f]$. ${\mathsf{C}^{\oplus}_{\min}}[f]$ is the \emph{parity kill number} of $f$, the fewest number of parities on the input variables one has to fix in order to "kill" $f$, i.e. to make it constant. ${\mathsf{DT^{\oplus}}}[f]$ is the depth
Ryan O'Donnell +4 more
openaire +4 more sources
Gaps of size 2, 4, and (conditionally) 6 between successive odd composite numbers occur infinitely often [PDF]
The infinite sequence of gaps (first differences) between successive odd composite numbers contains only the numbers 2, 4, and 6. We prove that, for any natural number k, the sequence of gaps contains infinitely many k-tuplets of consecutive gaps all ...
Joel E. Cohen, Dexter Senft
doaj +1 more source

