• 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
Max Lewis Dept. of Mathematics, University of Queensland, St Lucia
Max Lewis Dept. of Mathematics, University of Queensland, St Lucia

History of Math in Competitive Math Problems
History of Math in Competitive Math Problems

Section 5.1 Prime and Composite Numbers:
Section 5.1 Prime and Composite Numbers:

Objective: using algebra to prove number facts 1. Prove that the
Objective: using algebra to prove number facts 1. Prove that the

n = n//*,
n = n//*,

Fermat`s two square theorem for rationals
Fermat`s two square theorem for rationals

#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A
#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A

Problem of the Week
Problem of the Week

ON THE FRACTIONAL PARTS OF LACUNARY SEQUENCES
ON THE FRACTIONAL PARTS OF LACUNARY SEQUENCES

Numbers: Fun and Challenge
Numbers: Fun and Challenge

a 1
a 1

An Analysis of the Collatz Conjecture
An Analysis of the Collatz Conjecture

PERMUTATIONS WITHOUT 3-SEQUENCES 1. Introduction, The
PERMUTATIONS WITHOUT 3-SEQUENCES 1. Introduction, The

An Iteration Based on Prime and Composite Factors 1
An Iteration Based on Prime and Composite Factors 1

( 10)( 15) x x N − + = x y 25 xy x y = + + 9 8 ×
( 10)( 15) x x N − + = x y 25 xy x y = + + 9 8 ×

Full text
Full text

... - k - I), which enumerates the strings of length n - k that end with a zero. But, when a string of k consecutive ones is appended, these are precisely the configurations we wish to count. Remark 3.1: These two results can also be obtained from the work of Philippou and Muwafi [2], For k > 2, our fk ...
Part I
Part I

... 2. Write the prime factorization of each of the numbers in problem 1 above. 3. Find the least common multiple (LCM) (a) 24 and 18 (b) 16 and 18 (c) 12 and 15 ...
a quick way to factor large semi-primes
a quick way to factor large semi-primes

OF DIOPHANTINE APPROXIMATIONS
OF DIOPHANTINE APPROXIMATIONS

Preliminaries()
Preliminaries()

... Answer: (1) Base: when the number of pigeonholes n = 1, and the number of items m >n. Obviously, the principle is true, because all the items should be in that one pigeonhole. (2) Induction hypothesis: Suppose that the pigeonhole principle is true for any number of pigeonholes n’ < n. (3) Induction ...
Ch11 - ClausenTech
Ch11 - ClausenTech

... Theorem: an infinite geometric series is convergent and has a sum “S” if and only if its common ratio, r meets the following condition: | r | < 1 If our infinite series is convergent (| r | < 1), we can calculate its sum by the formula: ...
CHAP04 Inequalities and Absolute Values
CHAP04 Inequalities and Absolute Values

... Clearly |xy| = |x|.|y| for all real numbers x, y but things don’t work out quite so neatly for sums. It is NOT true in general that |x + y| = |x| + |y|. If x, y have opposite signs then |x + y| will be less than |x| + |y|. For example. |3 + (−1)| = 2 while |3| + |−1| = 4. All we can say for sums is ...
(n!)+
(n!)+

2.1 Lesson
2.1 Lesson

Writing Tips
Writing Tips

< 1 ... 385 386 387 388 389 390 391 392 393 ... 443 >

Proofs of Fermat's little theorem

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