• Study Resource
  • Explore Categories
    • Arts & Humanities
    • Business
    • Engineering & Technology
    • Foreign Language
    • History
    • Math
    • Science
    • Social Science

    Top subcategories

    • Advanced Math
    • Algebra
    • Basic Math
    • Calculus
    • Geometry
    • Linear Algebra
    • Pre-Algebra
    • Pre-Calculus
    • Statistics And Probability
    • Trigonometry
    • other →

    Top subcategories

    • Astronomy
    • Astrophysics
    • Biology
    • Chemistry
    • Earth Science
    • Environmental Science
    • Health Science
    • Physics
    • other →

    Top subcategories

    • Anthropology
    • Law
    • Political Science
    • Psychology
    • Sociology
    • other →

    Top subcategories

    • Accounting
    • Economics
    • Finance
    • Management
    • other →

    Top subcategories

    • Aerospace Engineering
    • Bioengineering
    • Chemical Engineering
    • Civil Engineering
    • Computer Science
    • Electrical Engineering
    • Industrial Engineering
    • Mechanical Engineering
    • Web Design
    • other →

    Top subcategories

    • Architecture
    • Communications
    • English
    • Gender Studies
    • Music
    • Performing Arts
    • Philosophy
    • Religious Studies
    • Writing
    • other →

    Top subcategories

    • Ancient History
    • European History
    • US History
    • World History
    • other →

    Top subcategories

    • Croatian
    • Czech
    • Finnish
    • Greek
    • Hindi
    • Japanese
    • Korean
    • Persian
    • Swedish
    • Turkish
    • other →
 
Profile Documents Logout
Upload
PDF
PDF

... A k-superperfect number n is an integer such that σ k (n) = 2n, where σ k (x) is the iterated sum of divisors function. For example, 16 is 2-superperfect since its divisors add up to 31, and in turn the divisors of 31 add up to 32, which is twice 16. At first Suryanarayana only considered 2-superper ...
HW 7. - U.I.U.C. Math
HW 7. - U.I.U.C. Math

... It is not particularly difficult, it is not hard to guess a formula for magic number, and proving that this number has the desired “magic” properties is not that hard either. #1 A magic matrix. Consider the n × n matrix obtained by filling the rows of this matrix with the numbers 1, 2, . . . , n2 , ...
Full text
Full text

... defines the generalized central factorial of degree m and increment b. This definition can be extended to any integer m as follows: x['m'b] ...
45rd IMO 2004 Problem 1. Let ABC be an acute
45rd IMO 2004 Problem 1. Let ABC be an acute

Homework 3
Homework 3

Computability
Computability

Full text
Full text

Prime Factorization prime_factorization_2
Prime Factorization prime_factorization_2

PDF format
PDF format

PERFECT NUMBERS WITH IDENTICAL DIGITS Paul Pollack1
PERFECT NUMBERS WITH IDENTICAL DIGITS Paul Pollack1

The Ring of Integers
The Ring of Integers

Full text
Full text

... In several recent papers L. Bernstein [1], [2] introduced a method of operating with units in cubic algebraic number fields to obtain combinatorial identities. In this paper we construct kth degree (k J> 2) algebraic fields with the special property that certain units have Fibonacci numbers for coef ...
Document
Document

... coefficients. The coefficients have symmetry. (x + y)5 = 1x5 + 5x4y + 10x3y2 + 10x2y3 + 5xy4 + 1y5 The first and last coefficients are 1. The coefficients of the second and second to last terms are equal to n. Example: What are the last 2 terms of (x + y)10 ? Since n = 10, the last two terms are 10x ...
Solution
Solution

Full text
Full text

... This problem a r i s e s in the following probabilistic situation. ...
OFFICIAL SYLLABUS  MATH 531-ALGEBRAIC CONTENT, PEDAGOGY, AND CONNECTIONS
OFFICIAL SYLLABUS MATH 531-ALGEBRAIC CONTENT, PEDAGOGY, AND CONNECTIONS

... 4.1.2 Solving equations 4.2.1 Solving equations of the form (equation) 4.2.2 Solving equations of the form (equation) 4.2.3 Quadratic and other polynomial equations 4.3.1 Generalized addition and multiplication properties of equality 4.3.2 Applying the same function to both sides of an equation 4.3. ...
Methods of Proof
Methods of Proof

Number sequence
Number sequence

Approximation to real numbers by algebraic numbers of
Approximation to real numbers by algebraic numbers of

Test 5-Section 6 (Maths)
Test 5-Section 6 (Maths)

Diophantine Equations
Diophantine Equations

The Least Prime Number in a Beatty Sequence
The Least Prime Number in a Beatty Sequence

Let F(x,y)
Let F(x,y)

Full text
Full text

Binomial Theorem
Binomial Theorem

< 1 ... 389 390 391 392 393 394 395 396 397 ... 443 >

Proofs of Fermat's little theorem

  • studyres.com © 2026
  • DMCA
  • Privacy
  • Terms
  • Report