Math notes (daily rev. on news)

by Stefano Maruelli – Read & check, at your own risk !


Here the final proof of Fermat the last, plus some math investigation of mine. (updated 24-07-26)

 

New Rules for Sum over Rational and Irrationals

Here the summarising of what you will find in my Vol.1: New Rules for Sum over Rational and Irrationals, that also prove the order of intinitesimal

 

 

 

 

THE TWO HAND CLOCK Vol.1

 

 

I’ve sticked here  as much as possible my research and discovery onto the COMPLICATE MODULUS ALGEBRA (CMA), that is anAlgebra having a MODULUS equal to a FUNCTION, helps in understanding POWER PROBLEMS and DIOPHANTINE EQUATIONS:

 

Italian version here:

 

Maruelli-The-Two-Hand-Clock-ita-Vol.1.pdf

 

 

English version here:

 

The Two Hand Clock vol. 1

 

 

 

 

 

Fermat The Last theorem

 

Written via CMA as you never seen it before

 

NEW PROOF:

 

FERMAT THE LAST and Beal  Theorem Proof

 

 (update 26-07-24):


download here: On the way to the “Maruellos” Fermat the Last  Proof

 

 

How Fermat the Last can be shown onto the Cartesian plane (here an example for n=3) where the curved derivative reveal that chose A and B integers, there is no possible solution into the integers because of the binomial develop(s) coming out from the shift and re-scaling.

 

It is all based onto the discover of mine of 2 new properties for the Summand Operator.

 

Here in the picture the first part of the proof lead to represent C^n-B^n, also, like A^n as a Sum between 1 and A.

 

VIDEO ON YOUTUBE HERE;

 

https://www.youtube.com/watch?v=SbJoYnFBiYY

 

A LONGER DISCUSSION HERE:

 

https://www.youtube.com/watch?v=ZTnCNPai_vQ

 

 

 

download here: The Maruellos Fermat the Last  Proof

 

 

Some old concerning about Fermat’s Symmetric condition let one understood that it is a question of factorization in R, and this is possible just for n=2, but in this way is not possible to prove for all n-th powers

 

 

Same symmetric condition from n=3 on with a curved derivative there is no possible solution into the integers because X_F <> X_I, while for n=2 they are equal.

 is the reason for what Fermat is right, but it is not soo simple to understand why due the fact that in R there is the non unique factorization. For this reason the most simple and clear proof is the one use Sums and mu Complicate Modulus Algebra.

The geometric construction for n=2 shows the exchange of scale x=X/rad(2) that is a 45° rotation of X,Y system respect to x,y one.

 

 

 

 

 

Complicate Modulus Algebra

 

A new way to Solve the n-root by hand,

 

Fermat UTF problem and probably many other

 

A new story ?

 

 Last version: 20-06-2023

Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: THE%20SUM    Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: COMPLICATE_MODULUS_CLOCK%201

Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: D:\maru2002.com\TWO-HAND-CLOCK\MARUELLI-TWO-HAND-CLOCK-ANI.gif

 

NEW STORY !  From Complicate Modulus to integrals !

 

download here (updated 221230): The Two Hand Clock vol. 1

 

 

 

Beal Conjecture: download the Vol1. and learn how to understand the Proof into the Vol.2

 

Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: MARUELLI-BEAL-CONJECTURE-1ST-CASE

 

Powers and Factorial:

 

Relation between Xn and n!

 

Pls see Vol.1 for the complete story

 

 

 

Delta(n) = n!

 

COLLATZ CONJECTURE

 

COLLATZ CONJECTURE

 

Is an interesting procedure that affirm that a special algoritm will ever terminate

Consider the following operation on an arbitrary positive integer:

  • If the number is even, divide it by two.
  • If the number is odd, triple it and add one.

In modular arithmetic notation, define the function f as follows:

Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione:  f(n) = \begin{cases} n/2 &\text{if } n \equiv 0 \pmod{2}\\ 3n+1 & \text{if } n\equiv 1 \pmod{2} \end{cases}

 

 

etc…click here to read more: .COLLATZ CONJECTURE

 

 

 

 

Prime study:

 

some concernings on primes numbers

 

 

Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: cubo%20di%20primiDescrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Ricerca%20p%20Q%20q%20con%20le%20onde

 

 

Solution of n-degree equations

 

 

 

Fattorizzazione “Repunit” (fattorizzazione di numeri contenenti fattori del tipo “1….1”)

 

 

 

Concerning about the Universe

 

Light Speed can be Doubled !!!

Cern resuts confirm my old “theory” ?

 

Un nuovo modelloorbitaletridimensionale

 

 

Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: Descrizione: onda%20piana-reale%203D%202