Pragyaditya Das Jeet1994

## Ensemble-Methods-Python.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                Jeet1994
                / Ensemble-Methods-Python.ipynb
            
            
              Created
              November 2, 2019 08:16
            
          
        Loading

      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## Catalan's Conjecture - A learning exercise for the bored mind : 2.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                Jeet1994
                / Catalan's Conjecture - A learning exercise for the bored mind : 2.md
            
            
              Last active
              August 24, 2018 12:15
            
              
                Catalan's Conjecture - A learning exercise for the bored mind : 2
              
          
    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,

  
## NodGenes.csv

          
            Gene
            nodU
            nodS
            nodU/nodO
            nodD
            nodC2
            nodB
            nodA
            nodI
            nodJ
            nodC1
            nodH

            
              Burkholderia 1
              100
              100
              100
              100
              100
              100
              100
              100
              100
              100
              0

            
              Burkholderia 2
              99
              98
              98
              94
              90
              94
              98
              98
              96
              87
              0

            
              Burkholderia 3
              99
              97
              98
              93
              89
              95
              99
              96
              97
              88
              0

            
              Burkholderia 4
              98
              94
              96
              99
              79
              94
              98
              96
              94
              89
              0

            
              Burkholderia 5
              81
              67
              40
              70
              76
              60
              73
              71
              77
              70
              72

            
              Burkholderia 6
              80
              66
              39
              69
              76
              60
              73
              70
              77
              70
              69

            
              Burkholderia 7
              76
              65
              40
              71
              63
              57
              75
              72
              79
              67
              100

            
              Burkholderia 8
              76
              69
              40
              72
              63
              56
              75
              74
              79
              66
              94

            
              Burkholderia 9
              75
              71
              40
              68
              71
              72
              70
              71
              76
              71
              66

## transferFun.m
>> G = tf([1], [1 1 1])

G =

       1
  -----------
  s^2 + s + 1

Continuous-time transfer function.

## FinalCode.R
#' 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){

## Run.R
#After running the function.R,
#type,

BenfScore(1)

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

## Load.R
library(devtools)

library(roxygen2)

## Setup.R
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")
Gene	nodU	nodS	nodU/nodO	nodD	nodC2	nodB	nodA	nodI	nodJ	nodC1	nodH
Burkholderia 1	100	100	100	100	100	100	100	100	100	100	0
Burkholderia 2	99	98	98	94	90	94	98	98	96	87	0
Burkholderia 3	99	97	98	93	89	95	99	96	97	88	0
Burkholderia 4	98	94	96	99	79	94	98	96	94	89	0
Burkholderia 5	81	67	40	70	76	60	73	71	77	70	72
Burkholderia 6	80	66	39	69	76	60	73	70	77	70	69
Burkholderia 7	76	65	40	71	63	57	75	72	79	67	100
Burkholderia 8	76	69	40	72	63	56	75	74	79	66	94
Burkholderia 9	75	71	40	68	71	72	70	71	76	71	66
	>> G = tf([1], [1 1 1])

	G =

	1
	-----------
	s^2 + s + 1

	Continuous-time transfer function.
	#' 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){
	BenfScore <- function(i){
	P <- (log10(1+(1/i)))*100
	return(P) #Gives the percentage output.
	}
	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")