Jeet1994

options(download.file.method="libcurl") #I do this line to handle any internet related errors.


install.packages("devtools")

#wait till it gets installed
#Now, run the line below

install.packages("roxygen2")

Jeet1994

library(devtools)

library(roxygen2)

Jeet1994

BenfScore <- function(i){
  P <- (log10(1+(1/i)))*100 
  return(P) #Gives the percentage output.
}

Jeet1994

#After running the function.R, 
#type, 

BenfScore(1)

Jeet1994

#' Benford Score function
#'
#' Facilitates finding the Benford Score of a number using Benford Law.
#' @param i First digit of a number
#' @keywords Benford law
#' @export
#' @examples
#' BenfScore()

BenfScore <- function(i){

Jeet1994

>> G = tf([1], [1 1 1])

G =
 
       1
  -----------
  s^2 + s + 1
 
Continuous-time transfer function.

Jeet1994

Jeet1994

Before we move to Mihailescu's proof, let us cover some more mathematical concepts (so that we feel superior to the people around us, just kidding 😄),

There is an interesting theorem that Mihailescu uses in his proof, called the Stickelberger's theorem,

---

Stickelberger's theorem:

This is a result of algebraic number theory, which gives more information about Galois Module structure of class groups of Cyclotomic Fields. This theorem consists of Stickelberger's element and Stickelberger's ideal. I will now state the complete definition of the theorem and then visit its corners as we move along,

Jeet1994