Skip to main
Zenodo home
Communities
My dashboard
Log in Sign up
Published January 5, 2007 | Version v1
Journal article Open

On the mean value of the Smarandache LCM function

Authors/Creators

  • Xiaoyan, Li

Description

For any positive integer n, the F.Smarandache LCM function SL(n) is defined
as the smallest positive integer k.

Files

MeanVSmarandacheLCM.pdf

Files (184.0 kB)

Name Size Download all
MeanVSmarandacheLCM.pdf
md5:7a41e8db5c5a28127dad76ec4940cc89
184.0 kB Preview Download
135
Views
70
Downloads
Show more details
All versions This version
Views

Total views

135 135
Downloads

Total downloads

70 70
Data volume

Total data volume

13.1 MB 13.1 MB

More info on how stats are collected....

Versions

External resources

Indexed in
  • OpenAIRE

Communities

Details

DOI
10.5281/zenodo.9303
DOI Badge

DOI

10.5281/zenodo.9303

Markdown

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.9303.svg)](https://doi.org/10.5281/zenodo.9303)

reStructuredText

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.9303.svg
  :target: https://doi.org/10.5281/zenodo.9303

HTML

<a href="https://doi.org/10.5281/zenodo.9303"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.9303.svg" alt="DOI"></a>

Image URL

https://zenodo.org/badge/DOI/10.5281/zenodo.9303.svg

Target URL

https://doi.org/10.5281/zenodo.9303
Resource type
Journal article
Publisher
Zenodo

Rights

License
cc-by-4.0 icon Creative Commons Attribution 4.0 International
The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited. Read more

Citation

Export

Technical metadata

Created
May 5, 2014
Modified
August 6, 2024

About

  • About
  • Policies
  • Infrastructure
  • Principles
  • Projects
  • Roadmap
  • Contact

Blog

  • Blog

Support

  • Help
  • FAQ

Developers

  • REST API
  • OAI-PMH

Contribute

  • GitHub
  • Donate

Funded by

Powered by CERN Data Centre & InvenioRDM

  • Status
  • Privacy policy
  • Cookie policy
  • Terms of Use

This site uses cookies. Find out more on how we use cookies