Question about Cell Phones

Ad

Hi,

a 6ya expert can help you resolve that issue over the phone in a minute or two.

best thing about this new service is that you are never placed on hold and get to talk to real repairmen in the US.

the service is completely free and covers almost anything you can think of (from cars to computers, handyman, and even drones).

click here to download the app (for users in the US for now) and get all the help you need.

goodluck!

Posted on Jan 02, 2017

Ad

SOURCE: 000000..

format ur phone

Enter the code: ***#7370#** and press **Yes** to confirm initialization.

Posted on Jan 10, 2010

SOURCE: What is the six digit number for a master reset

definitely 000000 (6) if not changed before.

Posted on Feb 23, 2012

any numbers that are not dividable by 3

so take each number between 1 and 100 , divide it by 3 and if you don.t get a remainder that number is not what you are looking for

grade 2 maths really

so take each number between 1 and 100 , divide it by 3 and if you don.t get a remainder that number is not what you are looking for

grade 2 maths really

Sep 20, 2016 | Office Equipment & Supplies

Let's do the preocess so it will work on any calculator.

As an example, convert 68 from decimal to binary.

The decimal columns are 10^0, 10^1, 10^2, 10^3, etc.

The binary columns are 2^0, 2^1, 2^2, 2^3, etc.

Flipping to the normal left to right, we get 2^6, 2^5, 2^4, 2^3, 2^2, 2^1, 2^0.

64 32 16 8 4 2 1

We divide our number, 68, by 64, and get 1 with a remainder of 4. We next divide our remainder by 32, 16, 8, and finally 4, where we get 1 with no reminder.

In binary, this works out to 1000100. To check, we multiply the ones by the respective column values and get 64 + 4 = 68.

Good luck.

Paul

As an example, convert 68 from decimal to binary.

The decimal columns are 10^0, 10^1, 10^2, 10^3, etc.

The binary columns are 2^0, 2^1, 2^2, 2^3, etc.

Flipping to the normal left to right, we get 2^6, 2^5, 2^4, 2^3, 2^2, 2^1, 2^0.

64 32 16 8 4 2 1

We divide our number, 68, by 64, and get 1 with a remainder of 4. We next divide our remainder by 32, 16, 8, and finally 4, where we get 1 with no reminder.

In binary, this works out to 1000100. To check, we multiply the ones by the respective column values and get 64 + 4 = 68.

Good luck.

Paul

Feb 28, 2016 | Casio FX-85GT Plus Scientific Calculator...

Remember 19 can also be written as 19.00000000, (or as many zeroes after the decimal as necessary) so:

_____.024081115____

789)19.000000000

__15.78__

3.220

__3.156__

.06400

__6312__

880

__ 789__

910

__789__

1210

__789__

4210

__ 3945__

265

Depending on the accuracy of the desired result, continue as above until the remainder is zero or starts repeating. The work above shows the answer is**.024081115 **with still a remainder.

My calculator shows the answer as .024081153358682

789)19.000000000

Depending on the accuracy of the desired result, continue as above until the remainder is zero or starts repeating. The work above shows the answer is

My calculator shows the answer as .024081153358682

Dec 17, 2014 | Computers & Internet

First, find out how many whole times 24 will go into 67

67/24 = 2 with a remainder that we don't care about. Write down 2

Next, multiply that answer (2) by 24 2 X 24=48

Subtract that 48 from 67 67-48=19

bring down next digit (8) append to the19 198

divide 24 into 198 198/24=8 Write down 8

multiply that answer by 24 8 X 24 =192

Subtract that 192 from 198 198 - 192 = 6

bring down next digit (7) append to the 6 67

divide 24 into 67 67/24 =2 Write down 2

multiply that answer by 24 2 X 24 = 48

subtract 48 from 67 27-24=19

bring down next digit (2)append to the 19 192

divide 24 into 192 192/24 = 8 Write down 8

multiply that answer by 24 24 X 8=192

subtract 192 from 192 192-192=0 You're done!

Your answer is the numbers you wrote down after the divisions = 2848

2 8 4 8

----------------------

24 ) 67872

- 48

198

-192

67

- 48

192

- 192

0

67/24 = 2 with a remainder that we don't care about. Write down 2

Next, multiply that answer (2) by 24 2 X 24=48

Subtract that 48 from 67 67-48=19

bring down next digit (8) append to the19 198

divide 24 into 198 198/24=8 Write down 8

multiply that answer by 24 8 X 24 =192

Subtract that 192 from 198 198 - 192 = 6

bring down next digit (7) append to the 6 67

divide 24 into 67 67/24 =2 Write down 2

multiply that answer by 24 2 X 24 = 48

subtract 48 from 67 27-24=19

bring down next digit (2)append to the 19 192

divide 24 into 192 192/24 = 8 Write down 8

multiply that answer by 24 24 X 8=192

subtract 192 from 192 192-192=0 You're done!

Your answer is the numbers you wrote down after the divisions = 2848

2 8 4 8

----------------------

24 ) 67872

- 48

198

-192

67

- 48

192

- 192

0

Oct 15, 2014 | Office Equipment & Supplies

There are an infinite number of numbers that qualify. The smallest such positive number is 125. The next such number is 251.

Sep 29, 2014 | Office Equipment & Supplies

MOD simply calculates the remainder that is left over after dividing by the MOD parameter.

For example, 10MOD7 = 3 since you can only divide 7 into 10 once, leaving a remainder of 3.

For larger numbers, eg 389487MOD31 you start by dividing 389487 by 31, which gives 12564.09677 (on the display), however you only want the fractional part so subtract 12564 to give 0.0967741935 . This includes the lower value digits that were previously hidden. Then multiply this result by 31 which gives 2.999999999 on the display. Since the result of a MOD calculation has to be a whole number, the answer needs to be rounded to 3. If the answer doesn't easily round to a whole number, it is likely that you have gone beyond the calculators working capacity.

An alternative method is to take the integer part of the first result (12564) and multiply it by 31 to get 389484, then subtract this from 389487, giving the answer of 3.

For example, 10MOD7 = 3 since you can only divide 7 into 10 once, leaving a remainder of 3.

For larger numbers, eg 389487MOD31 you start by dividing 389487 by 31, which gives 12564.09677 (on the display), however you only want the fractional part so subtract 12564 to give 0.0967741935 . This includes the lower value digits that were previously hidden. Then multiply this result by 31 which gives 2.999999999 on the display. Since the result of a MOD calculation has to be a whole number, the answer needs to be rounded to 3. If the answer doesn't easily round to a whole number, it is likely that you have gone beyond the calculators working capacity.

An alternative method is to take the integer part of the first result (12564) and multiply it by 31 to get 389484, then subtract this from 389487, giving the answer of 3.

Feb 23, 2013 | Casio FX991ES Scientific Calculator

Finding the remainder from a division calculation is often referred to as using the MOD function, though this isn't available directly on the fx-991ES.

To obtain the remainder, for example when dividing 10 by 7, you can only divide 7 into 10 once, leaving a remainder of 3.

For larger numbers, eg when dividing 389487 by 31 (equivalent to 389487MOD31) the division gives an answer of 12564.09677 (on the display), however you only want the fractional part so subtract 12564 to give 0.0967741935 . This includes the lower value digits that were previously hidden. Then multiply this result by 31 which gives 2.999999999 on the display. Since the result of a MOD or remainder calculation involving integers has to be a whole number, the answer needs to be rounded to 3. If the answer doesn't easily round to a whole number, it is likely that you have gone beyond the calculator's working capacity.

An alternative method which avoids the rounding of the fractional part is to take the integer part of the first result (12564) and multiply it by 31 to get 389484, then subtract this from 389487, giving the answer of 3.

To obtain the remainder, for example when dividing 10 by 7, you can only divide 7 into 10 once, leaving a remainder of 3.

For larger numbers, eg when dividing 389487 by 31 (equivalent to 389487MOD31) the division gives an answer of 12564.09677 (on the display), however you only want the fractional part so subtract 12564 to give 0.0967741935 . This includes the lower value digits that were previously hidden. Then multiply this result by 31 which gives 2.999999999 on the display. Since the result of a MOD or remainder calculation involving integers has to be a whole number, the answer needs to be rounded to 3. If the answer doesn't easily round to a whole number, it is likely that you have gone beyond the calculator's working capacity.

An alternative method which avoids the rounding of the fractional part is to take the integer part of the first result (12564) and multiply it by 31 to get 389484, then subtract this from 389487, giving the answer of 3.

Dec 16, 2012 | Casio FX991ES Scientific Calculator

Hi , There should be a vin# 17 didgets long on the streeting neck. The 10th number is the year. There are several sites that will help you desipher the code. If you have all 17 didgets try this one

http://www.motoverse.com/tools/vin/yamaha.asp

Here is more info and a link. Hope it helps

**9th Character** - The check digit "character or digit 9" in the sequence of a vehicle identification number (VIN) built beginning with model year 1981 (when the 17 character digit format was established) can best be described as identifying the VIN accuracy.

A check digit shall be part of each vin (since 1981) and shall appear in position nine (9) of the VIN on the vehicle and on any transfer documents containing the vin prepared by the manufacturer to be given to the first owner for purposes other than resale. Thus, the vins of any two vehicles manufactured within a 30 year period shall not be identical. The check digit means a single number or letter "x" used to verify the accuracy of the transcription of the vehicle identification number.

After all other characters in the VIN have been determined by the manufacturer the check digit is calculated by carrying out a mathematical computation specified. This is based on vin position, sample vin, assigned value code, weight factor and multiply assigned value times weight factors. The values are added and the total is divided by 11. The remainder is the check digit number. The correct numeric remainder - zero through nine (0-9) will appear. However, if the remainder is 10 the letter "X" is used to designate the check digit value/number.

**10th character-** Identifies the model year. For example: 1988(J), 1989(K), 1990(L), 1991(M), 1992(N), 1993(P), 1994(R), 1995(S), 1996(T), 1997(V), 1998(W), 1999(X), 2000(Y)------2001(1), 2002(2), 2003(3), 2004(4), 2005(5), 2006(6), 2007(7), 2008(8)

Read more: http://wiki.answers.com/Q/How_do_i_decode_a_Yamaha_vin_number#ixzz1CvEOyOpt

http://www.motoverse.com/tools/vin/yamaha.asp

Here is more info and a link. Hope it helps

A check digit shall be part of each vin (since 1981) and shall appear in position nine (9) of the VIN on the vehicle and on any transfer documents containing the vin prepared by the manufacturer to be given to the first owner for purposes other than resale. Thus, the vins of any two vehicles manufactured within a 30 year period shall not be identical. The check digit means a single number or letter "x" used to verify the accuracy of the transcription of the vehicle identification number.

After all other characters in the VIN have been determined by the manufacturer the check digit is calculated by carrying out a mathematical computation specified. This is based on vin position, sample vin, assigned value code, weight factor and multiply assigned value times weight factors. The values are added and the total is divided by 11. The remainder is the check digit number. The correct numeric remainder - zero through nine (0-9) will appear. However, if the remainder is 10 the letter "X" is used to designate the check digit value/number.

Read more: http://wiki.answers.com/Q/How_do_i_decode_a_Yamaha_vin_number#ixzz1CvEOyOpt

Feb 03, 2011 | 2004 Yamaha YZ 250 F

This is a common starter challenge in college and high school programming classes. While i'm not willing to code it for you, I can show you the methods you'll need to understand in order to approach the problem. The easiest way of doing this is by using a brute force method. Just keep testing the number to see if the remainder after dividing it with a number lower than it is zero. If so, it's a factor.

For example, If the number is 35 then pick a number just one lower than it that's not the number 1. Now divide the two numbers. 35/34 = a number with many decimal places after it, which means its not one of the factors of the number. However, eventually, you'll approach the number 7, and 35/7 = 5. This number has no decimal, meaning it IS a factor of 35, and also the largest non-zero factor of 35. Your algorithm can now stop, since it found the largest non-zero number.

Here's some pseudo-code:

int largestfactor(int number) {

int temp = number;

for(temp - 1; temp>=1; temp--) {

if (number % temp == 0) return temp

}

return temp

}

Something like that, with some bug tweaks will do it. The "%" sign is called a modulus. It's a standard c++ operator. Good luck, and remember to vote Fixya if you liked it.

The wikipedia article that helps you with better and more effecient algorithms can be found here.

Steven

For example, If the number is 35 then pick a number just one lower than it that's not the number 1. Now divide the two numbers. 35/34 = a number with many decimal places after it, which means its not one of the factors of the number. However, eventually, you'll approach the number 7, and 35/7 = 5. This number has no decimal, meaning it IS a factor of 35, and also the largest non-zero factor of 35. Your algorithm can now stop, since it found the largest non-zero number.

Here's some pseudo-code:

int largestfactor(int number) {

int temp = number;

for(temp - 1; temp>=1; temp--) {

if (number % temp == 0) return temp

}

return temp

}

Something like that, with some bug tweaks will do it. The "%" sign is called a modulus. It's a standard c++ operator. Good luck, and remember to vote Fixya if you liked it.

The wikipedia article that helps you with better and more effecient algorithms can be found here.

Steven

Sep 15, 2008 | Computers & Internet

Here is one solution. You might consider adding more robust error handling.

if the decimal numbers passed to the div function are multiples i will be a non-zero number of that multiple otherwise i will be zero.

Dim i As Integer

i = div(12, 0)

If i = 0 Then

'not multiple

' do this

Else

' is multiple

' do something else

End If

Function div(ByVal numerator As Object, ByVal denominator As Object) As Integer

dim n , d decimal

Dim result As Decimal

Dim remainder As Decimal

If IsNumber(numerator) Is True _

And IsNumber(denominator) Is True Then

If numerator <> 0 Then

n = numerator

d = denominator

Else

GoTo error1

End If

Else

GoTo error1

End If

result = Decimal.divide(n, d)

remainder = Decimal.remainder(n, d)

If remainder = 0 Then

div = result

Else

div = 0

End If

Exit Function

error1:

msgbox("Numbers must be non-zero numerics", , "Multiple check error")

div = 0

End Function

End Function

if the decimal numbers passed to the div function are multiples i will be a non-zero number of that multiple otherwise i will be zero.

Dim i As Integer

i = div(12, 0)

If i = 0 Then

'not multiple

' do this

Else

' is multiple

' do something else

End If

Function div(ByVal numerator As Object, ByVal denominator As Object) As Integer

dim n , d decimal

Dim result As Decimal

Dim remainder As Decimal

If IsNumber(numerator) Is True _

And IsNumber(denominator) Is True Then

If numerator <> 0 Then

n = numerator

d = denominator

Else

GoTo error1

End If

Else

GoTo error1

End If

result = Decimal.divide(n, d)

remainder = Decimal.remainder(n, d)

If remainder = 0 Then

div = result

Else

div = 0

End If

Exit Function

error1:

msgbox("Numbers must be non-zero numerics", , "Multiple check error")

div = 0

End Function

End Function

Aug 06, 2008 | Computers & Internet

117 people viewed this question

Usually answered in minutes!

×