Results 191 to 200 of about 11,354,844 (246)
Some of the next articles are maybe not open access.

Insight into the key factors in high Li +  transference number composite electrolytes for solid lithium batteries.

ChemSusChem, 2022
Solid lithium batteries (SLBs) have received much attention due to their potential to achieve secondary batteries with high energy density and high safety. The solid electrolyte (SE) is believed to be the essential material for SLBs. Among the recent SEs,
Mengyang Jia   +2 more
semanticscholar   +1 more source

The role of vibration and pass number on microstructure and mechanical properties of AZ91/SiC composite layer during friction stir processing

Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science, 2021
In this study, nano-sized SiC particles are added to AZ91 magnesium alloy using friction stir processing (FSP) and friction stir vibration processing (FSVP) to produce surface nano-composite layers.
B. Bagheri   +3 more
semanticscholar   +1 more source

Solvent‐Free Synthesis of Thin, Flexible, Nonflammable Garnet‐Based Composite Solid Electrolyte for All‐Solid‐State Lithium Batteries

Advanced Energy Materials, 2020
Thin solid‐state electrolytes with nonflammability, high ionic conductivity, low interfacial resistance, and good processability are urgently required for next‐generation safe, high energy density lithium metal batteries.
Ce-wen Nan, Li-zhen Fan, Pingge He
exaly   +2 more sources

Investigation of γ-ray attenuation coefficients, effective atomic number and electron density for ZnO/HDPE composite

Physica Scripta, 2020
Bulk and nano ZnO/HDPE composite with different weight fractions (10, 20, 30 and 40%) of ZnO as a filler were prepared and studied for radiation shielding properties against γ-ray. The structural, morphological and functional properties of the composites
Z. Alsayed   +4 more
semanticscholar   +1 more source

Prime and Composite Numbers

2021
A positive integer p is called a prime, if p has exactly two different positive divisors. Every prime p is thus greater than 1 and it is divisible by itself and 1. Positive integers greater than 1 are called composite if they are not primes.
Michal Křížek   +2 more
openaire   +2 more sources

On the average number of power residues modulo a?composite number

, 2010
We study the behaviour of the quantities and , that is, the number of th power residues in the reduced and complete residue systems modulo a composite number , respectively, where is an arbitrary fixed number.
Maxim Aleksandrovich Korolev
semanticscholar   +1 more source

Elemental Complete Composite Number Generators

The Fibonacci quarterly, 1985
Proof: It suffices to produce an example of such a function. Here, the existence of several such functions will be shown. First, consider the following two sequences: 2, 3, 3, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, ...
Blake Ralston
semanticscholar   +1 more source

On Highly Composite Numbers [PDF]

open access: possibleJournal of the London Mathematical Society, 1944
for a certain c. In fact I shall prove that if n is highly composite, then the next highly composite number is less than n+n(log y&)-C ; and the result just stated follows immediately from this. At, present I cannot, decide whether the number of highly composite numbers not exceeding z is greater than (logx)” for every k.
openaire   +1 more source

The win ratio approach for composite endpoints: practical guidance based on previous experience.

European Heart Journal, 2020
The win ratio was introduced in 2012 as a new method for examining composite endpoints and has since been widely adopted in cardiovascular (CV) trials.
B. Redfors   +6 more
semanticscholar   +1 more source

On the nth composite number

, 1993
An asymptotic formula for the nth composite number C n , with an error term O(n/log m n) for any fixed m, is given. Exact calculations for C n with various n ≤ 1013 are also given, showing that approximations to C n by the asymptotic formula have errors ...
P. Shiu
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy