Results 141 to 150 of about 31,208 (175)

Chronobiologically-informed features from CGM data provide unique information for XGBoost prediction of longer-term glycemic dysregulation in 8,000 individuals with type-2 diabetes. [PDF]

PLOS Digit Health
Burks JH, Joe L, Kanjaria K, Monsivais C, O'laughlin K, Smarr BL.   +5 more
europepmc   +1 more source

Opening the AI Black Box: Distilling Machine-Learned Algorithms into Code. [PDF]

Entropy (Basel)
Michaud EJ, Liao I, Lad V, Liu Z, Mudide A, Loughridge C, Guo ZC, Kheirkhah TR, Vukelić M, Tegmark M.   +9 more
europepmc   +1 more source

Green Chemometric-assisted UV spectrophotometric techniques for the analysis of Helicobacter pylori triple therapy: amoxicillin, metronidazole and famotidine in bulk, individual and laboratory- prepared combined dosage forms: application to simulated gastric fluid with comprehensive greenness and whiteness appraisals. [PDF]

BMC Chem
Maher HM, Mahgoub H, Ragab MAA, Tarek S.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Sums of higher divisor functions

Journal of Number Theory, 2021
The authors study the average behavior of the $k$th divisor (or Piltz divisor) function over values of the quadratic form $(n_1)^2+\dots+ (n_l)^2$ with $l>=3$. For $k=2$ and $l=3$ an earlier result is due to [\textit{L. Zhao}, Acta Arith. 163, No. 2, 161--177 (2014; Zbl 1346.11056)], while for $k=3$, $l=3$ to [\textit{Q. Sun} and \textit{D.
Hu, Guangwei, Lü, Guangshi
openaire   +1 more source

Sum of higher divisor function with prime summands

Czechoslovak Mathematical Journal, 2023
Let \(\tau_{k}(n)\) denote the \(k\)-th divisor function, counting the number of representations \(m_1\cdots m_k=n\) with \(1\leq m_1,\dots ,m_k\leq n\). Inspired by the recent work of \textit{G. Hu} and \textit{G. Lü} [J. Number Theory 220, 61--74 (2021; Zbl 1466.11065)], the authors obtain an asymptotic for the following sum running over primes \(p_1,
Ding, Yuchen, Zhou, Guang-Liang
openaire   +2 more sources

Sums of the Divisor Function

Canadian Journal of Mathematics, 1964
Shapiro and Warga (2) have proved in an elementary way that all large integers are expressible as the sum of at most 20 primes. In so doing, they proved thatas x —> ∞, where u is a positive square-free integer,
Gordon, B., Rogers, K.
openaire   +2 more sources

CONGRUENCES AND EXPONENTIAL SUMS WITH THE SUM OF ALIQUOT DIVISORS FUNCTION

International Journal of Number Theory, 2008
We give bounds on the number of integers 1 ≤ n ≤ N such that p | s(n), where p is a prime and s(n) is the sum of aliquot divisors function given by s(n) = σ(n) - n, where σ(n) is the sum of divisors function. Using this result, we obtain nontrivial bounds in certain ranges for rational exponential sums of the form [Formula: see text]
Balasuriya, Sanka, Banks, William D., Shparlinski, Igor E.   +2 more
openaire   +2 more sources

On Evaluation of Convolution Sums Involving Divisor Functions and Partition Functions

Vietnam Journal of Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A Note on Sums of Two Squares and Sum-of-divisors Functions

2020
See the abstract in the attached pdf.
openaire   +2 more sources

Shifted convolution sums of fourier coefficients with divisor functions

Acta Mathematica Hungarica, 2015
From the text: Let \(f(z)\) be a primitive holomorphic cusp form of even integral weight \(k\) for the full modular group. Denote its \(n\)th normalized Fourier coefficient (Hecke eigenvalue) by \(\lambda_f(n)\).'' ``Since Selberg's seminal paper [\textit{A. Selberg}, Proc. Sympos. Pure Math.
openaire   +1 more source