Libmonster ID: U.S.-1575
Author(s) of the publication: Verner Andrei

Front side: :

 2r2.JPG

Progress Sums:-1,-2,-3,-4,-5...    1,2,3,4,5...

We express the formulas:Sn= (n²a₁+n)/2, ; Sn-1=(n²a₁-n)/2,.  (n - Number of summing members, a₁ -  first member of the progression. With a negative or positive value n. Expressions Sn-1, Sn-2  should be understood: subtraction from the number of the member taken).

First option:

   

Example: Sn= (n²a₁+n)/2.

For n = -5 we have: ((-5)2(-1)+(-5))/2=-15;                          For n = 5 we have: (52*1+5)/2=15.

 

 Example: Sn-1=(n²a₁-n)/2

 For n = -5 we have: ((-5)2(-1)-(-5))/2=-10                            For n = 5 we have: (52*1-5)/2=10.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Triangular:                                                                                                                                                                                                         

 

 

 

  Progress Sums:-1,-3,-6,-10,-15....1,3,6,10,15....                                      

  We express the formulas:Sn= ((n+a₁)3-(n+a₁))/6, Sn= (n3-n)/6+(n²a₁+n)/2;  Sn-1=(n3-n)/6; Sn-2=((n-a₁)3-(n-a₁))/6,         Sn-2=(n3-n)/6-(n²a₁-n)/2.       

  First option:

 

 

  Example: Sn= ((n+a₁)3-(n+a₁))/6.

  For n = -5 we have: ((-5+(-1))3-(-5+(-1)))/6=-35;             For n = 5 we have: ((5+1)3-(5+1))/6=35.

 

  Example: Sn-2=((n-a₁)3-(n-a₁))/6.

  For n = -5 we have:((-5-(-1))3-(-5-(-1)))/6=-10;                For n = 5 we have: ((5-1)3-(5-1))/6=10.

 

  Second option:

 

  Example: Sn= (n3-n)/6+(n²a₁+n)/2.  

  For n = -5 we have: ((-5)3-(-5))/6+((-5)2(-1)+(-5))/2= -35;    For n = 5 we have:  (( 5)3-5)/6+(52*1+5)/2= 35.

          

  Example: Sn-1=(n3-n)/6.

  For n = -5 we have: ((-5)3-(-5))/6= -20;                             For n = 5 we have: (( 5)3-5)/6=20.

     

  Example: Sn-2=(n3-n)/6-(n²a₁-n)/2.

  For n = -5 we have:((-5)3-(-5))/6 -((-5)2(-1)-(-5))/2= -10;       For n = 5 we have: (( 5)3-5)/6-(52*1-5)/2= 10.

                                              

         Quadrilateral:

 4r2.JPG

 Progress Sums: -1,-4,-9,-16,-25....1,4,9,16,25....

  We express the formulas:Sn= a₁(n+a₁)(n²a₁+0,5n)/3,  Sn= (n3-n)/3 + (n²a₁+n)/2;  Sn-1= a₁(n-a₁)(n²a₁-0,5n)/3, Sn-1=(n3-n)/3 - (n²a₁-n)/2.

  First option:

 

  Example: Sn=a₁(n+a₁)(n²a₁+0,5n)/3.

  For n = -5 we have: -1(-5+(-1))*((-5)2(-1)+(-2,5))/3=-55;        For n = 5 we have: 1(5+1)(52*1+2,5)/3=55.

 

  Example: Sn-1= a₁(n-a₁)(n²a₁-0,5n)/3.

  For n = -5 we have: -1(-5-(-1))*((-5)2(-1)-(-2,5))/3=-30;           For n = 5 we have:1(5-1)(52*1-2,5)/3=30.

 

  Second option:

 

  Example: Sn= (n3-n)/3 + (n²a₁+n)/2.

  For n = -5 we have: ((-5)3-(-5))/3 +((-5)2(-1)+(-5))/2= -55;       For n = 5 we have:((5)3-5)/3 + (52*1+5)/2= 55.

 

  Example: Sn-1= (n3-n)/3 -(n²a₁-n)/2.

  For n = -5 we have: ((-5)3-(-5))/3 -((-5)2(-1)-(-5))/2= -30;           For n = 5 we have: ((5)3-5)/3 -(52*1-5)/2= 30.

 

 

 


© libmonster.com

Permanent link to this publication:

https://libmonster.com/m/articles/view/Calculation-of-the-pyramid-Sequence-of-numerical-progressions

Similar publications: LUnited States LWorld Y G


Publisher:

Andrei VernerContacts and other materials (articles, photo, files etc)

Author's official page at Libmonster: https://libmonster.com/andrei_62

Find other author's materials at: Libmonster (all the World)GoogleYandex

Permanent link for scientific papers (for citations):

Verner Andrei, Calculation of the pyramid (Sequence of numerical progressions). // New-York: Libmonster (LIBMONSTER.COM). Updated: 19.07.2024. URL: https://libmonster.com/m/articles/view/Calculation-of-the-pyramid-Sequence-of-numerical-progressions (date of access: 12.08.2026).

Publication author(s) - Verner Andrei:

Verner Andrei → other publications, search: Libmonster USALibmonster WorldGoogleYandex

Comments:



Reviews of professional authors
Order by: 
Per page: 
 
  • There are no comments yet
Related topics
Publisher
Andrei Verner
Frunze, Kyrgyzstan
881 views rating
19.07.2024 (754 days ago)
0 subscribers
Rating
0 votes
Related Articles
History of Germany's long-standing attempts to reclaim the treasures of Troy from Russia. Treaties, exhibitions, and the position of the parties.
Catalog: Law 
6 hours ago · From John Oppenheimer
The History of the Treasures of Troy: from Schliemann's discovery and export to Germany to their relocation to the USSR as a trophy and storage in the Pushkin Museum in Moscow.
Catalog: History 
7 hours ago · From John Oppenheimer
The History of Troy: from the legendary city praised by Homer to Schliemann's archaeological excavations and the modern UNESCO World Heritage site.
Catalog: History 
18 hours ago · From John Oppenheimer
Henry Schliemann, who discovered Troy, was closely connected with Russia: here he became wealthy, became a master merchant, received citizenship, and was named Andrey Aristovich.
Catalog: History 
18 hours ago · From John Oppenheimer
Henry Schliemann: self-taught archaeologist who discovered Troy, or a forger who destroyed an ancient city? Examining the arguments of both sides.
Catalog: History 
18 hours ago · From John Oppenheimer
The most successful nation in the Olympics: Norway at the 2026 Games, the United States in the total number of medals, and Russia in the historical ranking.
Catalog: Sports 
Yesterday · From John Oppenheimer
The aesthetics of the horse in art and culture. The image of the horse as a symbol of strength, freedom, power, and loyalty in painting, literature, and mythology.
Catalog: Aesthetics 
2 days ago · From John Oppenheimer
Male baldness: dominant gene or recessive? Maternal inheritance, the role of the AR gene, and the influence of androgens. Scientific explanation.
Catalog: Biology 
2 days ago · From John Oppenheimer
Data on water levels, glacier melting, and forecasts up to 2100.
Catalog: Geography 
2 days ago · From John Oppenheimer
Learn how water is delivered to the top floor of the Burj Khalifa thanks to a multi-level pump and reservoir system. Unique engineering solutions.
Catalog: Architecture 
2 days ago · From John Oppenheimer

New publications:

Popular with readers:

News from other countries:

LIBMONSTER.COM - U.S. Digital Library

Create your author's collection of articles, books, author's works, biographies, photographic documents, files. Save forever your author's legacy in digital form. Click here to register as an author.
Library Partners

Calculation of the pyramid (Sequence of numerical progressions).
 

Editorial Contacts
Chat for Authors: U.S. LIVE: We are in social networks:

About · News · For Advertisers

U.S. Digital Library ® All rights reserved.
2014-2026, LIBMONSTER.COM is a part of Libmonster, international library network (open map)
Keeping the heritage of the United States of America


LIBMONSTER NETWORK ONE WORLD - ONE LIBRARY

US-Great Britain Sweden Serbia
Russia Belarus Ukraine Kazakhstan Moldova Tajikistan Estonia Russia-2 Belarus-2

Create and store your author's collection at Libmonster: articles, books, studies. Libmonster will spread your heritage all over the world (through a network of affiliates, partner libraries, search engines, social networks). You will be able to share a link to your profile with colleagues, students, readers and other interested parties, in order to acquaint them with your copyright heritage. Once you register, you have more than 100 tools at your disposal to build your own author collection. It's free: it was, it is, and it always will be.

Download app for Android