Explore BrainMass

# Superincreasing Sequence and Prove that Expression is Prime

Not what you're looking for? Search our solutions OR ask your own Custom question.

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

1) Let S= {b ,b ,...........b } satisfies b j+1 >2b j for all j =1,2,3,.......n-1. Prove that S is a superincreasing sequence. ≡

2) Prove that n E N with n ≥ 3 is prime if and only if there exists an integer m such that m^(n-1) ≡ 1 (mod n)^((n-1)/q) but m is not ≡ ( mod n) for any prime q| (n-1)

https://brainmass.com/math/basic-algebra/superincreasing-sequence-prove-expression-prime-43781

#### Solution Preview

Please see the attached file for the complete solution.
Thanks for using BrainMass.

1. Proof:
We know that a sequence is superincreasing if . In this problem, we are given with , . Then we have
,
More generally, for any ...

#### Solution Summary

A Superincreasing Sequence and a prime expression are investigated. The superincreasing sequences are examined.

\$2.49